EUVIMEDEUVIMED entdecken
Crossref

Computing Functions of Symmetric Hierarchically Semiseparable Matrices

Angelo A. Casulli, Daniel Kressner, Leonardo Robol

SIAM Journal on Matrix Analysis and Applications · 31.12.2024 · 45 (4) · 2314-2338

DOI: 10.1137/24m1642354 ↗

Kurz gefasst

Fachartikel in der Zeitschrift SIAM Journal on Matrix Analysis and Applications, online erschienen am 02.12.2024. Verfasst von Angelo A. Casulli und 2 weiteren Autor:innen. Die Arbeit wurde bisher 5-mal zitiert (Crossref) und nennt 28 Literaturangaben. Gefördert von: National Research Center in High Performance Computing, Big Data and Quantum Computing, Ministero dell’Istruzione, dell’Università e della Ricerca.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The aim of this work is to develop a fast algorithm for approximating the matrix function [Formula: see text] of a square matrix [Formula: see text] that is symmetric and has hierarchically semiseparable (HSS) structure. Appearing in a wide variety of applications, often in the context of discretized (fractional) differential and integral operators, HSS matrices have a number of attractive properties facilitating the development of fast algorithms. In this work, we use an unconventional telescopic decomposition of [Formula: see text], inspired by recent work of Levitt and Martinsson on approximating an HSS matrix from matrix-vector products with a few random vectors. This telescopic decomposition allows us to approximate [Formula: see text] by recursively performing low-rank updates with rational Krylov subspaces while keeping the size of the matrices involved in the rational Krylov subspaces small. In particular, no large-scale linear system needs to be solved, which yields favorable complexity estimates and reduced execution times compared to existing methods, including an existing divide-and-conquer strategy. The advantages of our newly proposed algorithms are demonstrated for a number of examples from the literature, featuring the exponential, the inverse square root, and the sign function of a matrix. For the special case of matrix inversion, our algorithm reduces to a procedure previously proposed by Gillman, Young, and Martinsson [ Front. Math. China, 7 (2012), pp. 217–247].

Förderung

  • National Research Center in High Performance Computing, Big Data and Quantum Computing
  • Ministero dell’Istruzione, dell’Università e della Ricerca

Zitieren

APA

Casulli, A. A., Kressner, D., & Robol, L. (2024). Computing Functions of Symmetric Hierarchically Semiseparable Matrices. SIAM Journal on Matrix Analysis and Applications, 45(4), 2314-2338. https://doi.org/10.1137/24m1642354

Vancouver

Casulli AA, Kressner D, Robol L. Computing Functions of Symmetric Hierarchically Semiseparable Matrices. SIAM Journal on Matrix Analysis and Applications. 2024;45(4):2314-2338. doi:10.1137/24m1642354

BibTeX
@article{Casulli2024,
  author = {Casulli, Angelo A. and Kressner, Daniel and Robol, Leonardo},
  title = {Computing Functions of Symmetric Hierarchically Semiseparable Matrices},
  journal = {SIAM Journal on Matrix Analysis and Applications},
  year = {2024},
  volume = {45},
  number = {4},
  pages = {2314--2338},
  doi = {10.1137/24m1642354}
}
Kostenlos starten →