FIND算法的扩展与优化:计算格林函数和小于格林函数(含技术附录)
Extension and optimization of the FIND algorithm: computing Green's and less-than Green's functions (with technical appendix)
AI总结:
本文扩展了FIND算法以计算稀疏矩阵逆的相关量,并通过利用稀疏性和对称性显著降低了计算成本中的常数因子,使优化后的FIND算法在更小规模问题上优于其他方法。
摘要:
FIND算法是一种快速算法,旨在计算稀疏矩阵逆的某些条目。这种计算在许多应用中至关重要,例如纳米器件中的量子输运。我们将该算法扩展到其他与矩阵逆相关的计算中。这些计算是例如计算小于格林函数和通过器件的电流密度所必需的。对于一个离散化为N_x x N_y网格的二维器件,已知最佳算法的运行时间为O(N_x^3 N_y),而FIND仅需O(N_x^2 N_y)。尽管复杂度降低了一个数量级,但矩阵逆计算仍然是输运问题模拟中最耗时的部分。我们无法降低复杂度的阶数,但能够显著减少计算成本中涉及的常数因子。通过利用稀疏性和对称性,FIND比其他方法更快的问题规模通常从130x130二维网格下降到40x40网格。这些改进使得优化后的FIND算法在实际应用中更具竞争力。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。