Faster Algorithms for Multivariate Interpolation With Multiplicities and Simultaneous Polynomial Approximations
From MaRDI portal
Publication:2978612
DOI10.1109/TIT.2015.2416068zbMath1359.94683arXiv1402.0643OpenAlexW2095026990MaRDI QIDQ2978612
Vincent Neiger, Gilles Villard, Muhammad F. I. Chowdhury, Claude-Pierre Jeannerod, Éric Schost
Publication date: 28 April 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1402.0643
Linear codes (general theory) (94B05) Multidimensional problems (41A63) Interpolation in approximation theory (41A05)
Related Items (6)
Computing minimal interpolation bases ⋮ On Matrices With Displacement Structure: Generalized Operators and Faster Algorithms ⋮ Multi-trial Guruswami-Sudan decoding for generalised Reed-Solomon codes ⋮ Fast amortized multi-point evaluation ⋮ Power decoding Reed-Solomon codes up to the Johnson radius ⋮ Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
This page was built for publication: Faster Algorithms for Multivariate Interpolation With Multiplicities and Simultaneous Polynomial Approximations
