Abstract

Following work of Heindl and of Powell and Sabin, each triangle of an arbitrary (regular) triangulation Ī” \Delta of a polygonal region Ī© \Omega in R 2 {\mathbb {R}^2} is subdivided into twelve triangles, using the three medians, yielding the refinement Ī” ^ \hat \Delta of Ī” \Delta , so that C 1 {C^1} quadratic finite elements can be constructed. In this paper, we derive the BĆ©zier nets of these elements in terms of the parameters that describe function and first partial derivative values at the vertices and values of the normal derivatives at the midpoints of the edges of Ī” \Delta . Consequently, bivariate C 1 {C^1} quadratic (generalized) vertex splines on Ī” \Delta have an explicit formulation. Here, a generalized vertex spline is one which is a piecewise polynomial on the refined grid partition Ī” ^ \hat \Delta and has support that contains at most one vertex of the original partition Ī” \Delta in its interior. The collection of all C 1 {C^1} quadratic generalized vertex splines on Ī” \Delta so constructed is shown to form a basis of S 2 1 ( Ī” ^ ) S_2^1(\hat \Delta ) , the vector space of all functions on C 1 ( Ī© ) {C^1}(\Omega ) whose restrictions to each triangular cell of the partition Ī” ^ \hat \Delta are quadratic polynomials. A subspace with the basis given by appropriately chosen generalized vertex splines with exactly one vertex of Ī” \Delta in the interior of their supports, that reproduces all quadratic polynomials, is identified, and hence, has approximation order three. Quasi-interpolation formulas using this subspace are obtained. In addition, a constructive procedure that yields a locally supported basis of yet another subspace with dimension given by the number of vertices of Ī” \Delta , that has approximation order three, is given.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.