AngouriMath
CombinedCaseByCase(AngouriMath.Entity.Piecewise,AngouriMath.Entity.Piecewise,System.Func{AngouriMath.Entity,AngouriMath.Entity,AngouriMath.Entity},System.Func{AngouriMath.Entity,AngouriMath.Entity,AngouriMath.Entity,AngouriMath.Entity},System.Boolean)
Method (no overloads)
Summary
A piecewise combined with a piecewise, case by case: every case of one against every
case of the other, under the conjunction of their predicates.
case of the other, under the conjunction of their predicates.
Remarks
A pair whose conjunction is False is not a case: it is dropped here, before
its expression is even combined, rather than carried as... provided False until the piecewise is next simplified. Two piecewises that split on the same three
signs of one quantity then combine to five cases and not nine -- the three that
agree, and the two opposite strict signs, which are NaN rather than False off the
real line and so stay -- and a sum of such piecewises stays at five instead of
having 3^n cases after n additions.
https://github.com/asc-community/AngouriMath/issues/1414
its expression is even combined, rather than carried as
signs of one quantity then combine to five cases and not nine -- the three that
agree, and the two opposite strict signs, which are NaN rather than False off the
real line and so stay -- and a sum of such piecewises stays at five instead of
having 3^n cases after n additions.
https://github.com/asc-community/AngouriMath/issues/1414
Angouri © 2019-2023 · Project's repo · Site's repo · Octicons · Transparency · 4378 pages online