Contrast-independent partially explicit time discretizations for nonlinear multiscale problems
Abstract
This work continues a line of works on developing partially explicit methods for multiscale problems. In our previous works, we have considered linear multiscale problems, where the spatial heterogeneities are at subgrid level and are not resolved. In these works, we have introduced contrast-independent partially explicit time discretizations for linear equations. The contrast-independent partially explicit time discretization divides the spatial space into two components: contrast dependent (fast) and contrast independent (slow) spaces defined via multiscale space decomposition. Following this decomposition, temporal splitting is proposed that treats fast components implicitly and slow components explicitly. The space decomposition and temporal splitting are chosen such that it guarantees a stability and formulate a condition for the time stepping. This condition is formulated as a condition on slow spaces. In this paper, we extend this approach to nonlinear problems. We propose a splitting approach and derive a condition that guarantees stability. This condition requires some type of contrast-independent spaces for slow components of the solution. We present numerical results and show that the proposed methods provide results similar to implicit methods with the time step that is independent of the contrast.
1 Introduction
Nonlinear problems arise in many applications and they are typically described by some nonlinear partial differential equations. In many applications, these problems have multiscale nature and contain multiple scales and high contrast. Examples include nonlinear porous media flows (e.g., Richards’ equations, Forchheimer flow, and so on, e.g., [21, 4]), where the media properties contain many spatial scales and high contrast. Because of high contrast in the media properties, these processes also occur on multiple times scales. E.g., for nonlinear diffusion, the flow can be fast in high conductivity regions, while the flow is slow in low conductivity regions. Because of disparity of time scales, special temporal discretizations are often sought, which is the main goal of the paper in the context of multiscale problems.
When the media properties are high, the flow and transport become fast and requires small time step to resolve the dynamics. Implicit discretization can be used to handle fast dynamics; however, this requires solving large-scale nonlinear systems. For nonlinear problems, explicit methods are used when possible to avoid solving nonlinear systems. The main drawback of explicit methods is that they require small time steps that scale as the fine mesh and depend on physical parameters, e.g., the contrast. To alleviate this issue, we propose a novel nonlinear splitting algorithm following our earlier works [23, 24] for linear equations. The main idea of our approaches is to use multiscale methods on a coarse spatial grid such that the time step scales as the coarse mesh size.
Next, we give a brief overview of multiscale methods for spatial discretizations that are used in our paper. Multiscale spatial algorithms have been extensively studied for linear and nonlinear problems. For linear problems, many multiscale methods have been developed. These include homogenization-based approaches [18, 34], multiscale finite element methods [18, 27, 33], generalized multiscale finite element methods (GMsFEM) [6, 7, 8, 11, 16], constraint energy minimizing GMsFEM (CEM-GMsFEM) [9, 10], nonlocal multi-continua (NLMC) approaches [12], metric-based upscaling [38], heterogeneous multiscale method [15], localized orthogonal decomposition (LOD) [26], equation-free approaches [39, 41], multiscale stochastic approaches [29, 30, 28], and hierarchical multiscale method [5]. For high-contrast problems, approaches such as GMsFEM and NLMC are developed. For example, in the GMsFEM [9], multiple basis functions or continua are designed to capture the multiscale features due to high contrast [10, 12]. These approaches require a careful design of multiscale dominant modes. For nonlinear problems, linear multiscale basis functions can be replaced by nonlinear maps [19, 20, 17].
Our proposed approaches follow concepts developed in [23, 24] for linear equations. In these works, we design splitting algorithms for solving flow and wave equations. In both cases, the solution space is divided into two parts, coarse-grid part, and the correction part. Coarse-grid solution is computed using multiscale basis functions with CEM-GMsFEM. The correction part uses special spaces in the complement space (complement to the coarse space). A careful choice of these spaces guarantees that the method is stable. Our analysis in [23, 24] shows that for the stability, the correction space should be free of contrast and thus, this requires a special multiscale space construction. These splitting algorithms take their origin from earlier works [36, 43]. In this paper, we extend the linear concepts to nonlinear problems.
Splitting algorithms for nonlinear problems have often been used in the literature. Earlier approaches include implicit-explicit approaches and other techniques [3, 35, 1, 22, 2, 37, 42, 14, 25, 32, 40, 31, 13]. In many approaches, nonlinear contributions are roughly divided into two parts depending on whether it is easy to implicitly solve discretized system. For easy to solve part, implicit discretization is used, while for the rest, explicit discretization is used. However, in general, one can not separate these parts for the problems under the consideration. Our goal is to use splitting concepts and treat implicitly and explicitly some parts of the solution. As a result, we can use larger time steps that scale as the coarse mesh size.
Our approach starts a nonlinear dynamical system
where represents diffusion-like operator, while represents reaction-like terms. In linear problems, for the stability, we formulate a condition that involves the time step, the energy and norm of the solution in complement space. This is a constraint for the time step. With an appropriate choice of the complement space, this condition guarantees the stability for the time steps that scale as the coarse mesh size. To obtain similar conditions for nonlinear problems, we carry out the analysis for nonlinear and functions. The analysis reveals conditions that are required for stability. The conditions of multiscale spaces turn out to share some similarities to those for nonlinear multiscale methods [17]. We remark several observations.
-
•
Additional degrees of freedom are needed for dynamic problems, in general, to handle missing information.
-
•
We note that restrictive time step scales as the coarse mesh size and, thus, much coarser.
We present several numerical results. In our numerical results, we consider two cases. In the first case, we take the reaction term, , to be nonlinear, while the diffusion term, , to be linear. In the second case, we consider both to be nonlinear and use for the form . The media properties for the diffusion is taken to be heterogeneous and we choose smooth and singular source terms. We compare the proposed approach to the approach, where all degrees of freedom are handled implicitly. We show that the proposed methods provide an approximation similar to fully implicit methods.
The paper is organized as follows. In the next section, we provide some preliminaries. In Section 3, we present our main assumptions and stability estimates for fine-grid problem. In Section 4, we describe the partially explicit method and its stability, following some discussions in Section 5. Numerical results are presented in Section 6.
2 Problem Setting
We consider the following equation
(2.1) |
where and which are the variational derivative of energies and . Here, is assumed to be contrast dependent nonlinear (or linear) (i.e., introduces stiffness in the system) while is contrast independent (i.e., does not introduce stiffness).
We assume and for all . We can then consider the weak formulation of the problem, namely, finding such that
To simplify the notation, we will simply write instead of in the following discussion.
Example 1: For and , we will have for .
and thus, we have
In strong form, we have
Example 2: For and , we will have for
and thus, we have
In strong form, we have
In the following discussion, we will make the following assumptions on the second variational derivative of and .
-
•
The second variational derivative and satisfy
where and are independent on .
-
•
The second variational derivative and are bounded. That is,
where and are independent on .
3 Discretization
To solve the problem, a standard method is finite element approach. We can consider the numerical solution satisfies
(3.1) |
where is a finite element space in .
For the time discretization, we can consider two simplest discretizations which are forward Euler and backward Euler methods. For the forward Euler method, we consider such that
For the backward Euler method, we consider such that
Next, we would like to derive stability conditions for backward and forward Euler methods.
Since
and
for some with and , we have
We have
for any and thus, backward Euler method is stable if .
Similarly, for forward Euler method, we can use
and obtain
Therefore, if for any with , we have
We can see that although forward Euler method is easier for implementation, we require a small time step for stability if or is large.
We remark that in typical cases we will consider and are not too large. Therefore, we have and is small and the energy will not affect the stability too much.
4 Partially explicit scheme with space splitting
To obtain an efficient method, one can consider partially explicit scheme by splitting finite element space. We consider is a direct sum of two subspace and , namely, . The finite element solution is then satisfying
where . We can use a partially explicit time discretization. For example, we can consider
Energy stability
Lemma 4.1.
If
(4.1) |
where and , we have
Proof.
By substitute and , we have
and
Summing up the above two equations, we have
We first use
and obtain
To prove the stability of the method, we can consider
for some with and .
Therefore, we have
(4.2) |
and
Thus, we obtain
and
If
then we have
∎
Lemma 4.2.
If
(4.3) |
where , and
we have
Proof.
For the proof of this lemma, we will show that if the condition of Lemma 4.2 holds, then the condition of Lemma 4.1 holds. For this reason, we will need to estimate . Similar to the proof in previous lemma, we consider
for some with . We have
Since
we have
If
we have the condition formulated in Lemma 4.1
(4.4) |
By Lemma 4.1, we get the result. ∎
Example 1. For and , we have
and
and thus, we have
and the partially explicit scheme is stable when
5 Discussions
5.1 case
First, we present some discussions for case. In this case, the first stability condition for partial explicit scheme is
(5.1) |
This condition can be understood as a nonlinear constraint on the “second space” that represents and in order to have a small bound, one needs to guarantee that captures important degrees of freeom. Indeed, the smallness of
is a condition on (on the coarse space) and requires that this term is chosen such that the difference is independent of the contrast. This condition is more evident in Lemma 4.2, where the condition on is
5.2 case.
In this case, we will first treat the nonlinear forcing explicitly and we will also discuss the case when is partially explicit.
6 Numerical Results
In this section, we will present numerical results for various cases. We will consider several choices for and . For , we will use diffusion operator for linear case
and nonlinear case
(6.1) |
In all examples, we will use two heterogeneous high contrast that represent the media, where one is more complex (more channels). As for , we will consider several choices of nonlinear reaction terms as discussed below. This term will contain nonlinear reaction and steady state spatial source term. One source term will be more regular and the other more singular. The singular source term is chosen so that CEM solution requires additional basis functions as the source term contains subgrid features. In all numerical examples, the coarse mesh size is and the fine mesh size is . For the time discretization, we will consider the final time . In our numerical tests, we will compare three methods.
-
•
First, we will use implicit CEM to compute the solution without additional degrees of freedom (called “Implicit CEM” in our graphs).
-
•
Secondly, we will compute the solution with additional degrees of freedom using implicit CEM (called “Implicit CEM with additional basis” in our graphs).
-
•
Finally, we will compute the solution with additional degrees of fredoom using our proposed partially explicit approach (called “Partially Explicit Splitting CEM” in our graphs).
In all examples, we use Newton or Picard iterations to find the solution of nonlinear equations. In all examples, we observe that our proposed partially explicit method provides similar accuracy as the implicit CEM approach that uses additional degrees of freedom.
6.1 and constructions
In this section, we present a way to construct the spaces satisfying (4.3) based on linear problems. These spaces are constructed under the assumption that linear multiscale structure can be used to accurately model coarse-grid solution. It can be shown that the linear spaces satisfy (4.3) under some assumptions on (see (6.1)). Here, we follow our previous work [23]. As the constrained energy minimization basis functions are constructed such that they are almost orthogonal to a space , the CEM finite element space is a good option for . To find a satisfying the condition (4.3), we can use an eigenvalue problem to construct the local basis functions. We will first introduce the CEM finite element space, followed by the discussion of constructing . In the following, we let for a proper subset .
6.1.1 CEM method
In this section, we introduce the CEM method for solving the problem (3.1). We will construct the finite element space by solving a constrained energy minimization problem. Let be a coarse grid partition of . For , we first need to define a set of auxiliary basis functions in . We solve
where
with being a partition of unity functions corresponding to an overlapping partition of the domain. We then collect the first eigenfunctions corresponding to the first smallest eigenvalues. We define
We next define a projection operator
where and is the number of coarse elements. We let be an oversampling domain of , which is a few coarse blocks larger than [9]. For each auxiliary basis functions , we can find a local basis function such that
for some . We then define the space as
The CEM solution is given by
Let and we can now construct .
6.1.2 Construction of
The construction of is based on the CEM type finite element space. For each coarse element , we will solve an eigenvalue problem to get the second type of auxiliary basis. We obtain eigenpairs by solving
(6.2) |
and rearranging the eigenvalues by . For each , we choose the first few eigenfunctions corresponding to the smallest eigenvalues. We define . For each auxiliary basis function , we define a basis function such that , and
(6.3) | ||||
(6.4) | ||||
(6.5) |
where we use the notation to denote the space defined in Section 6.1.1. We define
6.2 Linear
In this subsection, we discuss the numerical results for
Equation becomes
(6.6) |
For the time discretization, we consider the time step .
Let be the fine mesh solution for Equation . We use Newton’s method to solve the following implicit equation.
where and is the inner product. In finite element methods, let be fine mesh basis functions. Let be the step number in Newton’s method. We have , and . Le and be the mass and stiffness matrices, respectively. Let , and . We define
where
Then
where
Then we have
Newton’s method for coarse mesh is similar. The partially explicit scheme is:
In our first example, we consider
In Figure 6.1, the permeability field and are presented. As is shown, this permeability field has heterogeneous high contrast channels and is a singular source term. In Figure 6.2, we first present the reference solution which is implicitly solved using fine grid basis functions. The middle plot in Figure 6.2 is implicit CEM solution obtained with additional basis functions and the solution in the right plot is obtained using the partially explicit scheme presented above. These three plots all show the solution at . We present two relative error plots in Figure 6.3. The first one is the relative error plot and the second one is the relative energy error plot. The blue, red and black curves (in both plots) stand for the relative error for implicit CEM solution, implicit CEM solution (with additional basis) and partially explicit solution respectively. In each of these two plots, there is a noticeable improvement for error when we use additional basis functions. We find that the black curve coincides with the red curve, which means that the partially explicit scheme can achieve similar accuracy as the fully implicit scheme.







