On the rational approximation of Markov functions, with applications to the computation of Markov functions of Toeplitz matrices

From MaRDI portal
Publication:2163448

DOI10.1007/S11075-022-01256-4zbMATH Open1497.65081arXiv2106.05098OpenAlexW4226145158WikidataQ114224286 ScholiaQ114224286MaRDI QIDQ2163448FDOQ2163448


Authors: Yanyan Li Edit this on Wikidata


Publication date: 10 August 2022

Published in: Numerical Algorithms (Search for Journal in Brave)

Abstract: We investigate the problem of approximating the matrix function f(A) by r(A), with f a Markov function, r a rational interpolant of f, and A a symmetric Toeplitz matrix. In a first step, we obtain a new upper bound for the relative interpolation error 1r/f on the spectral interval of A. By minimizing this upper bound over all interpolation points, we obtain a new, simple and sharp a priori bound for the relative interpolation error. We then consider three different approaches of representing and computing the rational interpolant r. Theoretical and numerical evidence is given that any of these methods for a scalar argument allows to achieve high precision, even in the presence of finite precision arithmetic. We finally investigate the problem of efficiently evaluating r(A), where it turns out that the relative error for a matrix argument is only small if we use a partial fraction decomposition for r following Antoulas and Mayo. An important role is played by a new stopping criterion which ensures to automatically find the degree of r leading to a small error, even in presence of finite precision arithmetic.


Full work available at URL: https://arxiv.org/abs/2106.05098




Recommendations




Cites Work


Cited In (5)

Uses Software





This page was built for publication: On the rational approximation of Markov functions, with applications to the computation of Markov functions of Toeplitz matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2163448)