The theoretical analysis and algorithm on a class of optimal curve fitting problems (Q864822)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The theoretical analysis and algorithm on a class of optimal curve fitting problems |
scientific article; zbMATH DE number 5125257
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The theoretical analysis and algorithm on a class of optimal curve fitting problems |
scientific article; zbMATH DE number 5125257 |
Statements
The theoretical analysis and algorithm on a class of optimal curve fitting problems (English)
0 references
13 February 2007
0 references
Let us consider the following problem (the so-called optimal curve fitting problem): suppose that \(y_1,y_2,\dots,y_n\), \(y_{n+1}= y_1\) are the average values of measurements on \(x_1< x_2<\cdots< x_n< x_{n+1}\) and seek an optimal curve to fit these data. In this paper the theory and algorithm on a class of optimal curve fitting problems which can be extensively applied to engineering are established. The authors prove the existence of an unique optimal solution and develop its analytical expression. Moreover, they prove that for every integer value of the involved smoothing parareter \(m\) this class of problems is equivalent to solve a quadratic programming with a spherical constraint. They also give as an example the results in the case of \(m =2\) and conduct a numerical test to validate the method.
0 references
optimal curve fitting problem
0 references
optimal solution
0 references
validation of the method
0 references
variational principle
0 references
convexity analysis
0 references
quadratic programming
0 references
numerical examples
0 references
0 references
0 references
0 references
0 references
0.8756726
0 references
0 references
0.8624021
0 references
0.86192685
0 references
0 references