{"title":"计算伯努利多项式的矩阵生成函数对向量的作用,并应用于非局部边值问题","authors":"Lidia Aceto, Luca Gemignani","doi":"10.1007/s10444-025-10231-1","DOIUrl":null,"url":null,"abstract":"<div><p>This paper deals with efficient numerical methods for computing the action of the matrix generating function of Bernoulli polynomials, say <span>\\(q(\\tau ,A)\\)</span>, on a vector when <i>A</i> is a large and sparse matrix. This problem occurs when solving some non-local boundary value problems. Methods based on the Fourier expansion of <span>\\(q(\\tau ,w)\\)</span> have already been addressed in the scientific literature. The contribution of this paper is twofold. First, we place these methods in the classical framework of Krylov-Lanczos (polynomial-rational) techniques for accelerating Fourier series. This allows us to apply the convergence results developed in this context to our function. Second, we design a new acceleration scheme. Some numerical results are presented to show the effectiveness of the proposed algorithms.</p></div>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":"51 2","pages":""},"PeriodicalIF":1.7000,"publicationDate":"2025-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10444-025-10231-1.pdf","citationCount":"0","resultStr":"{\"title\":\"Computing the action of the matrix generating function of Bernoulli polynomials on a vector with an application to non-local boundary value problems\",\"authors\":\"Lidia Aceto, Luca Gemignani\",\"doi\":\"10.1007/s10444-025-10231-1\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>This paper deals with efficient numerical methods for computing the action of the matrix generating function of Bernoulli polynomials, say <span>\\\\(q(\\\\tau ,A)\\\\)</span>, on a vector when <i>A</i> is a large and sparse matrix. This problem occurs when solving some non-local boundary value problems. Methods based on the Fourier expansion of <span>\\\\(q(\\\\tau ,w)\\\\)</span> have already been addressed in the scientific literature. The contribution of this paper is twofold. First, we place these methods in the classical framework of Krylov-Lanczos (polynomial-rational) techniques for accelerating Fourier series. This allows us to apply the convergence results developed in this context to our function. Second, we design a new acceleration scheme. Some numerical results are presented to show the effectiveness of the proposed algorithms.</p></div>\",\"PeriodicalId\":50869,\"journal\":{\"name\":\"Advances in Computational Mathematics\",\"volume\":\"51 2\",\"pages\":\"\"},\"PeriodicalIF\":1.7000,\"publicationDate\":\"2025-04-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://link.springer.com/content/pdf/10.1007/s10444-025-10231-1.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Advances in Computational Mathematics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s10444-025-10231-1\",\"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":"Advances in Computational Mathematics","FirstCategoryId":"100","ListUrlMain":"https://link.springer.com/article/10.1007/s10444-025-10231-1","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
Computing the action of the matrix generating function of Bernoulli polynomials on a vector with an application to non-local boundary value problems
This paper deals with efficient numerical methods for computing the action of the matrix generating function of Bernoulli polynomials, say \(q(\tau ,A)\), on a vector when A is a large and sparse matrix. This problem occurs when solving some non-local boundary value problems. Methods based on the Fourier expansion of \(q(\tau ,w)\) have already been addressed in the scientific literature. The contribution of this paper is twofold. First, we place these methods in the classical framework of Krylov-Lanczos (polynomial-rational) techniques for accelerating Fourier series. This allows us to apply the convergence results developed in this context to our function. Second, we design a new acceleration scheme. Some numerical results are presented to show the effectiveness of the proposed algorithms.
期刊介绍:
Advances in Computational Mathematics publishes high quality, accessible and original articles at the forefront of computational and applied mathematics, with a clear potential for impact across the sciences. The journal emphasizes three core areas: approximation theory and computational geometry; numerical analysis, modelling and simulation; imaging, signal processing and data analysis.
This journal welcomes papers that are accessible to a broad audience in the mathematical sciences and that show either an advance in computational methodology or a novel scientific application area, or both. Methods papers should rely on rigorous analysis and/or convincing numerical studies.