arXiv · math/0404374
Newton-Krylov solvers for time-steppers
Abstract
We study how the Newton-GMRES iteration can enable dynamic simulators (time-steppers) to perform fixed-point and path-following computations.For a class of dissipative problems, whose dynamics are characterized by a slow manifold, the Jacobian matrices in such computations are compact perturbations of the identity. We examine the number of GMRES iterations required for each nonlinear iteration as a function of the dimension of the slow subspace and the time-stepper reporting horizon. In a path-following computation, only a small number (one or two) of additional GMRES iterations is required.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
C. T. Kelley, I. G. Kevrekidis, L. Qiao. 2004-04-21. Newton-Krylov solvers for time-steppers. https://arxiv.org/abs/math/0404374
Cite the original work for its findings. Save a collection to share your selection of sources.