Skip to main content

Recursively defined interpolation nodes for the simplex

Project description

recursivenodes: Recursive, parameter-free, explicitly defined interpolation nodes for simplices

This package includes one module level function, recursive_nodes(), which returns nodes for polynomial interpolation on the simplex in arbitrary dimensions.

The nodes have a few nice properties: they are explicitly constructed and fully symmetric, and their traces on edges are Lobatto-Gauss-Legendre nodes (or any other node set you wish to use). Among explicitly constructed nodes, they appear to have the best interpolation properties. You can find more details in the documentation, and even more in the preprint.

    title={Recursive, parameter-free, explicitly defined interpolation nodes for simplices},
    author={Tobin Isaac},


  • Only numpy is needed for recursive_nodes().
  • The lebesgue submodules requires scipy.
  • Testing requires coverage, pytest and matplotlib.
  • Building documentation additionally requires sphinx, sphinxcontrib-bibtex, and sphinxcontrib-tikz.

Project details

Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Files for recursivenodes, version 0.2.0
Filename, size File type Python version Upload date Hashes
Filename, size recursivenodes-0.2.0-py3-none-any.whl (42.9 kB) File type Wheel Python version py3 Upload date Hashes View
Filename, size recursivenodes-0.2.0.tar.gz (41.1 kB) File type Source Python version None Upload date Hashes View

Supported by

Pingdom Pingdom Monitoring Google Google Object Storage and Download Analytics Sentry Sentry Error logging AWS AWS Cloud computing DataDog DataDog Monitoring Fastly Fastly CDN DigiCert DigiCert EV certificate StatusPage StatusPage Status page