Since the lm function provides a lot of features it is rather complicated. So we are going to instead use the function lsfit as a model. It computes only the coefficient estimates and the residuals.… Expand

A package of 38 low level subprograms for many of the basic operations of numerical linear algebra is presented, intended to be used with FORTRAN.Expand

Publisher Summary This chapter discusses algorithm and underlying theory of software for C1 surface interpolation. There has been practically no theory to guide the development of algorithms for… Expand

This paper establishes the possibility of performing certain transformations of triangulations of finite planar point sets by means of the convolution of ellipsoidal brackets.Expand

The problem of mathematically defining a smooth surface, passing through a finite set of given points is studied. Literature relating to the problem is briefly reviewed. An algorithm is described… Expand

A number of mathematical results relevant to the problem of constructing a triangulation, i.e., a simplical tessellation of the convex hull of an arbitrary finite set of points in n-space are established.Expand

An algorithm is described for constructing a smooth computable function, f, defined over the surface of a sphere and interpolating a set of n data values, u sub i, associated with n locations, P sub… Expand

A set of FORTRAN callable subprograms are proposed which will be useful in the development of efficient portable ANSI FORTRAN subprograms and applications programs in the area of linear algebra.