AngouriMath

Navigation

← Back to list of members

WithoutDecimalCopies​(System.​Collections.​Generic.​List{System.​Collections.​Generic.​List{AngouriMath.​Entity}})

 Method (no overloads)

Summary

rows without a row that is a copy of another: one equal to an
earlier row, and one with a number in it that is not exact, each of whose entries is
within a part in a million of an exact row's.

Remarks

Two branches of an elimination can reach one solution, and both were answered: the
circles (x - 3/2)^2 + (y - sqrt(3)/2)^2 = 1 and (x - 1)^2 + y^2 = 1 met at
(1/2, sqrt(3)/2) twice. Where one branch went through Newton's method the copy
is a decimal: (x - 1/2)^2 + (y - sqrt(3)/2)^2 = 1 with the same second circle
met at (3/2, sqrt(3)/2) and again where x is 1.4999999999999997.
The tolerance is a part in a million, not the double's own precision: a root taken
of the decimal multiplies its error, and that copy's y is out by about
2e-8. A decimal row that no exact row agrees with is kept: it is the answer the
search found, as a root of one equation is.
https://github.com/asc-community/AngouriMath/issues/2138

























Angouri © 2019-2026 · Project's repo · Site's repo · Octicons · Transparency · 5629 pages online