ترغب بنشر مسار تعليمي؟ اضغط هنا

Subdivision and spline spaces

217   0   0.0 ( 0 )
 نشر من قبل Henry K. Schenck
 تاريخ النشر 2016
  مجال البحث
والبحث باللغة English




اسأل ChatGPT حول البحث

A standard construction in approximation theory is mesh refinement. For a simplicial or polyhedral mesh D in R^k, we study the subdivision D obtained by subdividing a maximal cell of D. We give sufficient conditions for the module of splines on D to split as the direct sum of splines on D and splines on the subdivided cell. As a consequence, we obtain dimension formulas and explicit bases for several commonly used subdivisions and their multivariate generalizations.



قيم البحث

اقرأ أيضاً

We investigate properties of differential and difference operators annihilating certain finite-dimensional subspaces of exponential functions in two variables that are connected to the representation of real-valued trigonometric and hyperbolic functi ons. Although exponential functions appear in a variety of contexts, the motivation behind this work comes from considering subdivision schemes with the capability of preserving those exponential functions required for an exact description of surfaces parametrized in terms of trigonometric and hyperbolic functions.
A piecewise Chebyshevian spline space is good for design when it possesses a B-spline basis and this property is preserved under arbitrary knot insertion. The interest in piecewise Chebyshevian spline spaces that are good for design is justified by t he fact that, similarly as for polynomial splines, the related parametric curves exhibit the desired properties of convex hull inclusion, variation diminution and intuitive relation between the curve shape and the location of the control points. For all good-for-design spaces, in this paper we construct a set of functions, called transition functions, which allow for efficient computation of the B-spline basis, even in the case of nonuniform and multiple knots. Moreover, we show how the spline coefficients of the representations associated with a refined knot partition and with a raised order can conveniently be expressed by means of transition functions. This result allows us to provide effective procedures that generalize the classical knot insertion and degree raising algorithms for polynomial splines. To illustrate the benefits of the proposed computational approaches, we provide several examples dealing with different types of piecewise Chebyshevian spline spaces that are good for design.
In this paper, we present a family of multivariate grid transfer operators appropriate for anisotropic multigrid methods. Our grid transfer operators are derived from a new family of anisotropic interpolatory subdivision schemes. We study the minimal ity, polynomial reproduction and convergence properties of these interpolatory schemes and link their properties to the convergence and optimality of the corresponding multigrid methods. We compare the performance of our interpolarory grid transfer operators with the ones derived from a family of corresponding approximating subdivision schemes.
197 - K. Kopotun , D. Leviatan , 2014
Several results on constrained spline smoothing are obtained. In particular, we establish a general result, showing how one can constructively smooth any monotone or convex piecewise polynomial function (ppf) (or any $q$-monotone ppf, $qgeq 3$, with one additional degree of smoothness) to be of minimal defect while keeping it close to the original function in the ${mathbb L}_p$-(quasi)norm. It is well known that approximating a function by ppfs of minimal defect (splines) avoids introduction of artifacts which may be unrelated to the original function, thus it is always preferable. On the other hand, it is usually easier to construct constrained ppfs with as little requirements on smoothness as possible. Our results allow to obtain shape-preserving splines of minimal defect with equidistant or Chebyshev knots. The validity of the corresponding Jackson-type estimates for shape-preserving spline approximation is summarized, in particular we show, that the ${mathbb L}_p$-estimates, $pge1$, can be immediately derived from the ${mathbb L}_infty$-estimates.
The convergence rate of a multigrid method depends on the properties of the smoother and the so-called grid transfer operator. In this paper we define and analyze new grid transfer operators with a generic cutting size which are applicable for high o rder problems. We enlarge the class of available geometric grid transfer operators by relating the symbol analysis of the coarse grid correction with the approximation properties of univariate subdivision schemes. We show that the polynomial generation property and stability of a subdivision scheme are crucial for convergence and optimality of the corresponding multigrid method. We construct a new class of grid transfer operators from primal binary and ternary pseudo-spline symbols. Our numerical results illustrate the behavior of the new grid transfer operators.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا