A hybrid method for the parallel computation of Green's functions
DOI10.1016/J.JCP.2009.03.035zbMATH Open1280.82010OpenAlexW2088300196MaRDI QIDQ834057FDOQ834057
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
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
sparse matrixGreen's functionparallel computingdensity functional theoryinverse matrixquantum transportnested dissectioncyclic reduction
Transport processes in time-dependent statistical mechanics (82C70) Numerical methods for difference equations (65Q10)
Cites Work
- Title not available (Why is that?)
- Nested Dissection of a Regular Finite Element Mesh
- On computing certain elements of the inverse of a sparse matrix
- Computing entries of the inverse of a sparse matrix using the FIND algorithm
- Some Aspects of the Cyclic Reduction Algorithm for Block Tridiagonal Linear Systems
- Zur Lösung von Potentialaufgaben mit Hilfe des Differenzenverfahrens
- Block iterative methods for cyclically reduced matrix equations
- On computing the inverse of a sparse matrix
- Title not available (Why is that?)
Cited In (18)
- A fast algorithm for sparse matrix computations related to inversion
- An order \(N\) numerical method to efficiently calculate the transport properties of large systems: an algorithm optimized for sparse linear solvers
- Numerical methods for Kohn–Sham density functional theory
- Parallel implementation of the recursive Green's function method
- 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
- Finding off-diagonal entries of the inverse of a large symmetric sparse matrix
- Efficient linear-scaling quantum transport calculations on graphics processing units and applications on electron transport in graphene
- Examining the analytic structure of Green's functions: massive parallel complex integration using GPUs
- A nested dissection approach to modeling transport in nanodevices: algorithms and applications
- Recursive Green's function method for multi-terminal nanostructures
- Improved recursive Green's function formalism for quasi one-dimensional systems with realistic defects
- Block tridiagonal matrix inversion and fast transmission calculations
- Improvements on non-equilibrium and transport Green function techniques: the next-generation Transiesta
- A numerical approach to surface Green's functions via generalized eigenvalue problems
- Fast algorithms for implementation of the Green's function
- Optimal block-tridiagonalization of matrices for coherent charge transport
- Computing the full spectrum of large sparse palindromic quadratic eigenvalue problems arising from surface Green's function calculations
Uses Software
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)
