Timeline for How can I make this implementation of Euler's method more efficient?
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 18, 2014 at 19:44 | comment | added | bynx | I'm having a bit of trouble with your solution, due to the use of sympy, the symbols used cannot be substituted without using subVal, unless if there is another way to substitute an unknown number of symbols with their values without using a dictionary. | |
| Aug 18, 2014 at 18:10 | vote | accept | bynx | ||
| Aug 18, 2014 at 18:10 | comment | added | bynx | Ah. That seems to work much better and thankfully looks much cleaner. Thank you. I drastically over-thought this code. | |
| Aug 18, 2014 at 18:07 | history | edited | vnp | CC BY-SA 3.0 | added 35 characters in body |
| Aug 18, 2014 at 18:06 | comment | added | vnp | You only need to replace init0 with a calculated result. See update. | |
| Aug 18, 2014 at 18:03 | comment | added | bynx | The reason I use eqDict and subVal is because each step the values of 'init0' is changed as the next of the Euler step depends on the solutions of the previous step. I could see how it seems confusing, hence why I assumed that this is not that efficient of a method. The time step is increasing with each Euler step and included in the array of the returned solution, but I do agree, passing mesh does seem quite pointless as I could not find a way to correlate the each mesh point to each Euler step. | |
| Aug 18, 2014 at 17:58 | history | answered | vnp | CC BY-SA 3.0 |