In this case,
The difference is that we use a smooth source term. In Figure 6.4, the permeability field and source term are shown. The reference solution at the final time, implicit CEM solution (with additional basis) at the final time and partially explicit solution at the final time are presented in Figure 6.5. We show the relative error plot and the relative energy error plot in Figure 6.6. We see that the relative and energy error curves for implicit CEM (with additional basis) and partially explicit scheme almost coincide, which implies similar accuracy between them.







In our third test,
and we use a more complicated permeability field with more high contrast channels. Figure 6.7 shows the permeability field and source term . The reference solution at , implicit CEM solution (with additional basis) at and partially explicit solution at are presented in Figure 6.8. In Figure 6.9, we show the relative error plot and the relative energy error plot. In this case, in both error plots, the curves for implicit CEM (with additional basis) and partially explicit scheme coincide.







In this example,
We use the more complicated permeability field and the smooth source term which are shown in Figure 6.10. In Figure 6.11, the reference solution at the final time, implicit CEM solution (with additional basis) at the final time and partially explicit solution at the final time are presented. Relative error and energy error plots are shown in Figure 6.12. In this case, the relative error for implicit CEM scheme is small and comparable to the two schemes with additional basis. From Figure 6.12, we can find that the and energy error for implicit CEM (with additional basis) and partially explicit scheme are nearly the same.







