MATLAB Composite Simpsons 1/3 matlab code

AI Thread Summary
The discussion revolves around a MATLAB function implementing Simpson's 1/3 rule for numerical integration. The user reports issues with the function producing double results when using a greater number of segments. Key points include the need to ensure that the number of intervals is even for accurate results, as well as the importance of correctly defining the step size, h, which should be calculated as (b-a)/n rather than (b-a)/(n-1). There are also recommendations to avoid using real numbers as loop counters due to potential rounding errors that can lead to unexpected behavior, such as missing the last point in the loop. The user expresses gratitude for the feedback and indicates they have made adjustments to the function, seeking further clarification on the issues with their original loop counter setup. The conversation emphasizes the importance of testing with known analytical results to validate the implementation.
haz
Messages
3
Reaction score
0
hey guys,
So I'm working on a MATLAB function that uses simpsons 1/3 rule to find an integral.
This is what I have done so far, but I'm not 100% confident.. I seem to get double when I use greater segments.
If anyone would be able to have a look at give me some tips that would be very much appreciated.

function [ I ] = simpsons3( func,a,b,n )
%Finds estimate integral from a to b of function using simpson 1/3 rule

% % INPUTS
% % func = function
% % a = lower limit
% % b = upper limit
% % n=number of segments used for integration
% % OUTPUTS
% % I = integral estimate

h = (b-a)/(n-1);
sumE = 0;
for i = a+2*h:h:b-2*h
sumE = sumE + func(i);
end
sumO = 0;
for i = a+h:h:b-h
sumO = sumO + func(i);
end
I = (h/3)*(func(a)+4*sumE+2*sumO+func(b));
 
Physics news on Phys.org
haz said:
So I'm working on a MATLAB function that uses simpsons 1/3 rule to find an integral.
This is what I have done so far, but I'm not 100% confident.. I seem to get double when I use greater segments.
Always good to test with a function for which you know the analytical result and compare.

haz said:
Code:
function [ I ] = simpsons3( func,a,b,n )
%Finds estimate integral from a to b of function using simpson 1/3 rule

% % INPUTS
% % func = function
% % a = lower limit
% % b = upper limit
% % n=number of segments used for integration
% % OUTPUTS
% % I = integral estimate

h = (b-a)/(n-1);
Minor point, but if n is the number of intervals, then
Code:
h = (b-a)/n;

haz said:
Code:
sumE = 0;
for i = a+2*h:h:b-2*h
sumE = sumE + func(i);
end
sumO = 0;
for i = a+h:h:b-h
sumO = sumO + func(i);
end
First, it is a bad idea to use real values for a for loop counter. Use integers and calculate the independent variable from h at each step.

Second, you are doubly counting the interior points. Each sum should add points that are 2h apart, not h.

Third, such an implementation of the Simpson rule only works if the number of intervals is even (or n odd according to your definition of h), otherwise it will return a result with a greater error.
 
Thankyou very much for your reply.
I actually was able to make these adjustments before reading your reply but you have given me confidence so thankyou!
I am however confused as to why it is a bad idea to set up my for loop counters as I have done. Would you be able to tell be me why it is bad and give me examples as too when this would fail.
 
Because of rounding errors, you can end up with unexpected behaviour at the termination of a for loop. Say you have a for loop that counts to 15, but when you add the step sizes h, you end up with the last values being 15.00000001. This being > 15, the loop will exit without the last point being counted.
 

Similar threads

Replies
4
Views
1K
Replies
4
Views
4K
Replies
1
Views
9K
Replies
3
Views
2K
Replies
4
Views
3K
Replies
5
Views
3K
Replies
3
Views
1K
Back
Top