Computing Markov functions of Toeplitz matrices

by   Bernhard Beckermann, et al.

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 1-r/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.



page 1

page 2

page 3

page 4


Matrix functions via linear systems built from continued fractions

A widely used approach to compute the action f(A)v of a matrix function ...

Improvements of Polya Upper Bound for Cumulative Standard Normal Distribution and Related Functions

Although there is an extensive literature on the upper bound for cumulat...

Network Function Computation With Different Secure Conditions

In this paper, we investigate function computation problems under differ...

On the Convergence Rate of Variants of the Conjugate Gradient Algorithm in Finite Precision Arithmetic

We consider three mathematically equivalent variants of the conjugate gr...

Interpolating the Trace of the Inverse of Matrix 𝐀 + t 𝐁

We develop heuristic interpolation methods for the function t ↦trace( (𝐀...

Identity Testing from High Powers of Polynomials of Large Degree over Finite Fields

We consider the problem of identity testing of two "hidden" monic polyno...

Global Convergence of Hessenberg Shifted QR II: Numerical Stability

We develop a framework for proving rapid convergence of shifted QR algor...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.