Expand description
Auto-generated module
🤖 Generated with SplitRS
Traits§
- Interval
Constraint - Simple constraint propagation over interval boxes.
Functions§
- abs_
interval - Interval absolute value.
- atan_
interval - Conservative interval for
atan(a). - cos_
interval - Interval cos: conservative enclosure of cos over
[lo, hi]. - exp_
interval - Interval exp:
exp([lo, hi]) = [exp(lo), exp(hi)]. - interval_
bisection - Find all root-containing sub-intervals using bisection with an inclusion function.
- interval_
max - Interval max:
max([a.lo,a.hi], [b.lo,b.hi]) = [max(a.lo,b.lo), max(a.hi,b.hi)]. - interval_
min - Interval min:
min([a.lo,a.hi], [b.lo,b.hi]) = [min(a.lo,b.lo), min(a.hi,b.hi)]. - interval_
newton - Perform interval Newton iteration on a function
fwith derivativef'. - krawczyk_
operator - Krawczyk operator for root verification.
- ln_
interval - Interval ln:
ln([lo, hi]) = [ln(lo), ln(hi)]. Panics iflo <= 0. - pow_
interval - Interval power: compute
a^nfor non-negative integern. - propagate_
constraints - Run constraint propagation to a fixed point (or max iterations).
- range_
by_ subdivision - Evaluates
fon each sub-interval and returns the hull of all results. - sample_
enclosure - Returns a tighter interval bound for
fon[a.lo, a.hi]by evaluating atnequally-spaced sample points and taking their hull. - sin_
interval - Interval sin: conservative enclosure of sin over
[lo, hi]. - sqrt_
interval - Interval sqrt:
sqrt([lo, hi]) = [sqrt(lo), sqrt(hi)]. - square
- Tighter squaring of an interval (tighter than
a * a). - subdivide
- Recursively splits
ivuntil all sub-intervals have width ≤max_width. - tan_
interval - Conservative interval bound for
tan(a). - taylor_
enclosure - First-order Taylor enclosure of
faround the midpoint ofiv.