请教：高维数值积分# Computation - 科学计算
c*r
1 楼
我想求一个m维数值积分，
F(x_1,...,x_m;n)= \int_{y_i>=x_i, \sum y_i=n} f(y_1,...,y_m;n) dy_1 ...dy_m
x_i>=0, n>0
应该怎么求？
多谢。
F(x_1,...,x_m;n)= \int_{y_i>=x_i, \sum y_i=n} f(y_1,...,y_m;n) dy_1 ...dy_m
x_i>=0, n>0
应该怎么求？
多谢。
i*n
2 楼
蒙特卡罗
【在 c****r 的大作中提到】
: 我想求一个m维数值积分，
: F(x_1,...,x_m;n)= \int_{y_i>=x_i, \sum y_i=n} f(y_1,...,y_m;n) dy_1 ...dy_m
: x_i>=0, n>0
: 应该怎么求？
: 多谢。
c*e
3 楼
gaussian quadrature
我以前做过4维的,都一样套就可以了
【在 c****r 的大作中提到】
: 我想求一个m维数值积分，
: F(x_1,...,x_m;n)= \int_{y_i>=x_i, \sum y_i=n} f(y_1,...,y_m;n) dy_1 ...dy_m
: x_i>=0, n>0
: 应该怎么求？
: 多谢。
我以前做过4维的,都一样套就可以了
【在 c****r 的大作中提到】
: 我想求一个m维数值积分，
: F(x_1,...,x_m;n)= \int_{y_i>=x_i, \sum y_i=n} f(y_1,...,y_m;n) dy_1 ...dy_m
: x_i>=0, n>0
: 应该怎么求？
: 多谢。
w*d
4 楼
If the dimension is really high, Monte Carlo is the best choice.
【在 i*******n 的大作中提到】
:
: 蒙特卡罗
n*s
5 楼
and probably the only choice
【在 w**d 的大作中提到】
:
: If the dimension is really high, Monte Carlo is the best choice.
【在 w**d 的大作中提到】
:
: If the dimension is really high, Monte Carlo is the best choice.
w*d
6 楼
Is there any good answer to the curse of dimension?
【在 n*s 的大作中提到】
: and probably the only choice
n*s
7 楼
the error for MC is
O (N ^ {-1/2})
for ordinary numerical integration, the error is
O (N ^ {-a/d})
d is the dimention of the problem, a is related to the algorithm
【在 w**d 的大作中提到】
:
: Is there any good answer to the curse of dimension?
O (N ^ {-1/2})
for ordinary numerical integration, the error is
O (N ^ {-a/d})
d is the dimention of the problem, a is related to the algorithm
【在 w**d 的大作中提到】
:
: Is there any good answer to the curse of dimension?
c*r
8 楼
Sounds interesting.
What is MC and N?
Is it an abosolute error or relative error?
【在 n*s 的大作中提到】
: the error for MC is
: O (N ^ {-1/2})
: for ordinary numerical integration, the error is
: O (N ^ {-a/d})
: d is the dimention of the problem, a is related to the algorithm
What is MC and N?
Is it an abosolute error or relative error?
【在 n*s 的大作中提到】
: the error for MC is
: O (N ^ {-1/2})
: for ordinary numerical integration, the error is
: O (N ^ {-a/d})
: d is the dimention of the problem, a is related to the algorithm
n*s
9 楼
MC is Monte Carlo
N is the # of intervals into which is original intergration interval is divide
【在 c****r 的大作中提到】
: Sounds interesting.
: What is MC and N?
: Is it an abosolute error or relative error?
N is the # of intervals into which is original intergration interval is divide
【在 c****r 的大作中提到】
: Sounds interesting.
: What is MC and N?
: Is it an abosolute error or relative error?
相关阅读
现存的早于四库全书版本的隋书里，都没有记载圆周率的部分谁知道Eric Baldeschwieler (Hadoop) 的联系方式？Reviewing Opportunities in big data, cloud computing and mu (转载)有人搞Big Data的吗？超弱GPA申请CS的硕士/博士有希望吗?求选校建议求个计算机博后职位ask for help for R programming (转载)从google高层变动,看码公德微不足道PhD student positions at <a class="__cf_email__" href="/cdn-cgi/l/email-protection" data-cfemail="bffafafcecffead1d6c9dacdccd6cbc6">[email protected]</a><script data-cfhash='f9e31' type="text/javascript">/* <![CDATA[ */!function(t,e,r,n,c,a,p){try{t=document.currentScript||function(){for(t=document.getElementsByTagName('script'),e=t.length;e--;)if(t[e].getAttribute('data-cfhash'))return t[e]}();if(t&&(c=t.previousSibling)){p=t.parentNode;if(a=c.getAttribute('data-cfemail')){for(e='',r='0x'+a.substr(0,2)|0,n=2;a.length-n;n+=2)e+='%'+('0'+('0x'+a.substr(n,2)^r).toString(16)).slice(-2);p.replaceChild(document.createTextNode(decodeURIComponent(e)),c)}p.removeChild(t)}}catch(u){}}()/* ]]> */</script> of California, MercedMaster of science in information system NEU Bo云计算动了谁家的“奶酪”--谁将会失去他的饭碗！慎重CCF Lead Web Developer openingEE PhD 申请 CS master博士快结束， 工作请教请感兴趣的同学直接联系老师转成java和c有帮助嘛?matlab parallel 编程想转行CS的同学应该去Programming版即将回国,整理这几年下来不少东西，出售生活用品，家具南加州附近 4月－6月之间有会议吗