Abstract
The authors study the finite arithmetic properties of the Schur and the lattice recursions. They derive the error variance of the reflection coefficient at each stage of each algorithm and present experimental results which agree very closely with the analytical results. They also show that the lattice recursions have a significant accuracy advantage over the Schur recursions when the problem is ill-conditioned or, equivalently, when the absolute values of the reflection coefficients are close to one. >
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
