Linear least squares problems with data over incomplete grids
Let us consider the bivariate problem of surface fitting, where data points lie in the vertices of a rectangular gride and the task of computing a suitable function \(f\) which approximate the data values by a least squares approximation. If in some grid points the data values are missing or inaccurate and have to be excluded, then tensor product methods cannot be applied without changes. \textit{P. Dierckx} [Comput. Math. Appl. 10, 283--289 (1984; Zbl 0579.65010)] developed a method to compute data values such that the solution of the tensor product spline approximation problem using these values is the same as the spline approximation problem using only the given values. In the paper this approach is generalized to arbitrary linear least squares problems and a new method is developed for linear least squares problems with linear equality constraints. Algorithms based on these techniques are given and numerical examples to show the effectiveness of the method are presented.
- Computation of least-squares spline approximation to data over incomplete grids
- Bivariate least squares approximation with linear constraints
- Least squares solution of bivariate surface fitting problems using tensor product splines
- Using low-rank approximations of gridded data for spline surface fitting
- Least squares scattered data fitting by truncated SVDs
- A weighted pseudoinverse, generalized singular values, and constrained least squares problems
- Accuracy and stability of the null space method for solving the equality constrained least squares problem
- Bivariate least squares approximation with linear constraints
- Computation of least-squares spline approximation to data over incomplete grids
- scientific article; zbMATH DE number 3704749 (Why is no real title available?)
- scientific article; zbMATH DE number 3783337 (Why is no real title available?)
- scientific article; zbMATH DE number 491264 (Why is no real title available?)
- scientific article; zbMATH DE number 780021 (Why is no real title available?)
- scientific article; zbMATH DE number 852536 (Why is no real title available?)
- scientific article; zbMATH DE number 3892457 (Why is no real title available?)
- Improved parallel QR method for large least squares problems involving Kronecker products
- Iterative refinement enhances the stability of \(QR\) factorization methods for solving linear equations
- Large Least Squares Problems Involving Kronecker Products
- Note on a Least Squares Inverse for a Matrix
- Perturbation Theory for the Least Squares Problem with Linear Equality Constraints
- Tensor spline approximation
- Computation of least-squares spline approximation to data over incomplete grids
- Least squares problems involving generalized Kronecker products and application to bivariate polynomial regression
- scientific article; zbMATH DE number 5620293 (Why is no real title available?)
- scientific article; zbMATH DE number 1555404 (Why is no real title available?)
- On condition numbers for Moore-Penrose inverse and linear least squares problem involving Kronecker products
- Using low-rank approximations of gridded data for spline surface fitting
- Bivariate least squares approximation with linear constraints
This page was built for publication: Linear least squares problems with data over incomplete grids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2465667)
