Timeline for Multiple solutions from NSolve
Current License: CC BY-SA 4.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 15, 2023 at 4:13 | answer | added | Goofy | timeline score: 1 | |
| Nov 9, 2023 at 6:22 | answer | added | Alex Trounev | timeline score: 2 | |
| Nov 9, 2023 at 3:38 | comment | added | Alex Trounev | @Hugh Are you looking for an unique solution that depends on a parameter? | |
| Nov 8, 2023 at 22:57 | comment | added | Bill |
As a quick experiment, looking at @DanielHuber 's solution I replace A[0],A[2],B[2] with zeros, eliminate all decimal points, and then InputForm[Expand[N[Simplify[Reduce[eqns, uk]]]]] quickly gives 9 solutions for A[1] and A[3],B[1],B[3] are each 8th degree polynomials in your choice of A[1] Without the Expand those polynomials involve coefficients ~=10^200
|
|
| Nov 8, 2023 at 21:10 | answer | added | Daniel Huber | timeline score: 1 | |
| Nov 8, 2023 at 14:47 | comment | added | Hugh |
@AlexTrounev I tried using FindRoot. It needs starting values so I used random ones and then I get a failure due to lack of MachinePrecision.
|
|
| Nov 8, 2023 at 14:34 | comment | added | Alex Trounev |
Why not to use FindRoot?
|
|
| Nov 8, 2023 at 14:32 | comment | added | Hugh |
@DanielHuber Increasing or decreasing WorkingPrecision results in "Subsystem could not be solved". Also, takes a long time to reach that conclusion.
|
|
| Nov 8, 2023 at 14:18 | comment | added | Hugh |
@Nasser well spotted. Bad habit of using NDSolve more than NSolve. Thanks corrected.
|
|
| Nov 8, 2023 at 14:17 | history | edited | Hugh | CC BY-SA 4.0 |
Title wrong corrected
|
| Nov 8, 2023 at 13:17 | comment | added | Daniel Huber | You have a precision problem. Therefore, increase "WorkingPrecision" | |
| Nov 8, 2023 at 12:59 | history | asked | Hugh | CC BY-SA 4.0 |