The most compact algorithm for Simpson's rule??
|
12-12-2015, 11:02 PM
Post: #9
|
|||
|
|||
RE: The most compact algorithm for Simpson's rule??
This is a slightly different version based on one of Dieter's remarks.
Code: h=(B-A)/N |
|||
« Next Oldest | Next Newest »
|
User(s) browsing this thread: 1 Guest(s)