Efficient algorithms for order basis computation

DOI10.1016/J.JSC.2011.12.009MaRDI QIDQ420746zbMATH OpenOpenAlexFDO

Authors G. Labahn, Wei Zhou

Publication date 23 May 2012

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jsc.2011.12.009

zbMATH Keywords

algorithmmodule basisorder basisPadé approximation

Mathematics Subject Classification ID

Vector spaces, linear dependence, rank, lineability (15A03)

Recommendations

• Efficient computation of order bases
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• scientific article; zbMATH DE number 1263330
• Efficient computation of algebraic local cohomology classes and change of ordering for zero-dimensional standard bases
• Online order basis algorithm and its impact on the block Wiedemann algorithm

Cites work

• scientific article; zbMATH DE number 1936673 (Why is no real title available?)
• scientific article; zbMATH DE number 2151192 (Why is no real title available?)
• scientific article; zbMATH DE number 822685 (Why is no real title available?)
• A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants
• A generalization of the fast LUP matrix decomposition algorithm and applications
• Computing the rank and a small nullspace basis of a polynomial matrix
• Efficient computation of order bases
• Factorization of differential operators with rational functions coefficients
• Fraction-free computation of matrix rational interpolants and matrix GCDs
• Inversion components of block Hankel-like matrices
• Normal forms for general polynomial matrices
• Recursiveness in matrix rational interpolation problems

Cited in

(12)

• Symbolic computations of first integrals for polynomial vector fields
• Online order basis algorithm and its impact on the block Wiedemann algorithm
• Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix
• scientific article; zbMATH DE number 5556488 (Why is no real title available?)
• Computing minimal interpolation bases
• Deterministic computation of the characteristic polynomial in the time of matrix multiplication
• Algorithms for simultaneous Hermite-Padé approximations
• Efficient computation of order bases
• Row reduction applied to decoding of rank-metric and subspace codes
• Allowable processing orders in the accelerated cascade algorithm
• A deterministic algorithm for inverting a polynomial matrix
• Fast computation of approximant bases in canonical form

This page was built for publication: Efficient algorithms for order basis computation

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