skip to content
Some Qualitative Properties of Bivariate Euler-Frobenius Polynomials. Preview this item
ClosePreview this item
Checking...

Some Qualitative Properties of Bivariate Euler-Frobenius Polynomials.

Author: C De Boor; K Hoellig; S Riemenschneider; WISCONSIN UNIV-MADISON MATHEMATICS RESEARCH CENTER.
Publisher: Ft. Belvoir Defense Technical Information Center OCT 1984.
Edition/Format:   Book : English
Database:WorldCat
Summary:
This is a further report in a series devoted to the study of box splines. Box splines provide a natural generalization of univariate cardinal splines, i.e., splines with a uniform knot sequence. The process of univariate spline interpolation becomes particularly simple in the cardinal case, and this report considers the corresponding bivariate process of interpolation at the integer points in the plane to a given  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: C De Boor; K Hoellig; S Riemenschneider; WISCONSIN UNIV-MADISON MATHEMATICS RESEARCH CENTER.
OCLC Number: 227633587
Description: 20 p.

Abstract:

This is a further report in a series devoted to the study of box splines. Box splines provide a natural generalization of univariate cardinal splines, i.e., splines with a uniform knot sequence. The process of univariate spline interpolation becomes particularly simple in the cardinal case, and this report considers the corresponding bivariate process of interpolation at the integer points in the plane to a given function by a linear combination of integer translates of a box spline. In particular, the report shows that this process is well posed, i.e., any bounded continuous function has exactly one such bounded interpolant If. The argument uses the Fourier transform to identify a certain trigonometric polynomial (in two variables) whose nonvanishing is equivalent to the asserted well-posedness. The minimum value of this polynomial yields a bound on the norm of the resulting interpolation projector I.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/227633587>
library:oclcnum"227633587"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/227633587>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:contributor
schema:contributor
schema:contributor
schema:contributor
schema:datePublished"1984"
schema:datePublished"OCT 1984"
schema:description"This is a further report in a series devoted to the study of box splines. Box splines provide a natural generalization of univariate cardinal splines, i.e., splines with a uniform knot sequence. The process of univariate spline interpolation becomes particularly simple in the cardinal case, and this report considers the corresponding bivariate process of interpolation at the integer points in the plane to a given function by a linear combination of integer translates of a box spline. In particular, the report shows that this process is well posed, i.e., any bounded continuous function has exactly one such bounded interpolant If. The argument uses the Fourier transform to identify a certain trigonometric polynomial (in two variables) whose nonvanishing is equivalent to the asserted well-posedness. The minimum value of this polynomial yields a bound on the norm of the resulting interpolation projector I."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/1909300226>
schema:inLanguage"en"
schema:name"Some Qualitative Properties of Bivariate Euler-Frobenius Polynomials."@en
schema:numberOfPages"20"
schema:publisher
schema:url

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.