By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Scientific Computing

Previous Article
Applying Automated Memory Analysis to Improve Iterative Algorithms
In this paper, we describe automated memory analysis, a technique to improve the memory efficiency of a sparse linear iterative solver. Our automated memory analysis uses a language processor to pred...

You are not logged in to this journal. Log in

Block Locally Optimal Preconditioned Eigenvalue Xolvers (BLOPEX) in Hypre and PETSc

SIAM J. Sci. Comput. Volume 29, Issue 5, pp. 2224-2239 (2007)

Published September 28, 2007
Buy This PDF   (US$25)
Download PDF (203 kB) View Cart

We describe our software package Block Locally Optimal Preconditioned Eigenvalue Xolvers (BLOPEX) recently publicly released. BLOPEX is available as a stand-alone serial library, as an external package to PETSc (Portable, Extensible Toolkit for Scientific Computation, a general purpose suite of tools developed by Argonne National Laboratory for the scalable solution of partial differential equations and related problems), and is also built into hypre (High Performance Preconditioners, a scalable linear solvers package developed by Lawrence Livermore National Laboratory). The present BLOPEX release includes only one solver—the Locally Optimal Block Preconditioned Conjugate Gradient (LOBPCG) method for symmetric eigenvalue problems. hypre provides users with advanced high-quality parallel multigrid preconditioners for linear systems. With BLOPEX, the same preconditioners can now be efficiently used for symmetric eigenvalue problems. PETSc facilitates the integration of independently developed application modules, with strict attention to component interoperability, and makes BLOPEX extremely easy to compile and use with preconditioners that are available via PETSc. We present the LOBPCG algorithm in BLOPEX for hypre and PETSc. We demonstrate numerically the scalability of BLOPEX by testing it on a number of distributed and shared memory parallel systems, including a Beowulf system, SUN Fire 880, an AMD dual-core Opteron workstation, and IBM BlueGene/L supercomputer, using PETSc domain decomposition and hypre multigrid preconditioning. We test BLOPEX on a model problem, the standard 7-point finite-difference approximation of the 3-D Laplacian, with the problem size in the range of $10^5$–$10^8$.

©2007 Society for Industrial and Applied Mathematics
History: Received May 31, 2006; accepted July 2, 2007; published September 28, 2007
Permalink: http://dx.doi.org/10.1137/060661624

KEYWORDS and AMS

PUBLICATION DATA

ISSN:
1064-8275 (print)   1095-7197 (online)
Publisher:
AIP is a member of CrossRef SIAM

REFERENCES (30)

For access to fully linked references, you need to log in. For access to fully linked references, you need to Log in.

CITING ARTICLES

For access to citing articles, you need to log in.
For access to citing articles, you need to Log in.