SIAM Journal on 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.
First Page Number
Last Page Number
© 1999, SIAM Publications.
Walker, H. F. (1999). An Adaptation of Krylov Subspace Methods to Path Following Problems. SIAM Journal on Scientific Computing, 21(3), 1191-1198. http://dx.doi.org/10.1137/S1064827597315376