Cited in
(33)- The University of Florida sparse matrix collection
- NESSIE
- Chebyshev acceleration of the GeneRank algorithm
- Block matrix formulations for evolving networks
- A new lower bound on the size of the smallest vertex separator of a graph
- Network properties revealed through matrix functions
- Accelerating the Arnoldi-type algorithm for the PageRank problem and the ProteinRank problem
- Quadrature rule-based bounds for functions of adjacency matrices
- Anymatrix: an extensible MATLAB matrix collection
- Aitken's method for estimating bilinear forms arising in applications
- The deformed graph Laplacian and its applications to network centrality analysis
- Algorithm 694
- Hadamard
- testmatrix
- DOTmark
- YM11
- Temporal_Eigenvector_Centrality
- MMQ Toolbox
- GeneRank
- Updating and downdating techniques for optimizing network communicability
- Network analysis via partial spectral factorization and Gauss quadrature
- A network model for polarization of political opinion
- sgcen
- NLEVP, a collection of nonlinear eigenvalue problems
- Matrix Depot
- anymatrix
- Aggressively truncated Taylor series method for accurate computation of exponentials of essentially nonnegative matrices
- Computing the reciprocal of a \(\phi\)-function by rational approximation
- Approximation of functions of large matrices with Kronecker structure
- On the exponential generating function for non-backtracking walks
- Preconditioning linear least-squares problems by identifying a basis matrix
- Models for evolving networks: with applications in telecommunication and online activities
- A preconditioned conjugate gradient algorithm for GeneRank with application to microarray data mining
This page was built for software: CONTEST
