Asynchronous progressive iterative approximation method for least-squares fitting
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2022
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866913328275652608 |
|---|---|
| author | Wu, Nian-Ci Liu, Cheng-Zhi |
| author_facet | Wu, Nian-Ci Liu, Cheng-Zhi |
| contents | For large-scale data fitting, the least-squares progressive-iterative approximation (LSPIA) methods were proposed by Lin et al. (SIAM Journal on Scientific Computing, 2013, 35(6):A3052-A3068) and Deng et al. (Computer-Aided Design, 2014, 47:32-44), where the constant step sizes were used. In this work, we further accelerate the LSPIA method in the sense of a Chebyshev semi-iterative scheme and present an asynchronous LSPIA (ALSPIA) method to fit data points. The control points in ALSPIA are updated by utilizing an extrapolated variant and an adaptive step size is chosen according to the roots of Chebyshev polynomials. Our convergence analysis reveals that ALSPIA is faster than the original LSPIA method in both cases of singular and nonsingular least-squares fittings. Numerical examples show that the proposed algorithm is feasible and effective. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2211_06556 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Asynchronous progressive iterative approximation method for least-squares fitting Wu, Nian-Ci Liu, Cheng-Zhi Numerical Analysis For large-scale data fitting, the least-squares progressive-iterative approximation (LSPIA) methods were proposed by Lin et al. (SIAM Journal on Scientific Computing, 2013, 35(6):A3052-A3068) and Deng et al. (Computer-Aided Design, 2014, 47:32-44), where the constant step sizes were used. In this work, we further accelerate the LSPIA method in the sense of a Chebyshev semi-iterative scheme and present an asynchronous LSPIA (ALSPIA) method to fit data points. The control points in ALSPIA are updated by utilizing an extrapolated variant and an adaptive step size is chosen according to the roots of Chebyshev polynomials. Our convergence analysis reveals that ALSPIA is faster than the original LSPIA method in both cases of singular and nonsingular least-squares fittings. Numerical examples show that the proposed algorithm is feasible and effective. |
| title | Asynchronous progressive iterative approximation method for least-squares fitting |
| topic | Numerical Analysis |
| url | https://arxiv.org/abs/2211.06556 |