Analysis of an Adaptive Safeguarded Newton-Anderson Algorithm of Depth One with Applications to Fluid Problems (2402.09295v2)
Abstract: The purpose of this paper is to develop a practical strategy to accelerate Newton's method in the vicinity of singular points. We present an adaptive safeguarding scheme with a tunable parameter, which we call adaptive gamma-safeguarding, that one can use in tandem with Anderson acceleration to improve the performance of Newton's method when solving problems at or near singular points. The key features of adaptive gamma-safeguarding are that it converges locally for singular problems, and it can detect nonsingular problems automatically, in which case the Newton-Anderson iterates are scaled towards a standard Newton step. The result is a flexible algorithm that performs well for singular and nonsingular problems, and can recover convergence from both standard Newton and Newton-Anderson with the right parameter choice. This leads to faster local convergence compared to both Newton's method, and Newton- Anderson without safeguarding, with effectively no additional computational cost. We demonstrate three strategies one can use when implementing Newton-Anderson and gamma-safeguarded Newton-Anderson to solve parameter-dependent problems near singular points. For our benchmark problems, we take two parameter-dependent incompressible flow systems: flow in a channel and Rayleigh-Benard convection.
- D.G. Anderson. Iterative procedures for nonlinear integral equations. J. Assoc. Comput. Mach., 12(4):547–560, 1965.
- R. Behling and A. Fishcer. A unified local convergence analysis of inexact constrained Levenberg-Marquardt methods. Optimization Letters, 6:927–940, 2012.
- S. Bellavia and B. Morini. Strong local convergence properties of adaptive regularized methods for nonlinear least squares. IMA Journal of Numerical Analysis, 35, 2015.
- Bifurcation analysis of two-dimensional Rayleigh-Bénard convection using deflation. Phys. Rev. E, 105, 2022.
- D. Braess. Finite Elements: Theory, Fast Solvers, and Applications in Solid Mechanics. Cambridge University Press, 2007.
- Convergence analysis of adaptive DIIS algorithms with application to electronic ground state calculations. ESAIM: Mathematical Modelling and Numerical Analysis, 55(6):2785–2825, 2021.
- M. Dallas and S. Pollock. Newton-Anderson at singular points. Int. J. Numer. Anal. and Mod., 20(5):667–692, 2023.
- Convergence rates for Newton’s method at singular points. SIAM J. Numer. Anal., 20(2):296–314, 1983.
- Newton’s method at singular points I. SIAM J. Numer. Anal., 17(1):66–70, 1980.
- Convergence acceleration for Newton’s method at singular points. SIAM J. Numer. Anal., 19(1):219–229, 1982.
- Expanded convergence domains for Newton’s method at nearly singular roots. SIAM J. Sci. Stat. Comput., 6(4), 1985.
- P. Deuflhard. Newton Methods for Nonlinear Problems. Springer Series in Computational Mathematics. Springer, 2005.
- Deflation techniques for finding distinct solutions of nonlinear partial differential equations. SIAM J. Sci. Comput., 37, 2015.
- Stabilizing poor mass conservation in incompressible flow problems with large irrotational forcing and application to thermal convection. Comput. Methods Appl. Mech. Engrg., pages 166–176, 2012.
- A.O. Griewank. Analysis and Modification of Newton’s Method at Singularities. PhD thesis, 1980.
- A.O. Griewank. Starlike domains of convergence for Newton’s method at singularities. Numer. Math., 35:95–111, 1980.
- J. Guzḿan and L.R. Scott. The Scott-Vogelius finite elements revisited. Mathematics of Computation, 88(316):515–529, 2019.
- Solve minimax optimization by Anderson acceleration. International Conference on Learning Representations, 2022.
- N.C. Henderson and R. Varadhan. Damped Anderson acceleration with restarts and monotonicity control for accelerating EM and EM-like algorithms. Journal of computational and graphical statistics, 28(4):834–846, 2019.
- Modified Newton’s method for systems of nonlinear equations with singular Jacobian. J. Comput. Appl. Math., 224(1):77–83, 2008.
- Levenberg–Marquardt methods with strong local convergence properties for solving nonlinear equations with convex constraints. J. Comput. Appl. Math, 172:375–397, 2004.
- C.T. Kelley and R. Suresh. A new acceleration method for Newton’s method at singular points. SIAM J. Numer. Anal, 20(5):1001–1009, 1983.
- H. Kielhöfer. Bifurcation Theory: An Introduction with Applications to Partial Differential Equations. Springer Science+Business Media, 2012.
- M.L. Pasini. Convergence analysis of Anderson-type acceleration of Richardson’s iteration. Numer. Linear Algebra Appl., 26, 2019.
- F. Pichi. Reduced order models for parametric bifurcation problems in nonlinear PDEs. PhD thesis, 2020.
- S. Pollock and L.G. Rebholz. Anderson acceleration for contractive and noncontractive operators. IMA J. Numer. Anal., 41(4):2841–2872, 2021.
- S. Pollock and L.G. Rebholz. Filtering for Anderson acceleration. SIAM J. Sci. Comput., 45(4):A1571–A1590, 2023.
- S. Pollock and H. Schwartz. Benchmarking results for the Newton–Anderson method. Results Appl. Math., 8:100095, 2020.
- J. Qin. On the convergence of some low order mixed finite elements for incompressible fluids. PhD thesis, 1994.
- L. Rebholz and M. Xiao. The effect of Anderson acceleration on superlinear and sublinear convergence. Journal of Scientific Computing, 96(2), 2023.
- G.W. Reddien. On Newton’s method for singular problems. SIAM J. Numer. Anal, 15(5):993–996, 1978.
- G.W. Reddien. Newton’s method and high order singularities. Comput. Math. Appl., 5(2):79–86, 1979.
- Tensor methods for nonlinear equations. SIAM J. Numer. Anal., 21(5):815–843, 1984.
- On backtracking failure in Newton-GMRES methods with demonstration for the Navier-Stokes equations. Journal of Computational Physics, 180:549–558, 2002.
- H. Uecker. Continuation and bifurcation in nonlinear pdes – algorithms, applications, and experiments. Jahresbericht der Deutschen Mathematiker-Vereinigung, 124:43–80, 2021.
- H.F. Walker and P. Ni. Anderson acceleration for fixed-point iterations. SIAM J. Numer. Anal., 49(4):1715–1735, 2011.
- Matt Dallas (2 papers)
- Sara Pollock (28 papers)
- Leo G. Rebholz (32 papers)