Conjugate gradient methods for continuation problems (Q1184104)

The paper is concerned with the approximation of branches of solutions of linear and nonlinear eigenvalue problems. Such problems are likely to have arisen from a discretization of an operator equation in Banach space, which involves additional parameters. For such kind of problems linear and nonlinear conjugate gradient methods for large sparse confirmation problems are investigated. The authors show how linear conjugate gradient methods can be incorporated as linear solvers in the context of efficient higher-order predictor-Newton corrector confirmation methods. The implementation of this method is based on the generalized minimal residual algorithm of \textit{Y. Saad} and \textit{M. H. Schultz} [SIAM J. Sci. Stat. Comput. 7, 856-869 (1986; Zbl 0599.65018)]. The authors also describe how to use a special nonlinear conjugate gradient method to perform the corrector phase. In both cases the investigation deals with the perturbed problems for the bifurcations. Samples of numerical results concerning certain nonlinear eigenvalue problems are also given.