RT Journal Article
T1 BCYCLIC: A parallel block tridiagonal matrix cyclic solver
A1 Hirshman, S. P.
A1 Perumalla, K. S.
A1 Lynch, V. E.
A1 Sánchez Fernández, Luis Raúl
AB A block tridiagonal matrix is factored with minimal fill-in using a cyclic reduction algorithm that is easily parallelized. Storage of the factored blocks allows the application of the inverse to multiple right-hand sides which may not be known at factorization time. Scalability with the number of block rows is achieved with cyclic reduction, while scalability with the block size is achieved using multithreaded routines (OpenMP, GotoBLAS) for block matrix manipulation. This dual scalability is a noteworthy feature of this new solver, as well as its ability to efficiently handle arbitrary (non-powers-of-2) block row and processor numbers. Comparison with a state-of-the art parallel sparse solver is presented. It is expected that this new solver will allow many physical applications to optimally use the parallel resources on current supercomputers. Example usage of the solver in magneto-hydrodynamic (MHD), three-dimensional equilibrium solvers for high-temperature fusion plasmas is cited.
PB Elsevier
SN 0021-9991
YR 2010
FD 2010-09
LK https://hdl.handle.net/10016/8910
UL https://hdl.handle.net/10016/8910
LA eng
NO 13 pages, 6 figures.
NO This research has been sponsored by the US Department of Energy under Contract DE-AC05-00OR22725 with UT-Battelle, LLC. This research used resources of the National Center for Computational Sciences at Oak Ridge National Laboratory, which is supported by the Office of Science of the Department of Energy under Contract DE-AC05-00OR22725.
DS e-Archivo
RD 19 may. 2024