Extension and optimization of the FIND algorithm: computing Green's and less-than Green's functions (with technical appendix)

Abstract

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(N_x^3 N_y), whereas FIND only requires O(N_x^2 N_y). 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 130x130 2D mesh down to a 40x40 mesh. These improvements make the optimized FIND algorithm even more competitive for real-life applications.

References in corpus (1)

• Two Dimensional Quantum Mechanical Modeling of Nanotransistors

Cited by in corpus (12)

• Quantum machine learning: a classical perspective
• Scalable Atomistic Simulations of Quantum Electron Transport using Empirical Pseudopotentials
• A Nested Dissection Approach to Modeling Transport in Nanodevices: Algorithms and Applications
• Revisiting Quasiparticle Scattering Interference in High-Temperature Superconductors: The Problem of Narrow Peaks
• Self-Energies and Quasiparticle Scattering Interference
• PSelInv -- A Distributed Memory Parallel Algorithm for Selected Inversion : the Symmetric Case
• Büttiker probes and the Recursive Green's Function; an efficient approach to include dissipation in general configurations
• ${\mathcal{L}}^2$ localization landscape for highly-excited states
• Enhancing the scalability and load balancing of the parallel selected inversion algorithm via tree-based asynchronous communication
• An Approximate Framework for Quantum Transport Calculation with Model Order Reduction
• Nested Dissection Solver for Transport in 3D Nano-Electronic Devices
• Sparse inversion for derivative of log determinant