Least squares approximation by splines with free knots (Q1904276): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / reviewed by
 
Property / reviewed by: J. R. Illán-González / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: J. R. Illán-González / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: FITPACK / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient line search for nonlinear least squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: A practical guide to splines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3702408 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3135817 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Differentiation of Pseudo-Inverses and Nonlinear Least Squares Problems Whose Variables Separate / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Constrained Non-Linear Least-Squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for data reduction using splines with free knots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation to Data by Splines with Free Knots / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variable projection method for solving separable nonlinear least squares problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A globalization scheme for the generalized Gauss-Newton method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient implementation of a variable projection algorithm for nonlinear least squares problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4879581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Data-Reduction Strategy for Splines with Applications to the Approximation of Functions and Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Separable Nonlinear Least Squares Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Polya Frequency Function. III. The Positivity of Translation Determinants With an Application to the Interpolation Problem by Spline Curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3895980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spline smoothing under constraints on derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Method of optimal variable-knot spline interpolation in the 2 discrete norm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Spline Least Squares Method for Numerical Parameter Estimation in Differential Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3978908 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3996207 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01732610 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2024690006 / rank
 
Normal rank

Latest revision as of 08:49, 30 July 2024

scientific article
Language Label Description Also known as
English
Least squares approximation by splines with free knots
scientific article

    Statements

    Least squares approximation by splines with free knots (English)
    0 references
    0 references
    0 references
    0 references
    1 February 1996
    0 references
    Let \(f\) be a function in the class \(W^q_2 [ a,b ]\), whose values on the discrete data \(a\leq x_1< \dots< x_m\leq b\), have been perturbed: \(y_i= f(x_i)+ \varepsilon_i\) \((i=1, \dots, m)\), \(\varepsilon_i\) being the error of the \(i\)th observation. In order to find information of the unknown function \(f\) the \(n\)-dimensional spline space \(S_{k,t}\) of all piecewise polynomials of order \(k\geq 1\), with knot sequence \(t= \{t_j \}\) can be considered. The quadratic pseudo-distance \(S= S(\{ y_i\}, \{s(x_i )\})\), \(s\in S_{k,t}\), can be used as a measure of fitness. The purpose of the paper is to develop a robust optimization algorithm to minimize \(S\) to calculate a good location of the free knots \(\{ t_j \}\). The introduction of the paper contains general remarks about function approximation by means of free knots splines and data reduction strategies. In the references 27 titles are listed. The method of approximating the noisy data \(\{ y_i\}\) does not suppose a Schoenberg-Whitney-like regularity condition but instead uses some type of regularization by a simple smoothing term which guarantees unique solvability independent of the position of knots. It also treats the linearly constrained nonlinear least squares problem directly, and is able to find a good location of only a subset of the inner knots. Some numerical examples show that the corresponding algorithm provides a robust and efficient tool for least squares approximation by splines with free knots.
    0 references
    data fitting
    0 references
    knot removal strategies
    0 references
    \(B\)-splines
    0 references
    robust optimization algorithm
    0 references
    free knots splines
    0 references
    data reduction
    0 references
    noisy data
    0 references
    smoothing
    0 references
    nonlinear least squares
    0 references
    numerical examples
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references