Iterative refinement enhances the stability ofQR factorization methods for solving linear equations
- 1 September 1991
- journal article
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 31 (3) , 447-468
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- On the augmented system approach to sparse least-squares problemsNumerische Mathematik, 1989
- Fast Solution of Vandermonde-Like Systems Involving Orthogonal PolynomialsIMA Journal of Numerical Analysis, 1988
- Scaling for Numerical Stability in Gaussian EliminationJournal of the ACM, 1979
- An Error Analysis of the Modified Clenshaw Method for Evaluating Chebyshev and Fourier SeriesIMA Journal of Applied Mathematics, 1977
- Iterative refinement implies numerical stabilityBIT Numerical Mathematics, 1977
- Solution of Vandermonde Systems of EquationsMathematics of Computation, 1970
- Algol programmingBIT Numerical Mathematics, 1967
- Iterative refinement of linear least squares solutions IBIT Numerical Mathematics, 1967
- An algorithm for summing orthogonal polynomial series and their derivatives with applications to curve-fitting and interpolationMathematics of Computation, 1965
- Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sidesNumerische Mathematik, 1964