Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao zbMATH Openarrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
zbMATH Open
Article
Data sources: zbMATH Open
SIAM Journal on Numerical Analysis
Article . 1974 . Peer-reviewed
Data sources: Crossref
versions View all 2 versions
addClaim

Taylor-Like Remainder Formulas for Interpolation by Arbitrary Linear Functionals

Taylor-like remainder formulas for interpolation by arbitrary linear functionals
Authors: Chalmers, Bruce L.; Metcalf, Frederic T.;

Taylor-Like Remainder Formulas for Interpolation by Arbitrary Linear Functionals

Abstract

Let $\mathcal{L}^i (i = 1,2, \cdots ,n)$ denote n linear functionals on $C^n [a,b]$, $f \in C^n [a,b]$, $p \in P_{n - 1} $ (the space of polynomials of degree $ < n$), where $\mathcal{L}^i p = \mathcal{L}^i f$. Then one has the formula $| {f(x) - p(x)} | \leqq U(x)\| {f^{(n)} } \|_\infty $, where U is the upper envelope of all functions $R \in C^n [a,b]$ such that $\left\| {R^{(n)} } \right\|_\infty \leqq 1 $ and $\mathcal{L}^i R = 0$. $U(x)$ can be determined for each x to be the total variation of a certain measure calculated directly from the $\mathcal{L}^i $. One can, however, bypass this procedure and still obtain easily calculable formulas for $V(x)$, an upper bound for $U(x)$. In addition, situations in which $f(x) - p(x) = L(x)f^{(n)} (\xi _x )$, $\xi _x \in [a,b]$, will be investigated, where L is the unique element of $C^n [a,b]$ such that $L^{(n)} \equiv 1$ and $\mathcal{L}^{(i)} L = 0$.

Keywords

Interpolation in approximation theory

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    2
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
2
Average
Average
Average
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!