most citedSensitivity of matrix function based network communicability measures: Computational methods and a priori bounds

1 citations · 1 across the 3 of their papers we have counts for

collaborators
Showing math.NAShow all

5 papers · 1 filter

math.NA2024

Challenges in computing matrix functions

Massimiliano Fasi, Stéphane Gaudreault, Kathryn Lund +1

This manuscript summarizes the outcome of the focus groups at "The f(A)bulous workshop on matrix functions and exponential integrators", held at the Max Planck Institute for Dynami…

math.NA2024

Polynomial Preconditioning for the Action of the Matrix Square Root and Inverse Square Root

Andreas Frommer, Gustavo Ramirez-Hidalgo, Marcel Schweitzer +1

While preconditioning is a long-standing concept to accelerate iterative methods for linear systems, generalizations to matrix functions are still in their infancy. We go a further…

math.NA2023

Analysis of stochastic probing methods for estimating the trace of functions of sparse symmetric matrices

Andreas Frommer, Michele Rinelli, Marcel Schweitzer

We consider the problem of estimating the trace of a matrix function . In certain situations, in particular if cannot be well approximated by a low-rank matrix, combin…

math.NA2023

Structured level-2 condition numbers of matrix functions

Bahar Arslan, Samuel D. Relton, Marcel Schweitzer

Matrix functions play an increasingly important role in many areas of scientific computing and engineering disciplines. In such real-world applications, algorithms working in float…

math.NA20231 cited

Sensitivity of matrix function based network communicability measures: Computational methods and a priori bounds

Marcel Schweitzer

When analyzing complex networks, an important task is the identification of those nodes which play a leading role for the overall communicability of the network. In the context of…