2020
DOI: 10.1016/j.cagd.2020.101931
|View full text |Cite
|
Sign up to set email alerts
|

On a progressive and iterative approximation method with memory for least square fitting

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
13
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 11 publications
(13 citation statements)
references
References 27 publications
0
13
0
Order By: Relevance
“…It is not easy to realize multivariate nonlinear fitting directly using partial least squares method, and it may cause large errors. erefore, with the help of existing research results [31,32], the multilevel least square method is used to fit the curve, and use the N + 1 term to predict the difference between the real value of the N term and the predicted value, so as to achieve the approximate effect.…”
Section: Curve Fittingmentioning
confidence: 99%
“…It is not easy to realize multivariate nonlinear fitting directly using partial least squares method, and it may cause large errors. erefore, with the help of existing research results [31,32], the multilevel least square method is used to fit the curve, and use the N + 1 term to predict the difference between the real value of the N term and the predicted value, so as to achieve the approximate effect.…”
Section: Curve Fittingmentioning
confidence: 99%
“…With a point set false{Qjfalse}j=1m$$ {\left\{{Q}_j\right\}}_{j=1}^m $$ and starting control point set false{Pi0false}i=1n$$ {\left\{{P}_i^0\right\}}_{i=1}^n $$, the PIA method assigned in Lin et al, 16 the LSPIA method in Deng and Lin, 7 and the MLSPIA method in Huang and Wang 17 approximate the curves or surfaces repetitively with the NTP basis as follows: Ck+1false(tfalse)=truei=1nBifalse(tfalse)Pik+1,2emtfalse[0,1false],2emk0,$$ {C}^{k+1}(t)=\sum \limits_{i=1}^n{B}_i(t){P}_i^{k+1},\kern2em t\in \left[0,1\right],\kern2em k\ge 0, $$ the control points are updated Pik+1=Pik+normalΔik,2emifalse{1,2,3,,nfalse},2emk0,$$ {P}_i^{k+1}={P}_i^k+{\Delta}_i^k,\kern2em i\in \left\{1,2,3,\dots, n\right\},\kern2em k\ge 0, $$ with adjusting the vector normalΔik={arrayQiCk(ti),for PIA method,arrayμj=1m…”
Section: Preliminariesmentioning
confidence: 99%
“…The memory for least square fitting PIA method (MLSPIA) is a least square form of the PIA method 16 and the LSPIA method 7 created directly in Huang and Wang 17 to enhance convergence rate. It repeatedly estimates control points and creates a sequence of converging curves to arrive at a least square fitting solution.…”
Section: Preliminariesmentioning
confidence: 99%
See 2 more Smart Citations