Model's sparse representation based on reduced mixed GMsFE basis methods
Abstract
In this paper, we propose a model's sparse representation based on reduced mixed generalized multiscale finite element (GMsFE) basis methods for elliptic PDEs with random inputs. A typical application for the elliptic PDEs is the flow in heterogeneous random porous media. Mixed generalized multiscale finite element method (GMsFEM) is one of the accurate and efficient approaches to solve the flow problem in a coarse grid and obtain the velocity with local mass conservation. When the inputs of the PDEs are parameterized by the random variables, the GMsFE basis functions usually depend on the random parameters. This leads to a large number degree of freedoms for the mixed GMsFEM and substantially impacts on the computation efficiency. In order to overcome the difficulty, we develop reduced mixed GMsFE basis methods such that the multiscale basis functions are independent of the random parameters and span a lowdimensional space. To this end, a greedy algorithm is used to find a set of optimal samples from a training set scattered in the parameter space. Reduced mixed GMsFE basis functions are constructed based on the optimal samples using two optimal sampling strategies: basisoriented crossvalidation and proper orthogonal decomposition. Although the dimension of the space spanned bymore »
 Authors:
 Institute of Mathematics, Hunan University, Changsha 410082 (China)
 College of Mathematics and Econometrics, Hunan University, Changsha 410082 (China)
 Publication Date:
 OSTI Identifier:
 22622295
 Resource Type:
 Journal Article
 Resource Relation:
 Journal Name: Journal of Computational Physics; Journal Volume: 338; Other Information: Copyright (c) 2017 Elsevier Science B.V., Amsterdam, The Netherlands, All rights reserved.; Country of input: International Atomic Energy Agency (IAEA)
 Country of Publication:
 United States
 Language:
 English
 Subject:
 71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSICS; ALGORITHMS; APPROXIMATIONS; COMPUTERIZED SIMULATION; DECOMPOSITION; DEGREES OF FREEDOM; EFFICIENCY; FINITE ELEMENT METHOD; FLOW MODELS; FUNCTIONS; GRIDS; LEAST SQUARE FIT; MASS; PARTIAL DIFFERENTIAL EQUATIONS; POROUS MATERIALS; RANDOMNESS; SAMPLING; TRAINING; TWOPHASE FLOW; VALIDATION; VELOCITY
