Constrained approximation by splines with free knots
From MaRDI portal
Publication:678218
DOI10.1007/BF02510176zbMath0874.65006OpenAlexW1997510289MaRDI QIDQ678218
Hubert Schwetlick, Torsten Schütze
Publication date: 10 November 1997
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02510176
Related Items (3)
Least squares splines with free knots: Global optimization approach. ⋮ Point data reconstruction and smoothing using cubic splines and clusterization ⋮ Range restricted interpolation using Gregory's rational cubic splines
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Introduction to sensitivity and stability analysis in nonlinear programming
- A dual algorithm for convex-concave data smoothing by cubic \(C^ 2\)- splines
- An algorithm for computing constrained smoothing spline functions
- A practical guide to splines
- Spline smoothing under constraints on derivatives
- Least squares approximation by splines with free knots
- Stability of the solution of definite quadratic programs
- A Note on the Solution of Separable Nonlinear Least-Squares Problems with Separable Nonlinear Equality Constraints
- Smoothing and Interpolation in a Convex Subset of a Hilbert Space
- Algorithms for Separable Nonlinear Least Squares Problems
- Analysis of Discrete Ill-Posed Problems by Means of the L-Curve
- A variable projection method for solving separable nonlinear least squares problems
- Sensitivity analysis for nonlinear programming using penalty methods
- A Method for Separable Nonlinear Least Squares Problems with Separable Nonlinear Equality Constraints
- Approximation to Data by Splines with Free Knots
- An Error Analysis of a Method for Solving Matrix Equations
- The Differentiation of Pseudo-Inverses and Nonlinear Least Squares Problems Whose Variables Separate
This page was built for publication: Constrained approximation by splines with free knots
