{"title":"Asynchronous progressive iterative approximation method for least squares fitting","authors":"Nian-Ci Wu , Chengzhi Liu","doi":"10.1016/j.cagd.2024.102295","DOIUrl":null,"url":null,"abstract":"<div><p>For large data fitting, the least squares progressive iterative approximation (LSPIA) methods have been proposed by <span>Lin and Zhang (2013)</span> and <span>Deng and Lin (2014)</span>, in which a constant step size is used. In this paper, we further accelerate the LSPIA method in terms of a Chebyshev semi-iterative scheme and present an asynchronous LSPIA (denoted by ALSPIA) method. The control points in ALSPIA are updated by using an extrapolated variant in which an adaptive step size is chosen according to the roots of Chebyshev polynomial. Our convergence analysis shows that ALSPIA is faster than the original LSPIA method in both singular and non-singular least squares fitting cases. Numerical examples show that the proposed algorithm is feasible and effective.</p></div>","PeriodicalId":55226,"journal":{"name":"Computer Aided Geometric Design","volume":"111 ","pages":"Article 102295"},"PeriodicalIF":1.3000,"publicationDate":"2024-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Aided Geometric Design","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0167839624000293","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0
Abstract
For large data fitting, the least squares progressive iterative approximation (LSPIA) methods have been proposed by Lin and Zhang (2013) and Deng and Lin (2014), in which a constant step size is used. In this paper, we further accelerate the LSPIA method in terms of a Chebyshev semi-iterative scheme and present an asynchronous LSPIA (denoted by ALSPIA) method. The control points in ALSPIA are updated by using an extrapolated variant in which an adaptive step size is chosen according to the roots of Chebyshev polynomial. Our convergence analysis shows that ALSPIA is faster than the original LSPIA method in both singular and non-singular least squares fitting cases. Numerical examples show that the proposed algorithm is feasible and effective.
期刊介绍:
The journal Computer Aided Geometric Design is for researchers, scholars, and software developers dealing with mathematical and computational methods for the description of geometric objects as they arise in areas ranging from CAD/CAM to robotics and scientific visualization. The journal publishes original research papers, survey papers and with quick editorial decisions short communications of at most 3 pages. The primary objects of interest are curves, surfaces, and volumes such as splines (NURBS), meshes, subdivision surfaces as well as algorithms to generate, analyze, and manipulate them. This journal will report on new developments in CAGD and its applications, including but not restricted to the following:
-Mathematical and Geometric Foundations-
Curve, Surface, and Volume generation-
CAGD applications in Numerical Analysis, Computational Geometry, Computer Graphics, or Computer Vision-
Industrial, medical, and scientific applications.
The aim is to collect and disseminate information on computer aided design in one journal. To provide the user community with methods and algorithms for representing curves and surfaces. To illustrate computer aided geometric design by means of interesting applications. To combine curve and surface methods with computer graphics. To explain scientific phenomena by means of computer graphics. To concentrate on the interaction between theory and application. To expose unsolved problems of the practice. To develop new methods in computer aided geometry.