New Fast Algorithms for Toeplitz-Plus-Hankel Matrices
From MaRDI portal
Publication:4650962
Recommendations
Cited in
(19)- A Fast Schur–Euclid-Type Algorithm for Quasiseparable Polynomials
- A Schur algorithm and linearly connected processor array for Toeplitz-plus-Hankel matrices
- Topics in the numerical linear algebra of Toeplitz and Hankel matrices
- scientific article; zbMATH DE number 4128294 (Why is no real title available?)
- Computationally Efficient Reduced Polynomial Based Algorithms for Hermitian Toeplitz Matrices
- Efficient algorithm for Toeplitz plus Hankel matrices
- Fast algorithms for centro-symmetric and centro-skewsymmetric Toeplitz-plus-Hankel matrices
- Fast algorithms for perturbed Toeplitz-plus-Hankel system based on discrete cosine transform and their applications
- Efficient solution of a Toeplitz-plus-Hankel coefficient matrix system of equations
- Fast iterative methods for solving Toeplitz-plus-Hankel least squares problems
- Fast algorithms for Toeplitz and Hankel matrices
- Transformation techniques for Toeplitz and Toeplitz-plus-Hankel matrices. II: Algorithms
- Fast algorithms for close-to-Toeplitz-plus-Hankel systems and two-sided linear prediction
- scientific article; zbMATH DE number 1283877 (Why is no real title available?)
- scientific article; zbMATH DE number 766262 (Why is no real title available?)
- Efficient algorithms for perturbed symmetrical Toeplitz-plus-Hankel systems
- Schur algorithms for Hermitian Toeplitz, and Hankel matrices with singular leading principal submatrices
- Computing the characteristic polynomial of generic Toeplitz-like and Hankel-like matrices
- Fast inversion algorithms of Toeplitz-plus-Hankel matrices
This page was built for publication: New Fast Algorithms for Toeplitz-Plus-Hankel Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4650962)