|-snes_qn_m||- Number of past states saved for the L-Broyden methods.|
|-snes_qn_powell_angle||- Angle condition for restart.|
|-snes_qn_powell_descent||- Descent condition for restart.|
|-snes_linesearch_type <cp, l2, basic>||- Type of line search.|
|-snes_qn_monitor||- Monitors the quasi-newton jacobian.|
Notes: This implements the L-BFGS, Broyden, and "Bad" Broyden algorithms for the solution of F(x) = b using previous change in F(x) and x to form the approximate inverse Jacobian using a series of multiplicative rank-one updates.
When using a nonlinear preconditioner, one has two options as to how the preconditioner is applied. The first of these options, sequential, uses the preconditioner to generate a new solution and function and uses those at this iteration as the current iteration's values when constructing the approximate jacobian. The second, composed, perturbs the problem the jacobian represents to be P(x, b) - x = 0, where P(x, b) is the preconditioner.
Kelley, C.T., Iterative Methods for Linear and Nonlinear Equations, Chapter 8, SIAM, 1995.
R. Byrd, J. Nocedal, R. Schnabel, Representations of Quasi-Newton Matrices and their use in Limited Memory Methods, Technical Report, Northwestern University, June 1992.
Peter N. Brown, Alan C. Hindmarsh, Homer F. Walker, Experiments with Quasi-Newton Methods in Solving Stiff ODE Systems, SIAM J. Sci. Stat. Comput. Vol 6(2), April 1985.
Index of all SNES routines
Table of Contents for all manual pages
Index of all manual pages