Timeline for Shortest Program to Solve a Quartic Equation
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 17, 2020 at 9:04 | history | edited | CommunityBot |
Commonmark migration
|
|
| Feb 19, 2014 at 22:28 | history | edited | Digital Trauma | CC BY-SA 3.0 |
added 7 characters in body
|
| Feb 19, 2014 at 22:02 | comment | added | Level River St | Divide by zero is a major issue. If your code fails to find a solution, it won't be for lack of iterations. It will be because it gets caught in one of the local maxima/minima, where dy/dx falls to zero. Newton-Raphson will try to divide by zero and the program will crash. With a quadratic such as x^2+1 (only one maximum/minimum) this error could be trapped and used as conclusive proof of no real roots. But a quartic has up to 3 local maxima/minima so you don't know if there's really no roots or if you made a bad first guess for x. | |
| Feb 19, 2014 at 21:42 | history | edited | Digital Trauma | CC BY-SA 3.0 |
added 129 characters in body
|
| Feb 19, 2014 at 21:33 | history | edited | Digital Trauma | CC BY-SA 3.0 |
deleted 21 characters in body
|
| Feb 19, 2014 at 21:21 | history | edited | Digital Trauma | CC BY-SA 3.0 |
deleted 1 characters in body
|
| Feb 19, 2014 at 20:56 | history | answered | Digital Trauma | CC BY-SA 3.0 |