Timeline for Computation Complexity for Golden Section method
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 20, 2015 at 21:50 | comment | added | Cror2014 | You're right. I was making a mistake in proving it. | |
| Jan 20, 2015 at 21:49 | vote | accept | Cror2014 | ||
| Jan 20, 2015 at 20:35 | comment | added | Igor Rivin | The proof is in the notes. | |
| Jan 20, 2015 at 19:03 | comment | added | Cror2014 | Thanks for your answer, but how is it possible to show that the computation complexity is O(log(1/epsilon))? | |
| Jan 20, 2015 at 18:28 | history | answered | Igor Rivin | CC BY-SA 3.0 |