AngouriMath
WithoutConditions(AngouriMath.Entity)
Method (no overloads)
Summary
Strips the domain conditions off an expression. Simplification leaves them
behind -- log(a) + log(b) only collapses to log(a * b) where both are positive,
for one -- and the compiler has no way to represent an Providedf,
sox + ln(x) = 0 used to come out of the public solver as an
UncompilableNodeException. Newton iterates on the
unconditioned expression and Satisfies(AngouriMath.Entity,AngouriMath.Entity.Variable,AngouriMath.Entity.Number.Complex) re-imposes the conditions.
behind -- log(a) + log(b) only collapses to log(a * b) where both are positive,
for one -- and the compiler has no way to represent an Providedf,
so
UncompilableNodeException. Newton iterates on the
unconditioned expression and Satisfies(AngouriMath.Entity,AngouriMath.Entity.Variable,AngouriMath.Entity.Number.Complex) re-imposes the conditions.
Angouri © 2019-2023 · Project's repo · Site's repo · Octicons · Transparency · 1953 pages online