A stabilized superfast solver for indefinite Hankel systems
From MaRDI portal
Publication:1124777
This paper deals with the indefinite Hankel systems whose size is a power of 2. Based on an inversion formula for Loewner matrices and a divide and conquer approach, a stabilized super fast solver is derived. The algorithm is stabilized via pivoting, iterative improvement, and by giving the so-called ``difficult interpolation points an adequate treatment. Numerical examples are presented to illustrate the effectiveness of this algorithm.
Recommendations
- A fast Hankel solver based on an inversion formula for Loewner matrices
- A fast block Hankel solver based on an inversion formula for block Loewner matrices
- scientific article; zbMATH DE number 3883495
- A stabilized superfast solver for nonsymmetric Toeplitz systems
- A look-ahead algorithm for the solution of general Hankel systems
Cites work
- A fast algorithm for solving a Toeplitz system of equations
- A fast block Hankel solver based on an inversion formula for block Loewner matrices
- A general module theoretic framework for vector M-Padé and matrix rational interpolation
- A look-ahead algorithm for the solution of general Hankel systems
- A look-ahead Bareiss algorithm for general Toeplitz matrices
- A Look-Ahead Block Schur Algorithm for Toeplitz-Like Matrices
- A look-ahead Levinson algorithm for general Toeplitz systems
- A Look-Ahead Levinson Algorithm for Indefinite Toeplitz Systems
- A lookahead algorithm for the solution of block Toeplitz systems
- A method for solving key equation for decoding goppa codes
- A multi-step algorithm for Hankel matrices
- A new algorithm for solving Toeplitz systems of equations
- A Weakly Stable Algorithm for Padé Approximants and the Inversion of Hankel Matrices
- Algebraic Computations of Scaled Padé Fractions
- Algebraic methods for Toeplitz-like matrices and operators
- An algorithm for solving discrete-time Wiener-Hopf equations based upon Euclid's algorithm
- Asymptotically fast solution of Toeplitz and related systems of linear equations
- Classical foundations of algorithms for solving positive definite Toeplitz equations
- Displacement Structure: Theory and Applications
- Downdating of Szegö polynomials and data-fitting applications
- Fast Gaussian Elimination with Partial Pivoting for Matrices with Displacement Structure
- Fast solution of toeplitz systems of equations and computation of Padé approximants
- Formally biorthogonal polynomials and a look-ahead Levinson algorithm for general Toeplitz systems
- Hankel and Loewner matrices
- High performance algorithms for Toeplitz and block Toeplitz matrices
- scientific article; zbMATH DE number 1256367 (Why is no real title available?)
- scientific article; zbMATH DE number 686840 (Why is no real title available?)
- scientific article; zbMATH DE number 691245 (Why is no real title available?)
- scientific article; zbMATH DE number 741187 (Why is no real title available?)
- scientific article; zbMATH DE number 741188 (Why is no real title available?)
- scientific article; zbMATH DE number 749853 (Why is no real title available?)
- scientific article; zbMATH DE number 782074 (Why is no real title available?)
- Inverses of Löwner matrices
- Inversion of a block Löwner matrix
- Look-ahead Levinson and Schur algorithms for non-Hermitian Toeplitz systems
- Look-ahead Levinson- and Schur-type recurrences in the Padé table
- Matrix Padé Fractions and Their Computation
- Numerical experience with a superfast real Toeplitz solver
- On fast computation of superdiagonal Padé fractions
- Optimized look-ahead recurrences for adjacent rows in the Padé table
- Schur complements of Bézoutians and the inversion of block Hankel and block Toeplitz matrices
- Stable row recurrences for the Padé table and generically superfast lookahead solvers for non-Hermitian Toeplitz systems
- Superfast Solution of Real Positive Definite Toeplitz Systems
- The stability of inversion formulas for Toeplitz matrices
- Transformation techniques for Toeplitz and Toeplitz-plus-Hankel matrices. I: Transformations
- Transformation techniques for Toeplitz and Toeplitz-plus-Hankel matrices. II: Algorithms
Cited in
(7)- A fast block Hankel solver based on an inversion formula for block Loewner matrices
- A fast Hankel solver based on an inversion formula for Loewner matrices
- Randomized preprocessing versus pivoting
- Solving linear systems of equations with randomization, augmentation and aggregation
- Chebyshev-Hankel matrices and the splitting approach for centrosymmetric Toeplitz-plus-Hankel matrices
- Nonlinear functional equations satisfied by orthogonal polynomials
- Randomized preprocessing of homogeneous linear systems of equations
This page was built for publication: A stabilized superfast solver for indefinite Hankel systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1124777)
