ADAPTIVE APPROXIMATION BY PIECEWISE LINEAR POLYNOMIALS ON TRIANGULATIONS OF SUBSETS OF SCATTERED DATA

被引:19
作者
RIPPA, S [1 ]
机构
[1] TEL AVIV UNIV,SACKLER FAC EXACT SCI,SCH MATH SCI,IL-69978 TEL AVIV,ISRAEL
来源
SIAM JOURNAL ON SCIENTIFIC AND STATISTICAL COMPUTING | 1992年 / 13卷 / 05期
关键词
TRIANGULATION; DATA-DEPENDENT TRIANGULATION; PIECEWISE LINEAR INTERPOLATION; LEAST-SQUARES FITTING;
D O I
10.1137/0913065
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Given a set V of data points in R2 with corresponding data values, the problem of adaptive piecewise polynomial approximation is to choose a subset of points of V, to create a triangulation of this subset, and to define a piecewise linear surface over the triangulation such that the deviation of this surface from the data set is no more than a prescribed error tolerance. A typical numerical scheme starts with some initial triangulation and adds more points (and triangles) as necessary until the resulting piecewise linear surface satisfies the error bound. In this paper two ingredients of such schemes are discussed. The first problem is that of constructing a suitable triangulation of a subset of points. The use of data-dependent triangulations that depend on the given function values at the data points is discussed, and some data-dependent criteria for optimizing a triangulation are presented and compared to the Delaunay criterion leading to the well-known Delaunay triangulation traditionally used for this purpose. The second problem addressed in this paper is how to select a piecewise linear surface approximating the given data. A common approach is to use an interpolating surface, i.e., to require that the surface interpolates the data at the nodes of the triangulation. In this paper the least-square approximation to the data from the space of piecewise linear polynomials defined over a triangulation of a subset of V is used. It is proved that the matrix of the normal equations is always nonsingular and a bound for its condition number is derived. This bound is relatively low, hence the least-square surface can be computed by solving the normal equations, e.g., by the conjugate gradient scheme with no preconditioning. Various numerical experiments demonstrate the improvement in the quality of the approximation when certain data-dependent triangulations are used. Improvement is also reported when least-square surfaces are compared to interpolating surfaces.
引用
收藏
页码:1123 / 1141
页数:19
相关论文
共 24 条
[1]  
Barnhill R.E., 1977, MATH SOFTWARE, P68
[2]  
CHEW LP, 1989, ALGORITHMICA, V4, P97, DOI 10.1007/BF01553881
[3]   DELAUNAY-BASED REPRESENTATION OF SURFACES DEFINED OVER ARBITRARILY SHAPED DOMAINS [J].
DEFLORIANI, L ;
FALCIDIENO, B ;
PIENOVI, C .
COMPUTER VISION GRAPHICS AND IMAGE PROCESSING, 1985, 32 (01) :127-140
[4]   DATA DEPENDENT TRIANGULATIONS FOR PIECEWISE LINEAR INTERPOLATION [J].
DYN, N ;
LEVIN, D ;
RIPPA, S .
IMA JOURNAL OF NUMERICAL ANALYSIS, 1990, 10 (01) :137-154
[5]  
DYN N, 1990, ALGORITHMS APPROXIMA, V2, P185
[6]   SCATTERED DATA INTERPOLATION - TESTS OF SOME METHODS [J].
FRANKE, R .
MATHEMATICS OF COMPUTATION, 1982, 38 (157) :181-200
[7]  
Franke R., 1987, TOPICS MULTIVARIATE, P79
[8]  
Franke Richard, 1979, CRITICAL COMP SOME M
[9]   A GERSGORIN-TYPE LOWER BOUND FOR THE SMALLEST SINGULAR VALUE [J].
JOHNSON, CR .
LINEAR ALGEBRA AND ITS APPLICATIONS, 1989, 112 :1-7
[10]  
Lawson CL, 1977, MATH SOFTWARE, P161, DOI [DOI 10.1016/B978-0-12-587260-7.50011-X, 10.1016/B978-0-12-587260-7.50011-X]