Breakdowns In The Computation Of Orthogonal Polynomials
- 1 January 1994
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- The Reverse Bordering MethodSIAM Journal on Matrix Analysis and Applications, 1994
- Treatment of near-breakdown in the CGS algorithmNumerical Algorithms, 1994
- Well-defined determinant representations for non-normal multivariate rational interpolantsNumerical Algorithms, 1994
- A breakdown-free Lanczos type algorithm for solving linear systemsNumerische Mathematik, 1992
- Addendum to “Avoiding breakdown and near-breakdown in Lanczos type algorithms”Numerical Algorithms, 1992
- Avoiding breakdown and near-breakdown in Lanczos type algorithmsNumerical Algorithms, 1991
- A new presentation of orthogonal polynomials with applications to their computationNumerical Algorithms, 1991
- Other manifestations of the Schur complementLinear Algebra and its Applications, 1988
- The mühlbach-neville-aitken algorithm and some extensionsBIT Numerical Mathematics, 1980
- Padé-Type Approximation and General Orthogonal PolynomialsPublished by Springer Nature ,1980