A stabilized superfast solver for indefinite Hankel systems
From MaRDI portal
Publication:1124777
DOI10.1016/S0024-3795(98)10078-2zbMath0938.65059MaRDI QIDQ1124777
Peter Kravanja, Marc Van Barel
Publication date: 28 November 1999
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
algorithmnumerical examplesrational interpolationpivotingLoewner matricesiterative improvementdivide and conquer approachindefinite Hankel systemssuper fast solver
Related Items
Nonlinear functional equations satisfied by orthogonal polynomials ⋮ Randomized preprocessing versus pivoting ⋮ Solving linear systems of equations with randomization, augmentation and aggregation ⋮ Randomized preprocessing of homogeneous linear systems of equations ⋮ Chebyshev-Hankel matrices and the splitting approach for centrosymmetric Toeplitz-plus-Hankel matrices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Schur complements of Bézoutians and the inversion of block Hankel and block Toeplitz matrices
- Transformation techniques for Toeplitz and Toeplitz-plus-Hankel matrices. I: Transformations
- A general module theoretic framework for vector M-Padé and matrix rational interpolation
- Inverses of Löwner matrices
- Hankel and Loewner matrices
- Algebraic methods for Toeplitz-like matrices and operators
- A new algorithm for solving Toeplitz systems of equations
- Classical foundations of algorithms for solving positive definite Toeplitz equations
- A fast block Hankel solver based on an inversion formula for block Loewner matrices
- Asymptotically fast solution of Toeplitz and related systems of linear equations
- Downdating of Szegö polynomials and data-fitting applications
- 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
- Transformation techniques for Toeplitz and Toeplitz-plus-Hankel matrices. II: Algorithms
- 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
- A lookahead algorithm for the solution of block Toeplitz systems
- Numerical experience with a superfast real Toeplitz solver
- Look-ahead Levinson and Schur algorithms for non-Hermitian Toeplitz systems
- The stability of inversion formulas for Toeplitz matrices
- Optimized look-ahead recurrences for adjacent rows in the Padé table
- Inversion of a block Löwner matrix
- Look-ahead Levinson- and Schur-type recurrences in the Padé table
- High performance algorithms for Toeplitz and block Toeplitz matrices
- A Weakly Stable Algorithm for Padé Approximants and the Inversion of Hankel Matrices
- An algorithm for solving discrete-time Wiener-Hopf equations based upon Euclid's algorithm
- A fast algorithm for solving a Toeplitz system of equations
- Algebraic Computations of Scaled Padé Fractions
- Superfast Solution of Real Positive Definite Toeplitz Systems
- Fast solution of toeplitz systems of equations and computation of Padé approximants
- On fast computation of superdiagonal Padé fractions
- A Look-Ahead Levinson Algorithm for Indefinite Toeplitz Systems
- A look-ahead Levinson algorithm for general Toeplitz systems
- A method for solving key equation for decoding goppa codes
- Matrix Padé Fractions and Their Computation
- A Look-Ahead Block Schur Algorithm for Toeplitz-Like Matrices
- Displacement Structure: Theory and Applications
- Fast Gaussian Elimination with Partial Pivoting for Matrices with Displacement Structure
