Diagonal pivoting for partially reconstructible Cauchy-like matrices, with applications to Toeplitz-like linear equations and to boundary rational matrix interpolation problems
From MaRDI portal
Publication:677917
DOI10.1016/S0024-3795(96)00288-1zbMath0872.65022MaRDI QIDQ677917
Thomas Kailath, Vadim Olshevsky
Publication date: 20 May 1997
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
algorithmHermitian matricesGaussian eliminationpartial pivotingboundary rational matrix interpolation problemsCauchy-like matricesdiagonal pivotingToeplitz-like solver
Related Items (13)
Pivoting and backward stability of fast algorithms for solving Cauchy linear equations ⋮ Fast direct solution methods for symmetric banded Toeplitz systems, based on the sine transform ⋮ Stable factorization for Hankel and Hankel‐like matrices ⋮ Lagrange's formula for tangential interpolation with application to structured matrices ⋮ Eigenvector computation for almost unitary Hessenberg matrices and inversion of Szegö-Vandermonde matrices via discrete transmission lines ⋮ Solving Toeplitz systems after extension and transformation ⋮ A fast parallel Björck-Pereyra-type algorithm for solving Cauchy linear equations ⋮ A note on the \(O(n)\)-storage implementation of the GKO algorithm and its adaptation to Trummer-like matrices ⋮ Optimal trigonometric preconditioners for nonsymmetric Toeplitz systems ⋮ A fast Hankel solver based on an inversion formula for Loewner matrices ⋮ Confluent polynomial Vandermonde-like matrices: Displacement structures, inversion formulas and fast algorithm ⋮ Transformation techniques for Toeplitz and Toeplitz-plus-Hankel matrices. II: Algorithms ⋮ A fast algorithm for the inversion of general Toeplitz matrices
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Displacement structure for Hankel, Vandermonde, and related (derived) matrices
- Displacement ranks of matrices and linear equations
- Fast projection methods for minimal design problems in linear system theory
- The Gaussian Toeplitz matrix
- Interpolation of rational matrix functions
- The prolate matrix
- A multi-step algorithm for Hankel matrices
- A look-ahead algorithm for the solution of general Hankel systems
- Complexity of multiplication with vectors for structured matrices
- Fast state space algorithms for matrix Nehari and Nehari-Takagi interpolation problems
- Recursive solutions of rational interpolation problems via fast matrix factorization
- Circulants, displacements and decompositions of matrices
- Displacement structure approach to Chebyshev-Vandermonde and related matrices
- Look-ahead Levinson- and Schur-type recurrences in the Padé table
- Stability of the Diagonal Pivoting Method with Partial Pivoting
- Displacement ranks of a matrix
- On Computations with Dense Structured Matrices
- Stability of Methods for Solving Toeplitz Systems of Equations
- Lossless inverse scattering, digital filters, and estimation theory
- Fast Parallel Algorithms for QR and Triangular Factorization
- An Optimal Circulant Preconditioner for Toeplitz Systems
- The Numerical Stability of the Levinson-Durbin Algorithm for Toeplitz Systems of Equations
- A look-ahead Levinson algorithm for general Toeplitz systems
- Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
- On the Stability of the Bareiss and Related Toeplitz Factorization Algorithms
- Stable and Efficient Algorithms for Structured Systems of Linear Equations
- A Look-Ahead Block Schur Algorithm for Toeplitz-Like Matrices
- Displacement Structure: Theory and Applications
- Fast Gaussian Elimination with Partial Pivoting for Matrices with Displacement Structure
- Analysis of the Diagonal Pivoting Method
- Direct Methods for Solving Symmetric Indefinite Systems of Linear Equations
This page was built for publication: Diagonal pivoting for partially reconstructible Cauchy-like matrices, with applications to Toeplitz-like linear equations and to boundary rational matrix interpolation problems
