Add to ORKGWhen 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
summary:In the paper a method for computing zeroes of orthogonal polynomials is presented. An algori...
Lanczos type algorithms form a wide and interesting class of iterative methods for solving systems o...
Lanczos-type algorithms are well known for their inherent instability. They typically breakdown when...
When computing recursively the members of a family of formal orthogonal polynomials, a division by z...
The Lánczos method for solving systems of linear equations is based on formal orthogonal polynomial...
The Lanczos method for solving systems of linear equations is implemented by using some recurrence r...
Lanczos type algorithms for solving systems of linear equations have their foundations in the theory...
A breakdown (due to a division by zero) can arise in the algorithms for implementing Lanczos\u2019 m...
Lanczos method for solving a system of linear equations is well known. It is derived from a generali...
AbstractThe Lánczos method for solving systems of linear equations is based on formal orthogonal pol...
Lanczos method for solving a system of linear equations can be derived by using formal orthogonal po...
In the non-normal case, it is possible to use various look-ahead strategies for computing the elemen...
Various recurrence relations between formal orthogonal polynomials can be used to derive Lanczos-typ...
Lanczos method is an iterative method used to find the solution of a system of linear equations. Cur...
This article surveys the classical orthogonal polynomial systems of the Hahn class, which are soluti...
summary:In the paper a method for computing zeroes of orthogonal polynomials is presented. An algori...
Lanczos type algorithms form a wide and interesting class of iterative methods for solving systems o...
Lanczos-type algorithms are well known for their inherent instability. They typically breakdown when...
When computing recursively the members of a family of formal orthogonal polynomials, a division by z...
The Lánczos method for solving systems of linear equations is based on formal orthogonal polynomial...
The Lanczos method for solving systems of linear equations is implemented by using some recurrence r...
Lanczos type algorithms for solving systems of linear equations have their foundations in the theory...
A breakdown (due to a division by zero) can arise in the algorithms for implementing Lanczos\u2019 m...
Lanczos method for solving a system of linear equations is well known. It is derived from a generali...
AbstractThe Lánczos method for solving systems of linear equations is based on formal orthogonal pol...
Lanczos method for solving a system of linear equations can be derived by using formal orthogonal po...
In the non-normal case, it is possible to use various look-ahead strategies for computing the elemen...
Various recurrence relations between formal orthogonal polynomials can be used to derive Lanczos-typ...
Lanczos method is an iterative method used to find the solution of a system of linear equations. Cur...
This article surveys the classical orthogonal polynomial systems of the Hahn class, which are soluti...
summary:In the paper a method for computing zeroes of orthogonal polynomials is presented. An algori...
Lanczos type algorithms form a wide and interesting class of iterative methods for solving systems o...
Lanczos-type algorithms are well known for their inherent instability. They typically breakdown when...