Fast Computation of Shifted Popov Forms of Polynomial Matrices via Systems of Modular Polynomial Equations

DOI10.1145/2930889.2930936zbMath1361.68301arXiv1602.00710OpenAlexW3105749894MaRDI QIDQ2985849

Vincent Neiger

Publication date: 10 May 2017

Published in: Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1602.00710

zbMATH Keywords

polynomial matricesHermite formrow reductionshifted Popov formM-Padé approximation.system of modular equations

Mathematics Subject Classification ID

Related Items (6)

Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix ⋮ Computing Riemann-Roch spaces via Puiseux expansions ⋮ Algorithms for simultaneous Hermite-Padé approximations ⋮ Fast amortized multi-point evaluation ⋮ Power decoding Reed-Solomon codes up to the Johnson radius ⋮ Fast computation of approximant bases in canonical form

This page was built for publication: Fast Computation of Shifted Popov Forms of Polynomial Matrices via Systems of Modular Polynomial Equations