Experiments with Conjugate Gradient Algorithms for Homotopy Curve Tracking

There are algorithms for finding zeros or fixed points of nonlinear systems of equations that are globally convergent for almost all starting points, i.e., with probability one. The essence of all such algorithms is the construction of an appropriate homotopy map and then tracking some smooth curve in the zero set of this homotopy map. HOMPACK is a mathematical software package implementing globally convergent homotopy algorithms with three different techniques for tracking a homotopy zero curve, and has separate routines for dense and sparse Jacobian matrices. The HOMPACK algorithms for sparse Jacobian matrices use a preconditioned conjugate gradient algorithm for the computation of the kernal of the homotopy Jacobian matrix, a required linear algebra step for homotopy curve tracking. Here variants of the conjugate gradient algorithm are implemented in the context of homotopy curve tracking and compared with Craig''s preconditioned conjugate gradient method used in HOMPACK. The test problems used include actual large scale, sparse structural mechanics problems.

[1]  R. Fletcher.  Conjugate gradient methods for indefinite systems , 1976 .

[2]  C. Lanczos.  Solution of Systems of Linear Equations by Minimized Iterations1 , 1952 .

[3]  Y. Saad.  Krylov subspace methods for solving large unsymmetric linear systems , 1981 .

[4]  L. Watson.  A globally convergent algorithm for computing fixed points of C2 maps , 1979 .

[5]  D. O’Leary.  The block conjugate gradient algorithm and related methods , 1980 .

[6]  J. M Varah,et al.  Computational methods in linear algebra , 1984 .

[7]  Y. Saad,et al.  GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems , 1986 .

[8]  L. Watson.  An Algorithm That is Globally Convergent with Probability One for a Class of Nonlinear Two-Point Boundary Value Problems , 1979 .

[9]  O. Axelsson.  Conjugate gradient type methods for unsymmetric and inconsistent systems of linear equations , 1980 .

[10]  M. Hestenes,et al.  Methods of conjugate gradients for solving linear systems , 1952 .

[11]  O. Axelsson.  Solution of linear systems of equations: Iterative methods , 1977 .

[12]  O. Widlund.  A Lanczos Method for a Class of Nonsymmetric Systems of Linear Equations , 1978 .

[13]  P. Brown,et al.  Reduced storage matrix methods in stiff ODE systems , 1989, Conference on Numerical Ordinary Differential Equations.

[14]  J. Meijerink,et al.  Guidelines for the usage of incomplete decompositions in solving sets of linear equations as they occur in practical problems , 1981 .

[15]  L. T. Watson,et al.  Globally convergent homotopy methods: a tutorial , 1989, Conference on Numerical Ordinary Differential Equations.

[16]  J. Meijerink,et al.  An iterative solution method for linear systems of which the coefficient matrix is a symmetric -matrix , 1977 .

[17]  Kang C. Jea,et al.  Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methods , 1980 .

[18]  Homer F. Walker,et al.  Implementations of the GMRES method , 1989 .

[19]  Layne T. Watson,et al.  Algorithm 652: HOMPACK: a suite of codes for globally convergent homotopy algorithms , 1987, TOMS.

[20]  S. Eisenstat.  Efficient Implementation of a Class of Preconditioned Conjugate Gradient Methods , 1981 .

[21]  L. Watson,et al.  Solving spline-collocation approximations to nonlinear two-point boundary-value problems by a homoto , 1987 .

[22]  W. Rheinboldt.  Numerical analysis of parametrized nonlinear equations , 1986 .

[23]  Philip E. Gill,et al.  Newton-type methods for unconstrained and linearly constrained optimization , 1974, Math. Program..

[24]  R. P. Kendall,et al.  An Approximate Factorization Procedure for Solving Self-Adjoint Elliptic Difference Equations , 1968 .

[25]  O. Axelsson,et al.  On some versions of incomplete block-matrix factorization iterative methods , 1984 .

[26]  T. Chan.  Deflated Decomposition of Solutions of Nearly Singular Systems , 1984 .

[27]  T. Chan.  Deflation Techniques and Block-Elimination Algorithms for Solving Bordered Singular Systems , 1984 .

[28]  J. Gillis,et al.  Matrix Iterative Analysis , 1961 .

[29]  J. Dennis,et al.  Generalized conjugate directions , 1987 .

[30]  S. Eisenstat,et al.  Variational Iterative Methods for Nonsymmetric Systems of Linear Equations , 1983 .

[31]  D. O’Leary.  Hybrid conjugate gradient algorithms , 1976 .

[32]  Tony F. Chan,et al.  Generalized deflated block-elimination , 1986 .

[33]  E. J. Craig,et al.  Iteration procedures for simultaneous equations , 1954 .

[34]  P. K. W. Vinsome,et al.  Orthomin, an Iterative Method for Solving Sparse Sets of Simultaneous Linear Equations , 1976 .

[35]  J. Yorke,et al.  Finding zeroes of maps: homotopy methods that are constructive with probability one , 1978 .

[36]  T. Chan,et al.  Iterative Methods for Solving Bordered Systems with Applications to Continuation Methods , 1985 .

[37]  H. Elman.  Iterative methods for large, sparse, nonsymmetric systems of linear equations , 1982 .

[38]  L. Watson.  Numerical linear algebra aspects of globally convergent homotopy methods , 1986 .

[39]  J. Reid.  Large Sparse Sets of Linear Equations , 1973 .

[40]  T. Chan.  On the existence and computation of $LU$-factorizations with small pivots , 1984 .

[41]  W. Rheinboldt.  Numerical analysis of continuation methods for nonlinear structural problems , 1981 .

[42]  Y. Saad,et al.  Practical Use of Some Krylov Subspace Methods for Solving Indefinite and Nonsymmetric Linear Systems , 1984 .

[43]  L. Watson.  Solving Finite Difference Approximations to Nonlinear Two-Point Boundary Value Problems by a Homotopy Method , 1980 .

[44]  J. M. Ortega.  Efficient Implementations of Certain Iterative Methods , 1988 .

[45]  Layne T. Watson,et al.  Solving Galerkin approximation to nonlinear two-point boundary value problems bya globally convergent homotopy method , 1987 .

[46]  Y. Saad,et al.  Conjugate gradient-like algorithms for solving nonsymmetric linear systems , 1985 .

[47]  Louis A. Hageman,et al.  Iterative Solution of Large Linear Systems. , 1971 .

[48]  H. Walker.  Implementation of the GMRES method using householder transformations , 1988 .

[49]  Layne T. Watson,et al.  Location of stable and unstable equilibrium configurations using a model trust region quasi-Newton method and tunnelling , 1985 .

[50]  Werner C. Rheinboldt,et al.  Algorithm 596: a program for a locally parameterized , 1983, TOMS.