A hybrid method for the parallel computation of Green's functions

DOI10.1016/j.jcp.2009.03.035zbMath1280.82010OpenAlexW2088300196MaRDI QIDQ834057

Per Christian Hansen, Hans Henrik B. Sørensen, Stig Skelboe, Kurt Stokbro, Song Li, Eric Darve, Dan Erik Petersen

Publication date: 19 August 2009

Published in: Journal of Computational Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcp.2009.03.035

zbMATH Keywords

Green's functionparallel computingsparse matrixinverse matrixdensity functional theorycyclic reductionquantum transportnested dissection

Mathematics Subject Classification ID

Related Items (6)

Improved recursive Green's function formalism for quasi one-dimensional systems with realistic defects ⋮ A fast algorithm for sparse matrix computations related to inversion ⋮ A nested dissection approach to modeling transport in nanodevices: Algorithms and applications ⋮ Extension and optimization of the FIND algorithm: Computing Green's and less-than Green's functions ⋮ Finding off‐diagonal entries of the inverse of a large symmetric sparse matrix ⋮ Numerical methods for Kohn–Sham density functional theory

Uses Software

• transiesta

Cites Work

• Unnamed Item
• Unnamed Item
• Computing entries of the inverse of a sparse matrix using the FIND algorithm
• Block iterative methods for cyclically reduced matrix equations
• On computing the inverse of a sparse matrix
• On computing certain elements of the inverse of a sparse matrix
• Some Aspects of the Cyclic Reduction Algorithm for Block Tridiagonal Linear Systems
• Nested Dissection of a Regular Finite Element Mesh
• Zur Lösung von Potentialaufgaben mit Hilfe des Differenzenverfahrens

This page was built for publication: A hybrid method for the parallel computation of Green's functions