Analysis of directed networks via partial singular value decomposition and Gauss quadrature
DOI10.1016/J.LAA.2014.05.018zbMATH Open1295.05216OpenAlexW2141841756MaRDI QIDQ2249727FDOQ2249727
James Baglama, C. Fenu, G. Rodriguez, Lothar Reichel
Publication date: 3 July 2014
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2014.05.018
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Numerical computation of matrix exponential and similar matrix functions (65F60)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Restarted block Lanczos bidiagonalization methods
- Network analysis via partial spectral factorization and Gauss quadrature
- Block Gauss and Anti-Gauss Quadrature with Application to Networks
- Network Properties Revealed through Matrix Functions
- Networks
- Authoritative sources in a hyperlinked environment
- Augmented Implicitly Restarted Lanczos Bidiagonalization Methods
- An implicitly restarted block Lanczos bidiagonalization method using Leja shifts
- Harmonic and refined extraction methods for the singular value problem, with applications in least squares problems
- Ranking hubs and authorities using matrix functions
- Estimation of the \(L\)-curve via Lanczos bidiagonalization
- Mapping directed networks
- Quadrature rule-based bounds for functions of adjacency matrices
- A Measure of Similarity between Graph Vertices: Applications to Synonym Extraction and Web Searching
- Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
- Low-Rank Matrix Approximation Using the Lanczos Bidiagonalization Process with Applications
- Evaluating scientific products by means of citation-based models: a first analysis and validation
- Matrices, moments, and rational quadrature
- Bounds for matrix moments
- Fast matrix computations for pairwise and columnwise commute times and Katz scores
- Locally supported eigenvectors of matrices associated with connected and unweighted power-law graphs
Cited In (12)
- Performance and stability of direct methods for computing generalized inverses of the graph Laplacian
- The e-MoM approach for approximating matrix functionals
- Simplified anti-Gauss quadrature rules with applications in linear algebra
- Matrix functions in network analysis
- New block quadrature rules for the approximation of matrix functions
- GCV for Tikhonov regularization by partial SVD
- Analysis of directed networks via the matrix exponential
- Generalized block anti-Gauss quadrature rules
- Explicit deflation in Golub-Kahan-Lanczos bidiagonalization methods
- hubauth
- Approximation of the Diagonal of a Laplacian’s Pseudoinverse for Complex Network Analysis
- Bounding matrix functionals via partial global block Lanczos decomposition
Uses Software
This page was built for publication: Analysis of directed networks via partial singular value decomposition and Gauss quadrature
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2249727)
