Equation-free modeling
Yannis Kevrekidis and Giovanni Samaey (2010), Scholarpedia, 5(9):4847. | doi:10.4249/scholarpedia.4847 | revision #137023 [link to/cite this article] |
Equation-free modeling is a collective term referring to a paradigm for multiscale computation and computer-aided analysis. It is designed for a class of complex/multiscale problems in which one observes evolution at a macroscopic, coarse scale of interest, while accurate models are only given at a more detailed (fine-scale, microscopic, possibly atomistic) level of description. The framework enables one to perform macroscopic computational tasks (over extended spatiotemporal scales) using only appropriately initialized microscopic simulation on short time and length scales. The methodology bypasses the derivation of explicit macroscopic evolution equations when these equations conceptually exist but are not available in closed form – hence the term equation-free.
Contents |
Introduction
In a wide range of chemical, physical and biological systems, macroscopic, coherent behavior emerges from interactions between microscopic entities (molecules, cells, individuals in a population) among themselves and with their environment. Sometimes, remarkably, a coarse-scale model (such as the Navier-Stokes equations for fluid flow, or a reaction-diffusion system) can accurately describe behavior at this level, making use of general principles of conservation (species, mass, momentum, energy) closed through phenomenological constitutive equations (reaction rates as functions of concentrations, viscous stresses as functionals of velocity gradients). However, one increasingly encounters complex systems that can only be modeled with sufficient accuracy at a microscopic, fine scale. In such cases, although one observes the emergence of coarse-scale, macroscopic behavior in practice, modeling it through explicit closure relations may be impossible or impractical without simplifying assumptions that are hard to justify. Non-Newtonian fluid flow, chemotaxis, porous media transport, and neuronal systems are but a few typical examples in which there is a trend of moving away from empirical closures towards more fine-scale models.
Performing coarse-scale computational tasks with fine-scale models is often infeasible: direct simulation over the full spatiotemporal domain of interest can be computationally prohibitive. Moreover, additional modeling tasks, such as numerical bifurcation analysis, are often impossible to perform on the fine-scale model directly: a coarse steady state may not imply a steady state for the fine-scale system, since (for instance) individual molecules do not stop moving when the gas density or pressure become stationary.
The goal of equation-free modeling is to circumvent the explicit derivation of coarse equations by using short bursts of appropriately initialized fine-scale simulation. Thus, a (deterministic or stochastic) fine-scale model \(f\) and an associated time-stepper \(s\) with time step \(\textrm{d} t\ ,\)
\[\tag{1} \partial_t u = f(u), \qquad u(t+\textrm{d} t)= s(u(t),\textrm{d} t), \]
are given in terms of fine-scale variables \(u(t)\ ,\) while a coarse model \(F\) and its associated time-stepper \(S\) with time-step \(\delta t\ ,\)
\[\tag{2} \partial_t U = F(U), \qquad U(t+\delta t)=S(U,\delta t), \]
in terms of some (known) coarse variables are assumed to exist, but are unavailable in closed form. The article mainly treats the case when this coarse-scale model is deterministic. Some comments on stochastic models at the coarse scale are given towards the end.
The idea was first introduced in (Theodoropoulos et al, 2000) and (Gear et al., 2002); see (Kevrekidis et al., 2003) for an early review. A more recent review, on which this entry is based, is (Kevrekidis and Samaey, 2009). The reviews also contain ample references on how the equation-free framework relates to, and borrows ideas from, a long history of (computational) multiscale approaches. (See also "Further reading" for a limited list of references).
The coarse time-stepper
A key tool is the coarse time-stepper: a short computational experiment with the fine-scale simulator. Given an initial condition for the coarse variables \(U(t^*)\) at \(t^*\ ,\) the coarse time-stepper involves:
- Lifting. Create fine-scale initial conditions \(u(t^*)\ ,\) consistent with \(U(t^*)\ ;\)
- Simulation. Use the fine-scale simulator (1) to compute the fine-scale state \(u(t)\) at \(t \in [t^*,t^*+\delta t]\ ;\)
- Restriction. Obtain the coarse state \(U(t^*+\delta t)\) from the fine-scale state \(u(t)\ .\)
This can be written as
\[\tag{3} \bar{U}(t+\delta t)=\bar{S}(\bar{U}(t),\delta t)\equiv\mathcal{M}(s^k(\mu(\bar{U}(t)),\textrm{d} t)), \]
where the superscript on \(s\) denotes the \(k\) fine-scale time steps \(\textrm{d} t\ ,\) such that \(\delta t = k \textrm{d} t\ ,\) \(\mu\) is the lifting operator, \(\mathcal{M}\) is the restriction operator, and the overbars are introduced to emphasize that these are (time-discrete) approximations. If the fine-scale model is stochastic, multiple replica simulations, using an ensemble of fine-scale initial conditions, may be needed to obtain sufficiently low-variance results.
Once a coarse time-stepper is available, a direct bridge can be built between fine-scale simulation and algorithms of traditional continuum numerical analysis, such as numerical bifurcation analysis, optimization, control, and even accelerated coarse-scale simulation. Traditionally, a coarse-level solver (here called outer solver) obtains the numerical quantities it requires for computation (time derivatives, the action of Jacobians) using explicit formulae from the coarse model. In our approach, the outer solver designs, executes, and processes the results of computational experiments with an inner fine-scale simulator, in effect performing a closure on demand. The analogy with matrix-free numerical linear algebra (Kelley, 1995) provides another reason for the name equation-free; it emphasizes that the coarse-level equations are never constructed explicitly in closed form.
Restriction
The restriction operator can often be determined as soon as the coarse variables are chosen. For instance, when the fine-scale model evolves an ensemble of many particles, the restriction typically computes the first few moments of the particle distribution (density, momentum, energy), which can be represented by evaluation on a coarse grid, in a finite element or spectral basis, or even using empirical basis functions (EOFs, KL or POD modes).
Lifting
The construction of the lifting operator is usually much more involved. Again considering a particle model example, we need to define a mapping from a few low order moments of the particle distribution to initial conditions for each particle. The assumption that an equation exists that closes at the level of these low order moments, implies that higher order moments become functionals of (slaved to) the low order ones on time scales that are fast compared to the overall system evolution. (If this were not true, a description in terms of the chosen low order moments would contain memory terms, as can be seen from the Mori-Zwanzig formalism (Mori, 1965) and (Zwanzig, 1973).) The same principle also underpins quasi-steady state approximations. Unfortunately, the slaving relations (closures) are unknown (otherwise the coarse evolution law would be explicitly known).
Initializing the unknown degrees of freedom randomly introduces a lifting error, and one then relies on separation of time scales to ensure their quick relaxation to functionals of the coarse observables (healing). A preparatory step, possibly involving fine-scale simulations constrained to keep the coarse observables fixed, may be required, e.g. (Ryckaert et al., 1977). When the system has a unique fixed point for the unknown degrees of freedom conditioned upon the coarse observables, it is possible to construct a constrained runs algorithm to perform this preparatory step using only the fine-scale time-stepper, see e.g. (Gear et al.,2005).
An illustrative example
The basic concepts are most easily illustrated on a toy problem: a singularly perturbed system of ordinary differential equations. Consider for example
\[\tag{4} \begin{cases} \dfrac{du_1}{dt} = -u_1-u_2+2, \\ \dfrac{du_2}{dt} = \dfrac{1}{\varepsilon}(u_1^3-u_2). \end{cases} \]
as the fine-scale equation. As the coarse variable, we consider \(U=\mathcal{M}(u_1,u_2)=u_1\ ,\) implying that we assume a coarse model of the form \(\dot{U}=G(U)\) to exist. We define the lifting as \(u=\mu(U) = (U,1)\ .\) A simulation using the coarse time-stepper is shown in Figure 2.
The solution of equation (4) rapidly moves to the slow manifold \(u_2=u_1^3\) for any initial data when \(\varepsilon\ll 1\ .\) The coarse time-stepper solution agrees better with the full solution (actually, its restriction) when \(\varepsilon\) is decreased (for fixed \(\delta t\)). The left figure shows the lifted solution (blue solid line) \(u(n\delta t +s)\ ,\) \(s\in [0,\delta t]\ ,\) plotted in the \((u_1,u_2)\) phase space. At times \(t=n{\delta t}\ ,\) the solution is restricted and then lifted again, which here amounts to setting \(u_2(n\delta t)=1\ .\) The slow manifold is shown as a dashed red line. The right figure shows the time derivative of the restricted solution \(\mathcal{M}(u(n\delta t+s))\) as a function of time \(t=n\delta t+s\) (blue solid line), as well as the time derivative of \(u_1\) (the coarse time derivative), as observed from a full simulation of (4). (red dashed line).
On application to concrete multiscale problems
The approach has been applied to many concrete examples that illustrate how the algorithmic building blocks can be constructed and assembled. Moreover, some numerical analysis has been performed that discusses accuracy and efficiency of these methods. Extensive additional numerical analysis results on methods of this type can be found in the literature on heterogeneous multiscale methods (E and Engquist, 2003).
However, applying the equation-free paradigm to a concrete problem requires considerable care in the selection of all building blocks. One should judiciously define lifting and restriction operators, as well as the appropriate outer solver. Several remarks are in order:
- One has to know which coarse observables appear in the unavailable coarse equation, or, equivalently, from which coarse observables the unknown fine-scale degrees of freedom can be reliably reconstructed (lifted). If physical arguments are not sufficient to obtain these coarse observables, one might use modern data-mining/manifold learning techniques, such as Isomap or diffusion maps (Coifman et al., 2005) to obtain the coarse variables themselves from fine-scale simulation.
- For the methodology to be effective, there should be a clear separation between the time-scales at which the coarse observables evolve and the time-scales at which the remaining degrees of freedom equilibrate with respect to these observables.
- If one has knowledge on the dependence of the unknown fine-scale degrees of freedom on the coarse observables, this can and should be included when designing a lifting procedure.
- To decide on an appropriate coarse-scale solver (see later), knowing the coarse observables might not be sufficient, and one might need more information on the nature of the coarse model, such as the order or character (parabolic, hyperbolic) of a postulated unavailable partial differential equation. A strategy to obtain such information, also using only appropriately initialized simulations with the fine-scale model, is the baby-bathwater scheme (Li et al., 2003).
Coarse bifurcation analysis
Inspired by the recursive projection method (RPM) (Schroff and Keller, 1993), a computational superstructure (wrapper) that enables the computation of bifurcation diagrams using a legacy simulation code, the coarse time-stepper was first used to perform equation-free bifurcation computations. Consider the coarse equation, and its coarse time-stepper \[\tag{5} \partial_t U=F(U,\lambda), \qquad \bar{U}^{n+1}=\bar{S}(\bar{U}^n,\lambda;\Delta t), \]
which now include explicit dependence on one or more parameters \(\lambda\ ,\) and suppose one wants to compute asymptotic solutions (steady states, periodic orbits), their stability and dependence on \(\lambda\ .\)
A coarse steady state can be computed as a fixed point of the coarse time-stepper, \[\tag{6} \bar{G}(\bar{U},\lambda;\Delta t)=\bar{U}-\bar{S}(\bar{U},\lambda;\Delta t)=0. \]
RPM combines Newton-Raphson iterations in a low-dimensional slow subspace with Picard iterations in its orthogonal complement.
In the equation-free context, RPM is the outer solver; the coarse time-stepper enables the RPM computation to be performed using a fine-scale inner solver.
The coarse time-stepper immediately enables continuation/bifurcation
computations at the coarse level, even when parameters of
the fine-scale model are varied, whose influence on the coarse level is
difficult to assess directly. The procedure is illustrated in
Figure 1.
Additionally, for problems with continuous symmetries, one can use a template-based approach (Rowley and Marsden, 2000) to compute coarse self-similar solutions, such as traveling waves/exploding solutions, as fixed points of a coarse time-stepper that incorporates an appropriate shifting/rescaling of space, time and/or the solution. Coarse traveling speeds/similarity exponents are a byproduct of the procedure upon convergence. An illustrative example of outer coarse self-similar diffusion dynamics based on inner molecular dynamics (MD) (Chen et al., 2004), is depicted in Figure 3.
A schematic representation is given on the left. Starting with a probability density function (PDF) coarse description, through its cumulative density function (CDF), we lift to particle realizations. After fine-scale evolution using MD, the coarse description (particle density) is obtained and appropriately rescaled. Simulation results for an example of self-diffusion are given on the right. The inset (top) shows a snapshot around the center of the domain at \(t=300\ ,\) and the result of its restriction, rescaling and lifting (bottom).
As alternative to RPM, one can also use a Newton-Krylov method. One can estimate matrix-vector products with the Jacobian as \[\left(I-\bar{S}_U(\bar{U},\Delta t)\right)v\approx v - \frac{\bar{S}(\bar{U}+\epsilon v,\Delta t) -\bar{S}(\bar{U},\Delta t)}{\epsilon}, \] at a cost much lower than the construction of the full Jacobian, and then solve the linear systems arising in each Newton iteration using a Krylov method (Kelley, 1995). Iterative linear algebra algorithms, in their matrix-free form, are remarkably naturally suited for the equation-free framework. However, to limit the number of Krylov iterations, one needs to pay attention to appropriate preconditioning, for instance using an approximate coarse-scale model (the equation-assisted approach).
Coarse projective integration
The coarse time-stepper can also be used to accelerate the simulation of equation (2) over large (macroscopic) time intervals. Let \(\Delta t\gg \delta t\) be a large time step (commensurate with the slow coarse dynamics). Denote by \(\bar{U}^n\approx \bar{U}(n\Delta t)\) the numerical approximation of the coarse solution \(U(t)\) and by \(\bar{U}^{k,n}\) the iterates of the coarse time-stepper at \(t_{k,n}=n\Delta t+k\delta t\) (\(\bar{U}^{0,n}\equiv\bar{U}^n\)). (A slight abuse of notation: it is only necessary to lift the coarse solution for \(k=0\ ,\) since the corresponding fine-scale state for \(k>0\) is seamlessly available inside the coarse time-stepper.) One can then approximate \(\bar{U}^{n+1}\) via extrapolation, for instance, \[\tag{7} \bar{U}^{n+1} = \bar{U}^{k,n} + (\Delta t-k\delta t)\bar{F}(U^{k,n}). \]
Here \(\bar{F}\) approximates \(F\ ,\) e.g. via finite differencing \[\tag{8} \bar{F}(\bar{U}^{k,n}) := \frac{\bar{U}^{k+1,n} - U^{k,n}}{\delta t} \approx \frac{d\bar{U}(t_{k,n})}{dt} = F\left(\bar{U}(t_{k,n})\right) \approx F\left(\bar{U}^{k,n}\right). \]
The equation-free algorithm in (7) and (8) is called coarse projective forward Euler, and it is the simplest instantiation of this class of coarse integration methods. The procedure is illustrated inFigure 4 for the example (4).
On the right the results are shown for coarse projective integration with \(\Delta t = 4 \delta t\ .\) Intervals of full simulation are in blue. Magenta dotted lines represent projections in time, and the red dashed line is the full fine-scale simulation. A phase space view is seen on the left. Note that, while \(u_1\) is projected in time corresponding to the estimated time derivative, \(u_2\) is reset during the lifting, so that the new initial condition is off the slow manifold.
The first \(k\) steps with the coarse time-stepper serve two purposes. First, they reflect that, at the fine scale, we must allow for healing of the lifting errors (that perturb the fine-scale higher order moments) before we can start estimating coarse time derivatives. Second, in (7), extrapolation is performed starting from \(\bar{U}^{k,n}\ .\) This is particularly useful if the coarse equation contains both fast and slow modes; in that case, if the number \(k\) of inner steps is chosen large enough, the size of the projective step is practically limited by stability restrictions on the slow modes only (Gear and Kevrekidis, 2003).
Higher order versions of (7) can be constructed in several ways. A straightforward idea is to use polynomial extrapolation (Gear et al., 2002), resembling a Taylor method. Implementations of coarse projective integration using Adams-Bashforth or Runge-Kutta as the outer solver are also possible, as are implicit versions, partially discussed in (Gear et al., 2002).
Projective integration is especially suited for problems with a large gap in their eigenvalue spectrum. However, extensions to deal with parabolic problems, have been proposed with properties similar to Runge-Kutta-Chebychev methods. Telescopic projective integration (Gear and Kevrekidis, 2003) is a recursive version of the method: the coarse projective integrator (7) itself is now considered as the inner integrator, around which a new projective integrator is wrapped. Another idea is to design a multistep state extrapolation method using the last points of a number of sequences of inner steps (Vandekerckhove et al., 2007).
Patch dynamics
In coarse projective integration, short time simulations by the fine-scale inner solver are used to explore long-time intervals at the coarse level. By analogy, spatially localized simulations performed in a number of small domains (teeth) separated by gaps, can be appropriately linked through spatial interpolation to enable the exploration of spatially extended systems at the coarse level.
A discussion of the resulting gap-tooth scheme can be found in (Kevrekidis et al., 2003), (Samaey et al., 2005),(Roberts and Kevrekidis, 2004); the combination of gap-tooth with coarse integration is called patch dynamics.
For simplicity, consider the unavailable coarse model (2) to be a partial differential equation (PDE) in one space dimension \[\tag{9} \partial_t U(x,t) = F\left(U(x,t),\partial_x U(x,t),\ldots,\partial_x^d U(x,t)\right)=F(U), \]
where \(\partial_x^k\) denotes the k-th spatial derivative and the order \(d\) of (9) is known.
Given equation (9), its finite difference method-of-lines discretization on a regular mesh can be written as \[\tag{10} \partial_t U_i(t) = F(U_i(t),D^1(U_i(t)),\ldots, D^d(U_i(t))), \qquad i = 0, \ldots, N, \]
where \(U_i(t)\approx U(x_i,t)\ ,\) \(x_i\in\Pi(\Delta x):=\{0=x_0<x_1=x_0+\Delta x<\ldots<x_N=1\}\ ,\) and \(D^k(U_i(t))\) denotes a suitable finite difference approximation for the k-th spatial derivative.
Patch dynamics can be seen as a time discretization of the scheme (10), a viewpoint that facilitates the use of numerical analysis results obtained in the literature of the heterogeneous multiscale methods (E and Engquist, 2003). Whenever the time derivative \(F(U)\) is required, it is estimated by defining a small interval (box, tooth) of size \(h \ll \Delta x\) around each (coarse) mesh point \(x_i\ ,\) and defining the discrete solution \(\bar{U}^n=(\bar{U}_0(t_n),\ldots, \bar{U}_N(t_n)) \in \mathbb{R}^{N+1}\) as the spatially averaged restriction of the fine-scale solution in each small interval.
Given an initial condition \(\bar{U}^n\ ,\) \(F(\bar{U}^n)\) is estimated as follows:
- Lifting. Create initial conditions \(\bar{u}_i(t_n)\) for the fine-scale model in each small box around the mesh point \(x_i\ ,\) consistent with the spatial profile of the coarse solution.
- Simulation. Compute the fine-scale state \(\bar{u}_i(t_n)\) in each box for \(t \in [t^n,t^n+\delta t]\) using appropriate boundary conditions.
- Restriction. Obtain the spatially averaged coarse state \(\bar{U}_i^{n+\delta}\) in each box from the fine-scale state \(\bar{u}_it)\ .\)
- Estimation. Estimate the time derivative, e.g. as
\[ \bar{F}(\bar{U}^n;h,\delta t)=\frac{\bar{U}_i^{n+\delta}-\bar{U}^n}{\delta t} \]
Lifting
Initial conditions in each box result from a local Taylor expansion, with spatial derivatives approximated via finite differences on the coarse grid, using the (given) box averages \(\bar{U}_i^n\ ,\) \(i=0,\ldots,N\ ,\) at mesh point \(x_i\) and time \(t_n\ ,\) \[\tag{11} \tilde{U}^i(x,t_n)= \sum_{k}D^k_i(\bar{U}^n)\frac{(x-x_i)^k}{k!}, \]
in which the sum includes at least terms up to the order \(d\) of the coarse equation. The coefficients \(D^k_i(\bar{U}^n)\ ,\) \(k>0\) are the same finite difference approximations for the k-th spatial derivative that would be used in the method-of-lines discretization (10), whereas \(D_i^0(\bar{U}^n)\) is chosen such that \[\frac{1}{h}\int_{x_i-h/2}^{x_i+h/2} \tilde{U}^i(\xi,t_n)d\xi=\bar{U}_i^n. \] Clearly, one must have information about the nature of the coarse equation; e.g. if the behavior on the coarse scale is advection-dominated, one should use upwind approximations for \(D^1\ .\)
Lifting now becomes more involved because, in addition to the average value of the coarse unknowns in the box, some approximation of the spatial derivatives of the coarse solution is also needed to correctly capture the dynamics of (9). For noninteracting particles, one could generate initial particle positions via the inverse cumulative distribution function.
Boundary conditions
An additional (and crucial!) difficulty is the imposition of boundary conditions on each small box, since each box is supposed to mimic local evolution of the fine-scale problem as if it were embedded in a larger domain. Indeed, patch dynamics can be thought of as a hybrid algorithm (Wijesinghe and Hadjiconstantinou, 2004): each box thinks it evolves linked to a continuum description, yet this description is obtained by interpolation based on nearby boxes. Several strategies have been proposed.
- One could impose boundary conditions that approximate the behavior of the macroscopic solution in the larger domain; for diffusion problems, based on physical considerations, one achieves this by constraining the macroscopic gradients at the box edges (Kevrekidis et al., 2003), (Samaey et al., 2005). Such boundary conditions, however, may not always be available/feasible for a given fine-scale simulator. A control-based strategy to impose coarse boundary conditions on a fine-scale simulator, is given in (Li et al., 1998).
- Another idea is to introduce buffer regions of size \(H\ ;\) for short enough simulation and large enough \(H\ ,\) the artifacts due to essentially arbitrary boundary conditions at the buffer boundaries may not affect the fine-scale simulation in the inner, \(h\)-sized region of interest. For diffusion problems \(H=O(\sqrt{\delta t})\ ,\) and for advection-dominated problems \(H=O(\delta t)\) needs to be chosen.
- Based on holistic discretizations, a third approach was proposed that retains the possibility of imposing standard patch boundary conditions while avoiding buffer regions (Roberts and Kevrekidis, 2006). This is achieved by updating the boundary conditions for each patch after every fine-scale time step; the values for these boundary conditions are obtained via center manifold theory.
Open problems and future directions
- The choice of outer numerical algorithms is crucially affected by a number of qualitative features of the unavailable coarse equation. It is, for instance, important to assess
- the appropriate level at which a coarse equation can usefully close,
- the type of coarse equation (a partial differential equation (of what order?), an integrodifferential equation, a stochastic PDE, ...).
- the presence of special structure (scale or translational symmetry, conserved quantities, Hamiltonian structure).
- These questions can often be answered by inspection if the coarse equation is explicitly available. In the equation-free framework, tools for answering these questions (testing these hypotheses) based on fine-scale simulation results should be systematically developed.
- For many well-studied problems, appropriate coarse variables are known by experience and long experimentation, physical intuition, or rigorous mathematical derivation. There is, however, an increasing need to automatically extract such variables from available observations/computations. Here a crucial link to modern data-mining/manifold learning techniques must be developed, and one needs to systematically study the design of computational experiments for the extraction of appropriate coarse variables (observables), as well as the implementation of accompanying lifting/restriction procedures.
- Noise is often inherent in the nature of the fine and/or coarse models in equation-free algorithms, whose formulation and analysis may be crucially affected by its treatment. Important issues include (but are not limited to) the robustness of traditional outer algorithms to inner simulator noise, variance reduction for the local estimation of coarse quantities, and the identification of effective stochastic models (Givon et al., 2005). Hypothesis testing for the appropriate closure level or the nature of the unavailable equations (Li et al., 2003) also has a strong stochastic component.
- In effect, the equation-free framework leads to protocols for the design of computational experiments with fine scale solvers. It is interesting to consider physical systems in which enough spatiotemporally resolved sensing and actuation authority exists to enable initializing laboratory experiments at will. In such a context, one may envisage performing computer-assisted mathematical tasks directly on laboratory experiments through the same protocols used today to perform these tasks on mathematical models.
References
- Theodoropoulos, C.; Qian, Y.H. and Kevrekidis, I.G. (2000). Coarse stability and bifurcation analysis using time-steppers: a reaction-diffusion example Proc. Natl. Acad. Sci. 97: 9840-9845. doi:10.1073/pnas.97.18.9840.
- Gear, C.W.; Kevrekidis, I.G. and Theodoropoulos, C. (2002). Coarse integration/bifurcation analysis via microscopic simulators: micro-Galerkin methods Computers and Chemical Engineering 26: 941-963. doi:10.1016/s0098-1354(02)00020-0.
- Kevrekidis, I.G. et al. (2003). Equation-free, coarse-grained multiscale computation: enabling microscopic simulators to perform system-level tasks Comm. Math. Sciences 1(4): 715-762. doi:10.4310/cms.2003.v1.n4.a5.
- Kevrekidis, I.G. and Samaey, G. (2009). Equation-free multiscale computation: algorithms and applications Annual Review in Physical Chemistry 60: 321-344. doi:10.1146/annurev.physchem.59.032607.093610.
- Kelley, C.T. (1995). Iterative Methods for linear and nonlinear equations SIAM, Philadelphia.
- Mori, H. (1965). Transport, collective motion and Brownian motion Prog. Theor. Physics 33: 423-450. doi:10.1143/ptp.33.423.
- Zwanzig, R. (1973). Nonlinear generalized Langevin equations Journal of Statistical Physics 9: 215-220. doi:10.1007/bf01008729.
- Ryckaert, J.P.; Ciccotti, G. and Berendsen, H. (1977). Numerical integration of the Cartesian equation of motion of a system with constraints: molecular dynamics of N-alkanes J. Comp. Phys. 23: 237. doi:10.1016/0021-9991(77)90098-5.
- Gear, C.W.; Kaper, T.J.; Kevrekidis, I.G. and Zagaris, A. (2005). Projecting to a Slow Manifold: Singularly Perturbed Systems and Legacy Codes SIAM Journal on Applied Dynamical Systems 4(3): 711-732. doi:10.1137/040608295.
- E, W. and Engquist, B. (2003). The heterogeneous multiscale methods Comm. Math. Sciences 1(1): 87-132. doi:10.4310/cms.2003.v1.n1.a8.
- Coifman, R.R. et al. (2005). Geometric diffusions as a tool for harmonic analysis and structure definition of data: Diffusion maps Proceedings of the National Academy of Sciences 102(21): 7426-7431. doi:10.1073/pnas.0500334102.
- Li, J.; Kevrekidis, P.G.; Gear, C.W. and Kevrekidis, I.G. (2003). Deciding the nature of the coarse equation through microscopic simulations: the baby-bathwater scheme SIAM Multiscale Modeling and Simulation 1(3): 391-407. doi:10.1137/s1540345902419161.
- Schroff, G.M. and Keller, H.B. (1993). Stabilization of unstable procedures: the recursive projection method SIAM Journal on Numerical Analysis 30: 1099-1120. doi:10.1137/0730057.
- Rowley, C. and Marsden, J. (2000). Reconstruction equations and the Karhunen-Loeve expansion for systems with symmetry Physica D: Nonlinear Phenomena 142: 1-19.
- Chen, L.; Debenedetti, P.; Gear, C.W. and Kevrekidis, I.G. (2004). From molecular dynamics to coarse self-similar solutions: a simple example using equation-free computation Journal of Non-Newtonian Fluid Mechanics 120: 215-223.
- Gear, C.W. and Kevrekidis, I.G. (2003). Projective methods for stiff differential equations: problems with gaps in their eigenvalue spectrum SIAM Journal on Scientific Computing 24(4): 1091-1106. doi:10.1137/s1064827501388157.
- Gear, C.W. and Kevrekidis, I.G. (2003). Telescopic projective methods for parabolic differential equations Journal of Computational Physics 187: 95-109.
- Vandekerckhove, C.; Roose, D. and Lust, K. (2007). Numerical stability analysis of an acceleration scheme for step size constrained time integrators J. Comput. Appl. Math. 200: 761-777.
- Samaey, G.; Roose, D. and Kevrekidis, I.G. (2005). The gap-tooth scheme for homogenization problems SIAM Multiscale Modeling and Simulation 4: 278-306. doi:10.1137/030602046.
- Samaey, G.; Kevrekidis, I.G. and Roose, D. (2006). Patch dynamics with buffers for homogenization problems Journal of Computational Physics 213(1): 264-287. doi:10.1016/j.jcp.2005.08.010.
- Roberts, A.J. and Kevrekidis, I.G. (2007). General tooth boundary conditions for equation free modelling SIAM J. Scientific Computing 29(4): 1495-1510. doi:10.1137/060654554.
- Wijesinghe, H.S. and Hadjiconstantinou, N.G. (2004). Discussion of hybrid atomistic-continuum methods for multiscale hydrodynamics International Journal for Multiscale Computational Engineering 2: 189-202. doi:10.1615/intjmultcompeng.v2.i2.20.
- Li, J.; Liao, D. and Yip, S. (1998). Imposing field boundary conditions in MD simulation of fluids: optimal particle controller and buffer zone feedback Mat. Res. Soc. Symp. Proc 538: 473-478. doi:10.1557/proc-538-473.
- Givon, D.; Kupferman, R. and Stuart, A. (2004). Extracting macroscopic dynamics: model problems and algorithms Nonlinearity 17: R55-R127. doi:10.1088/0951-7715/17/6/r01.
- E, W.; Liu, D. and Vanden-Eijnden, E. (2005). Analysis of numerical techniques for multiscale stochastic dynamical systems Communications in Pure and Applied Mathematics 58: 1544-1585.
Internal references
- John Guckenheimer (2007) Bifurcation. Scholarpedia, 2(6):1517.
- Jack Carr (2006) Center manifold. Scholarpedia, 1(12):1826.
- Gregoire Nicolis and Catherine Rouvas-Nicolis (2007) Complex systems. Scholarpedia, 2(11):1473.
- James Meiss (2007) Dynamical systems. Scholarpedia, 2(2):1629.
- Eugene M. Izhikevich (2007) Equilibrium. Scholarpedia, 2(10):2014.
- J. Tinsley Oden (2010) Finite element method. Scholarpedia, 5(5):9836.
- Rodolfo Llinas (2008) Neuron. Scholarpedia, 3(8):1490.
- Kendall E. Atkinson (2007) Numerical analysis. Scholarpedia, 2(8):3163.
- Andrei D. Polyanin, William E. Schiesser, Alexei I. Zhurov (2008) Partial differential equation. Scholarpedia, 3(10):4605.
- Jeff Moehlis, Kresimir Josic, Eric T. Shea-Brown (2006) Periodic orbit. Scholarpedia, 1(7):1358.
- Gregoire Nicolis and Anne De Wit (2007) Reaction-diffusion systems. Scholarpedia, 2(9):1475.
- Thomas Witelski and Mark Bowen (2009) Singular perturbation theory. Scholarpedia, 4(4):3951.
- Philip Holmes and Eric T. Shea-Brown (2006) Stability. Scholarpedia, 1(10):1838.
- David H. Terman and Eugene M. Izhikevich (2008) State space. Scholarpedia, 3(3):1924.
Further reading
- Kevrekidis, I.G. et al. (2003). Equation-free, coarse-grained multiscale computation: enabling microscopic simulators to perform system-level tasks Comm. Math. Sciences 1(4): 715-762. doi:10.4310/cms.2003.v1.n4.a5.
- Kevrekidis, I.G. and Samaey, G. (2009). Equation-free multiscale computation: algorithms and applications Annual Review in Physical Chemistry 60: 321-344. doi:10.1146/annurev.physchem.59.032607.093610.
- E, W. and Engquist, B. (2003). The heterogeneous multiscale methods Comm. Math. Sciences 1(1): 87-132. doi:10.4310/cms.2003.v1.n1.a8.
- Givon, D.; Kupferman, R. and Stuart, A. (2004). Extracting macroscopic dynamics: model problems and algorithms Nonlinearity 17: R55-R127. doi:10.1088/0951-7715/17/6/r01.
- Oettinger, H.C. (2005). Beyond equilibrium thermodynamics Wiley-Interscience, Hoboken, New Jersey.
- The quasi-continuum method.
- Chorin, A.J.; Kast, A.P. and Kupferman, R. (1998). Optimal prediction of underresolved dynamics Proceedings of the National Academy of Sciences 8: 4094. doi:10.1073/pnas.95.8.4094.
- Efendiev, Y. and Hou, T. (2009). Multiscale finite element methods: theory and applications Springer, .