Cortinovis, AliceKressner, DanielMassei, Stefano2022-03-282022-03-282022-03-282022-01-0110.1137/21M1432594https://infoscience.epfl.ch/handle/20.500.14299/186613WOS:000759673100006This work is concerned with approximating matrix functions for banded matrices, hierarchically semiseparable matrices, and related structures. We develop a new divide-and-conquer method based on (rational) Krylov subspace methods for performing low-rank updates of matrix functions. Our convergence analysis of the newly proposed method proceeds by establishing relations to best polynomial and rational approximation. When only the trace or the diagonal of the matrix function is of interest, we demonstrate---in practice and in theory---that convergence can be faster. For the special case of a banded matrix, we show that the divide-and-conquer method reduces to a much simpler algorithm, which proceeds by computing matrix functions of small submatrices. Numerical experiments confirm the effectiveness of the newly developed algorithms for computing large-scale matrix functions from a wide variety of applications.Mathematics, AppliedMathematicskey wordsmatrix functionbanded matrixhierarchically semiseparable matrixkrylov sub-space methoddivide-and-conquer algorithmdecay propertiesspectral projectorsfast computationboundsapproximationalgorithmsequationsinversetext::journal::journal article::research article