CPOLYMESH: Matlab and Python codes for complex polynomial approximation by Chebyshev admissible meshes

Authors

  • Dimitri Jordan Kenne 1Doctoral School of Exact and Natural Sciences, Jagiellonian University, Krakow, Poland
  • Alvise Sommariva University' di Padova https://orcid.org/0000-0002-8902-8063
  • Marco Vianello University of Padova

Keywords:

complex polynomial approximation, interpolation, least-squares, admissible polynomial meshes, discrete extremal sets, Approximate Fekete Points, Discrete Leja Points, Pseudo Leja Points, Lebesgue constant. (MSC2020: 65D05,65E05)

Abstract

We provide Matlab and Python codes for polynomial approximation on complex compact sets with connected complement, by Chebyshev-like admissible polynomial meshes on boundaries with piecewise (trigonometric) polynomial parametrization. Such meshes have lower cardinality with respect to those previously known. They are used for polynomial least-squares, for the extraction of extremal interpolation sets of Fekete and Leja type, as well as for the computation of the uniform norms (Lebesgue constants) of polynomial projection operators.

Downloads

Published

2024-09-06

How to Cite

Kenne, D. J., Sommariva, A., & Vianello, M. (2024). CPOLYMESH: Matlab and Python codes for complex polynomial approximation by Chebyshev admissible meshes. Journal of Approximation Software, 1(2). Retrieved from https://ojs.unito.it/index.php/JAS/article/view/10829

Issue

Vol. 1 No. 2 (2024)

Section

Articles

License

JAS only considers unpublished manuscripts.

JAS is committed to electronic open-access publishing since its foundation in 2023 and has chosen to apply the Creative Commons Attribution License (CCAL) CC-BY to all articles.

Under the Creative Commons Attribution License, authors retain ownership of the copyright for their article, but authors allow anyone to download, reuse, reprint, modify, distribute, and/or copy articles in JAS, provided that the original authors and source are credited.