In this case, we use a new reaction term
In numerical experiments, we set to be constant inside every fine element. Figure 6.13 shows the permeability field , the source term and the function . The reference solution, implicit CEM solution (with additional basis) and partially explicit solution at the final time are shown in Figure 6.14. The relative error plot and relative energy error plot are presented in Figure 6.15. From the relative error plot, we find that the relative error for three schemes are comparable. For the relative energy error, we can find a large improvement when we introduce additional basis. The relative energy error for implicit CEM solution (with additional basis) and partially explicit solution are nearly the same.








In this case,
The permeability field , the source term and the funciotn are presented in Figure 6.16. The reference solution, implicit CEM solution (with additional basis) and partially explicit solution at the final time are shown in Figure 6.17. We present the relative error plot and the relative energy error plot in Figure 6.18. We observe that the and energy error curves for implicit CEM (with additional basis) and partially explicit scheme coincide.








6.3 Nonlinear
We want to explore the case in which the diffusion operator is nonlinear. So in Equation , we set
Equation becomes
(6.7) |
Let be the fine mesh solution for Equation . We use the Picard-Newton iteration to solve the implicit equation.
where is the Picard-Newton step number and is the inner product. In finite element methods, let be fine mesh basis functions. We have , and . Let be the mass matrix. Let , and . We define
where
and
Then
where
Thus,
Newton’s method for coarse mesh is similar. For the partially explicit scheme, we use the following Picard-Newton iteration which can be solved similarly using the method introduced above. Note that we change the reaction term to be partially explicit.
In the following three examples, we use in the partially explicit algorithm. One can prove its stability as in Lemma 4.1 and Lemma 4.2. The proof is similar and we omit it here.
In the following three cases,
In the first example, we consider and time step . The permeability field and the source term are presented in Figure 6.19. The reference solution, implicit CEM solution (with additional basis) and partially explicit solution at the final time are shown in Figure 6.20. We present the relative error plot and relative energy error plot in Figure 6.21. We can find that the curves for implicit CEM solution (with additional basis) and partially explicit solution coincide, which implies that our new partially explicit scheme is also effective and has similar accuracy as the implicit CEM (with additional basis) scheme.







