Matrix-free iterative processes with least-squares error damping for nonlinear systems of equations
Abstract
New iterative processes for numerical solution of big nonlinear systems of equations are considered. The processes do not require factorization and storing of Jacobi matrix and employ a special technique of convergence acceleration which is called least-squares error damping and requires solution of auxiliary linear least-squares problems of low dimension. In linear case the resulting method is similar to the general minimal residual method (GMRES) with preconditioning. In nonlinear case, in contrast to popular Newton – Krylov method, the computational scheme do not involve operation of difference approximation of derivative operator. Numerical experiments include three nonlinear problems originating from two-dimensional elliptic partial differential equations and exhibit advantage of the proposed method compared to Newton – Krylov method.
References
- Faleichik B., Bondar I., Byl V. Generalized Picard iterations: A class of iterated Runge – Kutta methods for stiff problems. J. Comput. Appl. Math. 2014. Vol. 262. P. 37 –50. DOI: 10.1016/j.cam. 2013.10.036.
- Saad Y. Iterative methods for Sparse Linear Systems. 2nd ed. Philadelphia : Siam, 2003.
- Knoll D. A., Keyes D. E. Jacobian-free Newton – Krylov methods: a survey of approaches and applications. J. Comput. Phys. 2004. Vol. 193, issue 2. P. 357–397 . DOI: 10.1016/j.jcp. 2003.08.010.
- Faddeev D. K., Faddeeva V. N. [Computational methods of linear algebra]. Moscow : Fizmatgiz, 1960 (in Russ.).
- Ortega J., Rheinboldt V. [Iterative methods for solving nonlinear equations with many unknowns]. Moscow : Mir, 1975 (in Russ.).
- Shapeev V. P., Vorozhtsov E. V., Isaev V. I., et al. [The method of collocations and least residuals for three-dimensional Navier – Stokes equations]. Vychisl. metody program. [Numer. Methods Program.]. 2013. No. 14. P. 306 –322 (in Russ.).
- Kurosh A. G. [The course of higher algebra]. 9th ed. Moscow : Glavnaya redaktsiya fiziko-matematicheskoi literatury, 1968 (in Russ.).
- Trefethen L. N., Bau D. III. Numerical Linear Algebra. Philadelphia : Siam, 1997.
- Samarsky A. A. [The theory of difference schemes]. Moscow : Nauka, 1977 (in Russ.).
- Baker A. H., Jessup E. R., Manteuffel T. A Technique for Accelerating the Convergence of Restarted GMRES. SIAM J. Matrix Anal. Appl. 2005. Vol. 26, issue 4. P. 962– 984. DOI: 10.1137/S0895479803422014.
- Walker H., Peng N. Anderson acceleration for fixed-point iterations. SIAM J. Numer. Anal. 2011. Vol. 49, issue 4. P. 1715–1735. DOI: 10.1137/10078356X.
- Toth A., Kelley C. T. Convergence Analysis for Anderson Acceleration. SIAM J. Numer. Anal. 2015. Vol. 53, issue 2. P. 805–819. DOI: 10.1137/130919398.
The authors who are published in this journal agree to the following:
- The authors retain copyright on the work and provide the journal with the right of first publication of the work on condition of license Creative Commons Attribution-NonCommercial. 4.0 International (CC BY-NC 4.0).
- The authors retain the right to enter into certain contractual agreements relating to the non-exclusive distribution of the published version of the work (e.g. post it on the institutional repository, publication in the book), with the reference to its original publication in this journal.
- The authors have the right to post their work on the Internet (e.g. on the institutional store or personal website) prior to and during the review process, conducted by the journal, as this may lead to a productive discussion and a large number of references to this work. (See The Effect of Open Access.)
