{"title":"De la Vallée Poussin filtered polynomial approximation on the half–line","authors":"Donatella Occorsio , Woula Themistoclakis","doi":"10.1016/j.apnum.2024.09.003","DOIUrl":null,"url":null,"abstract":"<div><div>On the half line, we introduce a new sequence of near-best uniform approximation polynomials, easily computable by the values of the approximated function at a truncated number of Laguerre zeros. Such approximation polynomials come from a discretization of filtered Fourier–Laguerre partial sums, which are filtered using a de la Vallée Poussin (VP) filter. They have the peculiarity of depending on two parameters: a truncation parameter that determines how many of the <em>n</em> Laguerre zeros are considered, and a localization parameter, which determines the range of action of the VP filter we will apply. As <span><math><mi>n</mi><mo>→</mo><mo>∞</mo></math></span>, under simple assumptions on such parameters and the Laguerre exponents of the involved weights, we prove that the new VP filtered approximation polynomials have uniformly bounded Lebesgue constants and uniformly convergence at a near–best approximation rate, for any locally continuous function on the semiaxis.</div><div>The numerical experiments have validated the theoretical results. In particular, they show a better performance of the proposed VP filtered approximation versus the truncated Lagrange interpolation at the same nodes, especially for functions a.e. very smooth with isolated singularities. In such cases, we see a more localized approximation and a satisfactory reduction of the Gibbs phenomenon.</div></div>","PeriodicalId":8199,"journal":{"name":"Applied Numerical Mathematics","volume":"207 ","pages":"Pages 569-584"},"PeriodicalIF":2.4000,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Numerical Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0168927424002332","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2024/9/16 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0
Abstract
On the half line, we introduce a new sequence of near-best uniform approximation polynomials, easily computable by the values of the approximated function at a truncated number of Laguerre zeros. Such approximation polynomials come from a discretization of filtered Fourier–Laguerre partial sums, which are filtered using a de la Vallée Poussin (VP) filter. They have the peculiarity of depending on two parameters: a truncation parameter that determines how many of the n Laguerre zeros are considered, and a localization parameter, which determines the range of action of the VP filter we will apply. As , under simple assumptions on such parameters and the Laguerre exponents of the involved weights, we prove that the new VP filtered approximation polynomials have uniformly bounded Lebesgue constants and uniformly convergence at a near–best approximation rate, for any locally continuous function on the semiaxis.
The numerical experiments have validated the theoretical results. In particular, they show a better performance of the proposed VP filtered approximation versus the truncated Lagrange interpolation at the same nodes, especially for functions a.e. very smooth with isolated singularities. In such cases, we see a more localized approximation and a satisfactory reduction of the Gibbs phenomenon.
期刊介绍:
The purpose of the journal is to provide a forum for the publication of high quality research and tutorial papers in computational mathematics. In addition to the traditional issues and problems in numerical analysis, the journal also publishes papers describing relevant applications in such fields as physics, fluid dynamics, engineering and other branches of applied science with a computational mathematics component. The journal strives to be flexible in the type of papers it publishes and their format. Equally desirable are:
(i) Full papers, which should be complete and relatively self-contained original contributions with an introduction that can be understood by the broad computational mathematics community. Both rigorous and heuristic styles are acceptable. Of particular interest are papers about new areas of research, in which other than strictly mathematical arguments may be important in establishing a basis for further developments.
(ii) Tutorial review papers, covering some of the important issues in Numerical Mathematics, Scientific Computing and their Applications. The journal will occasionally publish contributions which are larger than the usual format for regular papers.
(iii) Short notes, which present specific new results and techniques in a brief communication.