On reduced polynomial-based split algorithms

DOI10.1007/BF01187546zbMATH Open0803.65051MaRDI QIDQ1320122FDOQ1320122

Authors: Hari Krishna 

Publication date: 2 January 1995

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Cites Work

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

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)