File: SNESQN.html

package info (click to toggle)
petsc 3.4.2.dfsg1-8.1
  • links: PTS, VCS
  • area: main
  • in suites: jessie, jessie-kfreebsd
  • size: 129,104 kB
  • ctags: 516,422
  • sloc: ansic: 395,939; cpp: 47,201; python: 34,788; makefile: 17,193; fortran: 16,251; f90: 1,592; objc: 954; sh: 822; xml: 621; java: 381; lisp: 293; csh: 241
file content (54 lines) | stat: -rw-r--r-- 3,096 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML3.2 EN">
<HTML>
<HEAD> <link rel="canonical" href="http://www.mcs.anl.gov/petsc/petsc-current/docs/manualpages/SNES/SNESQN.html" />
<META NAME="GENERATOR" CONTENT="DOCTEXT">
<TITLE>SNESQN</TITLE>
</HEAD>
<BODY BGCOLOR="FFFFFF">
   <div id="version" align=right><b>petsc-3.4.2 2013-07-02</b></div>
<A NAME="SNESQN"><H1>SNESQN</H1></A>
Limited-Memory Quasi-Newton methods for the solution of nonlinear systems. 
<H3><FONT COLOR="#CC3333">Options Database</FONT></H3>
<P>
<TABLE border="0" cellpadding="0" cellspacing="0">
<TR><TD WIDTH=40></TD><TD ALIGN=LEFT VALIGN=TOP><B>-snes_qn_m </B></TD><TD>- Number of past states saved for the L-Broyden methods.
</TD></TR>
<TR><TD WIDTH=40></TD><TD ALIGN=LEFT VALIGN=TOP><B>-snes_qn_powell_angle </B></TD><TD>- Angle condition for restart.
</TD></TR>
<TR><TD WIDTH=40></TD><TD ALIGN=LEFT VALIGN=TOP><B>-snes_qn_powell_descent </B></TD><TD>- Descent condition for restart.
</TD></TR>
<TR><TD WIDTH=40></TD><TD ALIGN=LEFT VALIGN=TOP><B>-snes_linesearch_type &lt;cp, l2, basic&gt; </B></TD><TD>- Type of line search.
</TD></TR>
<TR><TD WIDTH=40></TD><TD ALIGN=LEFT VALIGN=TOP><B>-snes_qn_monitor </B></TD><TD>- Monitors the quasi-newton jacobian.
</TD></TR></TABLE>
<P>
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.
<P>
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.
<P>
<H3><FONT COLOR="#CC3333">References</FONT></H3>
<P>
L-Broyden Methods: a generalization of the L-BFGS method to the limited memory Broyden family, M. B. Reed,
International Journal of Computer Mathematics, vol. 86, 2009.
<P>
Experiments with Quasi-Newton Methods in Solving Stiff ODE Systems, Peter N. Brown, Alan C. Hindmarsh, Homer F. Walker
SIAM J. Sci. Stat. Comput. Vol 6(2), April 1985.
<P>
<P>

<P>
<H3><FONT COLOR="#CC3333">See Also</FONT></H3>
  <A HREF="../SNES/SNESCreate.html#SNESCreate">SNESCreate</A>(), <A HREF="../SNES/SNES.html#SNES">SNES</A>, <A HREF="../SNES/SNESSetType.html#SNESSetType">SNESSetType</A>(), <A HREF="../SNES/SNESNEWTONLS.html#SNESNEWTONLS">SNESNEWTONLS</A>, <A HREF="../SNES/SNESNEWTONTR.html#SNESNEWTONTR">SNESNEWTONTR</A>
<BR>
<P>
<P><B><P><B><FONT COLOR="#CC3333">Level:</FONT></B>beginner
<BR><FONT COLOR="#CC3333">Location:</FONT></B><A HREF="../../../src/snes/impls/qn/qn.c.html#SNESQN">src/snes/impls/qn/qn.c</A>
<BR><A HREF="./index.html">Index of all SNES routines</A>
<BR><A HREF="../../index.html">Table of Contents for all manual pages</A>
<BR><A HREF="../singleindex.html">Index of all manual pages</A>
</BODY></HTML>