Extension and optimization of the FIND algorithm: Computing Green's and less-than Green's functions

JOURNAL OF COMPUTATIONAL PHYSICS

卷:231

Article

Li, S.¹  Darve, E.^1,2 

[1] Stanford Univ, Inst Computat & Math Engn, Stanford, CA 94305 USA

[2] Stanford Univ, Dept Mech Engn, Stanford, CA 94305 USA

关键词: Nested dissection;    Green's function;    NEGF;    Nanotransistor;    Gaussian elimination;    Sparse matrix;    Inverse matrix;    Recursive Green's function method;   

DOI  :  10.1016/j.jcp.2011.05.027

来源: Elsevier

【 摘 要 】

The FIND algorithm is a fast algorithm designed to calculate certain entries of the inverse of a sparse matrix. Such calculation is critical in many applications, e.g., quantum transport in nano-devices. We extended the algorithm to other matrix inverse related calculations. Those are required for example to calculate the less-than Green's function and the current density through the device. For a 2D device discretized as an N-x x N-y mesh, the best known algorithms have a running time of O((NxNy)-N-3), whereas FIND only requires O((NxNy)-N-2). Even though this complexity has been reduced by an order of magnitude, the matrix inverse calculation is still the most time consuming part in the simulation of transport problems. We could not reduce the order of complexity, but we were able to significantly reduce the constant factor involved in the computation cost. By exploiting the sparsity and symmetry, the size of the problem beyond which FIND is faster than other methods typically decreases from a 130 x 130 2D mesh down to a 40 x 40 mesh. These improvements make the optimized FIND algorithm even more competitive for real-life applications. (C) 2011 Elsevier Inc. All rights reserved.

【 授权许可】

Free