Approximating the extreme Ritz values and upper bounds for the A-norm of the error in CG
- 30 Downloads
In practical conjugate gradient (CG) computations, it is important to monitor the quality of the approximate solution to Ax = b so that the CG algorithm can be stopped when the required accuracy is reached. The relevant convergence characteristics, like the A-norm of the error or the normwise backward error, cannot be easily computed. However, they can be estimated. Such estimates often depend on approximations of the smallest or largest eigenvalue of A. In the paper, we introduce a new upper bound for the A-norm of the error, which is closely related to the Gauss-Radau upper bound, and discuss the problem of choosing the parameter µ which should represent a lower bound for the smallest eigenvalue of A. The new bound has several practical advantages, the most important one is that it can be used as an approximation to the A-norm of the error even if µ is not exactly a lower bound for the smallest eigenvalue of A. In this case, µ can be chosen, e.g., as the smallest Ritz value or its approximation. We also describe a very cheap algorithm, based on the incremental norm estimation technique, which allows to estimate the smallest and largest Ritz values during the CG computations. An improvement of the accuracy of these estimates of extreme Ritz values is possible, at the cost of storing the CG coefficients and solving a linear system with a tridiagonal matrix at each CG iteration. Finally, we discuss how to cheaply approximate the normwise backward error. The numerical experiments demonstrate the efficiency of the estimates of the extreme Ritz values, and show their practical use in error estimation in CG.
KeywordsConjugate gradients Error norm estimation Approximation of Ritz values Incremental norm estimator
Mathematics Subject Classification (2010)65F10 65F15 65F35
Unable to display preview. Download preview PDF.
The authors thank an anonymous referee for the very helpful comments.
- 5.Dahlquist, G., Golub, G.H., Nash, S.G.: Bounds for the error in linear systems. In: Semi-Infinite Programming (Proc. Workshop, Bad Honnef, 1978), Lecture Notes in Control and Information Sci., vol. 15, pp. 154–172. Springer, Berlin (1979)Google Scholar
- 9.Fischer, B., Golub, G.H.: On the error computation for polynomial based iteration methods. In: Recent Advances in Iterative Methods, IMA Vol. Math. Appl., Vol. 60, pp. 59–67. Springer, New York (1994)Google Scholar
- 10.Golub, G.H., Meurant, G.: Matrices, moments and quadrature. In: Numerical Analysis 1993 (Dundee, 1993), Pitman Res. Notes Math. Ser., Vol. 303, pp. 105–156. Longman Sci. Tech., Harlow (1994)Google Scholar
- 14.Golub, G.H., Van Loan, C.F.: Matrix Computations. Johns Hopkins Studies in the Mathematical Sciences, 4th edn. Johns Hopkins University Press, Baltimore (2013)Google Scholar
- 20.Kouhia, R.: Description of the CYLSHELL set. Laboratory of Structural Mechanics, Finland (1998)Google Scholar
- 27.Parlett, B.N., Dhillon, I.S.: Relatively robust representations of symmetric tridiagonals. In: Proceedings of the International Workshop on Accurate Solution of Eigenvalue Problems (University Park, PA, 1998), vol. 309, pp. 121–151 (2000)Google Scholar