Finite precision arithmetic and the split Schur algorithms

DOI10.1109/78.91151zbMath0732.65016OpenAlexW2159480144MaRDI QIDQ3358127

Howard C. Card, Christopher J. Zarowski

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

Levinson algorithmreflection coefficientsmatrix factorizationinput signalcomplexity of algorithmfixed-point binary arithmeticnarrow-band high-pass signalnarrow-band low-pass signalsplit Schur algorithms

Mathematics Subject Classification ID

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

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