Efficient computation of order bases

DOI10.1145/1576702.1576753MaRDI QIDQ2883842zbMATH OpenOpenAlexFDO

Authors G. Labahn, Wei Zhou

Publication date 13 May 2012

Published in Proceedings of the 2009 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1576702.1576753

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Recommendations

• Efficient algorithms for order basis computation
• Online order basis algorithm and its impact on the block Wiedemann algorithm
• Computing minimal nullspace bases
• Computing column bases of polynomial matrices
• Computing the rank and a small nullspace basis of a polynomial matrix

Cited in

(6)

• Deterministic computation of the characteristic polynomial in the time of matrix multiplication
• Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix
• Simple forms of higher-order linear differential systems and their applications in computing regular solutions
• Online order basis algorithm and its impact on the block Wiedemann algorithm
• A fast recursive orthogonalization scheme for the Macaulay matrix
• Efficient algorithms for order basis computation

This page was built for publication: Efficient computation of order bases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2883842)