An Estimate of Approximation of a Matrix-Valued Function by an Interpolation Polynomial

2020

Full text Open access: Gold Metadata (CSL-JSON)
DOI 10.32523/2077-9879-2020-11-1-86-94
Data confidence 70 medium
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

Let A be a square complex matrix; z1, . . . , zn ∈ C be (possibly repetitive) points of interpolation; f be a function analytic in a neighborhood of the convex hull of the union of the spectrum of A and the points z1, . . . , zn; and p be the interpolation polynomial of f constructed by the points z1, . . . , zn. It is proved that under these assumptions ‖f(A)− p(A)‖ ≤ 1 n! max t∈[0,1] µ∈co{z1,z2,...,zn} ∥∥Ω(A)f (n) ( (1− t)µ1 + tA )∥∥, where Ω(z) = ∏n k=1(z − zk) and the symbol co means the convex hull.