Determinant expressions and matrix interpretations
In this chapter we go back to the origin of our basic algorithms of chapter 3. We started by formulating in (3.1) a problem of linear algebra wich was to solve recursively some nested Toeplitz systems of linear equations. This solution gave recurrence relation (3.6) which was the fundament of algorithms 1 and 2. In subsequent chapters we gave interpretations in terms of Padé approximants, continued fractions, Moebius transforms and orthogonal polynomials. In this chapter we shall come back to the linear algebra and show how the previous results may be interpreted in this environment.
KeywordsRecurrence Relation Inversion Formula Toeplitz Matrix Triangular Matrice Toeplitz Matrice
Unable to display preview. Download preview PDF.