1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
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
* Thu Jun 08 2023 Python_Bot <Python_Bot@openeuler.org> - 0.2.0-1
- Package Spec generated
|
