AngouriMath

Try it live

Navigation

← Back to list of members

Satisfies​(AngouriMath.​Entity,​AngouriMath.​Entity.​Variable,​AngouriMath.​Entity.​Number.​Complex)

 Method (no overloads)

Summary

Whether a candidate root really is one, checked against the expression as it
was handed in rather than against the simplified form Newton iterated on.
Simplification can widen the domain: ln(x) + ln(x+1) becomes
ln(x * (x+1)), whose root -1.618... leaves the original at 2*pi*i, and
the solver reported it as a root of the original equation.

Returns

true for anything that cannot be checked, so that a root is
only ever dropped on positive evidence that it is spurious. A point where the
expression is undefined at exact arguments is such evidence: the compiled form
takes 0^i to be 0, and x^i + x was answered with the root 0.

























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