Extension and optimization of the FIND algorithm: Computing Green's and less-than Green's functions

DOI10.1016/j.jcp.2011.05.027zbMath1239.65027arXiv1104.0623OpenAlexW2169657480MaRDI QIDQ422929

Eric Darve, Song Li

Publication date: 18 May 2012

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

Full work available at URL: https://arxiv.org/abs/1104.0623

zbMATH Keywords

finite difference methodGreen's functionnumerical examplesGaussian eliminationsparse matrixinverse matrixquantum transportnested dissectionrecursive Green's function methodtransport problemsFIND algorithmnanotransistor

Mathematics Subject Classification ID

Related Items (5)

Quantum machine learning: a classical perspective ⋮ Fast Sparse Selected Inversion ⋮ A nested dissection approach to modeling transport in nanodevices: Algorithms and applications ⋮ Scalable atomistic simulations of quantum electron transport using empirical pseudopotentials ⋮ An approximate framework for quantum transport calculation with model order reduction

Uses Software

• SelInv

Cites Work

• Unnamed Item
• A hybrid method for the parallel computation of Green's functions
• Computing entries of the inverse of a sparse matrix using the FIND algorithm
• Fast algorithm for extracting the diagonal of the inverse matrix with application to the electronic structure analysis of metallic systems
• A parallel graph partitioning algorithm for a message-passing multiprocessor
• A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
• General highly accurate algebraic coarsening
• Block tridiagonal matrix inversion and fast transmission calculations
• SelInv---An Algorithm for Selected Inversion of a Sparse Symmetric Matrix
• Partitioning Sparse Matrices with Eigenvectors of Graphs
• On Row and Column Orderings for Sparse Least Squares Problems
• Parallel Algorithms for Sparse Linear Systems
• On computing certain elements of the inverse of a sparse matrix
• Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
• A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations
• A Fast Solver for HSS Representations via Sparse Matrices
• Some Fast Algorithms for Sequentially Semiseparable Representations
• Direct Methods for Solving Symmetric Indefinite Systems of Linear Equations
• Nested Dissection of a Regular Finite Element Mesh

This page was built for publication: Extension and optimization of the FIND algorithm: Computing Green's and less-than Green's functions