Efficient algorithms for order basis computation

DOI10.1016/j.jsc.2011.12.009zbMath1258.65046OpenAlexW2000760108MaRDI QIDQ420746

George 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

algorithmPadé approximationmodule basisorder basis

Mathematics Subject Classification ID

Related Items (8)

Computing minimal interpolation bases ⋮ Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix ⋮ Symbolic computations of first integrals for polynomial vector fields ⋮ Algorithms for simultaneous Hermite-Padé approximations ⋮ Deterministic computation of the characteristic polynomial in the time of matrix multiplication ⋮ Row reduction applied to decoding of rank-metric and subspace codes ⋮ A deterministic algorithm for inverting a polynomial matrix ⋮ Fast computation of approximant bases in canonical form

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Recursiveness in matrix rational interpolation problems
• Inversion components of block Hankel-like matrices
• Factorization of differential operators with rational functions coefficients
• Normal forms for general polynomial matrices
• Fraction-Free Computation of Matrix Rational Interpolants and Matrix GCDs
• Efficient computation of order bases
• A generalization of the fast LUP matrix decomposition algorithm and applications
• A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants
• Computing the rank and a small nullspace basis of a polynomial matrix

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