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

DOI10.1016/J.JCP.2009.03.035MaRDI QIDQ834057zbMATH OpenOpenAlexFDO

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

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

sparse matrixGreen's functionparallel computingdensity functional theoryinverse matrixquantum transportnested dissectioncyclic reduction

Mathematics Subject Classification ID

Transport processes in time-dependent statistical mechanics (82C70) Numerical methods for difference equations (65Q10)

Recommendations

• Parallel implementation of the recursive Green's function method
• Optimal block-tridiagonalization of matrices for coherent charge transport
• A nested dissection approach to modeling transport in nanodevices: algorithms and applications
• An order \(N\) numerical method to efficiently calculate the transport properties of large systems: an algorithm optimized for sparse linear solvers
• Improvements on non-equilibrium and transport Green function techniques: the next-generation Transiesta

Cites work

• scientific article; zbMATH DE number 1304513 (Why is no real title available?)
• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• Block iterative methods for cyclically reduced matrix equations
• Computing entries of the inverse of a sparse matrix using the FIND algorithm
• Nested Dissection of a Regular Finite Element Mesh
• On computing certain elements of the inverse of a sparse matrix
• On computing the inverse of a sparse matrix
• Some Aspects of the Cyclic Reduction Algorithm for Block Tridiagonal Linear Systems
• Zur Lösung von Potentialaufgaben mit Hilfe des Differenzenverfahrens

Cited in

(18)

• Fast algorithms for implementation of the Green's function
• A nested dissection approach to modeling transport in nanodevices: algorithms and applications
• Optimal block-tridiagonalization of matrices for coherent charge transport
• Numerical methods for Kohn–Sham density functional theory
• Extension and optimization of the FIND algorithm: Computing Green's and less-than Green's functions
• A computationally cost-effective interleaving method for atomistic non-equilibrium Green's function simulation
• Improvements on non-equilibrium and transport Green function techniques: the next-generation Transiesta
• A fast algorithm for sparse matrix computations related to inversion
• Recursive Green's function method for multi-terminal nanostructures
• Examining the analytic structure of Green's functions: massive parallel complex integration using GPUs
• An order \(N\) numerical method to efficiently calculate the transport properties of large systems: an algorithm optimized for sparse linear solvers
• Improved recursive Green's function formalism for quasi one-dimensional systems with realistic defects
• Efficient linear-scaling quantum transport calculations on graphics processing units and applications on electron transport in graphene
• Parallel implementation of the recursive Green's function method
• A numerical approach to surface Green's functions via generalized eigenvalue problems
• Finding off-diagonal entries of the inverse of a large symmetric sparse matrix
• Computing the full spectrum of large sparse palindromic quadratic eigenvalue problems arising from surface Green's function calculations
• Block tridiagonal matrix inversion and fast transmission calculations

Describes a project that uses

Uses Software

• transiesta

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q834057)