A robust and scalable multi-level domain decomposition preconditioner for multi-core architecture with large number of cores
DOI10.1016/J.CAM.2019.112614zbMath1503.65308OpenAlexW2991006987WikidataQ126769912 ScholiaQ126769912MaRDI QIDQ1989214
Publication date: 24 April 2020
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2019.112614
domain decomposition methodsreservoir simulationparallel computinglinear algebraruntime systemsmulti-core architecture
Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Numerical algorithms for specific classes of architectures (65Y10) Preconditioners for iterative methods (65F08)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extending OpenMP to survive the heterogeneous multi-core era
- Comparison of two-level preconditioners derived from deflation, domain decomposition and multigrid methods
- A robust two-level domain decomposition preconditioner for systems of PDEs
- Discretization on non-orthogonal, quadrilateral grids for inhomogeneous, anisotropic media
- Gradient schemes: Generic tools for the numerical analysis of diffusion equations
- Nonoverlapping Schwarz algorithm for solving two-dimensional m-DDFV schemes
- An Introduction to Domain Decomposition Methods
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Fine-Grained Parallel Incomplete LU Factorization
- A UNIFIED APPROACH TO MIMETIC FINITE DIFFERENCE, HYBRID FINITE VOLUME AND MIXED FINITE VOLUME METHODS
This page was built for publication: A robust and scalable multi-level domain decomposition preconditioner for multi-core architecture with large number of cores
