The most compact algorithm for Simpson's rule??

12162015, 12:57 AM
(This post was last modified: 12162015 01:53 PM by Namir.)
Post: #15




RE: The most compact algorithm for Simpson's rule??
Here is a version that iterates one less time to calculate the integral:
Code: Given function f(x), integration interval [A, B] and N divisions, where N is even. The last iteration multiplies f(A) by 4 and leaves C with the value of 2. The initial value of Sum is initialized as f(A)+f(B). By controlling the loop with a counter, we can have a compact version that does not not do extra calculations. Namir 

« Next Oldest  Next Newest »

User(s) browsing this thread: 2 Guest(s)