Fast algorithms for Toeplitz and Hankel matrices
From MaRDI portal
Publication:2431168
The paper presents a self-contained survey of fast algorithms for solving linear systems of equations with Toeplitz or Hankel coefficient matrices. The authors discuss algorithms of Levinson-type and Schur-type. In the case in which the matrices have additional symmetry properties, the authors develop split algorithms.
Recommendations
- New Fast Algorithms for Toeplitz-Plus-Hankel Matrices
- Efficient algorithm for Toeplitz plus Hankel matrices
- Publication:4207515
- New fast algorithms for systems with Hankel and Toeplitz matrices
- Fast inversion algorithms of Toeplitz-plus-Hankel matrices
- Fast inversion of Hankel and Toeplitz matrices
- scientific article; zbMATH DE number 3945248
- scientific article; zbMATH DE number 766201
- Fast transforms of Toeplitz matrices
- A fast eigenvalue algorithm for Hankel matrices
Cites work
- Algebraic methods for Toeplitz-like matrices and operators
- An Algorithm for the Inversion of Finite Hankel Matrices
- Centrosymmetric and centro-skewsymmetric Toeplitz-plus-Hankel matrices and Bézoutians
- DFT representations of Toeplitz-plus-Hankel Bézoutians with application to fast matrix-vector multiplication
- Displacement ranks of matrices and linear equations
- Displacement Structure: Theory and Applications
- Efficient inversion formulas for Toeplitz-plus-Hankel matrices using trigonometric transformations
- Fast algorithms for centro-symmetric and centro-skewsymmetric Toeplitz-plus-Hankel matrices
- Hartley transform representations of symmetric Toeplitz matrix inverses with application to fast matrix-vector multiplication
- scientific article; zbMATH DE number 1682655 (Why is no real title available?)
- scientific article; zbMATH DE number 3650737 (Why is no real title available?)
- scientific article; zbMATH DE number 5005967 (Why is no real title available?)
- scientific article; zbMATH DE number 3810796 (Why is no real title available?)
- scientific article; zbMATH DE number 3947329 (Why is no real title available?)
- scientific article; zbMATH DE number 48955 (Why is no real title available?)
- scientific article; zbMATH DE number 1350351 (Why is no real title available?)
- scientific article; zbMATH DE number 691245 (Why is no real title available?)
- scientific article; zbMATH DE number 1893698 (Why is no real title available?)
- scientific article; zbMATH DE number 780775 (Why is no real title available?)
- scientific article; zbMATH DE number 822685 (Why is no real title available?)
- scientific article; zbMATH DE number 3219899 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Laurent series and their Padé approximations
- New Fast Algorithms for Toeplitz-Plus-Hankel Matrices
- Numerical methods for structured matrices and applications. The Georg Heinig memorial volume
- Numerical solution of linear equations with Toeplitz and vector Toeplitz matrices
- On the inverses of Toeplitz-plus-Hankel matrices
- The Fitting of Time-Series Models
- The Lanczos algorithm and Hankel matrix factorization
- The One-Dimensional Inverse Problem of Reflection Seismology
Cited in
(41)- Fast inversion algorithms of Toeplitz-plus-Hankel matrices
- Efficient algorithm for Toeplitz plus Hankel matrices
- The Lanczos algorithm and Hankel matrix factorization
- Transformation techniques for Toeplitz and Toeplitz-plus-Hankel matrices. II: Algorithms
- Fast algorithms for centro-symmetric and centro-skewsymmetric Toeplitz-plus-Hankel matrices
- Fast iterative adaptive multi-quadric radial basis function method for edges detection of piecewise functions. I: Uniform mesh
- Fast transforms of Toeplitz matrices
- Regularized nonlinear acceleration
- High-performance processing of covariance matrices using GPU computations
- Fast algorithms for calculating the eigenvalues of normal Hankel matrices
- scientific article; zbMATH DE number 1617990 (Why is no real title available?)
- On the fast Lanczos method for computation of eigenvalues of Hankel matrices using multiprecision arithmetics.
- Orthogonal polynomials, reproducing kernels, and zeros of optimal approximants
- scientific article; zbMATH DE number 3880882 (Why is no real title available?)
- scientific article; zbMATH DE number 4201468 (Why is no real title available?)
- Efficient solution of a Toeplitz-plus-Hankel coefficient matrix system of equations
- Toeplitz and Hankel matrices
- New analogs of split algorithms for arbitrary Toeplitz-plus-Hankel matrices
- Schur algorithms for Hermitian Toeplitz, and Hankel matrices with singular leading principal submatrices
- scientific article; zbMATH DE number 51046 (Why is no real title available?)
- A Schur algorithm and linearly connected processor array for Toeplitz-plus-Hankel matrices
- scientific article; zbMATH DE number 4128294 (Why is no real title available?)
- scientific article; zbMATH DE number 1283877 (Why is no real title available?)
- Hybrid compact-WENO finite difference scheme with radial basis function based shock detection method for hyperbolic conservation laws
- A Fast Schur–Euclid-Type Algorithm for Quasiseparable Polynomials
- New Fast Algorithms for Toeplitz-Plus-Hankel Matrices
- Topics in the numerical linear algebra of Toeplitz and Hankel matrices
- Computationally Efficient Reduced Polynomial Based Algorithms for Hermitian Toeplitz Matrices
- scientific article; zbMATH DE number 1893698 (Why is no real title available?)
- scientific article; zbMATH DE number 766201 (Why is no real title available?)
- Quadrant interlocking factorization algorithm of hourglass matrix from nonsingular matrix
- scientific article; zbMATH DE number 2201223 (Why is no real title available?)
- Linear complexity parallel algorithms for linear systems of equations with recursive structure
- Chebyshev-Hankel matrices and the splitting approach for centrosymmetric Toeplitz-plus-Hankel matrices
- Toeplitz matrices in the BC-method for the plane domains
- Risk-adjusted CUSUM charts under model error
- Efficient algorithms for perturbed symmetrical Toeplitz-plus-Hankel systems
- A low-complexity algorithm to digitally uncouple the mutual coupling effect in antenna arrays via symmetric Toeplitz matrices
- HHL algorithm without ancilla postselection for Toeplitz and Hankel systems
- The matricial Szegő mapping from the perspective of Schur analysis
- Matrices of small Toeplitz rank, certain representations of the solution to an unstable system of linear equations with Toeplitz coefficient matrices, and related fast algorithms for solving such systems
This page was built for publication: Fast algorithms for Toeplitz and Hankel matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2431168)