Analysis of the accuracy and convergence of equation-free projection to a slow manifold
Antonios Zagaris; C. William Gear; Tasso J. Kaper; Yannis G. Kevrekidis
ESAIM: Mathematical Modelling and Numerical Analysis (2009)
- Volume: 43, Issue: 4, page 757-784
- ISSN: 0764-583X
Access Full Article
top
Abstract
topHow to cite
topZagaris, Antonios, et al. "Analysis of the accuracy and convergence of equation-free projection to a slow manifold." ESAIM: Mathematical Modelling and Numerical Analysis 43.4 (2009): 757-784. <http://eudml.org/doc/250588>.
@article{Zagaris2009,
abstract = {
In [C.W. Gear, T.J. Kaper, I.G. Kevrekidis and A. Zagaris,
SIAM J. Appl. Dyn. Syst. 4 (2005) 711–732],
we developed
a class of iterative algorithms
within the context
of equation-free methods
to approximate
low-dimensional,
attracting,
slow manifolds
in systems
of differential equations
with multiple time scales.
For user-specified values
of a finite number
of the observables,
the mth member
of the class
of algorithms
($m = 0, 1, \ldots$)
finds iteratively
an approximation
of the appropriate zero
of the (m+1)st time derivative
of the remaining variables
and
uses this root
to approximate the location
of the point
on the slow manifold
corresponding to these values
of the observables.
This article
is the first
of two articles
in which
the accuracy and convergence
of the iterative algorithms
are analyzed.
Here,
we work directly
with fast-slow systems,
in which there is
an explicit small parameter, ε,
measuring the separation
of time scales.
We show that,
for each
$m = 0, 1, \ldots$,
the fixed point
of the iterative algorithm
approximates the slow manifold
up to and including
terms of $\{\mathcal O\}(\varepsilon^m)$.
Moreover,
for each m,
we identify explicitly
the conditions
under which
the mth iterative algorithm
converges to this fixed point.
Finally,
we show that
when
the iteration
is unstable
(or
converges slowly)
it may be stabilized
(or
its convergence
may be accelerated)
by application
of the Recursive Projection Method.
Alternatively,
the Newton-Krylov
Generalized Minimal Residual Method
may be used.
In the subsequent article,
we will consider
the accuracy and convergence
of the iterative algorithms
for a broader class
of systems – in which
there need not be
an explicit
small parameter – to which
the algorithms also apply.
},
author = {Zagaris, Antonios, Gear, C. William, Kaper, Tasso J., Kevrekidis, Yannis G.},
journal = {ESAIM: Mathematical Modelling and Numerical Analysis},
keywords = {Iterative initialization;
DAEs;
singular perturbations;
legacy codes;
inertial manifolds.; iterative initialization; daes; legacy codes; recursive projection method; Newton-Krylov generalized minimal residual method},
language = {eng},
month = {7},
number = {4},
pages = {757-784},
publisher = {EDP Sciences},
title = {Analysis of the accuracy and convergence of equation-free projection to a slow manifold},
url = {http://eudml.org/doc/250588},
volume = {43},
year = {2009},
}
TY - JOUR
AU - Zagaris, Antonios
AU - Gear, C. William
AU - Kaper, Tasso J.
AU - Kevrekidis, Yannis G.
TI - Analysis of the accuracy and convergence of equation-free projection to a slow manifold
JO - ESAIM: Mathematical Modelling and Numerical Analysis
DA - 2009/7//
PB - EDP Sciences
VL - 43
IS - 4
SP - 757
EP - 784
AB -
In [C.W. Gear, T.J. Kaper, I.G. Kevrekidis and A. Zagaris,
SIAM J. Appl. Dyn. Syst. 4 (2005) 711–732],
we developed
a class of iterative algorithms
within the context
of equation-free methods
to approximate
low-dimensional,
attracting,
slow manifolds
in systems
of differential equations
with multiple time scales.
For user-specified values
of a finite number
of the observables,
the mth member
of the class
of algorithms
($m = 0, 1, \ldots$)
finds iteratively
an approximation
of the appropriate zero
of the (m+1)st time derivative
of the remaining variables
and
uses this root
to approximate the location
of the point
on the slow manifold
corresponding to these values
of the observables.
This article
is the first
of two articles
in which
the accuracy and convergence
of the iterative algorithms
are analyzed.
Here,
we work directly
with fast-slow systems,
in which there is
an explicit small parameter, ε,
measuring the separation
of time scales.
We show that,
for each
$m = 0, 1, \ldots$,
the fixed point
of the iterative algorithm
approximates the slow manifold
up to and including
terms of ${\mathcal O}(\varepsilon^m)$.
Moreover,
for each m,
we identify explicitly
the conditions
under which
the mth iterative algorithm
converges to this fixed point.
Finally,
we show that
when
the iteration
is unstable
(or
converges slowly)
it may be stabilized
(or
its convergence
may be accelerated)
by application
of the Recursive Projection Method.
Alternatively,
the Newton-Krylov
Generalized Minimal Residual Method
may be used.
In the subsequent article,
we will consider
the accuracy and convergence
of the iterative algorithms
for a broader class
of systems – in which
there need not be
an explicit
small parameter – to which
the algorithms also apply.
LA - eng
KW - Iterative initialization;
DAEs;
singular perturbations;
legacy codes;
inertial manifolds.; iterative initialization; daes; legacy codes; recursive projection method; Newton-Krylov generalized minimal residual method
UR - http://eudml.org/doc/250588
ER -
References
top- G. Browning and H.-O. Kreiss, Problems with different time scales for nonlinear partial differential equations. SIAM J. Appl. Math.42 (1982) 704–718.
- J. Carr, Applications of Centre Manifold Theory, Applied Mathematical Sciences35. Springer-Verlag, New York (1981).
- J. Curry, S.E. Haupt and M.E. Limber, Low-order modeling, initializations, and the slow manifold. Tellus47A (1995) 145–161.
- N. Fenichel, Geometric singular perturbation theory for ordinary differential equations. J. Diff. Eq.31 (1979) 53–98.
- C.W. Gear and I.G. Kevrekidis, Constraint-defined manifolds: a legacy-code approach to low-dimensional computation. J. Sci. Comp.25 (2005) 17–28.
- C.W. Gear, T.J. Kaper, I.G. Kevrekidis and A. Zagaris, Projecting to a slow manifold: singularly perturbed systems and legacy codes. SIAM J. Appl. Dyn. Syst.4 (2005) 711–732.
- S.S. Girimaji, Reduction of large dynamical systems by minimization of evolution rate. Phys. Rev. Lett.82 (1999) 2282–2285.
- C.K.R.T. Jones, Geometric singular perturbation theory, in Dynamical Systems, Montecatini Terme, L. Arnold Ed., Lecture Notes Math.1609, Springer-Verlag, Berlin (1994) 44–118.
- H.G. Kaper and T.J. Kaper, Asymptotic analysis of two reduction methods for systems of chemical reactions. Physica D165 (2002) 66–93.
- C.T. Kelley, Iterative Methods for Linear and Nonlinear Equations, Frontiers In Applied Mathematics16. SIAM Publications, Philadelphia (1995).
- I.G. Kevrekidis, C.W. Gear, J.M. Hyman, P.G. Kevrekidis, O. Runborg and C. Theodoropoulos, Equation-free, coarse-grained multiscale computation: enabling microscopic simulators to perform system-level analysis. Commun. Math. Sci.1 (2003) 715–762.
- H.-O. Kreiss, Problems with different time scales for ordinary differential equations. SIAM J. Numer. Anal.16 (1979) 980–998.
- H.-O. Kreiss, Problems with Different Time Scales, in Multiple Time Scales, J.H. Brackbill and B.I. Cohen Eds., Academic Press (1985) 29–57.
- E.N. Lorenz, Attractor sets and quasi-geostrophic equilibrium. J. Atmos. Sci.37 (1980) 1685–1699.
- U. Maas and S.B. Pope, Simplifying chemical kinetics: intrinsic low-dimensional manifolds in composition space. Combust. Flame88 (1992) 239–264.
- P.J. Olver, Applications of Lie Groups to Differential Equations, Graduate Texts in Mathematics107. Springer-Verlag, New York (1986).
- G.M. Shroff and H.B. Keller, Stabilization of unstable procedures: A recursive projection method. SIAM J. Numer. Anal.30 (1993) 1099–1120.
- P. van Leemput, W. Vanroose and D. Roose, Initialization of a Lattice Boltzmann Model with Constrained Runs. Report TW444, Catholic University of Leuven, Belgium (2005).
- P. van Leemput, C. Vandekerckhove, W. Vanroose and D. Roose, Accuracy of hybrid Lattice Boltzmann/Finite Difference schemes for reaction-diffusion systems. Multiscale Model. Sim.6 (2007) 838–857.
- A. Zagaris, H.G. Kaper and T.J. Kaper, Analysis of the Computational Singular Perturbation reduction method for chemical kinetics. J. Nonlin. Sci.14 (2004) 59–91.
- A. Zagaris, H.G. Kaper and T.J. Kaper, Fast and slow dynamics for the Computational Singular Perturbation method. Multiscale Model. Sim.2 (2004) 613–638.
- A. Zagaris, C. Vandekerckhove, C.W. Gear, T.J. Kaper and I.G. Kevrekidis, Stability and stabilization of the constrained runs schemes for equation-free projection to a slow manifold. Numer. Math. (submitted).
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.