An Adaptation of Krylov Subspace Methods to Path Following Problems

  title={An Adaptation of Krylov Subspace Methods to Path Following Problems},
  author={Homer F. Walker},
  journal={SIAM J. Scientific Computing},
A procedure is outlined for adapting Krylov subspace methods to solving approximately the underdetermined linear systems that arise in path following (continuation, homotopy) methods. This procedure, in addition to preserving the usual desirable features of Krylov subspace methods, has the advantages of satisfying orthogonality constraints exactly and of not introducing ill-conditioning through poor scaling. 


Publications referenced by this paper.
Showing 1-10 of 19 references

Newton-like pseudo-arclength methods for computing simple turning points

T. F. Chan
SIAM J. Sci. Statist. Comput., 5 • 1984
View 3 Excerpts
Highly Influenced

Lanczos-type solvers for nonsymmetric linear systems of equations

M. H. Gutknecht
Acta Numerica 1997, 6 • 1997
View 1 Excerpt

Iterative ‘ Solution of Linear Systems

Roland W. Fkeund, Gene H. Golub, Noel M. Nachtigal
View 1 Excerpt

Globally convergent homotopy algorithms for nonlinear systems of equations

L. T. Watson
Nonlinear Dynam., 1 • 1990
View 1 Excerpt

Similar Papers

Loading similar papers…