Fast Computation of Minimal Interpolation Bases in Popov Form for Arbitrary Shifts
From MaRDI portal
Publication:2985840
DOI10.1145/2930889.2930928zbMath1360.65049arXiv1602.00651OpenAlexW3103308523MaRDI QIDQ2985840
Éric Schost, Vincent Neiger, Claude-Pierre Jeannerod, Gilles Villard
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.00651
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (5)
Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix ⋮ Computing syzygies in finite dimension using fast linear algebra ⋮ Algorithms for simultaneous Hermite-Padé approximations ⋮ Deterministic computation of the characteristic polynomial in the time of matrix multiplication ⋮ Fast computation of approximant bases in canonical form
This page was built for publication: Fast Computation of Minimal Interpolation Bases in Popov Form for Arbitrary Shifts
