Abstract
From some results concerning the formal orthogonal polynomials, already proved in [5], we develop new properties of generalized adjacent polynomials which correspond to a change in the weight function. A new structure of the singular blocks is given. These results have a direct application to Lanczos methods, theG and ɛ-algorithms.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
C. Brezinski,Padé-type Approximation and General Orthogonal Polynomials,ISNM vol. 50 (Birkhäuser, Basel, 1980).
C. Brezinski, M. Redivo-Zaglia and H. Sadok, A breakdown-free Lanczos type algorithm for solving linear systems, Numer. Math. 63 (1992) 29–38.
C. Brezinski, M. Redivo-Zaglia and H. Sadok, Avoiding breakdown and near-breakdown in Lanczos type algorithms, Numer. Algor. 1 (1991) 207–221.
C. Brezinski and M. Redivo-Zaglia, A look-ahead strategy for the implementation of some old and new extrapolation methods, Numer. Algor. 11 (1996), this volume.
A. Draux,Polynômes Orthogonaux Formels. Applications, LNM 974, (Springer, Berlin, 1983).
W.B. Gragg, Matrix interpretations and applications of the continued fraction algorithm, Rocky Mountain J. Math. 4 (1974) 213–225.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Draux, A. Formal orthogonal polynomials revisited. Applications. Numer Algor 11, 143–158 (1996). https://doi.org/10.1007/BF02142493
Issue Date:
DOI: https://doi.org/10.1007/BF02142493