A lookahead algorithm for the solution of block Toeplitz systems
From MaRDI portal
Publication:1372977
Recommendations
Cites Work
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 1256367 (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 782074 (Why is no real title available?)
- A Look-Ahead Levinson Algorithm for Indefinite Toeplitz Systems
- A Weakly Stable Algorithm for Padé Approximants and the Inversion of Hankel Matrices
- A look-ahead Bareiss algorithm for general Toeplitz matrices
- A look-ahead Levinson algorithm for general Toeplitz systems
- A look-ahead algorithm for the solution of general Hankel systems
- A multi-step algorithm for Hankel matrices
- Algorithm 766: experiments with a weakly stable algorithm for computing Padé-Hermite and simultaneous Padé approximants
- 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
- Displacement Structure: Theory and Applications
- Fast Gaussian Elimination with Partial Pivoting for Matrices with Displacement Structure
- Formally biorthogonal polynomials and a look-ahead Levinson algorithm for general Toeplitz systems
- High performance algorithms for Toeplitz and block Toeplitz matrices
- Look-ahead Levinson and Schur algorithms for non-Hermitian Toeplitz systems
- Look-ahead Levinson- and Schur-type recurrences in the Padé table
- On Bézoutians of nonsquare matrix polynomials and inversion of matrices with nonsquare blocks
- Optimized look-ahead recurrences for adjacent rows in the Padé table
- Stable row recurrences for the Padé table and generically superfast lookahead solvers for non-Hermitian 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 (9)
- A fast Hankel solver based on an inversion formula for Loewner matrices
- Look-ahead methods for block Hankel systems
- Erratum: A Look-Ahead Levinson Algorithm for Indefinite Toeplitz Systems
- A stabilized superfast solver for indefinite Hankel systems
- Title not available (Why is no real title available?)
- The inverses of block Toeplitz matrices
- A direct method for solving block-Toeplitz with near-circulant-block systems with applications to hybrid manufacturing systems
- A generalized minimal partial realization problem
- Further optimized look-ahead recurrences for adjacent rows in the Padé table and Toeplitz matrix factorizations
Uses Software
This page was built for publication: A lookahead algorithm for the solution of block Toeplitz systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1372977)