In this second example, we consider and time step . Figure 6.22 shows the permeability field and the source term . The reference solution, implicit CEM solution (with additional basis) and partially explicit solution at are presented in Figure 6.23. The relative error plot and relative energy error plot are shown in Figure 6.24. The partially explicit scheme also works in this case and has similar accuracy as the implicit CEM (with additional basis) scheme.







In this case, we have and time step . The permeability field and the source term are presented in Figure 6.25. We show the reference solution, implicit CEM solution (with additional basis) and partially explicit solution at in Figure 6.26. The relative error plot and the relative energy error plot are presented in Figure 6.27. From Figure 6.27, we see that the curves for implicit CEM (with additional basis) and partially explicit scheme coincide, which implies that they have similar accuracy.







7 Conclusions
In this work, we design and analyze contrast-independent time discretization for nonlinear problems. The work continues our earlier works on linear problems, where we propose temporal splitting and associated spatial decomposition that guarantees a stability. We introduce two spatial spaces, the first account for spatial features related to fast time scales and the second for spatial features related to “slow” time scales. We propose time splitting, where the first equation solves for fast components implicitly and the second equation solves for slow components explicitly. We introduce a condition for multiscale spaces that guarantees stability of the proposed splitting algorithm. Our proposed method is still implicit via mass matrix; however, it is explicit in terms of stiffness matrix for the slow component. We present numerical results, which show that the proposed methods provide very similar results as fully implicit methods using explicit methods with the time stepping that is independent of the contrast.
Acknowledgments
The research of Eric Chung is partially supported by the Hong Kong RGC General Research Fund (Project numbers 14304719 and 14302018) and the CUHK Faculty of Science Direct Grant 2020-21.
References
- [1] A. Abdulle. Explicit methods for stiff stochastic differential equations. In Numerical Analysis of Multiscale Computations, pages 1–22. Springer, 2012.
- [2] G. Ariel, B. Engquist, and R. Tsai. A multiscale method for highly oscillatory ordinary differential equations with resonance. Mathematics of Computation, 78(266):929–956, 2009.
- [3] U. M. Ascher, S. J. Ruuth, and R. J. Spiteri. Implicit-explicit Runge-Kutta methods for time-dependent partial differential equations. Applied Numerical Mathematics, 25(2-3):151–167, 1997.
- [4] J. Bear. Dynamics of fluids in porous media. Courier Corporation, 2013.
- [5] D. L. Brown, Y. Efendiev, and V. H. Hoang. An efficient hierarchical multiscale finite element method for stokes equations in slowly varying media. Multiscale Modeling & Simulation, 11(1):30–58, 2013.
- [6] E. T. Chung, Y. Efendiev, and T. Hou. Adaptive multiscale model reduction with generalized multiscale finite element methods. Journal of Computational Physics, 320:69–95, 2016.
- [7] E. T. Chung, Y. Efendiev, and C. Lee. Mixed generalized multiscale finite element methods and applications. SIAM Multiscale Model. Simul., 13:338–366, 2014.
- [8] E. T. Chung, Y. Efendiev, and W. T. Leung. Generalized multiscale finite element methods for wave propagation in heterogeneous media. Multiscale Modeling & Simulation, 12(4):1691–1721, 2014.
- [9] E. T. Chung, Y. Efendiev, and W. T. Leung. Constraint energy minimizing generalized multiscale finite element method. Computer Methods in Applied Mechanics and Engineering, 339:298–319, 2018.
- [10] E. T. Chung, Y. Efendiev, and W. T. Leung. Constraint energy minimizing generalized multiscale finite element method in the mixed formulation. Computational Geosciences, 22(3):677–693, 2018.
- [11] E. T. Chung, Y. Efendiev, and W. T. Leung. Fast online generalized multiscale finite element method using constraint energy minimization. Journal of Computational Physics, 355:450–463, 2018.
- [12] E. T. Chung, Y. Efendiev, W. T. Leung, M. Vasilyeva, and Y. Wang. Non-local multi-continua upscaling for flows in heterogeneous fractured media. Journal of Computational Physics, 372:22–34, 2018.
- [13] J. Du and Y. Yang. Third-order conservative sign-preserving and steady-state-preserving time integrations and applications in stiff multispecies and multireaction detonations. Journal of Computational Physics, 395:489–510, 2019.
- [14] L. Duchemin and J. Eggers. The explicit–implicit–null method: Removing the numerical instability of pdes. Journal of Computational Physics, 263:37–52, 2014.
- [15] W. E and B. Engquist. Heterogeneous multiscale methods. Comm. Math. Sci., 1(1):87–132, 2003.
- [16] Y. Efendiev, J. Galvis, and T. Hou. Generalized multiscale finite element methods (GMsFEM). Journal of Computational Physics, 251:116–135, 2013.
- [17] Y. Efendiev, J. Galvis, G. Li, and M. Presho. Generalized multiscale finite element methods. nonlinear elliptic equations. Communications in Computational Physics, 15(3):733–755, 2014.
- [18] Y. Efendiev and T. Hou. Multiscale Finite Element Methods: Theory and Applications, volume 4 of Surveys and Tutorials in the Applied Mathematical Sciences. Springer, New York, 2009.
- [19] Y. Efendiev and A. Pankov. Numerical homogenization of monotone elliptic operators. SIAM J. Multiscale Modeling and Simulation, 2(1):62–79, 2003.
- [20] Y. Efendiev and A. Pankov. Homogenization of nonlinear random parabolic operators. Advances in Differential Equations, 10(11):1235–1260, 2005.
- [21] W. Ehlers. Darcy, forchheimer, brinkman and richards: classical hydromechanical equations and their significance in the light of the tpm. Archive of Applied Mechanics, pages 1–21, 2020.
- [22] B. Engquist and Y.-H. Tsai. Heterogeneous multiscale methods for stiff ordinary differential equations. Mathematics of computation, 74(252):1707–1742, 2005.
- [23] W. T. L. Eric Chung, Yalchin Efendiev and P. N. Vabishchevich. Contrast-independent partially explicit time discretizations for multiscale flow problems. arXiv:2101.04863.
- [24] W. T. L. Eric Chung, Yalchin Efendiev and P. N. Vabishchevich. Contrast-independent partially explicit time discretizations for multiscale wave problems.
- [25] J. Frank, W. Hundsdorfer, and J. Verwer. On the stability of implicit-explicit linear multistep methods. Applied Numerical Mathematics, 25(2-3):193–205, 1997.
- [26] P. Henning, A. Målqvist, and D. Peterseim. A localized orthogonal decomposition method for semi-linear elliptic problems. ESAIM: Mathematical Modelling and Numerical Analysis, 48(5):1331–1349, 2014.
- [27] T. Hou and X. Wu. A multiscale finite element method for elliptic problems in composite materials and porous media. J. Comput. Phys., 134:169–189, 1997.
- [28] T. Y. Hou, D. Huang, K. C. Lam, and P. Zhang. An adaptive fast solver for a general class of positive definite matrices via energy decomposition. Multiscale Modeling & Simulation, 16(2):615–678, 2018.
- [29] T. Y. Hou, Q. Li, and P. Zhang. Exploring the locally low dimensional structure in solving random elliptic pdes. Multiscale Modeling & Simulation, 15(2):661–695, 2017.
- [30] T. Y. Hou, D. Ma, and Z. Zhang. A model reduction method for multiscale elliptic pdes with random coefficients using an optimization approach. Multiscale Modeling & Simulation, 17(2):826–853, 2019.
- [31] W. Hundsdorfer and S. J. Ruuth. Imex extensions of linear multistep methods with general monotonicity and boundedness properties. Journal of Computational Physics, 225(2):2016–2042, 2007.
- [32] G. Izzo and Z. Jackiewicz. Highly stable implicit–explicit runge–kutta methods. Applied Numerical Mathematics, 113:71–92, 2017.
- [33] P. Jenny, S. Lee, and H. Tchelepi. Multi-scale finite volume method for elliptic problems in subsurface flow simulation. J. Comput. Phys., 187:47–67, 2003.
- [34] C. Le Bris, F. Legoll, and A. Lozinski. An MsFEM type approach for perforated domains. Multiscale Modeling & Simulation, 12(3):1046–1077, 2014.
- [35] T. Li, A. Abdulle, et al. Effectiveness of implicit methods for stiff stochastic differential equations. In Commun. Comput. Phys. Citeseer, 2008.
- [36] G. I. Marchuk. Splitting and alternating direction methods. Handbook of numerical analysis, 1:197–462, 1990.
- [37] M. Narayanamurthi, P. Tranquilli, A. Sandu, and M. Tokman. Epirk-w and epirk-k time discretization methods. Journal of Scientific Computing, 78(1):167–201, 2019.
- [38] H. Owhadi and L. Zhang. Metric-based upscaling. Comm. Pure. Appl. Math., 60:675–723, 2007.
- [39] A. Roberts and I. Kevrekidis. General tooth boundary conditions for equation free modeling. SIAM J. Sci. Comput., 29(4):1495–1510, 2007.
- [40] S. J. Ruuth. Implicit-explicit methods for reaction-diffusion problems in pattern formation. Journal of Mathematical Biology, 34(2):148–176, 1995.
- [41] G. Samaey, I. Kevrekidis, and D. Roose. Patch dynamics with buffers for homogenization problems. J. Comput. Phys., 213(1):264–287, 2006.
- [42] H. Shi and Y. Li. Local discontinuous galerkin methods with implicit-explicit multistep time-marching for solving the nonlinear cahn-hilliard equation. Journal of Computational Physics, 394:719–731, 2019.
- [43] P. N. Vabishchevich. Additive Operator-Difference Schemes: Splitting Schemes. Walter de Gruyter GmbH, Berlin, Boston, 2013.