Transformation techniques for Toeplitz and Toeplitz-plus-Hankel matrices. I: Transformations
From MaRDI portal
Publication:677911
DOI10.1016/S0024-3795(96)00527-7zbMath0872.65021MaRDI QIDQ677911
Georg Heinig, Adam W. Bojanczyk
Publication date: 16 September 1997
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Related Items
A superfast method for solving Toeplitz linear least squares problems. ⋮ Fast direct solution methods for symmetric banded Toeplitz systems, based on the sine transform ⋮ A lookahead algorithm for the solution of block Toeplitz systems ⋮ Generalized Cauchy-Vandermonde matrices ⋮ Lagrange's formula for tangential interpolation with application to structured matrices ⋮ DFT representations of Toeplitz-plus-Hankel Bézoutians with application to fast matrix-vector multiplication ⋮ A stabilized superfast solver for indefinite Hankel systems ⋮ A fast solver for linear systems with displacement structure ⋮ Solving Toeplitz systems after extension and transformation ⋮ A fast block Hankel solver based on an inversion formula for block Loewner matrices ⋮ Wiener-Hopf and spectral factorization of real polynomials by Newton's method ⋮ Generalized-confluent Cauchy and Cauchy-Vandermonde matrices ⋮ Fast computation of determinants of Bézout matrices and application to curve implicitization ⋮ How Bad Are Vandermonde Matrices? ⋮ Optimal trigonometric preconditioners for nonsymmetric Toeplitz systems ⋮ A fast Hankel solver based on an inversion formula for Loewner matrices ⋮ Generalized confluent Cauchy-Vandermonde matrices: Displacement structures, inversion formulas and tangential interpolations ⋮ Representations of Toeplitz-plus-Hankel martrices using trigonometric transformations with application to fast matrix-vector multiplication ⋮ Transformation techniques for Toeplitz and Toeplitz-plus-Hankel matrices. II: Algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear complexity parallel algorithms for linear systems of equations with recursive structure
- Hankel and Loewner matrices
- Algebraic methods for Toeplitz-like matrices and operators
- A decomposition of Toeplitz matrices and optimal circulant preconditioning
- Efficient solution of linear systems of equations with recursive structure
- 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
- Fast algorithms for discrete Chebyshev-Vandermonde transforms and applications
- Circulants, displacements and decompositions of matrices
- A Weakly Stable Algorithm for Padé Approximants and the Inversion of Hankel Matrices
- Optimal and Superoptimal Circulant Preconditioners
- A look-ahead Levinson algorithm for general Toeplitz systems
- On the Use of Certain Matrix Algebras Associated with Discrete Trigonometric Transforms in Matrix Displacement Decomposition
- Some Aspects of Circulant Preconditioners
- Fast Transform Based Preconditioners for Toeplitz Equations
- Displacement Structure: Theory and Applications
- Fast Gaussian Elimination with Partial Pivoting for Matrices with Displacement Structure
- A Polynomial Approach to Fast Algorithms for Discrete Fourier-Cosine and Fourier-Sine Transforms
This page was built for publication: Transformation techniques for Toeplitz and Toeplitz-plus-Hankel matrices. I: Transformations
