The most compact algorithm for Simpson's rule??

12152015, 12:09 AM
(This post was last modified: 12152015 01:14 AM by Namir.)
Post: #13




RE: The most compact algorithm for Simpson's rule??
(12142015 09:04 PM)Dieter Wrote: I still don't get why you want to compute f(b) twice and generate an additional function call that is not required. Why don't you do it the classic way? To get good results the value of N has to be high. In this case one more call to f(x) does not make much of a difference. By contrast, saving one call to f(x) when N is low is not to help reducing the error. Namir 

« Next Oldest  Next Newest »

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