Treating the Gibbs phenomenon in barycentric rational interpolation and approximation via the S-Gibbs algorithm (Q2184976)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 7208171
Language Label Description Also known as
default for all languages
No label defined
    English
    Treating the Gibbs phenomenon in barycentric rational interpolation and approximation via the S-Gibbs algorithm
    scientific article; zbMATH DE number 7208171

      Statements

      Treating the Gibbs phenomenon in barycentric rational interpolation and approximation via the S-Gibbs algorithm (English)
      0 references
      0 references
      0 references
      0 references
      0 references
      4 June 2020
      0 references
      A very successful approach in interpolation and approximation theory is the method of mapped bases and fake notes for polynomial interpolation. Its principal advantages are the taming of the Gibb's phenomenon and creating more stable approximants; the idea is to combine an approximation method with a precursory mapping of the interpolation points by other functions to improved locations. The locations may of course depend on our particular numerical problem, but typically there could be denser points towards to boundary or singularities (stemming from originally equally spaced points). This can be viewed as either creating new, different nodes, or as mapping the (polynomial) bases. In this paper, this idea is combined -- for the same purposes -- with rational approximation methods. An especially challenging task is the approximation of discontinuous functions by any type of interpolation method, and in the article, this is successfully done by the combination of these two ideas.
      0 references
      barycentric rational interpolation
      0 references
      Gibbs phenomenon
      0 references
      Floater-Hormann interpolant
      0 references
      AAA algorithm
      0 references
      fake nodes
      0 references
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references