pith. sign in

arxiv: 1701.05913 · v1 · pith:KSCJKMUDnew · submitted 2017-01-20 · 💻 cs.MS

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

classification 💻 cs.MS
keywords linearparallelsolversmethodreservoirsimulationssystemsinterface
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.