AbstractWe describe an algorithm for constructing a Lagrange interpolation pair based on C1 cubic splines defined on tetrahedral partitions. In particular, given a set of points V∈R3, we construct a set P containing V and a spline space S31(▵) based on a tetrahedral partition ▵ whose set of vertices include V such that interpolation at the points of P is well-defined and unique. Earlier results are extended in two ways: (1) here we allow arbitrary sets V, and (2) the method provides optimal approximation order of smooth functions
AbstractWe present a method to construct convex cubic C1-splines which interpolate a given convex da...
AbstractThe aim of this paper is to establish C1-rational spline functions on any regular quadrilate...
AbstractWe study cubic spline interpolation with less restrictive continuity requirements at the kno...
AbstractWe describe an algorithm for constructing a Lagrange interpolation pair based on C1 cubic sp...
AbstractWe describe a local Lagrange interpolation method using cubic (i.e. non-tensor product) C1 s...
We develop quasi-interpolation methods and a Lagrange interpolation method for trivariate splines on...
AbstractLet Δ be an arbitrary regular triangulation of a simply connected compact polygonal domain Ω...
AbstractWe develop a local Lagrange interpolation scheme for quartic C1 splines on triangulations. G...
Let Δ be an arbitrary regular triangulation of a simply connected compact polygonal domain ]...
AbstractIn [G. Nürnberger and Th. Riessinger,Numer. Math.71(1995), 91–119], we developed an algorith...
We give a survey of recent methods to construct Lagrange interpolation points for splines of arbitra...
AbstractIn 1988, Worsey and Piper constructed a trivariate macro-element based on C1 quadratic splin...
AbstractLet S31() be the bivariate C1-cubic spline space over a triangulated quadrangulation . In th...
We construct Hermite interpolation sets for bivariate spline spaces of arbitrary degree and smoothne...
AbstractWe describe a general method for constructing triangulations Δ which are suitable for interp...
AbstractWe present a method to construct convex cubic C1-splines which interpolate a given convex da...
AbstractThe aim of this paper is to establish C1-rational spline functions on any regular quadrilate...
AbstractWe study cubic spline interpolation with less restrictive continuity requirements at the kno...
AbstractWe describe an algorithm for constructing a Lagrange interpolation pair based on C1 cubic sp...
AbstractWe describe a local Lagrange interpolation method using cubic (i.e. non-tensor product) C1 s...
We develop quasi-interpolation methods and a Lagrange interpolation method for trivariate splines on...
AbstractLet Δ be an arbitrary regular triangulation of a simply connected compact polygonal domain Ω...
AbstractWe develop a local Lagrange interpolation scheme for quartic C1 splines on triangulations. G...
Let Δ be an arbitrary regular triangulation of a simply connected compact polygonal domain ]...
AbstractIn [G. Nürnberger and Th. Riessinger,Numer. Math.71(1995), 91–119], we developed an algorith...
We give a survey of recent methods to construct Lagrange interpolation points for splines of arbitra...
AbstractIn 1988, Worsey and Piper constructed a trivariate macro-element based on C1 quadratic splin...
AbstractLet S31() be the bivariate C1-cubic spline space over a triangulated quadrangulation . In th...
We construct Hermite interpolation sets for bivariate spline spaces of arbitrary degree and smoothne...
AbstractWe describe a general method for constructing triangulations Δ which are suitable for interp...
AbstractWe present a method to construct convex cubic C1-splines which interpolate a given convex da...
AbstractThe aim of this paper is to establish C1-rational spline functions on any regular quadrilate...
AbstractWe study cubic spline interpolation with less restrictive continuity requirements at the kno...