Parallel implementation of the recursive Green's function method

Abstract

A parallel algorithm for the implementation of the recursive Green's function technique, which is extensively applied in the coherent scattering formalism, is developed. The algorithm performs a domain decomposition of the scattering region among the processors participating in the computation and calculates the Schur's complement block in the form of distributed blocks among the processors. If the method is applied recursively, thereby eliminating the processors cyclically, it is possible to arrive at a Schur's complement block of small size and compute the desired block of the Green's function matrix directly. The numerical complexity due to the longitudinal dimension of the scatterer scales linearly with the number of processors, though, the computational cost due to the processors' cyclic reduction, establishes a bottleneck to achieve efficiency 100%. The proposed algorithm is accompanied by a performance analysis for two numerical benchmarks, in which the dominant sources of computational load and parallel overhead as well as their competitive role in the efficiency of the algorithm will be demonstrated.

22 pages, 8 figures, submitted for publication to the Journal of Computational Physics

References in corpus (5)

• General Green's function formalism for transport calculations with spd-Hamiltonians and giant magnetoresistance in Co and Ni based magnetic multilayers
• Green's function technique for studying electron flow in 2D mesoscopic samples
• Ballistic quantum transport at high energies and high magnetic fields
• Geometrical enhancement of the proximity effect in quantum wires with extended superconducting tunnel contacts
• Magnetic-field dependence of transport in normal and Andreev billiards: a classical interpretation to the averaged quantum behavior

Cited by in corpus (22)

• The recursive Green's function method for graphene
• Electron density and transport in top-gated graphene nanoribbon devices: First-principles Green function algorithms for systems containing large number of atoms
• Optimal block-tridiagonalization of matrices for coherent charge transport
• Coherent transport through graphene nanoribbons in the presence of edge disorder
• Patched Green's function techniques for two dimensional systems: Electronic behaviour of bubbles and perforations in graphene
• Recursive Green's function method for multi-terminal nanostructures
• Dissipative Floquet Majorana modes in proximity-induced topological superconductors
• General Green's function formalism for layered systems: Wave function approach
• Numerical cookbook for electronic quantum transport at finite frequency
• Self-Energies and Quasiparticle Scattering Interference
• Revisiting Quasiparticle Scattering Interference in High-Temperature Superconductors: The Problem of Narrow Peaks
• Recursive Green's functions optimized for atomistic modelling of large superlattice-based devices
• Magnetoconductance switching in an array of oval quantum dots
• Tunable transmission via quantum state evolution in oval quantum dots
• Magnetic field-induced control of transport in multiterminal focusing quantum billiards
• Efficient calculation of the Green's function in scattering region for electron-transport simulations
• Current control by resonance decoupling and magnetic focusing in soft-wall billiards
• Magnetically controlled current flow in coupled-dot arrays
• Charge transfer energy and band filling effects on two-hole Auger resonances in strongly correlated systems
• Memory efficient Fock-space recursion scheme for computing many-fermion resolvents
• General method for calculating transport properties of disordered mesoscopic systems based on the nonequilibrium Green's function formalism
• Introducing Open boundary conditions in modeling nonperiodic materials and interfaces: the impact of the periodic assumption