Solving Toeplitz systems after extension and transformation

DOI10.1007/BF02575712zbMath0904.65033MaRDI QIDQ1127939

Georg Heinig

Publication date: 10 August 1998

Published in: Calcolo (Search for Journal in Brave)

zbMATH Keywords

computational complexityLevinson algorithmtransformationVandermonde matricesToeplitz systemspivoting strategiesSchur algorithms

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (4)

A superfast method for solving Toeplitz linear least squares problems. ⋮ Lagrange's formula for tangential interpolation with application to structured matrices ⋮ A fast Hankel solver based on an inversion formula for Loewner matrices ⋮ Transformation techniques for Toeplitz and Toeplitz-plus-Hankel matrices. II: Algorithms

Uses Software

• mctoolbox

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear complexity parallel algorithms for linear systems of equations with recursive structure
• Transformation techniques for Toeplitz and Toeplitz-plus-Hankel matrices. I: Transformations
• Diagonal pivoting for partially reconstructible Cauchy-like matrices, with applications to Toeplitz-like linear equations and to boundary rational matrix interpolation problems
• Hankel and Loewner matrices
• Algebraic methods for Toeplitz-like matrices and operators
• Efficient solution of linear systems of equations with recursive structure
• On Bézoutian reduction with the Vandermonde matrix
• Interpolation of rational matrix functions
• Stable row recurrences for the Padé table and generically superfast lookahead solvers for non-Hermitian Toeplitz systems
• The prolate matrix
• A multi-step algorithm for Hankel matrices
• A look-ahead algorithm for the solution of general Hankel systems
• Fast state space algorithms for matrix Nehari and Nehari-Takagi interpolation problems
• Lagrange's formula for tangential interpolation with application to structured matrices
• Look-ahead Levinson and Schur algorithms for non-Hermitian Toeplitz systems
• A Weakly Stable Algorithm for Padé Approximants and the Inversion of Hankel Matrices
• Superfast Solution of Real Positive Definite Toeplitz Systems
• The Numerical Stability of the Levinson-Durbin Algorithm for Toeplitz Systems of Equations
• A look-ahead Levinson algorithm for general Toeplitz systems
• On the Stability of the Bareiss and Related Toeplitz Factorization Algorithms
• On the Use of Certain Matrix Algebras Associated with Discrete Trigonometric Transforms in Matrix Displacement Decomposition
• Stable and Efficient Algorithms for Structured Systems of Linear Equations
• Displacement Structure: Theory and Applications
• Fast Gaussian Elimination with Partial Pivoting for Matrices with Displacement Structure

This page was built for publication: Solving Toeplitz systems after extension and transformation