A lookahead algorithm for the solution of block Toeplitz systems
DOI10.1016/S0024-3795(97)00013-XzbMATH Open0885.65028OpenAlexW2046250296WikidataQ127149145 ScholiaQ127149145MaRDI QIDQ1372977FDOQ1372977
Authors: Marc van Barel, Adhemar Bultheel
Publication date: 2 April 1998
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0024-3795(97)00013-x
Recommendations
interpolationalgorithmlinear equationsinversion formulaToeplitz systemsiterative refinementsupdating formulalookahead algorithm
Direct numerical methods for linear systems and matrix inversion (65F05) Numerical interpolation (65D05)
Cites Work
- Algorithm 766: experiments with a weakly stable algorithm for computing Padé-Hermite and simultaneous Padé approximants
- Title not available (Why is that?)
- The stability of inversion formulas for Toeplitz matrices
- A Weakly Stable Algorithm for Padé Approximants and the Inversion of Hankel Matrices
- Displacement Structure: Theory and Applications
- A Look-Ahead Levinson Algorithm for Indefinite Toeplitz Systems
- A look-ahead Levinson algorithm for general Toeplitz systems
- 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
- Fast Gaussian Elimination with Partial Pivoting for Matrices with Displacement Structure
- Transformation techniques for Toeplitz and Toeplitz-plus-Hankel matrices. I: Transformations
- A look-ahead algorithm for the solution of general Hankel systems
- Transformation techniques for Toeplitz and Toeplitz-plus-Hankel matrices. II: Algorithms
- On Bézoutians of nonsquare matrix polynomials and inversion of matrices with nonsquare blocks
- Stable row recurrences for the Padé table and generically superfast lookahead solvers for non-Hermitian Toeplitz systems
- A multi-step algorithm for Hankel matrices
- Look-ahead Levinson- and Schur-type recurrences in the Padé table
- Formally biorthogonal polynomials and a look-ahead Levinson algorithm for general Toeplitz systems
- High performance algorithms for Toeplitz and block Toeplitz matrices
- Title not available (Why is that?)
- Look-ahead Levinson and Schur algorithms for non-Hermitian Toeplitz systems
- Title not available (Why is that?)
- A look-ahead Bareiss algorithm for general Toeplitz matrices
- Optimized look-ahead recurrences for adjacent rows in the Padé table
- Title not available (Why is that?)
- Title not available (Why is that?)
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 that?)
- 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)