Some observations on local least squares
- 44 Downloads
In previous work we introduced a construction to produce biorthogonal multiresolutions from given subdivisions. The approach involved estimating the solution to a least squares problem by means of a number of smaller least squares approximations on local portions of the data. In this work we use a result by Dahlquist, et al. on the method of averages to make observational comparisons between this local least squares estimation and full least squares approximation. We have explored examples in two problem domains: data reduction and data approximation. We observe that, particularly for design matrices with a repetitive pattern of column entries, the least squares solution is often well estimated by local least squares, that the estimation rapidly improves with the size of the local least squares problems, and that the quality of the estimate is largely independent of the size of the full problem.
Key wordssubdivision refinement interpolation approximation least squares projection subspace angles left inverse B-splines
Unable to display preview. Download preview PDF.
- 4.C. de Boor, A Practical Guide to Splines, Applied Mathematical Sciences 27, Springer, 1978.Google Scholar
- 6.R. N. Goldman and T. Lyche, Knot Insertion and Deletion Algorithms for B-Spline Curves and Surfaces, SIAM, 1993.Google Scholar
- 7.G. H. Golub and C. F. V. Loan, Matrix Computations, 2nd edn., The Johns Hopkins University Press, 1989.Google Scholar
- 9.F. F. Samavati and R. H. Bartels, Reversing subdivision using local linear conditions: Generating multiresolutions on regular triangular meshes, Technical report, University of Calgary, Computer Science, TR 2002-711-14, December 2002.Google Scholar