{"title":"A note on generalized Floater–Hormann interpolation at arbitrary distributions of nodes","authors":"Woula Themistoclakis, Marc Van Barel","doi":"10.1007/s11075-024-01933-6","DOIUrl":null,"url":null,"abstract":"<p>The paper is concerned with a generalization of Floater–Hormann (briefly FH) rational interpolation recently introduced by the authors. Compared with the original FH interpolants, the generalized ones depend on an additional integer parameter <span>\\(\\gamma >1\\)</span>, that, in the limit case <span>\\(\\gamma =1\\)</span> returns the classical FH definition. Here we focus on the general case of an arbitrary distribution of nodes and, for any <span>\\(\\gamma >1\\)</span>, we estimate the sup norm of the error in terms of the maximum (<i>h</i>) and minimum (<span>\\(h^*\\)</span>) distance between two consecutive nodes. In the special case of equidistant (<span>\\(h=h^*\\)</span>) or quasi–equidistant (<span>\\(h\\approx h^*\\)</span>) nodes, the new estimate improves previous results requiring some theoretical restrictions on <span>\\(\\gamma \\)</span> which are not needed as shown by the numerical tests carried out to validate the theory.</p>","PeriodicalId":54709,"journal":{"name":"Numerical Algorithms","volume":"64 1","pages":""},"PeriodicalIF":1.7000,"publicationDate":"2024-09-17","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-01933-6","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0
Abstract
The paper is concerned with a generalization of Floater–Hormann (briefly FH) rational interpolation recently introduced by the authors. Compared with the original FH interpolants, the generalized ones depend on an additional integer parameter \(\gamma >1\), that, in the limit case \(\gamma =1\) returns the classical FH definition. Here we focus on the general case of an arbitrary distribution of nodes and, for any \(\gamma >1\), we estimate the sup norm of the error in terms of the maximum (h) and minimum (\(h^*\)) distance between two consecutive nodes. In the special case of equidistant (\(h=h^*\)) or quasi–equidistant (\(h\approx h^*\)) nodes, the new estimate improves previous results requiring some theoretical restrictions on \(\gamma \) which are not needed as shown by the numerical tests carried out to validate the theory.
期刊介绍:
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.