Timeline for Why Findroot slower with Jacobian?
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 3, 2021 at 2:54 | history | edited | user49047 | CC BY-SA 4.0 |
edited title
|
| Aug 6, 2018 at 15:01 | history | tweeted | twitter.com/StackMma/status/1026483525619523584 | ||
| Jun 22, 2018 at 14:59 | vote | accept | user49047 | ||
| Jun 18, 2018 at 18:09 | comment | added | user49047 | @ Michael E2 it actually makes a difference and you are right i dont even know why i was evaluating Jacobian at initial points. now i have another question. if function and Jacobian being updated at each loop then what is the best way to tackle this problem? you can also post the answer and i will accept it . | |
| Jun 18, 2018 at 17:32 | comment | added | Michael E2 |
You get some improvement by updating the Jacobian at each step, instead of using the constant Jac. at the starting point {x0, y0} (i.e., use Jacobian :> cDf[x, y]).
|
|
| Jun 18, 2018 at 15:59 | answer | added | Henrik Schumacher | timeline score: 2 | |
| Jun 18, 2018 at 12:34 | comment | added | Henrik Schumacher |
I gues, the amount of numbercrunching within cDf is not enough to ammortized the calling overhead. This problem is just too small.
|
|
| Jun 18, 2018 at 12:27 | history | asked | user49047 | CC BY-SA 4.0 |