Back to Search
Start Over
Further analysis of minimum residual iterations.
- Source :
- Numerical Linear Algebra with Applications; Mar2000, Vol. 7 Issue 2, p67-93, 27p
- Publication Year :
- 2000
-
Abstract
- The convergence behaviour of a number of algorithms based on minimizing residual norms over Krylov subspaces is not well understood. Residual or error bounds currently available are either too loose or depend on unknown constants that can be very large. In this paper we take another look at traditional as well as alternative ways of obtaining upper bounds on residual norms. In particular, we derive inequalities that utilize Chebyshev polynomials and compare them with standard inequalities. Copyright © 2000 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 10705325
- Volume :
- 7
- Issue :
- 2
- Database :
- Complementary Index
- Journal :
- Numerical Linear Algebra with Applications
- Publication Type :
- Academic Journal
- Accession number :
- 13440688
- Full Text :
- https://doi.org/10.1002/(SICI)1099-1506(200003)7:2<67::AID-NLA186>3.0.CO;2-8