Implementation of the recurrence relations of biorthogonality

DOI10.1007/BF02141926MaRDI QIDQ688113zbMATH OpenFDO

Authors Zélia da Rocha

Publication date 14 December 1993

Published in Numerical Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02141926

zbMATH Keywords

algorithmsPadé-type approximantsrecurrence relations of biorthogonality

Mathematics Subject Classification ID

Algorithms for approximation of functions (65D15)

Review text

General algorithms for computing some generalized Padé-type approximants are given. The quality of the used approximants depends on the choosen functionals for measuring the quality. In the classical example of the series \(f(b)=\log(1+t)/t\) functionals are found which give better results than the usual ones.

Recommendations

• Recursive computation of Padé-Legendre approximants and some acceleration properties.
• scientific article; zbMATH DE number 4078608
• Computation of special functions by Padé approximants with orthogonal polynomial denominators
• scientific article; zbMATH DE number 69567
• Epsilon-algorithm and eta-algorithm of generalized inverse function-valued Padé approximants using for solution of integral equations

Cites work

• Extrapolation methods theory and practice
• scientific article; zbMATH DE number 52854 (Why is no real title available?)
• Rational approximation to formal power series

Cited in

(6)

• A unified approach to various orthogonalities
• QD-algorithms and recurrence relations for biorthogonal polynomials
• The methods of Vorobyev and Lanczos
• na3
• scientific article; zbMATH DE number 4157186 (Why is no real title available?)
• Recursive computation of Padé-Legendre approximants and some acceleration properties.

Describes a project that uses

Uses Software

• Mathematica

This page was built for publication: Implementation of the recurrence relations of biorthogonality

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