A new look at the Padé table and the different methods for computing its elements
Copyright policy )A new look at the Padé table and the different methods for computing its elements
AbstractIn this paper a survey is given of several algorithms for the computation of the Padé table of a formal power series. Those algorithms are studied which are based on certain relationships between adjacent elements in the Padé table. A new proof for the algorithms of Baker, Longman and for Gragg's variant of the qd-algorithm is given. A variant of Watson's algorithm is derived. The techniques used in this survey give some new ideas concerning the structure of the Padé table and the different ways to compute the elements of the table.
- University of Antwerp Belgium
Approximation by rational functions, Computational Mathematics, Computation of special functions and constants, construction of tables, Applied Mathematics
Approximation by rational functions, Computational Mathematics, Computation of special functions and constants, construction of tables, Applied Mathematics
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).19 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!