Average Error: 32.9 → 25.6
Time: 8.5m
Precision: 64
Internal Precision: 576
\[\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)}\]
↓
\[\begin{array}{l} \mathbf{if}\;n \cdot \left(U \cdot 2\right) \le -2.5253379235232403 \cdot 10^{-302}:\\ \;\;\;\;\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell}{\frac{Om}{\ell}}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)}\\ \mathbf{if}\;n \cdot \left(U \cdot 2\right) \le 1.761835295839345 \cdot 10^{-308}:\\ \;\;\;\;\sqrt{2 \cdot \left(\left(\frac{n}{Om} \cdot \frac{n}{Om}\right) \cdot \left(\left(U* \cdot U\right) \cdot \left(\ell \cdot \ell\right) - \left(\ell \cdot U\right) \cdot \left(\ell \cdot U\right)\right) + U \cdot \left(t \cdot n\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{\left(2 \cdot n\right) \cdot U} \cdot \sqrt{\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)}\\ \end{array}\]

Error

Bits error versus n

Bits error versus U

Bits error versus t

Bits error versus l

Bits error versus Om

Bits error versus U*

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Split input into 3 regimes

  2. if (* n (* U 2)) < -2.5253379235232403e-302

    1. Initial program 27.6

      \[\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)}\]
    2. Using strategy rm

    3. Applied associate-/l*24.5

      \[\leadsto \sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \color{blue}{\frac{\ell}{\frac{Om}{\ell}}}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)}\]

    if -2.5253379235232403e-302 < (* n (* U 2)) < 1.761835295839345e-308

    1. Initial program 56.0

      \[\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)}\]

    2. Taylor expanded around inf 46.6

      \[\leadsto \sqrt{\color{blue}{\left(2 \cdot \left(n \cdot \left(t \cdot U\right)\right) + 2 \cdot \frac{{n}^{2} \cdot \left(U* \cdot \left({\ell}^{2} \cdot U\right)\right)}{{Om}^{2}}\right) - 2 \cdot \frac{{n}^{2} \cdot \left({\ell}^{2} \cdot {U}^{2}\right)}{{Om}^{2}}}}\]

    3. Applied simplify40.8

      \[\leadsto \color{blue}{\sqrt{2 \cdot \left(\left(\frac{n}{Om} \cdot \frac{n}{Om}\right) \cdot \left(\left(U* \cdot U\right) \cdot \left(\ell \cdot \ell\right) - \left(\ell \cdot U\right) \cdot \left(\ell \cdot U\right)\right) + U \cdot \left(t \cdot n\right)\right)}}\]

    if 1.761835295839345e-308 < (* n (* U 2))

    1. Initial program 28.3

      \[\sqrt{\left(\left(2 \cdot n\right) \cdot U\right) \cdot \left(\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)\right)}\]
    2. Using strategy rm

    3. Applied sqrt-prod20.0

      \[\leadsto \color{blue}{\sqrt{\left(2 \cdot n\right) \cdot U} \cdot \sqrt{\left(t - 2 \cdot \frac{\ell \cdot \ell}{Om}\right) - \left(n \cdot {\left(\frac{\ell}{Om}\right)}^{2}\right) \cdot \left(U - U*\right)}}\]
  3. Recombined 3 regimes into one program.

Runtime

Time bar (total: 8.5m)Debug logProfile

herbie shell --seed 2018167 
(FPCore (n U t l Om U*)
  :name "Toniolo and Linder, Equation (13)"
  (sqrt (* (* (* 2 n) U) (- (- t (* 2 (/ (* l l) Om))) (* (* n (pow (/ l Om) 2)) (- U U*))))))