81.2NAJun 2
Linear Convergence of Parareal Algorithm for Semilinear Parabolic EquationsGuanglian Li, Qingle Lin, Shu-lin Wu et al.
Long-time simulations of evolution equations present substantial computational challenges due to the inherently sequential nature of conventional time-stepping schemes. The parareal method, a leading parallel-in-time (PinT) algorithm, offers a promising approach to overcome the challenge by introducing concurrency in the time domain. While its convergence theory is well-established for linear problems, extending the theory to nonlinear problems, particularly when the problem data have only limited regularity, remains a significant challenge. In this work, we provide the convergence analysis of the parareal algorithm for solving semilinear parabolic equations with an $H^2$ initial data. We employ stable rational approximations and first-order linearization as coarse propagators, establish the linear convergence of the parareal algorithm and provide a sharp estimate for the convergence factor. The analysis combines the error-splitting technique from the superlinear convergence analysis of the parareal method, a refined linear convergence theory for linear parabolic equations, and \textsl{a priori} error estimates that are optimal with respect to the regularity of the problem data. The analysis shows the close connection between the convergence behavior of nonlinear models and their linear counterparts. Numerical experiments fully support the theoretical findings.
NASep 24, 2014
Randomized Oversampling for Generalized Multiscale Finite Element MethodsVictor M. Calo, Y. Efendiev, Juan Galvis et al.
In this paper, we study the development of efficient multiscale methods for flows in heterogeneous media. Our approach uses the Generalized Multiscale Finite Element (GMsFEM) framework. The main idea of GMsFEM is to approximate the solution space locally using a few multiscale basis functions. This is typically achieved by selecting an appropriate snapshot space and a local spectral decomposition, e.g., the use of oversampled regions in order to achieve an efficient model reduction. However, the successful construction of snapshot spaces may be costly if too many local problems need to be solved in order to obtain these spaces. In this paper, we show that this efficiency can be achieved using a moderate quantity of local solutions (or snapshot vectors) with random boundary conditions on oversampled regions with zero forcing. Motivated by the randomized algorithm presented in [19], we consider a snapshot space which consists of harmonic extensions of random boundary conditions defined in a domain larger than the target region. Furthermore, we perform an eigenvalue decomposition in this small space. We study the application of randomized sampling for GMsFEM in conjunction with adaptivity, where local multiscale spaces are adaptively enriched. Convergence analysis is provided. We present representative numerical results to validate the method proposed.
NAJan 14, 2015
Generalized Multiscale Finite Element Methods for problems in perforated heterogeneous domainsEric T. Chung, Yalchin Efendiev, Guanglian Li et al.
Complex processes in perforated domains occur in many real-world applications. These problems are typically characterized by physical processes in domains with multiple scales (see Figure 1 for the illustration of a perforated domain). Moreover, these problems are intrinsically multiscale and their discretizations can yield very large linear or nonlinear systems. In this paper, we investigate multiscale approaches that attempt to solve such problems on a coarse grid by constructing multiscale basis functions in each coarse grid, where the coarse grid can contain many perforations. In particular, we are interested in cases when there is no scale separation and the perforations can have different sizes. In this regard, we mention some earlier pioneering works [14, 18, 17], where the authors develop multiscale finite element methods. In our paper, we follow Generalized Multiscale Finite Element Method (GMsFEM) and develop a multiscale procedure where we identify multiscale basis functions in each coarse block using snapshot space and local spectral problems. We show that with a few basis functions in each coarse block, one can accurately approximate the solution, where each coarse block can contain many small inclusions. We apply our general concept to (1) Laplace equation in perforated domain; (2) elasticity equation in perforated domain; and (3) Stokes equations in perforated domain. Numerical results are presented for these problems using two types of heterogeneous perforated domains. The analysis of the proposed methods will be presented elsewhere.
NAFeb 12, 2015
Hierarchical multiscale modeling for flows in fractured media using Generalized Multiscale Finite Element MethodYalchin Efendiev, Seong Lee, Guanglian Li et al.
In this paper, we develop a multiscale finite element method for solving flows in fractured media. Our approach is based on Generalized Multiscale Finite Element Method (GMsFEM), where we represent the fracture effects on a coarse grid via multiscale basis functions. These multiscale basis functions are constructed in the offline stage via local spectral problems following GMsFEM. To represent the fractures on the fine grid, we consider two approaches (1) Discrete Fracture Model (DFM) (2) Embedded Fracture Model (EFM) and their combination. In DFM, the fractures are resolved via the fine grid, while in EFM the fracture and the fine grid block interaction is represented as a source term. In the proposed multiscale method, additional multiscale basis functions are used to represent the long fractures, while short-size fractures are collectively represented by a single basis functions. The procedure is automatically done via local spectral problems. In this regard, our approach shares common concepts with several approaches proposed in the literature as we discuss. Numerical results are presented where we demonstrate how one can adaptively add basis functions in the regions of interest based on error indicators. We also discuss the use of randomized snapshots (\cite{randomized2014}) which reduces the offline computational cost.
NAMay 26, 2018
On the Degree of Ill-Posedness of Multi-Dimensional Magnetic Particle ImagingTobias Kluth, Bangti Jin, Guanglian Li
Magnetic particle imaging is an imaging modality of relatively recent origin, and it exploits the nonlinear magnetization response for reconstructing the concentration of nanoparticles. Since first invented in 2005, it has received much interest in the literature. In this work, we study one prototypical mathematical model in multi-dimension, i.e., the equilibrium model, which formulates the problem as a linear Fredholm integral equation of the first kind. We analyze the degree of ill-posedness of the associated linear integral operator by means of the singular value decay estimate for Sobolev smooth bivariate functions, and discuss the influence of various experimental parameters. In particular, applied magnetic fields with a field free point and a field free line are distinguished. The study is complemented with extensive numerical experiments.
NAOct 24, 2018
Edge Multiscale Methods for elliptic problems with heterogeneous coefficientsShubin Fu, Eric Chung, Guanglian Li
In this paper, we proposed two new types of edge multiscale methods motivated by \cite{GL18} to solve Partial Differential Equations (PDEs) with high-contrast heterogeneous coefficients: Edge spectral multiscale Finte Element method (ESMsFEM) and Wavelet-based edge multiscale Finite Element method (WEMsFEM). Their convergence rates for elliptic problems with high-contrast heterogeneous coefficients are demonstrated in terms of the coarse mesh size $H$, the number of spectral basis functions and the level of the wavelet space $\ell$, which are verified by extensive numerical tests.
40.8NAMay 27
Dual Variational Neural Network for the $p$-Laplace ProblemTianhao Hu, Guanglian Li, Fengru Wang et al.
The reliable and accurate numerical approximation of the $p$-Laplacian is particularly challenging in the extreme regimes $p \to 1^{+}$ and $p \gg 1$, where the operator becomes either highly singular or strongly degenerate, often causing severe instability in standard numerical methods. To address these difficulties, we propose a novel deep learning based framework, termed the dual variational neural network, for $p$-Laplace problems. The approach is based on a mixed formulation and an $L^q$-based Helmholtz decomposition, which decouples the original problem into two convex subproblems: a linear Poisson problem for the irrotational component and an unconstrained minimization problem over divergence-free fields for the solenoidal component. Following the decomposition, we employ two neural networks using a gradient--curl representation to approximate the flux, and further establish an error analysis of the neural approximation. The analysis relies on fundamental vector inequalities together with tools from statistical learning theory. Numerical experiments demonstrate robust convergence of the proposed method in challenging settings, including the extreme cases $p \to 1^{+}$ and $p \gg 1$, as well as the $p(x)$-Laplace equation.
NAJun 15, 2016
Error analysis of a variational multiscale stabilization for convection-dominated diffusion equations in 2dGuanglian Li, Daniel Peterseim, Mira Schedensack
We formulate a stabilized quasi-optimal Petrov-Galerkin method for singularly perturbed convection-diffusion problems based on the variational multiscale method. The stabilization is of Petrov-Galerkin type with a standard finite element trial space and a problem-dependent test space based on pre-computed fine-scale correctors. The exponential decay of these correctors and their localisation to local patch problems, which depend on the direction of the velocity field and the singular perturbation parameter, is rigorously justified. Under moderate assumptions, this stabilization guarantees stability and quasi-optimal rate of convergence for arbitrary mesh Péclet numbers on fairly coarse meshes at the cost of additional inter-element communication.
NAMar 20, 2019
Homogenization of time-fractional diffusion equations with periodic coefficientsJiuhua Hu, Guanglian Li
We consider the initial boundary value problem for the time-fractional diffusion equation with a homogeneous Dirichlet boundary condition and an inhomogeneous initial data $a(x)\in L^{2}(D)$ in a bounded domain $D\subset \mathbb{R}^d$ with a sufficiently smooth boundary. We analyze the homogenized solution under the assumption that the diffusion coefficient $κ^ε(x)$ is smooth and periodic with the period $ε>0$ being sufficiently small. We derive that its first order approximation has a convergence rate of $\mathcal{O}(ε^{1/2})$ when the dimension $d\leq 2$ and $\mathcal{O}(ε^{1/6})$ when $d=3$. Several numerical tests are presented to show the performance of the first order approximation.
NAMar 16, 2018
Quasi-Optimality of an Adaptive Finite Element Method for Cathodic ProtectionGuanglian Li, Yifeng Xu
In this work, we derive a reliable and efficient residual-typed error estimator for the finite element approximation of a 2d cathodic protection problem governed by a steady-state diffusion equation with a nonlinear boundary condition. We propose a standard adaptive finite element method involving the Dörfler marking and a minimal refinement without the interior node property. Furthermore, we establish the contraction property of this adaptive algorithm in terms of the sum of the energy error and the scaled estimator. This essentially allows for a quasi-optimal convergence rate in terms of the number of elements over the underlying triangulation. Numerical experiments are provided to confirm this quasi-optimality.
25.4NAApr 24
Numerical homogenization for indefinite time-harmonic Maxwell equationsYueqi Wang, Wing Tat Leung, Guanglian Li
We propose a novel numerical homogenization method based on the edge multiscale approach for solving indefinite time-harmonic Maxwell equations in heterogeneous media with large wavenumber. Numerical methods for these equations in homogeneous media with high wavenumber are particularly challenging due to the so-called pollution effect: the mesh size must be significantly smaller than the reciprocal of the wavenumber to achieve a desired accuracy. This challenge is amplified in heterogeneous media, which frequently occur in practical applications such as metamaterial simulations, since resolving the heterogeneity is necessary for obtaining reliable solutions. Our approach overcomes this difficulty by avoiding explicit resolution of the heterogeneity, while employing a mesh size that depends almost linearly on the reciprocal of the wavenumber. The approximation properties and stability of the method rely critically on the development and rigorous analysis of a novel, nonstandard variational formulation, which constitutes the main innovation of this work. Extensive numerical experiments are provided to validate our theoretical findings.
50.3NAMay 12
Optimized Two-Step Coarse Propagators in Parareal AlgorithmsGuanglian Li, Qingle Lin, Kai Zhang et al.
In this work, we propose a novel framework for accelerating the parareal algorithm, in which the coarse propagator is formulated as a two-step method and optimized with respect to the convergence factor.} We derive a rigorous error estimate for the proposed two-step parareal algorithm, yielding an explicit bound on the linear convergence factor. This estimate is not only of theoretical interest: it provides a quantitative guideline for selecting and designing coarse propagators. Guided by this estimate, we {consider the linear parabolic equation as an illustrative example and }construct an optimized two-step coarse propagator~(O2CP) that delivers very fast convergence in practice. The resulting method attains an optimized convergence factor of approximately $0.0064$, substantially smaller than that of commonly used practical coarse propagators in the classical parareal setting, while keeping the computational cost moderate. Numerical experiments on linear and nonlinear parabolic equations fully support the theoretical analysis and demonstrate rapid convergence of the two-step parareal algorithm equipped with the O2CP.
NAFeb 24, 2018
On the Convergence Rates of GMsFEMs for Heterogeneous Elliptic Problems without Oversampling TechniquesGuanglian Li
This work is concerned with the rigorous analysis on the Generalized Multiscale Finite Element Methods (GMsFEMs) for elliptic problems with high-contrast heterogeneous coefficients. GMsFEMs are popular numerical methods for solving flow problems with heterogeneous high-contrast coefficients, and it has demonstrated extremely promising numerical results for a wide range of applications. However, the mathematical justification of the efficiency of the method is still largely missing. In this work, we analyze two types of multiscale basis functions, i.e., local spectral basis functions and basis functions of local harmonic extension type, within the GMsFEM framework. These constructions have found many applications in the past few years. We establish their optimal convergence in the energy norm under a very mild assumption that the source term belongs to some weighted $L^2$ space, and without the help of any oversampling technique. Furthermore, we analyze the model order reduction of the local harmonic extension basis and prove its convergence in the energy norm. These theoretical findings shed insights into the mechanism behind the efficiency of the GMsFEMs.
NAAug 3, 2015
Sparse Generalized Multiscale Finite Element Methods and their applicationsEric Chung, Yalchin Efendiev, Wing Tat Leung et al.
In a number of previous papers, local (coarse grid) multiscale model reduction techniques are developed using a Generalized Multiscale Finite Element Method. In these approaches, multiscale basis functions are constructed using local snapshot spaces, where a snapshot space is a large space that represents the solution behavior in a coarse block. In a number of applications (e.g., those discussed in the paper), one may have a sparsity in the snapshot space for an appropriate choice of a snapshot space. More precisely, the solution may only involve a portion of the snapshot space. In this case, one can use sparsity techniques to identify multiscale basis functions. In this paper, we consider two such sparse local multiscale model reduction approaches. In the first approach (which is used for parameter-dependent multiscale PDEs), we use local minimization techniques, such as sparse POD, to identify multiscale basis functions, which are sparse in the snapshot space. These minimization techniques use $l_1$ minimization to find local multiscale basis functions, which are further used for finding the solution. In the second approach (which is used for the Helmholtz equation), we directly apply $l_1$ minimization techniques to solve the underlying PDEs. This approach is more expensive as it involves a large snapshot space; however, in this example, we can not identify a local minimization principle, such as local generalized SVD.