Bivariate least squares approximation with linear constraints (Q996803)

The paper is devoted to the linear least squares problems with linear equality constrains. The data points are considered to lie on the vertices of a rectangular grid. A fast and efficient computational method for the case, when the linear equality constrains can be formulated in a tensor product form, is presented. Using the solution of several univariate approximation problems the solution of the bivariate approximation problem is derived. An example, based on the use of tensor product polynomials and tensor product splines, is given to illustrate the practicability of the proposed method. In the case of splines a further improvement is possible using algorithms for sparse matrices. According to the authors' conclusions, this method is not only restricted to point evaluation. It can be used for all types of linear functionals on function spaces.