Variable Order Adams-Bashforth Predictors with an Error-Stepsize Control for Continuation Methods

Variable order Adams–Bashforth predictors with an error-stepsize control are developed and used for a class of predictor-corrector continuation methods which trace solution paths of an underdetermined nonlinear system $F(w) = 0$, where $F:\mathbb{R}^{n + 1} \to \mathbb{R}^n $. The predictor method developed here employs consecutive order Adams–Bashforth predictors to determine the stepsize by estimating the local truncation error in the lower order formula, a comparison of three consecutive order methods to choose the order that yields the largest stepsize, and local extrapolation to improve accuracy. Unlike many differential equation algorithms, the stepsize is changed at each step to give more uniformity in the predictor error and the global error is controlled at each step through the use of a Newton-like correction back to the path after each prediction. The philosophy of following the path closely with only one or two corrections per step is shown to yield an efficient and robust algorithm which is fairly insensitive to parameter settings. The key to the success and robustness of these multistep predictors is the approximation of arclength along the path at an accuracy commensurate with that of the tangents to the path, which is achieved by a local parameterization suggested by the corrector equations. To demonstrate the efficiency and robustness of the resulting continuation algorithm, several numerical comparisons are made with state-of-the-art software packages HOMPACK and PITCON.

[1]  On the Choice of Steplength in Path Following Methods , 1984 .

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

[3]  H. Keller The Bordering Algorithm and Path Following Near Singular Points of Higher Nullity , 1983 .

[4]  R. Russell,et al.  Adaptive Mesh Selection Strategies for Solving Boundary Value Problems , 1978 .

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

[6]  K. Georg A Note on Stepsize Control for Numerical Curve Following , 1983 .

[7]  K. Georg Numerical integration of the Davidenko equation , 1981 .

[8]  F. Gustavson,et al.  Implementing Linear Algebra Algorithms for Dense Matrices on a Vector Pipeline Machine , 1984 .

[9]  H. B. Keller Global Homotopies and Newton Methods , 1978 .

[10]  A. B. Poore,et al.  The expanded Lagrangian system for constrained optimization problems , 1988 .

[11]  H. Schwetlick,et al.  Parametrization via secant length and application to path following , 1985 .

[12]  Hans D Mittlemann A pseudo-arclength continuation method for nonlinear eigenvalue problems , 1986 .

[13]  Werner C. Rheinboldt,et al.  A locally parameterized continuation process , 1983, TOMS.

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

[15]  Fred T. Krogh,et al.  Algorithms for Changing the Step Size , 1973 .

[16]  T. Ypma Following paths through turning points , 1982 .

[17]  J. H. Avila The Feasibility of Continuation Methods for Nonlinear Equations , 1974 .

[18]  R. Mejia CONKUB: A conversational path-follower for systems of nonlinear equations , 1986 .

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

[20]  Eugene L. Allgower,et al.  Predictor-Corrector and Simplicial Methods for Approximating Fixed Points and Zero Points of Nonlinear Mappings , 1982, ISMP.

[21]  James M. Ortega,et al.  Iterative solution of nonlinear equations in several variables , 2014, Computer science and applied mathematics.

[22]  W. E. Bosarge,et al.  Iterative continuation and the solution of nonlinear two-point boundary value problems , 1971 .

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

[24]  L. Shampine,et al.  Computer solution of ordinary differential equations : the initial value problem , 1975 .

[25]  Eugene L. Allgower,et al.  Numerical continuation methods - an introduction , 1990, Springer series in computational mathematics.

[26]  H. Schwetlick,et al.  Higher order predictors and adaptive steplength control in path following algorithms , 1987 .

[27]  P. Deuflhard A stepsize control for continuation methods and its special application to multiple shooting techniques , 1979 .

[28]  P. Deuflhard,et al.  Efficient numerical path following beyond critical points , 1987 .

[29]  Tony F. Chan,et al.  Techniques for Large Sparae Systems Arising from Continuation Methods , 1984 .

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

[31]  H. Walker,et al.  Least-change secant update methods for undetermined systems , 1990 .

[32]  W. Rheinboldt,et al.  On steplength algorithms for a class of continuation methods siam j numer anal , 1981 .

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