Citation Formats
Jiang, Lijian, Email: ljjiang@hnu.edu.cn, and Li, Qiuqi, Email: qiuqili@hnu.edu.cn. Model's sparse representation based on reduced mixed GMsFE basis methods. United States: N. p., 2017.
Web. doi:10.1016/J.JCP.2017.02.055.
Jiang, Lijian, Email: ljjiang@hnu.edu.cn, & Li, Qiuqi, Email: qiuqili@hnu.edu.cn. Model's sparse representation based on reduced mixed GMsFE basis methods. United States. doi:10.1016/J.JCP.2017.02.055.
Jiang, Lijian, Email: ljjiang@hnu.edu.cn, and Li, Qiuqi, Email: qiuqili@hnu.edu.cn. 2017.
"Model's sparse representation based on reduced mixed GMsFE basis methods". United States.
doi:10.1016/J.JCP.2017.02.055.
@article{osti_22622295,
title = {Model's sparse representation based on reduced mixed GMsFE basis methods},
author = {Jiang, Lijian, Email: ljjiang@hnu.edu.cn and Li, Qiuqi, Email: qiuqili@hnu.edu.cn},
abstractNote = {In this paper, we propose a model's sparse representation based on reduced mixed generalized multiscale finite element (GMsFE) basis methods for elliptic PDEs with random inputs. A typical application for the elliptic PDEs is the flow in heterogeneous random porous media. Mixed generalized multiscale finite element method (GMsFEM) is one of the accurate and efficient approaches to solve the flow problem in a coarse grid and obtain the velocity with local mass conservation. When the inputs of the PDEs are parameterized by the random variables, the GMsFE basis functions usually depend on the random parameters. This leads to a large number degree of freedoms for the mixed GMsFEM and substantially impacts on the computation efficiency. In order to overcome the difficulty, we develop reduced mixed GMsFE basis methods such that the multiscale basis functions are independent of the random parameters and span a lowdimensional space. To this end, a greedy algorithm is used to find a set of optimal samples from a training set scattered in the parameter space. Reduced mixed GMsFE basis functions are constructed based on the optimal samples using two optimal sampling strategies: basisoriented crossvalidation and proper orthogonal decomposition. Although the dimension of the space spanned by the reduced mixed GMsFE basis functions is much smaller than the dimension of the original full order model, the online computation still depends on the number of coarse degree of freedoms. To significantly improve the online computation, we integrate the reduced mixed GMsFE basis methods with sparse tensor approximation and obtain a sparse representation for the model's outputs. The sparse representation is very efficient for evaluating the model's outputs for many instances of parameters. To illustrate the efficacy of the proposed methods, we present a few numerical examples for elliptic PDEs with multiscale and random inputs. In particular, a twophase flow model in random porous media is simulated by the proposed sparse representation method.},
doi = {10.1016/J.JCP.2017.02.055},
journal = {Journal of Computational Physics},
number = ,
volume = 338,
place = {United States},
year = 2017,
month = 6
}

In this work, a systematic infrastructure is described that formalizes concepts implicit in previous work and greatly simplifies computer implementation of reducedscaling electronic structure methods. The key concept is sparse representation of tensors using chains of sparse maps between two index sets. Sparse map representation can be viewed as a generalization of compressed sparse row, a common representation of a sparse matrix, to tensor data. By combining few elementary operations on sparse maps (inversion, chaining, intersection, etc.), complex algorithms can be developed, illustrated here by a linearscaling transformation of threecenter Coulomb integrals based on our compact code library that implementsmore »

Sparse maps—A systematic infrastructure for reducedscaling electronic structure methods. II. Linear scaling domain based pair natural orbital coupled cluster theory
Domain based local pair natural orbital coupled cluster theory with single, double, and perturbative triple excitations (DLPNOCCSD(T)) is a highly efficient local correlation method. It is known to be accurate and robust and can be used in a black box fashion in order to obtain coupled cluster quality total energies for large molecules with several hundred atoms. While previous implementations showed near linear scaling up to a few hundred atoms, several nonlinear scaling steps limited the applicability of the method for very large systems. In this work, these limitations are overcome and a linear scaling DLPNOCCSD(T) method for closed shellmore » 
Sparsegrid, reducedbasis Bayesian inversion: Nonaffineparametric nonlinear equations
We extend the reduced basis (RB) accelerated Bayesian inversion methods for affineparametric, linear operator equations which are considered in [16,17] to nonaffine, nonlinear parametric operator equations. We generalize the analysis of sparsity of parametric forward solution maps in [20] and of Bayesian inversion in [48,49] to the fully discrete setting, including Petrov–Galerkin highfidelity (“HiFi”) discretization of the forward maps. We develop adaptive, stochastic collocation based reduction methods for the efficient computation of reduced bases on the parametric solution manifold. The nonaffinity and nonlinearity with respect to (w.r.t.) the distributed, uncertain parameters and the unknown solution is collocated; specifically, by themore » 
Sequential Designs Based on Bayesian Uncertainty Quantification in Sparse Representation Surrogate Modeling
A numerical method, called OBSM, was recently proposed which employs overcomplete basis functions to achieve sparse representations. While the method can handle nonstationary response without the need of inverting large covariance matrices, it lacks the capability to quantify uncertainty in predictions. We address this issue by proposing a Bayesian approach which first imposes a normal prior on the large space of linear coefficients, then applies the MCMC algorithm to generate posterior samples for predictions. From these samples, Bayesian credible intervals can then be obtained to assess prediction uncertainty. A key application for the proposed method is the efficient construction ofmore » 
Automated bone segmentation from dental CBCT images using patchbased sparse representation and convex optimization
Purpose: Conebeam computed tomography (CBCT) is an increasingly utilized imaging modality for the diagnosis and treatment planning of the patients with craniomaxillofacial (CMF) deformities. Accurate segmentation of CBCT image is an essential step to generate threedimensional (3D) models for the diagnosis and treatment planning of the patients with CMF deformities. However, due to the poor image quality, including very low signaltonoise ratio and the widespread image artifacts such as noise, beam hardening, and inhomogeneity, it is challenging to segment the CBCT images. In this paper, the authors present a new automatic segmentation method to address these problems. Methods: To segmentmore »