x
Yes
No
Do you want to visit DriveHQ English website?
首页
产品服务
价格
免费试用
下载客户端
关于我们
云文件服务
|
云备份服务
|
FTP服务
|
企业邮箱服务
|
网站托管
|
客户端软件
云文件服务
云备份服务
FTP服务
企业级邮箱服务
网站托管
客户端软件
solve.hpp - Hosted on DriveHQ Cloud IT Platform
返回上层目录
上传
下载
共享
发布
新建文件夹
新建文件
复制
剪切
删除
粘贴
评论
升级服务
路径: \\game3dprogramming\materials\GameFactory\GameFactoryDemo\references\boost_1_35_0\boost\math\tools\solve.hpp
旋转
特效
属性
历史版本
// (C) Copyright John Maddock 2006. // 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_TOOLS_SOLVE_HPP #define BOOST_MATH_TOOLS_SOLVE_HPP #include
#include
#ifdef BOOST_MSVC #pragma warning(push) #pragma warning(disable:4996 4267 4244) #endif #include
#include
#include
#ifdef BOOST_MSVC #pragma warning(pop) #endif namespace boost{ namespace math{ namespace tools{ // // Find x such that Ax = b // // Caution: this uses undocumented, and untested ublas code, // however short of writing our own LU-decompostion code // it's the only game in town. // template
boost::numeric::ublas::vector
solve( const boost::numeric::ublas::matrix
& A_, const boost::numeric::ublas::vector
& b_) { //BOOST_ASSERT(A_.size() == b_.size()); boost::numeric::ublas::matrix
A(A_); boost::numeric::ublas::vector
b(b_); boost::numeric::ublas::permutation_matrix<> piv(b.size()); lu_factorize(A, piv); lu_substitute(A, piv, b); // // iterate to reduce error: // boost::numeric::ublas::vector
delta(b.size()); for(unsigned i = 0; i < 1; ++i) { noalias(delta) = prod(A_, b); delta -= b_; lu_substitute(A, piv, delta); b -= delta; T max_error = 0; for(unsigned i = 0; i < delta.size(); ++i) { T err = fabs(delta[i] / b[i]); if(err > max_error) max_error = err; } //std::cout << "Max change in LU error correction: " << max_error << std::endl; } return b; } }}} // namespaces #endif // BOOST_MATH_TOOLS_SOLVE_HPP
solve.hpp
网页地址
文件地址
上一页
12/19
下一页
下载
( 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.