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
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
|
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML3.2 EN">
<HTML>
<HEAD> <link rel="canonical" href="http://www.mcs.anl.gov/petsc/petsc-current/docs/manualpages/TS/TSPSEUDO.html" />
<META NAME="GENERATOR" CONTENT="DOCTEXT">
<TITLE>TSPSEUDO</TITLE>
</HEAD>
<BODY BGCOLOR="FFFFFF">
<div id="version" align=right><b>petsc-3.4.2 2013-07-02</b></div>
<A NAME="TSPSEUDO"><H1>TSPSEUDO</H1></A>
Solve steady state ODE and DAE problems with pseudo time stepping This method solves equations of the form
<P>
<pre>
F(X,Xdot) = 0
</pre>
<P>
for steady state using the iteration
<P>
<pre>
[G'] S = -F(X,0)
</pre>
<pre>
X += S
</pre>
<P>
where
<P>
<pre>
G(Y) = F(Y,(Y-X)/dt)
</pre>
<P>
This is linearly-implicit Euler with the residual always evaluated "at steady
state". See note below.
<P>
<H3><FONT COLOR="#CC3333">Options database keys</FONT></H3>
<TABLE border="0" cellpadding="0" cellspacing="0">
<TR><TD WIDTH=40></TD><TD ALIGN=LEFT VALIGN=TOP><B>-ts_pseudo_increment <real> </B></TD><TD>- ratio of increase dt
</TD></TR>
<TR><TD WIDTH=40></TD><TD ALIGN=LEFT VALIGN=TOP><B>-ts_pseudo_increment_dt_from_initial_dt <truth> </B></TD><TD>- Increase dt as a ratio from original dt
</TD></TR></TABLE>
<P>
<P>
<H3><FONT COLOR="#CC3333">References</FONT></H3>
Todd S. Coffey and C. T. Kelley and David E. Keyes, Pseudotransient Continuation and Differential-Algebraic Equations, 2003.
C. T. Kelley and David E. Keyes, Convergence analysis of Pseudotransient Continuation, 1998.
<P>
<H3><FONT COLOR="#CC3333">Notes</FONT></H3>
The residual computed by this method includes the transient term (Xdot is computed instead of
always being zero), but since the prediction from the last step is always the solution from the
last step, on the first Newton iteration we have
<P>
<pre>
Xdot = (Xpredicted - Xold)/dt = (Xold-Xold)/dt = 0
</pre>
<P>
Therefore, the linear system solved by the first Newton iteration is equivalent to the one
described above and in the papers. If the user chooses to perform multiple Newton iterations, the
algorithm is no longer the one described in the referenced papers.
<P>
<H3><FONT COLOR="#CC3333">See Also</FONT></H3>
<A HREF="../TS/TSCreate.html#TSCreate">TSCreate</A>(), <A HREF="../TS/TS.html#TS">TS</A>, <A HREF="../TS/TSSetType.html#TSSetType">TSSetType</A>()
<BR>
<P>
<P><B><P><B><FONT COLOR="#CC3333">Level:</FONT></B>beginner
<BR><FONT COLOR="#CC3333">Location:</FONT></B><A HREF="../../../src/ts/impls/pseudo/posindep.c.html#TSPSEUDO">src/ts/impls/pseudo/posindep.c</A>
<BR><A HREF="./index.html">Index of all TS 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>
<P><H3><FONT COLOR="#CC3333">Examples</FONT></H3>
<A HREF="../../../src/ts/examples/tutorials/ex1.c.html">src/ts/examples/tutorials/ex1.c.html</A><BR>
<A HREF="../../../src/ts/examples/tutorials/ex24.c.html">src/ts/examples/tutorials/ex24.c.html</A><BR>
<A HREF="../../../src/ts/examples/tutorials/ex1f.F.html">src/ts/examples/tutorials/ex1f.F.html</A><BR>
</BODY></HTML>
|
