ParaMonte Fortran 2.0.0
Parallel Monte Carlo and Machine Learning Library
See the latest version documentation. |
Compute and return the series expansion of the input function values via the Chebyshev polynomials of the first kind of degrees 12
and 24
using Fast Fourier Transform method.
More...
Compute and return the series expansion of the input function values via the Chebyshev polynomials of the first kind of degrees 12
and 24
using Fast Fourier Transform method.
The returned coefficients are such that,
\begin{eqnarray} f(x) &=& \sum_{k = 1}^{13} \ms{cheb12}(k) \times T(k-1,x) ~, \\ f(x) &=& \sum_{k = 1}^{25} \ms{cheb24}(k) \times T(k-1,x) ~, \end{eqnarray}
where \(T(n,x)\) is the Chebyshev polynomial of the first kind of degree \(n\) evaluated at proper points.
[in,out] | func | : The input/output vector of size 25 of type real of kind any supported by the processor (e.g., RK, RK32, RK64, or RK128), containing the function values. |
[out] | cheb12 | : The output vector of the same type and kind as func , of size 13 , containing the Chebyshev Coefficients of degree 12 . |
[out] | cheb24 | : The output vector of the same type and kind as func , of size 25 , containing the Chebyshev Coefficients of degree 24 . |
Possible calling interfaces ⛓
pure
.
Final Remarks ⛓
If you believe this algorithm or its documentation can be improved, we appreciate your contribution and help to edit this page's documentation and source file on GitHub.
For details on the naming abbreviations, see this page.
For details on the naming conventions, see this page.
This software is distributed under the MIT license with additional terms outlined below.
This software is available to the public under a highly permissive license.
Help us justify its continued development and maintenance by acknowledging its benefit to society, distributing it, and contributing to it.
Definition at line 4838 of file pm_quadPack.F90.