Composite iteration for isogeometric collocation method using LSPIA and Schulz iteration

IF 2.9 2区 数学 Q1 MATHEMATICS, APPLIED
Gengchen Li, Hongwei Lin, Depeng Gao
{"title":"Composite iteration for isogeometric collocation method using LSPIA and Schulz iteration","authors":"Gengchen Li, Hongwei Lin, Depeng Gao","doi":"10.1016/j.camwa.2024.12.026","DOIUrl":null,"url":null,"abstract":"The isogeometric least-squares collocation method (IGA-L) is an effective numerical technique for solving partial differential equations (PDEs), which utilizes the non-uniform rational B-splines (NURBS) to represent the numerical solution and constructs a system of equations using more collocation points than the number of unknowns. However, on the one hand, the convergence rate of the isogeometric collocation method is lower than that of the isogeometric Galerkin (IGA-G) method; on the other hand, the freedom of the numerical solution cannot be determined in advance to reach specified precision. In this paper, we model the solution of PDEs using IGA-L as a data fitting problem, in which the linear combination of the numerical solution and its derivatives is employed to fit the load function. Moreover, we develop a composite iterative method combining the least-squares progressive-iterative approximation (LSPIA) with the three-order Schulz iteration to solve the data fitting problem. The convergence of composite iterative method is proved, and the error bound is analyzed. Numerical results demonstrate that the convergence rate of the composite iterative method for IGA-L is nearly the same as that of IGA-G. Finally, we propose an incremental fitting algorithm with the composite iterative method, by which the freedom of numerical solution can be determined automatically to reach the specified fitting precision.","PeriodicalId":55218,"journal":{"name":"Computers & Mathematics with Applications","volume":"2 1","pages":""},"PeriodicalIF":2.9000,"publicationDate":"2025-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Mathematics with Applications","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1016/j.camwa.2024.12.026","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

The isogeometric least-squares collocation method (IGA-L) is an effective numerical technique for solving partial differential equations (PDEs), which utilizes the non-uniform rational B-splines (NURBS) to represent the numerical solution and constructs a system of equations using more collocation points than the number of unknowns. However, on the one hand, the convergence rate of the isogeometric collocation method is lower than that of the isogeometric Galerkin (IGA-G) method; on the other hand, the freedom of the numerical solution cannot be determined in advance to reach specified precision. In this paper, we model the solution of PDEs using IGA-L as a data fitting problem, in which the linear combination of the numerical solution and its derivatives is employed to fit the load function. Moreover, we develop a composite iterative method combining the least-squares progressive-iterative approximation (LSPIA) with the three-order Schulz iteration to solve the data fitting problem. The convergence of composite iterative method is proved, and the error bound is analyzed. Numerical results demonstrate that the convergence rate of the composite iterative method for IGA-L is nearly the same as that of IGA-G. Finally, we propose an incremental fitting algorithm with the composite iterative method, by which the freedom of numerical solution can be determined automatically to reach the specified fitting precision.
基于LSPIA和Schulz迭代的等几何配点法复合迭代
等距最小二乘配位法(IGA-L)是求解偏微分方程(PDE)的一种有效数值技术,它利用非均匀有理 B-样条曲线(NURBS)来表示数值解,并用多于未知数个数的配位点来构造方程组。然而,一方面,等距配位法的收敛速度低于等距 Galerkin(IGA-G)法;另一方面,数值解的自由度无法事先确定,无法达到指定精度。在本文中,我们将使用 IGA-L 求解 PDEs 作为一个数据拟合问题进行建模,利用数值解及其导数的线性组合来拟合载荷函数。此外,我们还开发了一种将最小二乘渐进迭代近似(LSPIA)与三阶舒尔茨迭代相结合的复合迭代法来解决数据拟合问题。证明了复合迭代法的收敛性,并分析了误差约束。数值结果表明,IGA-L 复合迭代法的收敛速率与 IGA-G 几乎相同。最后,我们提出了一种采用复合迭代法的增量拟合算法,通过该算法可以自动确定数值解的自由度,从而达到指定的拟合精度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Computers & Mathematics with Applications
Computers & Mathematics with Applications 工程技术-计算机:跨学科应用
CiteScore
5.10
自引率
10.30%
发文量
396
审稿时长
9.9 weeks
期刊介绍: Computers & Mathematics with Applications provides a medium of exchange for those engaged in fields contributing to building successful simulations for science and engineering using Partial Differential Equations (PDEs).
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信