Algorithms for Simultaneous Padé Approximations

DOI10.1145/2930889.2930933MaRDI QIDQ2985854zbMATH OpenOpenAlexFDO

Authors Arne Storjohann, Johan Rosenkilde né Nielsen

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.00836

zbMATH Keywords

algorithmapproximationsPadé approximationpolynomialspower series ring

Mathematics Subject Classification ID

Padé approximation (41A21) Algorithms for approximation of functions (65D15)

Abstract: We describe how to solve simultaneous Pad'e approximations over a power series ring $K[[x]]$ for a field $K$ using $O(n^{omega-1}d)$ operations in $K$, where $d$ is the sought precision and $n$ is the number of power series to approximate. We develop two algorithms using different approaches. Both algorithms return a reduced sub-bases that generates the complete set of solutions to the input approximations problem that satisfy the given degree constraints. Our results are made possible by recent breakthroughs in fast computations of minimal approximant bases and Hermite Pad'e approximations.

Recommendations

• Algorithms for simultaneous Hermite-Padé approximations
• scientific article; zbMATH DE number 3942132
• scientific article; zbMATH DE number 17943
• Fraction-free computation of simultaneous Padé approximants
• Some explicit formulae in simultaneous Padé approximation
• Simultaneous partial Padé approximants
• scientific article; zbMATH DE number 527503
• An algorithm for constructing a class of Padé approximants of vector functions
• Concurrent universal Padé approximation
• scientific article; zbMATH DE number 7264163

Cited in

(12)

• A superfast algorithm for multi-dimensional Padé systems
• Power decoding Reed-Solomon codes up to the Johnson radius
• Simultaneous rational function reconstruction with errors: handling multiplicities and poles
• Algorithms for simultaneous Hermite-Padé approximations
• Fast computation of approximant bases in canonical form
• Algorithm 956: PAMPAC, a parallel adaptive method for pseudo-arclength continuation
• Fraction-free computation of simultaneous Padé approximants
• A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants
• Algorithm 766: experiments with a weakly stable algorithm for computing Padé-Hermite and simultaneous Padé approximants
• scientific article; zbMATH DE number 7264163 (Why is no real title available?)
• Simultaneous rational number codes: decoding beyond half the minimum distance with multiplicities and bad primes
• Decoding simultaneous rational evaluation codes

This page was built for publication: Algorithms for Simultaneous Padé Approximations

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