A nested dissection approach to modeling transport in nanodevices: Algorithms and applications
From MaRDI portal
Publication:2952324
DOI10.1002/nme.4518zbMath1352.65133arXiv1305.1070OpenAlexW2127070219MaRDI QIDQ2952324
No author found.
Publication date: 30 December 2016
Published in: International Journal for Numerical Methods in Engineering (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1305.1070
designGreen's functionstunnelingnumerical simulationquantum transportgraphenenanotechnologysuperlatticenanomaterialsnanotransistordevice modeling
Computational methods for sparse matrices (65F50) Quantum equilibrium statistical mechanics (general) (82B10)
Related Items (2)
Improvements on non-equilibrium and transport Green function techniques: the next-generation Transiesta ⋮ An approximate framework for quantum transport calculation with model order reduction
Uses Software
Cites Work
- A fast algorithm for sparse matrix computations related to inversion
- Extension and optimization of the FIND algorithm: Computing Green's and less-than Green's functions
- 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
- SelInv---An Algorithm for Selected Inversion of a Sparse Symmetric Matrix
- On computing certain elements of the inverse of a sparse matrix
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- Nested Dissection of a Regular Finite Element Mesh
This page was built for publication: A nested dissection approach to modeling transport in nanodevices: Algorithms and applications
