Composing scalable nonlinear algebraic solvers

From MaRDI portal
Publication:2808260

DOI10.1137/130936725zbMATH Open1336.65030arXiv1607.04254OpenAlexW2120494006MaRDI QIDQ2808260FDOQ2808260


Authors: Peter Brune, Matthew G. Knepley, Xuemin Tu, Barry Smith Edit this on Wikidata


Publication date: 20 May 2016

Published in: SIAM Review (Search for Journal in Brave)

Abstract: Most efficient linear solvers use composable algorithmic components, with the most common model being the combination of a Krylov accelerator and one or more preconditioners. A similar set of concepts may be used for nonlinear algebraic systems, where nonlinear composition of different nonlinear solvers may significantly improve the time to solution. We describe the basic concepts of nonlinear composition and preconditioning and present a number of solvers applicable to nonlinear partial differential equations. We have developed a software framework in order to easily explore the possible combinations of solvers. We show that the performance gains from using composed solvers can be substantial compared with gains from standard Newton-Krylov methods.


Full work available at URL: https://arxiv.org/abs/1607.04254




Recommendations




Cites Work


Cited In (73)

Uses Software





This page was built for publication: Composing scalable nonlinear algebraic solvers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2808260)