Look-ahead Levinson- and Schur-type recurrences in the Padé table
From MaRDI portal
Publication:1920161
zbMath0852.41012MaRDI QIDQ1920161
Marlis Hochbruck, Martin H. Gutknecht
Publication date: 9 December 1996
Published in: ETNA. Electronic Transactions on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/118935
Padé approximantsLevinson algorithmToeplitz matrixSchur algorithmfast algorithmbiorthogonal polynomialslook-ahead
Padé approximation (41A21) Moment problems and interpolation problems in the complex plane (30E05) Direct numerical methods for linear systems and matrix inversion (65F05) Linear equations (linear algebraic aspects) (15A06) Prediction theory (aspects of stochastic processes) (60G25) Trigonometric moment problems in one variable harmonic analysis (42A70)
Related Items
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 ⋮ A lookahead algorithm for the solution of block Toeplitz systems ⋮ Optimized look-ahead recurrences for adjacent rows in the Padé table ⋮ Further optimized look-ahead recurrences for adjacent rows in the Padé table and Toeplitz matrix factorizations ⋮ Look-ahead methods for block Hankel systems ⋮ A stabilized superfast solver for indefinite Hankel systems ⋮ Diagonal pivoting for partially reconstructible Cauchy-like matrices, with applications to Toeplitz-like linear equations and to boundary rational matrix interpolation problems ⋮ A fast Hankel solver based on an inversion formula for Loewner matrices
