Look-ahead Levinson- and Schur-type recurrences in the Padé table
From MaRDI portal
fast algorithmToeplitz matrixLevinson algorithmSchur algorithmlook-aheadbiorthogonal polynomialsPadé approximants
Direct numerical methods for linear systems and matrix inversion (65F05) Prediction theory (aspects of stochastic processes) (60G25) Linear equations (linear algebraic aspects) (15A06) Moment problems and interpolation problems in the complex plane (30E05) Padé approximation (41A21) Trigonometric moment problems in one variable harmonic analysis (42A70)
Recommendations
Cited in
(14)- A fast Hankel solver based on an inversion formula for Loewner matrices
- Recursive computation of Padé-Legendre approximants and some acceleration properties.
- Stable row recurrences for the Padé table and generically superfast lookahead solvers for non-Hermitian Toeplitz systems
- A new method for deriving adjacent approximants in the Padé table
- Optimized look-ahead recurrences for adjacent rows in the Padé table
- A lookahead algorithm for the solution of block Toeplitz systems
- Further optimized look-ahead recurrences for adjacent rows in the Padé table and Toeplitz matrix factorizations
- scientific article; zbMATH DE number 683525 (Why is no real title available?)
- Diagonal pivoting for partially reconstructible Cauchy-like matrices, with applications to Toeplitz-like linear equations and to boundary rational matrix interpolation problems
- A stabilized superfast solver for indefinite Hankel systems
- scientific article; zbMATH DE number 5167007 (Why is no real title available?)
- Look-ahead methods for block Hankel systems
- The multipoint Padé table and general recurrences for rational interpolation
- VPAStab\((J,L)\): an iterative method with look-ahead for the solution of large sparse linear systems
This page was built for publication: Look-ahead Levinson- and Schur-type recurrences in the Padé table
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1920161)