Abstract
The paper addresses bivariate surface fitting problems, where data points lie on the vertices of a rectangular grid. Efficient and stable algorithms can be found in the literature to solve such problems. If data values are missing at some grid points, there exists a computational method for finding a least squares spline by fixing appropriate values for the missing data. We extended this technique to arbitrary least squares problems as well as to linear least squares problems with linear equality constraints. Numerical examples are given to show the effectiveness of the technique presented.
Similar content being viewed by others
References
A. Ben-Israel and T. N. E. Greville, Generalized Inverses: Theory and Applications, Robert E. Krieger, New York, 1980.
Å. Björck, Numerical Methods for Least Squares Problems, SIAM Publ., Philadelphia, 1996.
A. J. Cox and N. J. Higham, Accuracy and stability of the null space method for solving the equality constrained least squares problem, BIT, 39 (1999), pp. 34–50.
P. Dierckx, Computation of least-squares spline approximations to data over incomplete grids, Comput. Math. Appl., 10 (1984), pp. 283–289.
P. Dierckx, Curve and Surface Fitting with Splines, Clarendon Press, Oxford, 1995.
L. Eldén, Pertubation theory for the least squares problem with linear equality constraints, SIAM J. Numer. Anal., 17 (1980), pp. 338–350.
L. Eldén, A weighted pseudoinverse, generalized singular values, and constrained least squares problems, BIT, 22 (1982), pp. 487–502.
G. Farin, Curves and Surfaces for CAGD, a practical guide, 5th edn., Academic Press, San Francisco, 2002.
D. Fausett and C. Fulton, Large least squares problems involving Kronecker products, SIAM J. Matrix Anal. Appl., 15 (1994), pp. 219–227.
D. Fausett, C. Fulton, and H. Hashish, Improved parallel QR method for large least squares problems involving Kronecker products, J. Comput. Appl. Math., 78 (1997), pp. 63–78.
G. H. Golub and C. F. Van Loan, Matrix Computations, Johns Hopkins UP, Baltimore, 1983.
A. Graham, Kronecker Products and Matrix Calculus: with Applications, Halsted Press, John Wiley and Sons, Inc., New. York, 1981.
E. Grosse, Tensor spline approximation, Linear Algebra Appl., 34 (1980), pp. 29–41.
N. J. Higham, Iterative refinement enhances the stability of QR factorization methods for solving linear equations, BIT, 31 (1991), pp. 447–468.
J. Hoschek and D. Lasser, Fundamentals of Computer Aided Geometric Design, A. K. Peters, Wellesley, Mass., 1993.
C. D. Meyer and R. J. Painter, Note on a least squares inverse for a matrix, J. ACM, 17 (1970), pp. 110–112.
G. Pisinger and A. Zimmermann, Bivariate least squares approximation with linear constraints, BIT, 47 (2007), pp. 427–439.
Author information
Authors and Affiliations
Corresponding author
Additional information
AMS subject classification (2000)
65D05, 65D07, 65D10, 65F05, 65F20
Rights and permissions
About this article
Cite this article
Pisinger, G., Zimmermann, A. Linear least squares problems with data over incomplete grids . Bit Numer Math 47, 809–824 (2007). https://doi.org/10.1007/s10543-007-0152-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10543-007-0152-x