Computationally Efficient Reduced Polynomial Based Algorithms for Hermitian Toeplitz Matrices

DOI10.1137/0149076zbMATH Open0679.65030OpenAlexW2053956289MaRDI QIDQ4729243FDOQ4729243

Authors: Bal Krishna, Hari Krishna 

Publication date: 1989

Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0149076

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

zbMATH Keywords

reflection coefficientsthree-term recurrence relationLevinson polynomialLevinson-Durbin algorithmHermitian, positive definite Toeplitz matrixSzegö polynomial

Mathematics Subject Classification ID

Cited In (6)

• Topics in the numerical linear algebra of Toeplitz and Hankel matrices
• Immitance-Type Three-Term Schur and Levinson Recursions for Quasi-Toeplitz Complex Hermitian Matrices
• New PCG based algorithms for the solution of Hermitian Toeplitz systems
• On reduced polynomial-based split algorithms
• Split algorithms for Hermitian Toeplitz matrices with arbitrary rank profile
• A REDUCE program for Hirota's bilinear operator and Wronskian operations

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)