High performance algorithms for Toeplitz and block Toeplitz matrices
From MaRDI portal
Publication:1923158
DOI10.1016/0024-3795(95)00649-4zbMath0859.65017OpenAlexW2084355037MaRDI QIDQ1923158
S. Thirumalai, V. Vermaut, Kyle A. Gallivan, Paul Van Dooren
Publication date: 7 October 1996
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(95)00649-4
numerical exampleshigh performance computingblock Toeplitz matricesSchur algorithmsQR factorization algorithms
Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
A superfast method for solving Toeplitz linear least squares problems., Sensitivity analysis for Szegő polynomials, A lookahead algorithm for the solution of block Toeplitz systems, Look-ahead methods for block Hankel systems, A stabilized superfast solver for indefinite Hankel systems, Kronecker product and SVD approximations in image restoration, A stable parallel algorithm for block tridiagonal Toeplitz-block-Toeplitz linear systems, A fast block Hankel solver based on an inversion formula for block Loewner matrices, A least squares approach to reduce stable discrete linear systems preserving their stability., A multilevel parallel algorithm to solve symmetric Toeplitz linear systems, Fast QR factorization of Cauchy-like matrices, Fast direct solvers for some complex symmetric block Toeplitz linear systems, A fast algorithm for subspace state-space system identification via exploitation of the displacement structure, A unified least squares approach to identify and to reduce continuous asymptotically stable systems, Acoustic multiple scattering using recursive algorithms, On the computation of the rank of block bidiagonal Toeplitz matrices, A fast Hankel solver based on an inversion formula for Loewner matrices, The generalized Schur algorithm and some applications, Application of FFT-based algorithms for large-scale universal kriging problems, The ubiquitous Kronecker product
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Displacement ranks of matrices and linear equations
- Fast orthogonal decomposition of rank deficient Toeplitz matrices
- Formally biorthogonal polynomials and a look-ahead Levinson algorithm for general Toeplitz systems
- Look-ahead Levinson and Schur algorithms for non-Hermitian Toeplitz systems
- Stability Issues in the Factorization of Structured Matrices
- A Weakly Stable Algorithm for Padé Approximants and the Inversion of Hankel Matrices
- Fast Triangular Factorization and Inversion of Hermitian, Toeplitz, and Related Matrices with Arbitrary Rank Profile
- Hyperbolic Householder Algorithms for Factoring Structured Matrices
- The WY Representation for Products of Householder Matrices
- Hyperbolic householder transformations
- Fast Parallel Algorithms for QR and Triangular Factorization
- Hyperbolic Householder Transforms
- A Storage-Efficient $WY$ Representation for Products of Householder Transformations
- A Look-Ahead Levinson Algorithm for Indefinite Toeplitz Systems
- Reduction to Tridiagonal Form and Minimal Realizations
- A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms. Part II
- Block Downdating of Least Squares Solutions
- FORTRAN subroutines for general Toeplitz systems
- A Look-Ahead Block Schur Algorithm for Toeplitz-Like Matrices
- A modified direct preconditioner for indefinite symmetric Toeplitz systems
- Fast Gaussian Elimination with Partial Pivoting for Matrices with Displacement Structure
