Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Approximation by cubic C1-splines on arbitrary triangulations
Gmelig Meyling R. Numerische Mathematik51 (1):65-85,1987.Type:Article
Date Reviewed: May 1 1988

The paper deals with the space S1-3- of piecewise cubic C1 functions defined on an arbitrary triangulation. This space has the distinction (among all C1 spline spaces) of offering the smallest possible polynomial degree that, in general, supplies more parameters than there are vertices in the triangulation. However, at present its dimension is unknown, and it is also unknown whether, in general, the interpolation conditions at the vertices and the smoothness conditions across interior edges are consistent. The author acknowledges these problems but does not otherwise address them. Instead, he reviews a well-known lower bound on the dimension, describes four ways of representing splines in S1-3-, derives equations that enforce certain boundary conditions, and gives some numerical results for least squares approxi- mation and interpolation to scattered data. There is a useful bibliography of 38 items.

Reviewer:  Peter Alfeld Review #: CR112317
Bookmark and Share
 
Spline And Piecewise Polynomial Approximation (G.1.2 ... )
 
 
Least Squares Approximation (G.1.2 ... )
 
 
Spline And Piecewise Polynomial Interpolation (G.1.1 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Spline And Piecewise Polynomial Approximation": Date
Generating NURBS curves by envelopes
Wang G. Computing 48(3-4): 275-289, 1992. Type: Article
Jul 1 1993
Box splines
de Boor C., Höllig K., Riemenschneider S., Springer-Verlag New York, Inc., New York, NY, 1993. Type: Book (9780387941011)
Dec 1 1994
Box spline prewavelets of small support
Buhmann M., Davydov O. Journal of Approximation Theory 112(1): 16-27, 2001. Type: Article
Nov 15 2002
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy