sgcen

swMATH38372MaRDI QIDQ54072FDOQ54072

Author name not available (Why is that?)

Described by source

• Network analysis via partial spectral factorization and Gauss quadrature

Cited In (18)

• Centrality measures for node-weighted networks via line graphs and the matrix exponential
• Simplified anti-Gauss quadrature rules with applications in linear algebra
• Analysis of directed networks via partial singular value decomposition and Gauss quadrature
• Extended and rational Hessenberg methods for the evaluation of matrix functions
• Fast estimates for the diagonal of the inverse of large scale matrices appearing in applications
• The extended global Lanczos method, Gauss-Radau quadrature, and matrix function approximation
• Estimation of the bilinear form \(y^\ast f(A)x\) for Hermitian matrices
• New block quadrature rules for the approximation of matrix functions
• On the computation of Gauss quadrature rules for measures with a monomial denominator
• Adaptive nonnegative matrix factorization and measure comparisons for recommender systems
• Edge importance in a network via line graphs and the matrix exponential
• Computation of error bounds via generalized Gauss-Radau and Gauss-Lobatto rules
• Updating and Downdating Techniques for Optimizing Network Communicability
• Generalized averaged Gauss quadrature rules for the approximation of matrix functionals
• Generalized block anti-Gauss quadrature rules
• Bounding matrix functionals via partial global block Lanczos decomposition
• Computing performability measures in Markov chains by means of matrix functions
• On the Limiting Behavior of Parameter-Dependent Network Centrality Measures

This page was built for software: sgcen