A Parallel Sparse Linear Solver for Nearest-Neighbor Tight-Binding Problems
This paper describes an efficient sparse linear solver for block tri-diagonal systems arising from atomistic device simulation based on the nearest-neighbor tight-binding method. The algorithm is a parallel Gaussian elimination of blocks corresponding to atomic layers instead of single elements. It is known in the physics community as the renormalization method introduced in 1989 by Grosso et al, [Phys. Rev. B 40 12328 (1989)]. Here, we describe in details the functionality of the algorithm and we show that it is faster than direct sparse linear packages like Pardiso, MUMPS or SuperLU_DIST and that it scales well up to 512 processors.
KeywordsAtomic Layer Gaussian Elimination Diagonal Block Cyclic Reduction Speed Improvement
Unable to display preview. Download preview PDF.