Look-ahead methods for block Hankel systems
From MaRDI portal
Publication:1379009
DOI10.1016/S0377-0427(97)00164-7zbMath0913.65018OpenAlexW2171586573MaRDI QIDQ1379009
Marc Van Barel, Adhemar Bultheel
Publication date: 24 August 1998
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-0427(97)00164-7
Related Items
Further optimized look-ahead recurrences for adjacent rows in the Padé table and Toeplitz matrix factorizations ⋮ A type of matrix Padé approximant inspired by scalar component models
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear complexity parallel algorithms for linear systems of equations with recursive structure
- Padé-type approximation and general orthogonal polynomials
- Algebraic methods for Toeplitz-like matrices and operators
- Laurent series and their Padé approximations
- Efficient solution of linear systems of equations with recursive structure
- Fast projection methods for minimal design problems in linear system theory
- Formally biorthogonal polynomials and a look-ahead Levinson algorithm for general Toeplitz systems
- Stable row recurrences for the Padé table and generically superfast lookahead solvers for non-Hermitian Toeplitz systems
- A multi-step algorithm for Hankel matrices
- A look-ahead algorithm for the solution of general Hankel systems
- A look-ahead Bareiss algorithm for general Toeplitz matrices
- Linear algebra, rational approximation and orthogonal polynomials
- A fast Hankel solver based on an inversion formula for Loewner matrices
- Polynômes orthogonaux formels - applications
- Look-ahead Levinson and Schur algorithms for non-Hermitian Toeplitz systems
- The stability of inversion formulas for Toeplitz matrices
- Formal orthogonal polynomials and Hankel/Toeplitz duality
- Optimized look-ahead recurrences for adjacent rows in the Padé table
- Look-ahead Levinson- and Schur-type recurrences in the Padé table
- Orthonormal polynomial vectors and least squares approximation for a discrete inner product
- High performance algorithms for Toeplitz and block Toeplitz matrices
- A Weakly Stable Algorithm for Padé Approximants and the Inversion of Hankel Matrices
- The Inverses of Block Hankel and Block Toeplitz Matrices
- A Look-Ahead Levinson Algorithm for Indefinite Toeplitz Systems
- A look-ahead Levinson algorithm for general Toeplitz systems
- Stable and Efficient Algorithms for Structured Systems of Linear Equations
- Stabilizing the Generalized Schur Algorithm
- Matrix Padé Fractions and Their Computation
- Displacement Structure: Theory and Applications
- Fast Gaussian Elimination with Partial Pivoting for Matrices with Displacement Structure
- Computation of Numerical Padé–Hermite and Simultaneous Padé Systems I: Near Inversion of Generalized Sylvester Matrices
- Computation of Numerical Padé–Hermite and Simultaneous Padé Systems II: A Weakly Stable Algorithm
