x
Yes
No
Do you want to visit DriveHQ English website?
首页
产品服务
价格
免费试用
下载客户端
关于我们
云文件服务
|
云备份服务
|
FTP服务
|
企业邮箱服务
|
网站托管
|
客户端软件
云文件服务
云备份服务
FTP服务
企业级邮箱服务
网站托管
客户端软件
bessel_yn.hpp - Hosted on DriveHQ Cloud IT Platform
返回上层目录
上传
下载
共享
发布
新建文件夹
新建文件
复制
剪切
删除
粘贴
评论
升级服务
路径: \\game3dprogramming\materials\GameFactory\GameFactoryDemo\references\boost_1_35_0\boost\math\special_functions\detail\bessel_yn.hpp
旋转
特效
属性
历史版本
// Copyright (c) 2006 Xiaogang Zhang // Use, modification and distribution are subject to the // Boost Software License, Version 1.0. (See accompanying file // LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) #ifndef BOOST_MATH_BESSEL_YN_HPP #define BOOST_MATH_BESSEL_YN_HPP #include
#include
#include
// Bessel function of the second kind of integer order // Y_n(z) is the dominant solution, forward recurrence always OK (though unstable) namespace boost { namespace math { namespace detail{ template
T bessel_yn(int n, T x, const Policy& pol) { T value, factor, current, prev; using namespace boost::math::tools; static const char* function = "boost::math::bessel_yn<%1%>(%1%,%1%)"; if ((x == 0) && (n == 0)) { return -policies::raise_overflow_error
(function, 0, pol); } if (x <= 0) { return policies::raise_domain_error
(function, "Got x = %1%, but x must be > 0, complex result not supported.", x, pol); } // // Reflection comes first: // if (n < 0) { factor = (n & 0x1) ? -1 : 1; // Y_{-n}(z) = (-1)^n Y_n(z) n = -n; } else { factor = 1; } if (n == 0) { value = bessel_y0(x, pol); } else if (n == 1) { value = factor * bessel_y1(x, pol); } else { prev = bessel_y0(x, pol); current = bessel_y1(x, pol); int k = 1; BOOST_ASSERT(k < n); do { value = 2 * k * current / x - prev; prev = current; current = value; ++k; } while(k < n); value *= factor; } return value; } }}} // namespaces #endif // BOOST_MATH_BESSEL_YN_HPP
bessel_yn.hpp
网页地址
文件地址
上一页
14/24
下一页
下载
( 1 KB )
Comments
Total ratings:
0
Average rating:
无评论
of 10
Would you like to comment?
Join now
, or
Logon
if you are already a member.