When computing recursively the members of a family of formal orthogonal polynomials, a division by zero can occur, thus producing a breakdown in the algorithm which has to be stopped. In this paper, such breakdowns are analyzed in detail and classified. It is also showed how to avoid them in some particular cases. Applications to Padé approximations, extrapolation methods and Lanczos method for solving systems of linear equations are discussed.
Breakdowns in the computation of Orthogonal Polynomials
REDIVO ZAGLIA, MICHELA
1994
Abstract
When computing recursively the members of a family of formal orthogonal polynomials, a division by zero can occur, thus producing a breakdown in the algorithm which has to be stopped. In this paper, such breakdowns are analyzed in detail and classified. It is also showed how to avoid them in some particular cases. Applications to Padé approximations, extrapolation methods and Lanczos method for solving systems of linear equations are discussed.File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
