{"title":"论自动卷积 Volterra 积分微分方程 Galerkin 方法的收敛性","authors":"Yuping Li, Hui Liang, Huifang Yuan","doi":"10.1007/s11075-024-01874-0","DOIUrl":null,"url":null,"abstract":"<p>The Galerkin method is proposed for initial value problem of auto-convolution Volterra integro-differential equation (AVIDE). The solvability of the Galerkin method is discussed, and the uniform boundedness of the numerical solution is provided by defining a discrete weighted exponential norm. In particular, it is proved that the quadrature Galerkin method obtained from the Galerkin method by approximating the inner products by suitable numerical quadrature formulas, is equivalent to the continuous piecewise polynomial collocation method. For the Galerkin approximated solution in continuous piecewise polynomial space of degree <span>\\(\\varvec{m}\\)</span>, at first, the <span>\\(\\varvec{m}\\)</span> global convergence order is obtained. By defining a projection operator, the convergence is improved, and the optimal <span>\\(\\varvec{m+1}\\)</span> global convergence order is gained, as well as <span>\\(\\varvec{2m}\\)</span> local convergence order at mesh points. Furthermore, all the above analysis for uniform mesh can be extended to typical quasi-uniform meshes. Some numerical experiments are given to illustrate the theoretical results.</p>","PeriodicalId":54709,"journal":{"name":"Numerical Algorithms","volume":"2014 1","pages":""},"PeriodicalIF":1.7000,"publicationDate":"2024-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the convergence of Galerkin methods for auto-convolution Volterra integro-differential equations\",\"authors\":\"Yuping Li, Hui Liang, Huifang Yuan\",\"doi\":\"10.1007/s11075-024-01874-0\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>The Galerkin method is proposed for initial value problem of auto-convolution Volterra integro-differential equation (AVIDE). The solvability of the Galerkin method is discussed, and the uniform boundedness of the numerical solution is provided by defining a discrete weighted exponential norm. In particular, it is proved that the quadrature Galerkin method obtained from the Galerkin method by approximating the inner products by suitable numerical quadrature formulas, is equivalent to the continuous piecewise polynomial collocation method. For the Galerkin approximated solution in continuous piecewise polynomial space of degree <span>\\\\(\\\\varvec{m}\\\\)</span>, at first, the <span>\\\\(\\\\varvec{m}\\\\)</span> global convergence order is obtained. By defining a projection operator, the convergence is improved, and the optimal <span>\\\\(\\\\varvec{m+1}\\\\)</span> global convergence order is gained, as well as <span>\\\\(\\\\varvec{2m}\\\\)</span> local convergence order at mesh points. Furthermore, all the above analysis for uniform mesh can be extended to typical quasi-uniform meshes. Some numerical experiments are given to illustrate the theoretical results.</p>\",\"PeriodicalId\":54709,\"journal\":{\"name\":\"Numerical Algorithms\",\"volume\":\"2014 1\",\"pages\":\"\"},\"PeriodicalIF\":1.7000,\"publicationDate\":\"2024-07-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Numerical Algorithms\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s11075-024-01874-0\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Numerical Algorithms","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s11075-024-01874-0","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
On the convergence of Galerkin methods for auto-convolution Volterra integro-differential equations
The Galerkin method is proposed for initial value problem of auto-convolution Volterra integro-differential equation (AVIDE). The solvability of the Galerkin method is discussed, and the uniform boundedness of the numerical solution is provided by defining a discrete weighted exponential norm. In particular, it is proved that the quadrature Galerkin method obtained from the Galerkin method by approximating the inner products by suitable numerical quadrature formulas, is equivalent to the continuous piecewise polynomial collocation method. For the Galerkin approximated solution in continuous piecewise polynomial space of degree \(\varvec{m}\), at first, the \(\varvec{m}\) global convergence order is obtained. By defining a projection operator, the convergence is improved, and the optimal \(\varvec{m+1}\) global convergence order is gained, as well as \(\varvec{2m}\) local convergence order at mesh points. Furthermore, all the above analysis for uniform mesh can be extended to typical quasi-uniform meshes. Some numerical experiments are given to illustrate the theoretical results.
期刊介绍:
The journal Numerical Algorithms is devoted to numerical algorithms. It publishes original and review papers on all the aspects of numerical algorithms: new algorithms, theoretical results, implementation, numerical stability, complexity, parallel computing, subroutines, and applications. Papers on computer algebra related to obtaining numerical results will also be considered. It is intended to publish only high quality papers containing material not published elsewhere.