Y. Efendiev

NA
4papers
329citations
Novelty45%
AI Score24

4 Papers

NAMay 5, 2011
Robust Domain Decomposition Preconditioners for Abstract Symmetric Positive Definite Bilinear Forms

Y. Efendiev, J. Galvis, R. Lazarov et al.

An abstract framework for constructing stable decompositions of the spaces corresponding to general symmetric positive definite problems into "local" subspaces and a global "coarse" space is developed. Particular applications of this abstract framework include practically important problems in porous media applications such as: the scalar elliptic (pressure) equation and the stream function formulation of its mixed form, Stokes' and Brinkman's equations. The constant in the corresponding abstract energy estimate is shown to be robust with respect to mesh parameters as well as the contrast, which is defined as the ratio of high and low values of the conductivity (or permeability). The derived stable decomposition allows to construct additive overlapping Schwarz iterative methods with condition numbers uniformly bounded with respect to the contrast and mesh parameters. The coarse spaces are obtained by patching together the eigenfunctions corresponding to the smallest eigenvalues of certain local problems. A detailed analysis of the abstract setting is provided. The proposed decomposition builds on a method of Efendiev and Galvis, Multiscale Model. Simul., 8 (2010), pp. 1461--1483, developed for second order scalar elliptic problems with high contrast. Applications to the finite element discretizations of the second order elliptic problem in Galerkin and mixed formulation, the Stokes equations, and Brinkman's problem are presented. A number of numerical experiments for these problems in two spatial dimensions are provided.

NASep 24, 2014
Randomized Oversampling for Generalized Multiscale Finite Element Methods

Victor 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.

NAFeb 28, 2013
Generalized Multiscale Finite Element Method. Symmetric Interior Penalty Coupling

Y. Efendiev, J. Galvis, R. Lazarov et al.

Motivated by applications to numerical simulation of flows in highly heterogeneous porous media, we develop multiscale finite element methods for second order elliptic equations. We discuss a multiscale model reduction technique in the framework of the discontinuous Galerkin finite element method. We propose three different finite element spaces on the coarse mesh. The first space is based on a local eigenvalue problem that uses a weighted $L_2-$norm for computing the "mass" matrix. The second space is generated by amending the eigenvalue problem of the first case with a term related to the penalty. The third choice is based on generation of a large space of snapshots and subsequent selection of a subspace of a reduced dimension. The approximation with these spaces is based on the discontinuous Galerkin finite element method framework. We investigate the stability and derive error estimates for the methods and further experimentally study their performance on a representative number of numerical examples.

NAFeb 9, 2017
Bayesian Multiscale Finite Element Methods. Modeling missing subgrid information probabilistically

Y. Efendiev, W. T. Leung, S. W. Cheung et al.

In this paper, we develop a Bayesian multiscale approach based on a multiscale finite element method. Because of scale disparity in many multiscale applications, computational models can not resolve all scales. Various subgrid models are proposed to represent un-resolved scales. Here, we consider a probabilistic approach for modeling un-resolved scales using the Multiscale Finite Element Method (cf., [1, 2]). By representing dominant modes using the Generalized Multiscale Finite Element, we propose a Bayesian framework, which provides multiple inexpensive (computable) solutions for a deterministic problem. These approximate probabilistic solutions may not be very close to the exact solutions and, thus, many realizations are needed. In this way, we obtain a rigorous probabilistic description of approximate solutions. In the paper, we consider parabolic and wave equations in heterogeneous media. In each time interval, the domain is divided into subregions. Using residual information, we design appropriate prior and posterior distributions. The likelihood consists of the residual minimization. To sample from the resulting posterior distribution, we consider several sampling strategies. The sampling involves identifying important regions and important degrees of freedom beyond permanent basis functions, which are used in residual computation. Numerical results are presented. We consider two sampling algorithms. The first algorithm uses sequential sampling and is inexpensive. In the second algorithm, we perform full sampling using the Gibbs sampling algorithm, which is more accurate compared to the sequential sampling. The main novel ingredients of our approach consist of: defining appropriate permanent basis functions and the corresponding residual; setting up a proper posterior distribution; and sampling the posteriors.