Timeline for Fastest way to implement Secant method on calculator
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 16, 2021 at 10:05 | vote | accept | IamThat | ||
| Jan 16, 2021 at 3:40 | answer | added | Simply Beautiful Art | timeline score: 3 | |
| Jan 15, 2021 at 16:09 | history | edited | IamThat | CC BY-SA 4.0 |
Corrected another mistake in one of the operations
|
| Jan 15, 2021 at 16:04 | comment | added | IamThat | @CarlChristian I have made an edit. Sorry, while posting the question, I had mentioned the wrong operations. The formula is working fine, I have solved atleast 15 problems with the correct answer (convergent) using the above algorithm. The only problem is that it takes a bit of time. Accuracy is not an issue, as I said, I have to solve this question in exams not in real life projects. | |
| Jan 15, 2021 at 16:00 | history | edited | IamThat | CC BY-SA 4.0 |
Operation was wrongly mentioned
|
| Jan 15, 2021 at 15:48 | comment | added | Carl Christian | You are currently calculating $C$ in a manner which will cause subtractive cancellation. This will (severely) limit the accuracy that you can achieve. You really need to compute $x_{n+1} = x_n - f(x_n) a_n$ where $a_n = \frac{x_n - x_{n-1}}{f(x_n)-f(x_{n-1})}$ to avoid this. There are alternatives, but those are expensive. | |
| Jan 15, 2021 at 12:16 | history | asked | IamThat | CC BY-SA 4.0 |