Finite precision arithmetic and the split Schur algorithms

DOI10.1109/78.91151MaRDI QIDQ3358127zbMATH OpenOpenAlexFDO

Authors Christopher J. Zarowski, Howard C. Card

Publication date 1991

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/78.91151

zbMATH Keywords

matrix factorizationLevinson algorithmreflection coefficientsinput signalcomplexity of algorithmfixed-point binary arithmeticnarrow-band high-pass signalnarrow-band low-pass signalsplit Schur algorithms

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• Finite precision arithmetic and the Schur algorithm
• Fixed-point error analysis of the lattice and the Schur algorithms for the autocorrelation method of linear prediction
• scientific article; zbMATH DE number 17433
• The Split Levinson Algorithm is Weakly Stable
• Numerical behaviour of a fixed-point implementation of the splitted generalized LeRoux-Gueguen algorithm

Cited in

(3)

• Finite precision arithmetic and the Schur algorithm
• Finite precision representation of the Conley decomposition
• Numerical behaviour of a fixed-point implementation of the splitted generalized LeRoux-Gueguen algorithm

This page was built for publication: Finite precision arithmetic and the split Schur algorithms

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