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 Journal of Mathemati...arrow_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
Journal of Mathematical Sciences
Article . 1997 . Peer-reviewed
License: Springer TDM
Data sources: Crossref
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
Journal of Mathematical Sciences
Article . 1997 . Peer-reviewed
License: Springer TDM
Data sources: Crossref
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
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
versions View all 4 versions
addClaim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

Polynomial interpolation of operators

Authors: V. V. Khlobystov; V. L. Makarov;

Polynomial interpolation of operators

Abstract

This is the second part of the article under the same title. For the first one see \textit{V. L. Makarov} and \textit{V. V. Khlobystov} [J. Math. Sci., New York 84, No. 4, 1244-1290 (1997); translation from Obchisl. Prykl. Mat. 78, 55-133 (1994; Zbl 0909.41004))] (see also \textit{E. F. Kashpur, V. L. Makarov} and \textit{V. V. Khlobystov} [J. Math. Sci., New York 84, No. 4, 1233-1239 (1997); translation from Obchisl. Prykl. Mat. 78, 38-48 (1994)]). In this article the authors investigate the polynomial operator interpolation problem in an abstract vector space. Necessary and sufficient conditions of solvability of the problem in the general case are obtained. Existence of the Hermite type operator polynomial are proved in the case of the Hilbert space. Interpolation operator formulas are proposed which describe the set of all interpolators in the correspondent space as well as the subset of polynomials which preserve the operator polynomials of the correspondent degree. Estimate of accuracy of interpolation in the metric of the operator space with a norm is obtained. Convergence of the operator interpolation process for the polynomial operators is proved. Examples of application of the proposed operator interpolation method to some applied problem are proposed. The results proposed by the authors generalize the correspondent results by \textit{W. A. Porter} [SIAM J. Math. Anal. 11, No. 2, 308-315 (1980; Zbl 0451.93022)] and by \textit{P. M. Prenter} [J. Approximation Theory 4, No. 4, 419-432 (1971; Zbl 0237.41011)].

Keywords

Abstract approximation theory (approximation in normed linear spaces and other abstract spaces), convergence, vector space, Hilbert space, polynomial operator, Interpolation in approximation theory, Approximation by other special function classes, interpolation, solvability

  • BIP!
    Impact byBIP!
    citations
    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).
    9
    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).
    Top 10%
    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
citations
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!
9
Average
Top 10%
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!