I updated my previous 2 order problem solver and 1 order problem solver to work with N order systems of equations, where N > 0 and < 100. At N = 1 you are doing Runge-Kutta order 4 estimation.
You just have to set up all the equations and then pass them in along with an initial value for each one. Your functions will be passed an array of long doubles in u[] from 0 to n-1.
Source code is here:
https://github.com/BuckRogers1965/Examples/blob/master/Math/NumericAnalysis/SysEqNOrderTest.c
https://github.com/BuckRogers1965/Examples/blob/master/Math/NumericAnalysis/SysEqNOrder.h
https://github.com/BuckRogers1965/Examples/blob/master/Math/NumericAnalysis/SysEqNOrder.c
First you create an object, setting it's start, end, steps per unit, and title.
Next you add Orders one at a time, with the initial value and function to use at that order.
One all the orders are entered, call the calculate function to generate the results.
Then call the print function to output the results.
There are also methods to get the results programatically.
Finally dispose of the object and you are done.
Thinking about adding an actual result function that, if present, will print out with the results as the first column.
Subscribe to:
Post Comments (Atom)
Progress on the campaign manager
You can see that you can build tactical maps automatically from the world map data. You can place roads, streams, buildings. The framework ...
-
The tent smelled of ozone, sawdust, and cheap miracles. On a rickety stage, a man named Constantine adjusted the frayed cuffs of his tuxedo...
-
So, I saw this kit on Amazon. It seemed too good too be true. The kit was priced right, it was less than 2 dollars for each board. Of co...
-
My plan was to get the most use possible from the $5 raspberry Pi Zero that I managed to get my hands onto by buying a full kit that include...
No comments:
Post a Comment