From fa4f2beaddcb243df92a4588ed6c2e704ec92015 Mon Sep 17 00:00:00 2001 From: CoprDistGit Date: Wed, 10 May 2023 07:03:49 +0000 Subject: automatic import of python-recursivenodes --- .gitignore | 1 + python-recursivenodes.spec | 181 +++++++++++++++++++++++++++++++++++++++++++++ sources | 1 + 3 files changed, 183 insertions(+) create mode 100644 python-recursivenodes.spec create mode 100644 sources diff --git a/.gitignore b/.gitignore index e69de29..8a3caf5 100644 --- a/.gitignore +++ b/.gitignore @@ -0,0 +1 @@ +/recursivenodes-0.2.0.tar.gz diff --git a/python-recursivenodes.spec b/python-recursivenodes.spec new file mode 100644 index 0000000..cdfe6fc --- /dev/null +++ b/python-recursivenodes.spec @@ -0,0 +1,181 @@ +%global _empty_manifest_terminate_build 0 +Name: python-recursivenodes +Version: 0.2.0 +Release: 1 +Summary: Recursively defined interpolation nodes for the simplex +License: MIT +URL: https://tisaac.gitlab.io/recursivenodes/ +Source0: https://mirrors.nju.edu.cn/pypi/web/packages/5f/7e/d25bcff9964c03939c86b5b68d31c7aa3ac2c430a2cb75d65e21f00e3b11/recursivenodes-0.2.0.tar.gz +BuildArch: noarch + +Requires: python3-numpy +Requires: python3-matplotlib +Requires: python3-pytest +Requires: python3-coverage +Requires: python3-sphinx +Requires: python3-sphinxcontrib-bibtex +Requires: python3-sphinxcontrib-tikz +Requires: python3-scipy +Requires: python3-matplotlib +Requires: python3-sphinx +Requires: python3-sphinxcontrib-bibtex +Requires: python3-sphinxcontrib-tikz +Requires: python3-scipy +Requires: python3-matplotlib +Requires: python3-pytest +Requires: python3-coverage + +%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](https://tisaac.gitlab.io/recursivenodes), and even more in the +[preprint](https://arxiv.org/abs/2002.09421). + +```bibtex +@misc{isaac2020recursive, + title={Recursive, parameter-free, explicitly defined interpolation nodes for simplices}, + author={Tobin Isaac}, + year={2020}, + eprint={2002.09421}, + archivePrefix={arXiv}, + primaryClass={math.NA} +} +``` + +## Requirements: + +- 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`. + + + + +%package -n python3-recursivenodes +Summary: Recursively defined interpolation nodes for the simplex +Provides: python-recursivenodes +BuildRequires: python3-devel +BuildRequires: python3-setuptools +BuildRequires: python3-pip +%description -n python3-recursivenodes +# `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](https://tisaac.gitlab.io/recursivenodes), and even more in the +[preprint](https://arxiv.org/abs/2002.09421). + +```bibtex +@misc{isaac2020recursive, + title={Recursive, parameter-free, explicitly defined interpolation nodes for simplices}, + author={Tobin Isaac}, + year={2020}, + eprint={2002.09421}, + archivePrefix={arXiv}, + primaryClass={math.NA} +} +``` + +## Requirements: + +- 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`. + + + + +%package help +Summary: Development documents and examples for recursivenodes +Provides: python3-recursivenodes-doc +%description help +# `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](https://tisaac.gitlab.io/recursivenodes), and even more in the +[preprint](https://arxiv.org/abs/2002.09421). + +```bibtex +@misc{isaac2020recursive, + title={Recursive, parameter-free, explicitly defined interpolation nodes for simplices}, + author={Tobin Isaac}, + year={2020}, + eprint={2002.09421}, + archivePrefix={arXiv}, + primaryClass={math.NA} +} +``` + +## Requirements: + +- 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`. + + + + +%prep +%autosetup -n recursivenodes-0.2.0 + +%build +%py3_build + +%install +%py3_install +install -d -m755 %{buildroot}/%{_pkgdocdir} +if [ -d doc ]; then cp -arf doc %{buildroot}/%{_pkgdocdir}; fi +if [ -d docs ]; then cp -arf docs %{buildroot}/%{_pkgdocdir}; fi +if [ -d example ]; then cp -arf example %{buildroot}/%{_pkgdocdir}; fi +if [ -d examples ]; then cp -arf examples %{buildroot}/%{_pkgdocdir}; fi +pushd %{buildroot} +if [ -d usr/lib ]; then + find usr/lib -type f -printf "/%h/%f\n" >> filelist.lst +fi +if [ -d usr/lib64 ]; then + find usr/lib64 -type f -printf "/%h/%f\n" >> filelist.lst +fi +if [ -d usr/bin ]; then + find usr/bin -type f -printf "/%h/%f\n" >> filelist.lst +fi +if [ -d usr/sbin ]; then + find usr/sbin -type f -printf "/%h/%f\n" >> filelist.lst +fi +touch doclist.lst +if [ -d usr/share/man ]; then + find usr/share/man -type f -printf "/%h/%f.gz\n" >> doclist.lst +fi +popd +mv %{buildroot}/filelist.lst . +mv %{buildroot}/doclist.lst . + +%files -n python3-recursivenodes -f filelist.lst +%dir %{python3_sitelib}/* + +%files help -f doclist.lst +%{_docdir}/* + +%changelog +* Wed May 10 2023 Python_Bot - 0.2.0-1 +- Package Spec generated diff --git a/sources b/sources new file mode 100644 index 0000000..1d73fd8 --- /dev/null +++ b/sources @@ -0,0 +1 @@ +7e18a2e134135356a63bc0336ec0d05f recursivenodes-0.2.0.tar.gz -- cgit v1.2.3