Constrained approximation by splines with free knots
type: Item
instance of: scholarly article
title: Constrained approximation by splines with free knots
zbMATH Open document ID: 0874.65006
DOI: 10.1007/BF02510176
author: Torsten Schütze
author: Hubert Schwetlick
published in: BIT
publication date: 1997-11-10T00:00:00Z
review text: This paper deals with the problem of fitting data by the shape preserving approximating spline with free knots. The spline approximating function has to satisfy the least squares approximating criterion. The key idea used in this paper is to reduce the original problem to a simpler one with a different measure of smoothness. A correspondence between the full and reduced problems is discussed in detail. Three numerical examples are included.
reviewed by: Edward Neuman
Mathematics Subject Classification ID: 65D10
Mathematics Subject Classification ID: 65D07
zbMATH DE Number: 1000367
zbMATH Keywords: smoothing
zbMATH Keywords: shape preserving splines
zbMATH Keywords: data fitting
zbMATH Keywords: least squares
zbMATH Keywords: numerical examples
describes a project that uses: FITPACK
MaRDI profile type: Publication
cites work: Q4868585
cites work: A Note on the Solution of Separable Nonlinear Least-Squares Problems with Separable Nonlinear Equality Constraints
cites work: Stability of the solution of definite quadratic programs
cites work: A practical guide to splines
cites work: Q3135817
cites work: An algorithm for computing constrained smoothing spline functions
cites work: Sensitivity analysis for nonlinear programming using penalty methods
cites work: Introduction to sensitivity and stability analysis in nonlinear programming
cites work: The Differentiation of Pseudo-Inverses and Nonlinear Least Squares Problems Whose Variables Separate
cites work: Analysis of Discrete Ill-Posed Problems by Means of the L-Curve
cites work: Approximation to Data by Splines with Free Knots
cites work: A variable projection method for solving separable nonlinear least squares problems
cites work: A Method for Separable Nonlinear Least Squares Problems with Separable Nonlinear Equality Constraints
cites work: Smoothing and Interpolation in a Convex Subset of a Hilbert Space
cites work: An Error Analysis of a Method for Solving Matrix Equations
cites work: Algorithms for Separable Nonlinear Least Squares Problems
cites work: A dual algorithm for convex-concave data smoothing by cubic \(C^ 2\)- splines
cites work: Q3895980
cites work: Q3984244
cites work: Q4288948
cites work: Spline smoothing under constraints on derivatives
cites work: Least squares approximation by splines with free knots
cites work: Q3996207
full work available at URL: https://doi.org/10.1007/bf02510176
OpenAlex ID: W1997510289
Recommended article: Convexity Preserving Approximation by Free Knot Splines
Recommended article: Approximation and estimation bounds for free knot splines
Recommended article: Least squares approximation by splines with free knots
Recommended article: Uniform approximation by generalized splines with free knots
Recommended article: Q4365443
Recommended article: Best approximation by free knot splines
Recommended article: Strongly unique spline approximations with free knots
Recommended article: Q4325209
Recommended article: Q4884020
Recommended article: Free-knot splines approximation of \(s\)-monotone functions
description: scientific article; zbMATH DE number 1000367