Faster method of numerical Integration?
7 次查看(过去 30 天)
显示 更早的评论
Howdy,
I'm currently running a for loop containing only the trapezoidal rule and a count variable, i.e. something like:
for n=2:length(a)
computeVel(n-1,1) = trapz(a,b);
n=n+1;
end
I'm running this for 600k iterations, and will be running it often. I need the solution at each successive upper bound in the vector 'b.' I.e., if b=[1,2,3,4] i need the integral on 1 to 2, 1 to 3, and 1 to 4.
Is there a fast(er) way to do this?
0 个评论
采纳的回答
更多回答(0 个)
另请参阅
产品
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!