Spectral Upscaling for Graph Laplacian Problems with Application to Reservoir Simulation
- Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
- Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Portland State Univ., Portland, OR (United States)
Here, we consider coarsening procedures for graph Laplacian problems written in a mixed saddle-point form. In that form, in addition to the original (vertex) degrees of freedom (dofs), we also have edge degrees of freedom. We extend previously developed aggregation-based coarsening procedures applied to both sets of dofs to now allow more than one coarse vertex dof per aggregate. Those dofs are selected as certain eigenvectors of local graph Laplacians associated with each aggregate. Additionally, we coarsen the edge dofs by using traces of the discrete gradients of the already constructed coarse vertex dofs. These traces are defined on the interface edges that connect any two adjacent aggregates. The overall procedure is a modification of the spectral upscaling procedure developed in for the mixed finite element discretization of diffusion type PDEs which has the important property of maintaining inf-sup stability on coarse levels and having provable approximation properties. We consider applications to partitioning a general graph and to a finite volume discretization interpreted as a graph Laplacian, developing consistent and accurate coarse-scale models of a fine-scale problem.
- Research Organization:
- Lawrence Livermore National Laboratory (LLNL), Livermore, CA (United States)
- Sponsoring Organization:
- USDOE
- Grant/Contract Number:
- AC52-07NA27344
- OSTI ID:
- 1438732
- Report Number(s):
- LLNL-JRNL-693123
- Journal Information:
- SIAM Journal on Scientific Computing, Vol. 39, Issue 5; ISSN 1064-8275
- Publisher:
- SIAMCopyright Statement
- Country of Publication:
- United States
- Language:
- English
Web of Science
Similar Records
Upscaling of Mixed Finite Element Discretization Problems by the Spectral AMGe Method
Commuting projections on graphs