Computationally Efficient Reduced Polynomial Based Algorithms for Hermitian Toeplitz Matrices
From MaRDI portal
Hermitian, positive definite Toeplitz matrixLevinson polynomialLevinson-Durbin algorithmreflection coefficientsSzegö polynomialthree-term recurrence relation
Recommendations
- Computing algorithms for the reduction of a Hermite algorithm with polynomial coefficients
- Efficient algorithm for Toeplitz plus Hankel matrices
- An improved Toeplitz algorithm for polynomial matrix null-space computation
- Computing Hermite forms of polynomial matrices
- Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix
- Fast Parallel Computation of Hermite and Smith Forms of Polynomial Matrices
- Algorithms for Hessenberg-triangular reduction of Fiedler linearization of matrix polynomials
- Fast algorithms for Toeplitz and Hankel matrices
- Fast polynomial transforms based on Toeplitz and Hankel matrices
- New Fast Algorithms for Toeplitz-Plus-Hankel Matrices
Cited in
(7)- On reduced polynomial-based split algorithms
- A REDUCE program for Hirota's bilinear operator and Wronskian operations
- New PCG based algorithms for the solution of Hermitian Toeplitz systems
- Split algorithms for Hermitian Toeplitz matrices with arbitrary rank profile
- scientific article; zbMATH DE number 4201508 (Why is no real title available?)
- Immitance-Type Three-Term Schur and Levinson Recursions for Quasi-Toeplitz Complex Hermitian Matrices
- Topics in the numerical linear algebra of Toeplitz and Hankel matrices
This page was built for publication: Computationally Efficient Reduced Polynomial Based Algorithms for Hermitian Toeplitz Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4729243)
