KIT | KIT-Bibliothek | Impressum | Datenschutz

A Chebychev method for matrix function approximation

Eckhardt, Daniel 1; Grimm, Volker ORCID iD icon 1; Hochbruck, Marlis 1
1 Institut für Angewandte und Numerische Mathematik (IANM), Karlsruher Institut für Technologie (KIT)

Abstract:

We present a Chebyshev-based method for approximating matrix functions or products of matrix functions with vectors. Our main interest is in matrix functions that arise in exponential integrators. The approach builds upon the construction of a Faber expansion of the function on an ellipse that encloses the field of values of the matrix. We derive error bounds for the proposed approximations and provide an efficient residual-based error estimator for the product of a matrix function with a vector, that can be computed efficiently using short recurrences. Since Faber polynomials rely on a priori information on the spectrum of the field of values of the matrix, we propose a novel algorithm to determine a suitable ellipse from appropriate Ritz values. Numerical examples demonstrate the effectiveness of the proposed method.


Volltext §
DOI: 10.5445/IR/1000193370
Veröffentlicht am 19.05.2026
Cover der Publikation
Zugehörige Institution(en) am KIT Institut für Angewandte und Numerische Mathematik (IANM)
Sonderforschungsbereich 1173 (SFB 1173)
Publikationstyp Forschungsbericht/Preprint
Publikationsmonat/-jahr 05.2026
Sprache Englisch
Identifikator ISSN: 2365-662X
KITopen-ID: 1000193370
Verlag Karlsruher Institut für Technologie (KIT)
Umfang 28 S.
Serie CRC 1173 Preprint ; 2026/17
Projektinformation SFB 1173, 258734477 (DFG, DFG KOORD, SFB 1173/3)
Externe Relationen Siehe auch
Forschungsdaten/Software
Schlagwörter Krylov subspace methods, Chebyshev, Faber, matrix functions, exponential integrators, residuals, Arnoldi algorithm, error estimation
KIT – Die Universität in der Helmholtz-Gemeinschaft
KITopen Landing Page