On reduced polynomial-based split algorithms

DOI10.1007/BF01187546MaRDI QIDQ1320122zbMATH OpenFDO

Authors Hari Krishna

Publication date 2 January 1995

Published in Circuits, Systems, and Signal Processing (Search for Journal in Brave)

zbMATH Keywords

computational complexityToeplitz matricesthree-term recurrence relationSchur algorithmLevinson-Durbin algorithmlattice algorithmssplit algorithms

Mathematics Subject Classification ID

Recommendations

• Computationally Efficient Reduced Polynomial Based Algorithms for Hermitian Toeplitz Matrices
• Immitance-Type Three-Term Schur and Levinson Recursions for Quasi-Toeplitz Complex Hermitian Matrices
• scientific article; zbMATH DE number 17432

Cites work

• scientific article; zbMATH DE number 4106088 (Why is no real title available?)
• A fixed point computation of partial correlation coefficients
• An inverse problem for Toeplitz matrices
• An inverse problem for Toeplitz matrices and the synthesis of discrete transmission lines
• Computationally Efficient Reduced Polynomial Based Algorithms for Hermitian Toeplitz Matrices
• Immittance-domain Levinson algorithms
• Some matrix factorization identities for discrete inverse scattering
• The Fitting of Time-Series Models
• The Numerical Stability of the Levinson-Durbin Algorithm for Toeplitz Systems of Equations
• The One-Dimensional Inverse Problem of Reflection Seismology

Cited in

(3)

• Immitance-Type Three-Term Schur and Levinson Recursions for Quasi-Toeplitz Complex Hermitian Matrices
• Optimized look-ahead recurrences for adjacent rows in the Padé table
• Immittance-domain Levinson algorithms

This page was built for publication: On reduced polynomial-based split algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1320122)