fact: Definition ComputeBound (prec : Pol.U) (pol : Pol.T) (x : I.type) : I.type := if 3 <= Pol.size pol then let a1 := Pol.nth pol 1 in let a2 := Pol.nth pol 2 in let a2t2 := I.add prec a2 a2 in let a2t4 := I.add prec a2t2 a2t2 in let b1 := I.div prec a1 a2t2 in let b2 := I.div prec (I.sqr prec a1) a2t4 in if I.bounded b2 then I.add prec (I.add prec (I.sub prec (Pol.nth pol 0) b2) (I.mul prec a2 (I.sqr prec (I.add prec x b1)))) (I.mul prec (I.power_int prec x 3) (Pol.horner prec (Pol.tail 3 pol) x)) else Pol.horner prec pol x else Pol.horner prec pol x.
imports: Coq(ZArith Reals) Flocq(Raux) mathcomp.ssreflect(ssreflect ssrfun ssrbool eqtype ssrnat seq fintype bigop) Xreal Interval MathComp Datatypes Bound