The following pages link to CONTEST (Q24664):
Displaying 21 items.
- Accelerating the Arnoldi-type algorithm for the PageRank problem and the ProteinRank problem (Q395333) (← links)
- Approximation of functions of large matrices with Kronecker structure (Q504162) (← links)
- Quadrature rule-based bounds for functions of adjacency matrices (Q977482) (← links)
- On the exponential generating function for non-backtracking walks (Q1669018) (← links)
- A preconditioned conjugate gradient algorithm for GeneRank with application to microarray data mining (Q1944967) (← links)
- Computing the reciprocal of a \(\phi\)-function by rational approximation (Q2070289) (← links)
- Aitken's method for estimating bilinear forms arising in applications (Q2363689) (← links)
- Chebyshev acceleration of the GeneRank algorithm (Q2450052) (← links)
- Anymatrix: an extensible MATLAB matrix collection (Q2672725) (← links)
- Network Analysis via Partial Spectral Factorization and Gauss Quadrature (Q2855655) (← links)
- Aggressively Truncated Taylor Series Method for Accurate Computation of Exponentials of Essentially Nonnegative Matrices (Q2923346) (← links)
- The university of Florida sparse matrix collection (Q2989137) (← links)
- Network Properties Revealed through Matrix Functions (Q3066235) (← links)
- Models for evolving networks: with applications in telecommunication and online activities (Q3166328) (← links)
- NLEVP (Q3189663) (← links)
- A network model for polarization of political opinion (Q3303829) (← links)
- Preconditioning Linear Least-Squares Problems by Identifying a Basis Matrix (Q3449796) (← links)
- Updating and Downdating Techniques for Optimizing Network Communicability (Q3460271) (← links)
- The Deformed Graph Laplacian and Its Applications to Network Centrality Analysis (Q4604568) (← links)
- Block Matrix Formulations for Evolving Networks (Q5346757) (← links)
- A New Lower Bound on the Size of the Smallest Vertex Separator of a Graph (Q5862814) (← links)
