Name
Abstract | ||
|---|---|---|
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 4012328 (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. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/978-3-540-85451-7_84 | Euro-Par |
Keywords | Field | DocType |
block tri-diagonal system,efficient sparse linear solver,rev. b,parallel gaussian elimination,nearest-neighbor tight-binding method,nearest-neighbor tight-binding problems,parallel sparse linear solver,direct sparse linear package,physics community,atomic layer,renormalization method,atomistic device simulation,gaussian elimination,nearest neighbor,tight binding | Renormalization,k-nearest neighbors algorithm,Tight binding,Computer science,Parallel computing,Gaussian elimination,Linear solver,Cyclic reduction,Distributed computing | Conference |
Volume | ISSN | Citations |
5168 | 0302-9743 | 4 |
PageRank | References | Authors |
0.57 | 3 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mathieu Luisier | 1 | 56 | 8.55 |
| Gerhard Klimeck | 2 | 129 | 26.11 |
| A. Schenk | 3 | 6 | 4.24 |
| Wolfgang Fichtner | 4 | 629 | 84.99 |
| Timothy B. Boykin | 5 | 5 | 0.98 |