Iterative methods for low rank approximation of graph similarity matrices
DOI10.1016/j.laa.2011.12.004zbMath1264.65060OpenAlexW2179686847MaRDI QIDQ1940336
T. P. Cason, Paul Van Dooren, Pierre-Antoine Absil
Publication date: 6 March 2013
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2011.12.004
iterative algorithmtruncated singular value decompositiondirected graphspower methodlow-rank approximationadjacency matricessimilarity matrixnode-to-node similarityset of low-rank matricestrace maximization
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Iterative numerical methods for linear systems (65F10) Directed graphs (digraphs), tournaments (05C20) Vector spaces, linear dependence, rank, lineability (15A03)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Numerical computation of an analytic singular value decomposition of a matrix valued function
- Comparing Two Matrices by Means of Isometric Projections
- Authoritative sources in a hyperlinked environment
- Optimizing the Coupling Between Two Isometric Projections of Matrices
- Error and Perturbation Bounds for Subspaces Associated with Certain Eigenvalue Problems
- A Measure of Similarity between Graph Vertices: Applications to Synonym Extraction and Web Searching
- Limits of tangent spaces to real surfaces
- Functions of Matrices