TSPSEUDO#

Solve steady state ODE and DAE problems with pseudo time stepping [CKK02] [KK98] This method solves equations of the form

\[ F(X,Xdot) = 0 \]

for steady state using the iteration

\[ [G'] S = -F(X,0) X += S \]

where

\[ G(Y) = F(Y,(Y-X)/dt) \]

This is linearly-implicit Euler with the residual always evaluated “at steady state”. See note below.

Options Database Keys#

-ts_pseudo_increment - ratio of increase dt
-ts_pseudo_increment_dt_from_initial_dt - Increase dt as a ratio from original dt
-ts_pseudo_fatol - stop iterating when the function norm is less than atol
-ts_pseudo_frtol - stop iterating when the function norm divided by the initial function norm is less than rtol

Notes#

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

\[ Xdot = (Xpredicted - Xold)/dt = (Xold-Xold)/dt = 0 \]

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.

References#

CKK02: Todd S. Coffey, C. T. Kelley, and David E. Keyes. Pseudo-transient continuation and differential-algebraic equations. Technical Report, ODU, 2002. Submitted to the special issue of the SIAM Journal of Scientific Computing dedicated to papers from the 2002 Copper Mountain Conference on Iterative Methods. URL: http://www.math.odu.edu/\~{ }keyes.
KK98: Carl T. Kelley and David E. Keyes. Convergence analysis of pseudo-transient continuation. SIAM J. Numerical Analysis, 35:508–523, 1998.

Level#

beginner

Location#

src/ts/impls/pseudo/posindep.c

Index of all TS routines
Table of Contents for all manual pages
Index of all manual pages