2017arXiv (Cornell University)Open access

Scalable linear solvers for sparse linear systems from large-scale numerical simulations

Hui Liu, Zhangxin Chen

Open full text 2 citations

Abstract

This paper presents our work on designing scalable linear solvers for large-scale reservoir simulations. The main objective is to support implementation of parallel reservoir simulators on distributed-memory parallel systems, where MPI (Message Passing Interface) is employed for communications among computation nodes. Distributed matrix and vector modules are designed, which are the base of our parallel linear systems. Commonly-used Krylov subspace linear solvers are implemented, including the restarted GMRES method, the LGMRES method, and the BiCGSTAB method. It also has an interface to a parallel algebraic multigrid solver, BoomerAMG from HYPRE. Parallel general-purpose preconditioners and special preconditioners for reservoir simulations are also developed. The numerical experiments show that our linear solvers have excellent scalability using thousands of CPU cores.

Open-access reader

About this research paper

What this paper is about

This paper presents our work on designing scalable linear solvers for large-scale reservoir simulations. The main objective is to support implementation of parallel reservoir simulators on distributed-memory parallel systems, where MPI (Message Passing Interface) is employed for communications among computation nodes. Distributed matrix and vector modules are designed, which are the base of our parallel linear systems. Commonly-used Krylov subspace linear solvers are implemented, including the restarted GMRES method, the LGMRES method, and the BiCGSTAB method. It also has an interface to a parallel algebraic multigrid solver, BoomerAMG from HYPRE. Parallel general-purpose preconditioners and special preconditioners for reservoir simulations are also developed. The numerical experiments show that our linear solvers have excellent scalability using thousands of CPU cores.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

This paper presents our work on designing scalable linear solvers for large-scale reservoir simulations. The main objective is to support implementation of parallel reservoir simulators on distributed-memory parallel systems, where MPI (Message Passing Interface) is employed for communications among computation nodes. Distributed matrix and vector modules are designed, which are the base of our parallel linear systems. Commonly-used Krylov subspace linear solvers are implemented, including the restarted GMRES method, the LGMRES method, and the BiCGSTAB method. It also has an interface to a parallel algebraic multigrid solver, BoomerAMG from HYPRE. Parallel general-purpose preconditioners and special preconditioners for reservoir simulations are also developed. The numerical experiments show that our linear solvers have excellent scalability using thousands of CPU cores.

Key concepts: Krylov subspace, Parallel computing, Computer science, Biconjugate gradient stabilized method, Linear system, Generalized minimal residual method, Computational science, Multigrid method

Related papers

Back to paper searchBrowse research topicsOriginal source
Scalable linear solvers for sparse linear systems from large-scale numerical simulations — Research Paper | ScholarLens