Optimal interpolation of convergent algebraic series

Let , –1<x1<...<xn<1. Denote , t∈(–1,1). Given a function f∈W we try to recover f(ζ) at fixed point ζ∈(–1,1) by an algorithm A on the basis of the information f(x1),...,f(xn). We find the intrinsic error of recovery .

Saved in:
Bibliographic Details
Published inNumerical algorithms Vol. 44; no. 3; pp. 273 - 279
Main Author Sidorov, S. P.
Format Journal Article
LanguageEnglish
Published New York Springer Nature B.V 01.03.2007
Subjects
Algorithms
Fixed points (mathematics)
Interpolation
Online AccessGet full text

Cover

More Information
Summary:Let , –1<x1<...<xn<1. Denote , t∈(–1,1). Given a function f∈W we try to recover f(ζ) at fixed point ζ∈(–1,1) by an algorithm A on the basis of the information f(x1),...,f(xn). We find the intrinsic error of recovery .
ISSN:1017-1398
1572-9265
DOI:10.1007/s11075-007-9100-8