Abstract
In a recent paper, we introduced a new look-ahead algorithm for recursively computing Padé approximants. This algorithm generates a subsequence of the Padé approximants on two adjacent rows (defined by fixed numerator degree) of the Padé table. Its two basic versions reduce to the classical Levinson and Schur algorithms if no look-ahead is required. In this paper, we show that the computational overhead of the look-ahead steps in the O( N 2) versions of the look-ahead Levinson- and the look-ahead Schur-type algorithm can be further reduced. If the algorithms are used to solve Toeplitz systems of equations Tx = b , then the corresponding block LDU decompositions of T −1 or T , respectively, can be found with less computational effort than with any other look-ahead algorithm available today.
Sign-in/Register to access full text options 
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.
