Spectral Upscaling for Graph Laplacian Problems with Application to Reservoir Simulation
Andrew T. Barker, Chak Shing Lee, Panayot S. Vassilevski · SIAM Journal on Scientific Computing · 2017
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 [P. S. Vassilevski and L. T. Zikatanov, Numer. Linear Algebra Appl., 21 (2014), pp. 297--315] 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 [P. Jenny, S. H. Lee, and H. A. Tchelepi, J. Comput. Phys., 187 (2003), pp. 47--67] 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.