1 // Special functions -*- C++ -*-
3 // Copyright (C) 2006, 2007, 2008
4 // Free Software Foundation, Inc.
6 // This file is part of the GNU ISO C++ Library. This library is free
7 // software; you can redistribute it and/or modify it under the
8 // terms of the GNU General Public License as published by the
9 // Free Software Foundation; either version 2, or (at your option)
12 // This library is distributed in the hope that it will be useful,
13 // but WITHOUT ANY WARRANTY; without even the implied warranty of
14 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 // GNU General Public License for more details.
17 // You should have received a copy of the GNU General Public License along
18 // with this library; see the file COPYING. If not, write to the Free
19 // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
22 // As a special exception, you may use this file as part of a free software
23 // library without restriction. Specifically, if other files instantiate
24 // templates or use macros or inline functions from this file, or you compile
25 // this file and link it with other files to produce an executable, this
26 // file does not by itself cause the resulting executable to be covered by
27 // the GNU General Public License. This exception does not however
28 // invalidate any other reasons why the executable file might be covered by
29 // the GNU General Public License.
31 /** @file tr1/legendre_function.tcc
32 * This is an internal header file, included by other library headers.
33 * You should not attempt to use it directly.
37 // ISO C++ 14882 TR1: 5.2 Special functions
40 // Written by Edward Smith-Rowland based on:
41 // (1) Handbook of Mathematical Functions,
42 // ed. Milton Abramowitz and Irene A. Stegun,
43 // Dover Publications,
44 // Section 8, pp. 331-341
45 // (2) The Gnu Scientific Library, http://www.gnu.org/software/gsl
46 // (3) Numerical Recipes in C, by W. H. Press, S. A. Teukolsky,
47 // W. T. Vetterling, B. P. Flannery, Cambridge University Press (1992),
48 // 2nd ed, pp. 252-254
50 #ifndef _GLIBCXX_TR1_LEGENDRE_FUNCTION_TCC
51 #define _GLIBCXX_TR1_LEGENDRE_FUNCTION_TCC 1
53 #include "special_function_util.h"
60 // [5.2] Special functions
62 // Implementation-space details.
67 * @brief Return the Legendre polynomial by recursion on order
70 * The Legendre function of @f$ l @f$ and @f$ x @f$,
71 * @f$ P_l(x) @f$, is defined by:
73 * P_l(x) = \frac{1}{2^l l!}\frac{d^l}{dx^l}(x^2 - 1)^{l}
76 * @param l The order of the Legendre polynomial. @f$l >= 0@f$.
77 * @param x The argument of the Legendre polynomial. @f$|x| <= 1@f$.
79 template<typename _Tp>
81 __poly_legendre_p(const unsigned int __l, const _Tp __x)
84 if ((__x < _Tp(-1)) || (__x > _Tp(+1)))
85 std::__throw_domain_error(__N("Argument out of range"
86 " in __poly_legendre_p."));
87 else if (__isnan(__x))
88 return std::numeric_limits<_Tp>::quiet_NaN();
89 else if (__x == +_Tp(1))
91 else if (__x == -_Tp(1))
92 return (__l % 2 == 1 ? -_Tp(1) : +_Tp(1));
104 for (unsigned int __ll = 2; __ll <= __l; ++__ll)
106 // This arrangement is supposed to be better for roundoff
107 // protection, Arfken, 2nd Ed, Eq 12.17a.
108 __p_l = _Tp(2) * __x * __p_lm1 - __p_lm2
109 - (__x * __p_lm1 - __p_lm2) / _Tp(__ll);
120 * @brief Return the associated Legendre function by recursion
123 * The associated Legendre function is derived from the Legendre function
124 * @f$ P_l(x) @f$ by the Rodrigues formula:
126 * P_l^m(x) = (1 - x^2)^{m/2}\frac{d^m}{dx^m}P_l(x)
129 * @param l The order of the associated Legendre function.
131 * @param m The order of the associated Legendre function.
133 * @param x The argument of the associated Legendre function.
136 template<typename _Tp>
138 __assoc_legendre_p(const unsigned int __l, const unsigned int __m,
142 if (__x < _Tp(-1) || __x > _Tp(+1))
143 std::__throw_domain_error(__N("Argument out of range"
144 " in __assoc_legendre_p."));
146 std::__throw_domain_error(__N("Degree out of range"
147 " in __assoc_legendre_p."));
148 else if (__isnan(__x))
149 return std::numeric_limits<_Tp>::quiet_NaN();
151 return __poly_legendre_p(__l, __x);
157 // Two square roots seem more accurate more of the time
159 _Tp __root = std::sqrt(_Tp(1) - __x) * std::sqrt(_Tp(1) + __x);
161 for (unsigned int __i = 1; __i <= __m; ++__i)
163 __p_mm *= -__fact * __root;
170 _Tp __p_mp1m = _Tp(2 * __m + 1) * __x * __p_mm;
174 _Tp __p_lm2m = __p_mm;
175 _Tp __P_lm1m = __p_mp1m;
177 for (unsigned int __j = __m + 2; __j <= __l; ++__j)
179 __p_lm = (_Tp(2 * __j - 1) * __x * __P_lm1m
180 - _Tp(__j + __m - 1) * __p_lm2m) / _Tp(__j - __m);
191 * @brief Return the spherical associated Legendre function.
193 * The spherical associated Legendre function of @f$ l @f$, @f$ m @f$,
194 * and @f$ \theta @f$ is defined as @f$ Y_l^m(\theta,0) @f$ where
196 * Y_l^m(\theta,\phi) = (-1)^m[\frac{(2l+1)}{4\pi}
197 * \frac{(l-m)!}{(l+m)!}]
198 * P_l^m(\cos\theta) \exp^{im\phi}
200 * is the spherical harmonic function and @f$ P_l^m(x) @f$ is the
201 * associated Legendre function.
203 * This function differs from the associated Legendre function by
204 * argument (@f$x = \cos(\theta)@f$) and by a normalization factor
205 * but this factor is rather large for large @f$ l @f$ and @f$ m @f$
206 * and so this function is stable for larger differences of @f$ l @f$
209 * @param l The order of the spherical associated Legendre function.
211 * @param m The order of the spherical associated Legendre function.
213 * @param theta The radian angle argument of the spherical associated
216 template <typename _Tp>
218 __sph_legendre(const unsigned int __l, const unsigned int __m,
221 if (__isnan(__theta))
222 return std::numeric_limits<_Tp>::quiet_NaN();
224 const _Tp __x = std::cos(__theta);
228 std::__throw_domain_error(__N("Bad argument "
229 "in __sph_legendre."));
233 _Tp __P = __poly_legendre_p(__l, __x);
234 _Tp __fact = std::sqrt(_Tp(2 * __l + 1)
235 / (_Tp(4) * __numeric_constants<_Tp>::__pi()));
239 else if (__x == _Tp(1) || __x == -_Tp(1))
246 // m > 0 and |x| < 1 here
248 // Starting value for recursion.
249 // Y_m^m(x) = sqrt( (2m+1)/(4pi m) gamma(m+1/2)/gamma(m) )
250 // (-1)^m (1-x^2)^(m/2) / pi^(1/4)
251 const _Tp __sgn = ( __m % 2 == 1 ? -_Tp(1) : _Tp(1));
252 const _Tp __y_mp1m_factor = __x * std::sqrt(_Tp(2 * __m + 3));
253 #if _GLIBCXX_USE_C99_MATH_TR1
254 const _Tp __lncirc = std::tr1::log1p(-__x * __x);
256 const _Tp __lncirc = std::log(_Tp(1) - __x * __x);
258 // Gamma(m+1/2) / Gamma(m)
259 #if _GLIBCXX_USE_C99_MATH_TR1
260 const _Tp __lnpoch = std::tr1::lgamma(_Tp(__m + _Tp(0.5L)))
261 - std::tr1::lgamma(_Tp(__m));
263 const _Tp __lnpoch = __log_gamma(_Tp(__m + _Tp(0.5L)))
264 - __log_gamma(_Tp(__m));
266 const _Tp __lnpre_val =
267 -_Tp(0.25L) * __numeric_constants<_Tp>::__lnpi()
268 + _Tp(0.5L) * (__lnpoch + __m * __lncirc);
269 _Tp __sr = std::sqrt((_Tp(2) + _Tp(1) / __m)
270 / (_Tp(4) * __numeric_constants<_Tp>::__pi()));
271 _Tp __y_mm = __sgn * __sr * std::exp(__lnpre_val);
272 _Tp __y_mp1m = __y_mp1m_factor * __y_mm;
278 else if (__l == __m + 1)
286 // Compute Y_l^m, l > m+1, upward recursion on l.
287 for ( int __ll = __m + 2; __ll <= __l; ++__ll)
289 const _Tp __rat1 = _Tp(__ll - __m) / _Tp(__ll + __m);
290 const _Tp __rat2 = _Tp(__ll - __m - 1) / _Tp(__ll + __m - 1);
291 const _Tp __fact1 = std::sqrt(__rat1 * _Tp(2 * __ll + 1)
292 * _Tp(2 * __ll - 1));
293 const _Tp __fact2 = std::sqrt(__rat1 * __rat2 * _Tp(2 * __ll + 1)
294 / _Tp(2 * __ll - 3));
295 __y_lm = (__x * __y_mp1m * __fact1
296 - (__ll + __m - 1) * __y_mm * __fact2) / _Tp(__ll - __m);
306 } // namespace std::tr1::__detail
310 #endif // _GLIBCXX_TR1_LEGENDRE_FUNCTION_TCC