A fast algorithm for sparse matrix computations related to inversion
From MaRDI portal
Publication:401614
DOI10.1016/j.jcp.2013.01.036zbMath1297.65030OpenAlexW2090917733MaRDI QIDQ401614
Publication date: 27 August 2014
Published in: Journal of Computational Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcp.2013.01.036
algorithmdecompositionGreen's functionGaussian eliminationsparse matrixinversenested dissectionelimination tree
Computational methods for sparse matrices (65F50) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
Improved recursive Green's function formalism for quasi one-dimensional systems with realistic defects, A nested dissection approach to modeling transport in nanodevices: Algorithms and applications
Uses Software
Cites Work
- A two-dimensional domain decomposition technique for the simulation of quantum-scale devices
- 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
- SelInv---An Algorithm for Selected Inversion of a Sparse Symmetric Matrix
- Direct Methods for Sparse Linear Systems
- The Role of Elimination Trees in Sparse Factorization
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- On Row and Column Orderings for Sparse Least Squares Problems
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- Equivalent Sparse Matrix Reordering by Elimination Tree Rotations
- Inverse Iteration, Ill-Conditioned Equations and Newton’s Method
- Parallel Algorithms for Sparse Linear Systems
- On George’s Nested Dissection Method
- An Automatic Nested Dissection Algorithm for Irregular Finite Element Problems
- Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers
- The Calculation of the Eigenvectors of a General Complex Matrix by Inverse Iteration
- Nested Dissection of a Regular Finite Element Mesh
