Computing the smallest eigenpairs of the graph Laplacian

DOI10.1007/S40324-017-0108-2zbMath1392.65087arXiv1311.1695OpenAlexW1558311178MaRDI QIDQ1742851

Luca Bergamaschi, Enrico Bozzo

Publication date: 12 April 2018

Published in: S\(\vec{\text{e}}\)MA Journal (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1311.1695

zbMATH Keywords

algorithmsnetworksgraph Laplacianeigenpair computation

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Complexity and performance of numerical algorithms (65Y20)

Related Items (3)

A Fast Hierarchically Preconditioned Eigensolver Based on Multiresolution Matrix Decomposition ⋮ Generalized Block Tuned Preconditioners for SPD Eigensolvers ⋮ Tuned preconditioners for the eigensolution of large SPD matrices arising in engineering problems

Uses Software

• JDQR
• ARPACK
• JDQZ
• JDCG
• lobpcg.m

Cites Work

• Unnamed Item
• Unnamed Item
• Parallel Rayleigh quotient optimization with FSAI-based preconditioning
• Spectra of graphs
• Generalized inverses. Theory and applications.
• Preconditioning techniques for large linear systems: A survey
• Numerical comparison of iterative eigensolvers for large sparse symmetric positive definite matrices
• Approximate inverse preconditioning in the parallel solution of sparse eigenproblems
• Toward the Optimal Preconditioned Eigensolver: Locally Optimal Block Preconditioned Conjugate Gradient Method
• Tuned preconditioners for the eigensolution of large SPD matrices arising in engineering problems
• Pursuing scalability for hypre 's conceptual interfaces
• Convergence Analysis of Iterative Solvers in Inexact Rayleigh Quotient Iteration
• Shift-Invert Arnoldi's Method with Preconditioned Iterative Solves
• Jacobi--Davidson Style QR and QZ Algorithms for the Reduction of Matrix Pencils
• Asymptotic Convergence of Conjugate Gradient Methods for the Partial Symmetric Eigenproblem
• ARPACK Users' Guide
• A Case for a Biorthogonal Jacobi--Davidson Method: Restarting and Correction Equation
• A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
• Approximations of the Generalized Inverse of the Graph Laplacian Matrix
• Combination of Jacobi–Davidson and conjugate gradients for the partial symmetric eigenproblem
• Minimizing Effective Resistance of a Graph
• A comparison of eigensolvers for large-scale 3D modal analysis using AMG-preconditioned iterative methods
• Networks

This page was built for publication: Computing the smallest eigenpairs of the graph Laplacian