C 1 Quintic Splines on Type-4 Tetrahedral Partitions

Starting with a partition of a rectangular box into subboxes, it is shown how to construct a natural tetrahedral (type-4) partition and associated trivariate C ¹ quintic polynomial spline spaces with a variety of useful properties, including stable local bases and full approximation power. It is also shown how the spaces can be used to solve certain Hermite and Lagrange interpolation problems.     

Approximating weak Chebyshev subspaces by Chebyshev subspaces

We examine to what extent finite-dimensional spaces defined on locally compact subsets of the line and possessing various weak Chebyshev properties (involving sign changes, zeros, alternation of best approximations, and peak points) can be uniformly approximated by a sequence of spaces having related properties.     

Trivariate Cr Polynomial Macroelements

Trivariate C^r macroelements defined in terms of polynomials of degree 8r + 1 on tetrahedra are analyzed. For r = 1,2, these spaces reduce to well-known macroelement spaces used in data fitting and in the finite-element method. We determine the dimension of these spaces, and describe stable local minimal determining sets and nodal minimal determining sets. We also show that the spaces approximate smooth functions to optimal order.     

Super spline spaces of smoothnessr and degreed≥3r+2

The problem of computing the dimension of spaces of splines whose elements are piecewise polynomials of degreed withr continuous derivatives globally has attracted a great deal of attention recently. We contribute to this theory by obtaining dimension formulae for certain spaces of super splines, including the case where varying amounts of additional smoothness is enforced at each vertex. We also explicitly construct minimally supported bases for the spaces. The main tool is the Bernstein-Bézier method.Communicated by Klaus Höllig.     

Convexity preserving C 0 splines

Linear conditions for a C ⁰ spline to be convex are developed and used to create some convexity preserving interpolation and approximation methods.     

Two condensed macro-elements with full approximation power

A variant of the classical C ¹ Powell-Sabin-12 macro-element is defined that has the same approximation power, but has fewer degrees of freedom and only requires vertex data. The same idea is then applied to a related C ¹ trivariate macro-element.