2017
DOI: 10.1137/16m1077581
|View full text |Cite
|
Sign up to set email alerts
|

Spectral Upscaling for Graph Laplacian Problems with Application to Reservoir Simulation

Abstract: We extend previously developed two-level coarsening procedures for graph Laplacian problems written in a mixed saddle point form to the fully recursive multilevel case. The resulting hierarchy of discretizations gives rise to a hierarchy of upscaled models, in the sense that they provide approximation in the natural norms (in the mixed setting). This property enables us to utilize them in three applications: (i) as an accurate reduced model, (ii) as a tool in multilevel Monte Carlo simulations (in application … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
5
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 11 publications
(6 citation statements)
references
References 45 publications
1
5
0
Order By: Relevance
“…In this case, we have η w H h (cf., [5]) where H stands for the diameter of the aggregates. This fact, combined with a simple argument relating the right hand side of the discrete problem, f , and the L 2 -norm f 0 of the right hand side function f (as shown in [27]), we conclude that the first term η w D − 1 2 Au H f 0 . If we want to balance the second term with the first one, we need to choose 2q ν H (assume Chebyshev polynomial or CG used).…”
Section: Example: Linear Finite Elements For Laplace Equationsupporting
confidence: 58%
See 2 more Smart Citations
“…In this case, we have η w H h (cf., [5]) where H stands for the diameter of the aggregates. This fact, combined with a simple argument relating the right hand side of the discrete problem, f , and the L 2 -norm f 0 of the right hand side function f (as shown in [27]), we conclude that the first term η w D − 1 2 Au H f 0 . If we want to balance the second term with the first one, we need to choose 2q ν H (assume Chebyshev polynomial or CG used).…”
Section: Example: Linear Finite Elements For Laplace Equationsupporting
confidence: 58%
“…In the PDE case this challenge seems resolvable if large enough coarsening factor (H/h) is employed, whereas in the graph application for graphs with irregular degree distribution, in addition to high coarsening factor one may need to employ graph disaggregation (cf., [16]), which is left for a possible future study. Additionally, in the PDE case, it is of interest to extend the present results to other types of PDEs such as ones posed in H(curl) and H(div), which will provide alternatives to the existing AMGe upscaling methods (cf., [17], [13], and [1]).…”
Section: Remarks For Elliptic Problems With High Contrast Coefficientsmentioning
confidence: 99%
See 1 more Smart Citation
“…Other works that focus on fractured media include Long [40], Pouya and Fouché [43], and Lang et al [39]. Barker et al [65] consider the spectral graph properties of networks and developed a reservoir simulation application involving a Finite Volume discretization of a 3D heterogeneous continuum, re-interpreted as a 3D network of links.…”
Section: Introductionmentioning
confidence: 99%
“…In particular, the solver can also be applied to solve coarse saddle point problems coming from coarsening of the graph Laplacian problems, which has application in upscaling of finite volume discretization in reservoir simulations, see [6] for a detail discussion.…”
Section: Efficient Solver For Coarse Saddle Point Systemsmentioning
confidence: 99%