scientific article; zbMATH DE number 4000635
[For the entire collection see Zbl 0607.00009.] A method is described for computing least-squares bivariate spline approximants to function values specified at the vertices of a very large rectangular mesh. The mesh is considered to be partitioned into a system of (slightly) overlapping rectangular subarrays or blocks, each of which can be held in memory. A constrained tensor-product spline approximant is formed for each block. The constraints imposed are such that the individual approximants blend together with a desired order of continuity. The method is designed to have local properties: modification to function values within a block will affect only the approximant for the block itself (and, possibly, the approximants for immediately neighbouring blocks.) Knot refinement is permitted at block boundaries. Thus the number of knots can be selected locally (i.e. at the block level) to account for local behaviour of the underlying function.
- Computation of least-squares spline approximation to data over incomplete grids
- Bivariate free knot splines
- Large scale least squares scattered data fitting
- A method for solving the indirect approximation problem
- A generalized bilinear spline approximation
- An algorithm for low-rank approximation of bivariate functions using splines
- A domain decomposition method for computing bivariate spline fits of scattered data
- scientific article; zbMATH DE number 1303659 (Why is no real title available?)
- Hierarchical spline approximations
- scientific article; zbMATH DE number 3996986 (Why is no real title available?)
- An efficient method for fitting large data sets using T-splines
- Computing bivariate splines in scattered data fitting and the finite-element method
- Bivariate least squares approximation with linear constraints
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4726786)