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

From MaRDI portal
Publication:2005174

DOI10.1016/J.CAGD.2020.101931zbMATH Open1450.65019arXiv1908.06417OpenAlexW3087853493MaRDI QIDQ2005174FDOQ2005174


Authors: Zhengda Huang, Hui-Di Wang Edit this on Wikidata


Publication date: 7 October 2020

Published in: Computer Aided Geometric Design (Search for Journal in Brave)

Abstract: In this paper, we present a progressive and iterative approximation method with memory for least square fitting(MLSPIA). It adjusts the control points and the weighted sums iteratively to construct a series of fitting curves (surfaces) with three weights. For any normalized totally positive basis even when the collocation matrix is of deficient column rank, we obtain a condition to guarantee that these curves (surfaces) converge to the least square fitting curve (surface) to the given data points. It is proved that the theoretical convergence rate of the method is faster than the one of the progressive and iterative approximation method for least square fitting (LSPIA) in [Deng C-Y, Lin H-W. Progressive and iterative approximation for least squares B-spline curve and surface fitting. Computer-Aided Design 2014;47:32-44] under the same assumption. Examples verify this phenomenon.


Full work available at URL: https://arxiv.org/abs/1908.06417




Recommendations




Cites Work


Cited In (12)





This page was built for publication: On a progressive and iterative approximation method with memory for least square fitting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2005174)