No CrossRef data available.
Article contents
Usage of the convergence test of the residual norm in the Tsuno-Nodera version of the GMRES algorithm
Published online by Cambridge University Press: 17 February 2009
Abstract
Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
Tsuno and Nodera proposed a new variant of the GMRES(m) algorithm. Their algorithm is referred to as the GMRES(≤ mmax) algorithm and performs the restart process adaptively, considering the distribution of the zeros of the residual polynomial. However, unless the zeros of the residual polynomial are distributed uniformly, mass is always chosen and their algorithm becomes almost the same as the GMRES(m) algorithm with m = mmax. In this paper, we include a convergence test for the residual norm in the GMRES(≤ mmax) algorithm and propose a new restarting technique based on two criteria. Even if the distribution of zeros does not become uniform, the restart can be performed by using the convergence test of the residual norm. Numerical examples simulated on a Compaq Beowulf computer demonstrate that the proposed technique accelerates the convergence of the GMRES(≤ mmax) algorithm.
- Type
- Articles
- Information
- Copyright
- Copyright © Australian Mathematical Society 2007
References
[1] Arnoldi, W., “The principle of minimized iterations in the solution of the matrix eigenvalue problem”, Quart Appl Math. 9 (1951) 17–29.CrossRefGoogle Scholar
[2] Baglama, J., Calvetti, D., Golub, G. H. and Reichel, L., “Adaptively preconditioned GMRES algorithms”, S1AMJ Sci Comput. 20 (1998) 373–390.Google Scholar
[3] Chapman, A. and Saad, Y., “Deflated and augment Krylov subspace techniques”, Numer Lin Algebra Appl. 4 (1997) 43–66.3.0.CO;2-Z>CrossRefGoogle Scholar
[4] Eiermann, M., Ernst, O. G. and Schneider, O., “Analysis of acceleration strategies for restarted minimal residual methods”, J Comput Appl Math. 123 (2000) 261–292.CrossRefGoogle Scholar
[5] Freund, R. W., “Quasi-kernel polynomials and their use in non-Hermitian matrix iterations”, J Comp Appl Math. 43 (1992) 135–158.CrossRefGoogle Scholar
[6] Joubert, W., “Lanczos methods for the solution of nonsymmetric systems of linear equations”, SIAMJ Matrix Anal Appl. 13 (1992) 928–943.CrossRefGoogle Scholar
[7] MatrixMarket, Url = http://math.nist.gov/matrixmarket.Google Scholar
[8] Morgan, R. B., “A restarted GMRES method augmented with eigenvectors”, SIAM J Matrix Anal Appl. 16 (1995) 1154–1171.CrossRefGoogle Scholar
[9] Morgan, R. B., “Implicitly restarted GMRES and Arnoldi methods for nonsymmetric systems of equations”, SIAMJ Matrix Anal Appl. 21 (2000) 11127–1135.CrossRefGoogle Scholar
[10] Moriya, K. and Nodera, T., “The DEFLATED-GMRES(m, k) method with switching the restart frequency dynamically”, Numer Lin Algebra Appl. 7 (2000) 569–584.3.0.CO;2-8>CrossRefGoogle Scholar
[11] Nachtigal, N. M., Reichel, L. and Trefethen, L. N., “A hybrid GMRES algorithm for nonsymmetric linear systems”, SIAMJ Matrix Anal Appl. 13 (1992) 796–825.CrossRefGoogle Scholar
[12] Saad, Y. and Schultz, M. K., “GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems”, SIAMJ Sci Stat Comput. 7 (1986) 856–869.CrossRefGoogle Scholar
[13] Tsuno, N. and Nodera, T., “The speedup of the GMRES(m) method using the early restarting procedure”, Trans Inform Process Soc Japan 40 (1999) 1760–1773, (in Japanese).Google Scholar
[14] Zitko, J., “Using successive approximations for improving the convergence of GMRES method”, Appl Math 43 (1998) 321–350.CrossRefGoogle Scholar
[15] Zitko, J., “Convergence condition for restarted GMRES method augmented with eigenspaces”, Numer Lin Algebra Appl. 12 (2005) 373–390.CrossRefGoogle Scholar
You have
Access