An efficient Tau approach for solving a class of third-kind Volterra integral equations with proportional delays

IF 2.4 2区 数学 Q1 MATHEMATICS, APPLIED
E. Aourir , H. Laeli Dastjerdi , M. Oudani
{"title":"An efficient Tau approach for solving a class of third-kind Volterra integral equations with proportional delays","authors":"E. Aourir ,&nbsp;H. Laeli Dastjerdi ,&nbsp;M. Oudani","doi":"10.1016/j.cam.2026.117370","DOIUrl":null,"url":null,"abstract":"<div><div>This work presents a new algorithm for solving a kind of Volterra delay integral equations of the third kind (VDIEs). Using the Tau method and generalized polynomial bases, our developed method is a robust approach for solving these equations. Specifically, we employ simple matrix operations to enhance the Tau approach. The underlying strategy leverages orthogonal polynomial bases to change the original equation into a matrix-vector form. Such a transformation makes the third-kind VDIEs easier to handle by turning them into a set of algebraic equations. Importantly, this method exhibits good stability, reduces memory usage, and is computationally cost-effective. The paper details the algorithm’s formulation and shows its capability to provide approximate polynomial solutions. We perform a thorough error estimation to check the method’s accuracy. To demonstrate its practical effectiveness, we use several numerical examples. The obtained results highlight the performance of the method and prove its alignment with theoretical error predictions. Furthermore, a comparative analysis with analytical solutions and alternative methods reaffirms the efficiency of the developed approach.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"483 ","pages":"Article 117370"},"PeriodicalIF":2.4000,"publicationDate":"2026-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computational and Applied Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0377042726000361","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/1/19 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

This work presents a new algorithm for solving a kind of Volterra delay integral equations of the third kind (VDIEs). Using the Tau method and generalized polynomial bases, our developed method is a robust approach for solving these equations. Specifically, we employ simple matrix operations to enhance the Tau approach. The underlying strategy leverages orthogonal polynomial bases to change the original equation into a matrix-vector form. Such a transformation makes the third-kind VDIEs easier to handle by turning them into a set of algebraic equations. Importantly, this method exhibits good stability, reduces memory usage, and is computationally cost-effective. The paper details the algorithm’s formulation and shows its capability to provide approximate polynomial solutions. We perform a thorough error estimation to check the method’s accuracy. To demonstrate its practical effectiveness, we use several numerical examples. The obtained results highlight the performance of the method and prove its alignment with theoretical error predictions. Furthermore, a comparative analysis with analytical solutions and alternative methods reaffirms the efficiency of the developed approach.
求解一类具有比例时滞的第三类Volterra积分方程的有效Tau方法
本文提出了求解一类第三类Volterra延迟积分方程的新算法。利用Tau方法和广义多项式基,我们开发的方法是求解这些方程的一种鲁棒方法。具体来说,我们使用简单的矩阵运算来增强Tau方法。该策略利用正交多项式基将原始方程转换为矩阵-向量形式。这种转换通过将第三类vdi转化为一组代数方程,使其更易于处理。重要的是,该方法具有良好的稳定性,减少了内存使用,并且在计算上具有成本效益。本文详细介绍了该算法的公式,并展示了其提供近似多项式解的能力。我们进行了彻底的误差估计,以检查该方法的准确性。为了证明其实际有效性,我们使用了几个数值算例。得到的结果突出了该方法的性能,并证明了其与理论误差预测的一致性。此外,与解析解和替代方法的比较分析重申了所开发方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
5.40
自引率
4.20%
发文量
437
审稿时长
3.0 months
期刊介绍: The Journal of Computational and Applied Mathematics publishes original papers of high scientific value in all areas of computational and applied mathematics. The main interest of the Journal is in papers that describe and analyze new computational techniques for solving scientific or engineering problems. Also the improved analysis, including the effectiveness and applicability, of existing methods and algorithms is of importance. The computational efficiency (e.g. the convergence, stability, accuracy, ...) should be proved and illustrated by nontrivial numerical examples. Papers describing only variants of existing methods, without adding significant new computational properties are not of interest. The audience consists of: applied mathematicians, numerical analysts, computational scientists and engineers.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信
小红书