Performance and stability of direct methods for computing generalized inverses of the graph Laplacian
From MaRDI portal
Publication:2208933
DOI10.1553/etna_vol53s439zbMath1472.65052OpenAlexW3035161296MaRDI QIDQ2208933
Michele Benzi, Paraskevi Fika, Marilena Mitrouli
Publication date: 28 October 2020
Published in: ETNA. Electronic Transactions on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: http://etna.mcs.kent.edu/volumes/2011-2020/vol53/abstract.php?vol=53&pages=439-458
Computational methods for sparse matrices (65F50) Theory of matrix inversion and generalized inverses (15A09) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- LU decomposition of M-matrices by elimination without pivoting
- A direct projection method for Markov chains
- A generalized inverse for graphs with absorption
- The computation of the mean first passage times for Markov chains
- Laplacians and the Cheeger inequality for directed graphs
- Using Gauss-Jordan elimination to compute the index, generalized nullspaces, and Drazin inverse
- A note on the stability of Gauss-Jordan elimination for diagonally dominant matrices
- Relative-error bounds for the LU decomposition via the GTH algorithm
- Analysis of directed networks via partial singular value decomposition and Gauss quadrature
- Disease invasion on community networks with environmental pathogen movement
- Gauss-Jordan elimination method for computing all types of generalized inverses related to the {1}-inverse
- Graphs with absorption: numerical methods for the absorption inverse and the computation of centrality measures
- Regenerative Analysis and Steady State Distributions for Markov Chains
- Distances in Weighted Trees and Group Inverse of Laplacian Matrices
This page was built for publication: Performance and stability of direct methods for computing generalized inverses of the graph Laplacian
