Solving Toeplitz systems after extension and transformation
From MaRDI portal
Publication:1127939
DOI10.1007/BF02575712zbMATH Open0904.65033MaRDI QIDQ1127939FDOQ1127939
Authors: G. Heinig 
Publication date: 10 August 1998
Published in: Calcolo (Search for Journal in Brave)
Recommendations
computational complexitytransformationVandermonde matricesLevinson algorithmToeplitz systemspivoting strategiesSchur algorithms
Direct numerical methods for linear systems and matrix inversion (65F05) Complexity and performance of numerical algorithms (65Y20)
Cites Work
- Title not available (Why is that?)
- Superfast Solution of Real Positive Definite Toeplitz Systems
- A Weakly Stable Algorithm for Padé Approximants and the Inversion of Hankel Matrices
- Title not available (Why is that?)
- Displacement Structure: Theory and Applications
- Algebraic methods for Toeplitz-like matrices and operators
- Efficient solution of linear systems of equations with recursive structure
- The Numerical Stability of the Levinson-Durbin Algorithm for Toeplitz Systems of Equations
- A look-ahead Levinson algorithm for general Toeplitz systems
- Title not available (Why is that?)
- Interpolation of rational matrix functions
- Fast Gaussian Elimination with Partial Pivoting for Matrices with Displacement Structure
- On the Stability of the Bareiss and Related Toeplitz Factorization Algorithms
- Transformation techniques for Toeplitz and Toeplitz-plus-Hankel matrices. I: Transformations
- The prolate matrix
- Hankel and Loewner matrices
- Stable and Efficient Algorithms for Structured Systems of Linear Equations
- On the Use of Certain Matrix Algebras Associated with Discrete Trigonometric Transforms in Matrix Displacement Decomposition
- Linear complexity parallel algorithms for linear systems of equations with recursive structure
- A look-ahead algorithm for the solution of general Hankel systems
- On Bézoutian reduction with the Vandermonde matrix
- Stable row recurrences for the Padé table and generically superfast lookahead solvers for non-Hermitian Toeplitz systems
- A multi-step algorithm for Hankel matrices
- Fast state space algorithms for matrix Nehari and Nehari-Takagi interpolation problems
- Title not available (Why is that?)
- Diagonal pivoting for partially reconstructible Cauchy-like matrices, with applications to Toeplitz-like linear equations and to boundary rational matrix interpolation problems
- Look-ahead Levinson and Schur algorithms for non-Hermitian Toeplitz systems
- Title not available (Why is that?)
- Lagrange's formula for tangential interpolation with application to structured matrices
Cited In (4)
- A fast Hankel solver based on an inversion formula for Loewner matrices
- Lagrange's formula for tangential interpolation with application to structured matrices
- A superfast method for solving Toeplitz linear least squares problems.
- Transformation techniques for Toeplitz and Toeplitz-plus-Hankel matrices. II: Algorithms
Uses Software
This page was built for publication: Solving Toeplitz systems after extension and transformation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1127939)
