Approximation Order of Bivariate Spline Interpolation
نویسندگان
چکیده
منابع مشابه
Approximation order of bivariate spline interpolation for arbitrary smoothness
By using the algorithm of Nfimberger and Riessinger (1995), we construct Hermite interpolation sets for spaces of bivariate splines Sq(d 1 ) of arbitrary smoothness defined on the uniform type triangulations. It is shown that our Hermite interpolation method yields optimal approximation order for q >~ 3.5r + 1. In order to prove this, we use the concept of weak interpolation and arguments of Bi...
متن کاملScattered data interpolation by bivariate splines with higher approximation order
Given a set of scattered data, we usually use a minimal energy method to find Lagrange interpolation based on bivariate spline spaces over a triangulation of the scattered data locations. It is known that the approximation order of the minimal energy spline interpolation is only 2 in terms of the size of triangulation. To improve this order of approximation, we propose several new schemes in th...
متن کاملThe L2-approximation order of surface spline interpolation
We show that if the open, bounded domain Ω ⊂ Rd has a sufficiently smooth boundary and if the data function f is sufficiently smooth, then the Lp(Ω)-norm of the error between f and its surface spline interpolant is O(δγp+1/2) (1 ≤ p ≤ ∞), where γp := min{m,m − d/2 + d/p} and m is an integer parameter specifying the surface spline. In case p = 2, this lower bound on the approximation order agree...
متن کاملApproximation from Bivariate Spline Spaces Over Triangulations
Let ∆ be a triangulation of some polygonal domain in IR and S k(∆) the space of all bivariate C piecewise polynomials of total degree ≤ k on ∆. The approximation order of S k(∆) is defined to be the largest real number ρ for which dist(f, S k(∆)) ≤ Const |∆| for all sufficiently smooth functions f , where the distance is measured in the supremum norm, and |∆| := sup τ∈∆ diam τ is the mesh size ...
متن کاملH∞ Optimal Approximation for Causal Spline Interpolation
In this paper, we give a causal solution to the problem of spline interpolation using H∞ optimal approximation. Generally speaking, spline interpolation requires filtering the whole sampled data, the past and the future, to reconstruct the inter-sample values. This leads to non-causality of the filter, and this becomes a critical issue for real-time applications. Our objective here is to derive...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 1996
ISSN: 0021-9045
DOI: 10.1006/jath.1996.0095