cm conference abstract: Kelley
Mesh Independence of Fully Iterative Methods for Path Following

W. R. Ferng
National Chiao-Tung University
Hsin-Chu 30050
Taiwan

and

C. T. Kelley
Department of Mathematics , Box 8205
Center for Research in Scientific Computation
North Carolina State University
Raleigh, NC 27695-8205
tim_kelley@ncsu.edu


Abstract

In this paper we consider fully iterative path following algorithms for nonlinear parameter-dependent compact fixed point problems. By fully iterative we mean that linear and nonlinear solves and testing for branching are done by iterative methods. We show that if these problems are discretized so that certain collective compactness and strong convergence properties hold, then certain fully iterative path following algorithms can follow smooth folds and capture simple bifurcations in a mesh independent way.