Falkner and Boettcher, Equation (20:1,3)

Percentage Accurate: 99.3% → 99.3%
Time: 6.6s
Alternatives: 8
Speedup: 1.0×

Specification

?
\[\begin{array}{l} \\ \frac{1 - 5 \cdot \left(v \cdot v\right)}{\left(\left(\pi \cdot t\right) \cdot \sqrt{2 \cdot \left(1 - 3 \cdot \left(v \cdot v\right)\right)}\right) \cdot \left(1 - v \cdot v\right)} \end{array} \]
(FPCore (v t)
 :precision binary64
 (/
  (- 1.0 (* 5.0 (* v v)))
  (* (* (* PI t) (sqrt (* 2.0 (- 1.0 (* 3.0 (* v v)))))) (- 1.0 (* v v)))))
double code(double v, double t) {
	return (1.0 - (5.0 * (v * v))) / (((((double) M_PI) * t) * sqrt((2.0 * (1.0 - (3.0 * (v * v)))))) * (1.0 - (v * v)));
}
public static double code(double v, double t) {
	return (1.0 - (5.0 * (v * v))) / (((Math.PI * t) * Math.sqrt((2.0 * (1.0 - (3.0 * (v * v)))))) * (1.0 - (v * v)));
}
def code(v, t):
	return (1.0 - (5.0 * (v * v))) / (((math.pi * t) * math.sqrt((2.0 * (1.0 - (3.0 * (v * v)))))) * (1.0 - (v * v)))
function code(v, t)
	return Float64(Float64(1.0 - Float64(5.0 * Float64(v * v))) / Float64(Float64(Float64(pi * t) * sqrt(Float64(2.0 * Float64(1.0 - Float64(3.0 * Float64(v * v)))))) * Float64(1.0 - Float64(v * v))))
end
function tmp = code(v, t)
	tmp = (1.0 - (5.0 * (v * v))) / (((pi * t) * sqrt((2.0 * (1.0 - (3.0 * (v * v)))))) * (1.0 - (v * v)));
end
code[v_, t_] := N[(N[(1.0 - N[(5.0 * N[(v * v), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(N[(Pi * t), $MachinePrecision] * N[Sqrt[N[(2.0 * N[(1.0 - N[(3.0 * N[(v * v), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(v * v), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}

\\
\frac{1 - 5 \cdot \left(v \cdot v\right)}{\left(\left(\pi \cdot t\right) \cdot \sqrt{2 \cdot \left(1 - 3 \cdot \left(v \cdot v\right)\right)}\right) \cdot \left(1 - v \cdot v\right)}
\end{array}

Sampling outcomes in binary64 precision:

Local Percentage Accuracy vs ?

The average percentage accuracy by input value. Horizontal axis shows value of an input variable; the variable is choosen in the title. Vertical axis is accuracy; higher is better. Red represent the original program, while blue represents Herbie's suggestion. These can be toggled with buttons below the plot. The line is an average while dots represent individual samples.

Accuracy vs Speed?

Herbie found 8 alternatives:

AlternativeAccuracySpeedup
The accuracy (vertical axis) and speed (horizontal axis) of each alternatives. Up and to the right is better. The red square shows the initial program, and each blue circle shows an alternative.The line shows the best available speed-accuracy tradeoffs.

Initial Program: 99.3% accurate, 1.0× speedup?

\[\begin{array}{l} \\ \frac{1 - 5 \cdot \left(v \cdot v\right)}{\left(\left(\pi \cdot t\right) \cdot \sqrt{2 \cdot \left(1 - 3 \cdot \left(v \cdot v\right)\right)}\right) \cdot \left(1 - v \cdot v\right)} \end{array} \]
(FPCore (v t)
 :precision binary64
 (/
  (- 1.0 (* 5.0 (* v v)))
  (* (* (* PI t) (sqrt (* 2.0 (- 1.0 (* 3.0 (* v v)))))) (- 1.0 (* v v)))))
double code(double v, double t) {
	return (1.0 - (5.0 * (v * v))) / (((((double) M_PI) * t) * sqrt((2.0 * (1.0 - (3.0 * (v * v)))))) * (1.0 - (v * v)));
}
public static double code(double v, double t) {
	return (1.0 - (5.0 * (v * v))) / (((Math.PI * t) * Math.sqrt((2.0 * (1.0 - (3.0 * (v * v)))))) * (1.0 - (v * v)));
}
def code(v, t):
	return (1.0 - (5.0 * (v * v))) / (((math.pi * t) * math.sqrt((2.0 * (1.0 - (3.0 * (v * v)))))) * (1.0 - (v * v)))
function code(v, t)
	return Float64(Float64(1.0 - Float64(5.0 * Float64(v * v))) / Float64(Float64(Float64(pi * t) * sqrt(Float64(2.0 * Float64(1.0 - Float64(3.0 * Float64(v * v)))))) * Float64(1.0 - Float64(v * v))))
end
function tmp = code(v, t)
	tmp = (1.0 - (5.0 * (v * v))) / (((pi * t) * sqrt((2.0 * (1.0 - (3.0 * (v * v)))))) * (1.0 - (v * v)));
end
code[v_, t_] := N[(N[(1.0 - N[(5.0 * N[(v * v), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(N[(N[(Pi * t), $MachinePrecision] * N[Sqrt[N[(2.0 * N[(1.0 - N[(3.0 * N[(v * v), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * N[(1.0 - N[(v * v), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}

\\
\frac{1 - 5 \cdot \left(v \cdot v\right)}{\left(\left(\pi \cdot t\right) \cdot \sqrt{2 \cdot \left(1 - 3 \cdot \left(v \cdot v\right)\right)}\right) \cdot \left(1 - v \cdot v\right)}
\end{array}

Alternative 1: 99.3% accurate, 0.7× speedup?

\[\begin{array}{l} \\ \frac{\frac{\mathsf{fma}\left(v \cdot v, -5, 1\right)}{\pi \cdot t}}{\sqrt{2 + \left(v \cdot v\right) \cdot -6} \cdot \left(1 - v \cdot v\right)} \end{array} \]
(FPCore (v t)
 :precision binary64
 (/
  (/ (fma (* v v) -5.0 1.0) (* PI t))
  (* (sqrt (+ 2.0 (* (* v v) -6.0))) (- 1.0 (* v v)))))
double code(double v, double t) {
	return (fma((v * v), -5.0, 1.0) / (((double) M_PI) * t)) / (sqrt((2.0 + ((v * v) * -6.0))) * (1.0 - (v * v)));
}
function code(v, t)
	return Float64(Float64(fma(Float64(v * v), -5.0, 1.0) / Float64(pi * t)) / Float64(sqrt(Float64(2.0 + Float64(Float64(v * v) * -6.0))) * Float64(1.0 - Float64(v * v))))
end
code[v_, t_] := N[(N[(N[(N[(v * v), $MachinePrecision] * -5.0 + 1.0), $MachinePrecision] / N[(Pi * t), $MachinePrecision]), $MachinePrecision] / N[(N[Sqrt[N[(2.0 + N[(N[(v * v), $MachinePrecision] * -6.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[(1.0 - N[(v * v), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}

\\
\frac{\frac{\mathsf{fma}\left(v \cdot v, -5, 1\right)}{\pi \cdot t}}{\sqrt{2 + \left(v \cdot v\right) \cdot -6} \cdot \left(1 - v \cdot v\right)}
\end{array}
Derivation
  1. Initial program 99.4%

    \[\frac{1 - 5 \cdot \left(v \cdot v\right)}{\left(\left(\pi \cdot t\right) \cdot \sqrt{2 \cdot \left(1 - 3 \cdot \left(v \cdot v\right)\right)}\right) \cdot \left(1 - v \cdot v\right)} \]
  2. Step-by-step derivation
    1. associate-*l*99.3%

      \[\leadsto \frac{1 - 5 \cdot \left(v \cdot v\right)}{\color{blue}{\left(\pi \cdot t\right) \cdot \left(\sqrt{2 \cdot \left(1 - 3 \cdot \left(v \cdot v\right)\right)} \cdot \left(1 - v \cdot v\right)\right)}} \]
    2. associate-/r*99.5%

      \[\leadsto \color{blue}{\frac{\frac{1 - 5 \cdot \left(v \cdot v\right)}{\pi \cdot t}}{\sqrt{2 \cdot \left(1 - 3 \cdot \left(v \cdot v\right)\right)} \cdot \left(1 - v \cdot v\right)}} \]
    3. sub-neg99.5%

      \[\leadsto \frac{\frac{\color{blue}{1 + \left(-5 \cdot \left(v \cdot v\right)\right)}}{\pi \cdot t}}{\sqrt{2 \cdot \left(1 - 3 \cdot \left(v \cdot v\right)\right)} \cdot \left(1 - v \cdot v\right)} \]
    4. +-commutative99.5%

      \[\leadsto \frac{\frac{\color{blue}{\left(-5 \cdot \left(v \cdot v\right)\right) + 1}}{\pi \cdot t}}{\sqrt{2 \cdot \left(1 - 3 \cdot \left(v \cdot v\right)\right)} \cdot \left(1 - v \cdot v\right)} \]
    5. sqr-neg99.5%

      \[\leadsto \frac{\frac{\left(-5 \cdot \color{blue}{\left(\left(-v\right) \cdot \left(-v\right)\right)}\right) + 1}{\pi \cdot t}}{\sqrt{2 \cdot \left(1 - 3 \cdot \left(v \cdot v\right)\right)} \cdot \left(1 - v \cdot v\right)} \]
    6. *-commutative99.5%

      \[\leadsto \frac{\frac{\left(-\color{blue}{\left(\left(-v\right) \cdot \left(-v\right)\right) \cdot 5}\right) + 1}{\pi \cdot t}}{\sqrt{2 \cdot \left(1 - 3 \cdot \left(v \cdot v\right)\right)} \cdot \left(1 - v \cdot v\right)} \]
    7. distribute-rgt-neg-in99.5%

      \[\leadsto \frac{\frac{\color{blue}{\left(\left(-v\right) \cdot \left(-v\right)\right) \cdot \left(-5\right)} + 1}{\pi \cdot t}}{\sqrt{2 \cdot \left(1 - 3 \cdot \left(v \cdot v\right)\right)} \cdot \left(1 - v \cdot v\right)} \]
    8. fma-def99.5%

      \[\leadsto \frac{\frac{\color{blue}{\mathsf{fma}\left(\left(-v\right) \cdot \left(-v\right), -5, 1\right)}}{\pi \cdot t}}{\sqrt{2 \cdot \left(1 - 3 \cdot \left(v \cdot v\right)\right)} \cdot \left(1 - v \cdot v\right)} \]
    9. sqr-neg99.5%

      \[\leadsto \frac{\frac{\mathsf{fma}\left(\color{blue}{v \cdot v}, -5, 1\right)}{\pi \cdot t}}{\sqrt{2 \cdot \left(1 - 3 \cdot \left(v \cdot v\right)\right)} \cdot \left(1 - v \cdot v\right)} \]
    10. metadata-eval99.5%

      \[\leadsto \frac{\frac{\mathsf{fma}\left(v \cdot v, \color{blue}{-5}, 1\right)}{\pi \cdot t}}{\sqrt{2 \cdot \left(1 - 3 \cdot \left(v \cdot v\right)\right)} \cdot \left(1 - v \cdot v\right)} \]
  3. Simplified99.5%

    \[\leadsto \color{blue}{\frac{\frac{\mathsf{fma}\left(v \cdot v, -5, 1\right)}{\pi \cdot t}}{\sqrt{2 + \left(v \cdot v\right) \cdot -6} \cdot \left(1 - v \cdot v\right)}} \]
  4. Final simplification99.5%

    \[\leadsto \frac{\frac{\mathsf{fma}\left(v \cdot v, -5, 1\right)}{\pi \cdot t}}{\sqrt{2 + \left(v \cdot v\right) \cdot -6} \cdot \left(1 - v \cdot v\right)} \]

Alternative 2: 99.3% accurate, 1.0× speedup?

\[\begin{array}{l} \\ \frac{1 + \left(v \cdot v\right) \cdot -5}{\pi \cdot \left(t \cdot \left(\left(1 - v \cdot v\right) \cdot \sqrt{2 \cdot \left(1 - v \cdot \left(v \cdot 3\right)\right)}\right)\right)} \end{array} \]
(FPCore (v t)
 :precision binary64
 (/
  (+ 1.0 (* (* v v) -5.0))
  (* PI (* t (* (- 1.0 (* v v)) (sqrt (* 2.0 (- 1.0 (* v (* v 3.0))))))))))
double code(double v, double t) {
	return (1.0 + ((v * v) * -5.0)) / (((double) M_PI) * (t * ((1.0 - (v * v)) * sqrt((2.0 * (1.0 - (v * (v * 3.0))))))));
}
public static double code(double v, double t) {
	return (1.0 + ((v * v) * -5.0)) / (Math.PI * (t * ((1.0 - (v * v)) * Math.sqrt((2.0 * (1.0 - (v * (v * 3.0))))))));
}
def code(v, t):
	return (1.0 + ((v * v) * -5.0)) / (math.pi * (t * ((1.0 - (v * v)) * math.sqrt((2.0 * (1.0 - (v * (v * 3.0))))))))
function code(v, t)
	return Float64(Float64(1.0 + Float64(Float64(v * v) * -5.0)) / Float64(pi * Float64(t * Float64(Float64(1.0 - Float64(v * v)) * sqrt(Float64(2.0 * Float64(1.0 - Float64(v * Float64(v * 3.0)))))))))
end
function tmp = code(v, t)
	tmp = (1.0 + ((v * v) * -5.0)) / (pi * (t * ((1.0 - (v * v)) * sqrt((2.0 * (1.0 - (v * (v * 3.0))))))));
end
code[v_, t_] := N[(N[(1.0 + N[(N[(v * v), $MachinePrecision] * -5.0), $MachinePrecision]), $MachinePrecision] / N[(Pi * N[(t * N[(N[(1.0 - N[(v * v), $MachinePrecision]), $MachinePrecision] * N[Sqrt[N[(2.0 * N[(1.0 - N[(v * N[(v * 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}

\\
\frac{1 + \left(v \cdot v\right) \cdot -5}{\pi \cdot \left(t \cdot \left(\left(1 - v \cdot v\right) \cdot \sqrt{2 \cdot \left(1 - v \cdot \left(v \cdot 3\right)\right)}\right)\right)}
\end{array}
Derivation
  1. Initial program 99.4%

    \[\frac{1 - 5 \cdot \left(v \cdot v\right)}{\left(\left(\pi \cdot t\right) \cdot \sqrt{2 \cdot \left(1 - 3 \cdot \left(v \cdot v\right)\right)}\right) \cdot \left(1 - v \cdot v\right)} \]
  2. Simplified99.3%

    \[\leadsto \color{blue}{\frac{1 + \left(v \cdot v\right) \cdot -5}{\pi \cdot \left(t \cdot \left(\sqrt{2 \cdot \left(1 - v \cdot \left(v \cdot 3\right)\right)} \cdot \left(1 - v \cdot v\right)\right)\right)}} \]
  3. Final simplification99.3%

    \[\leadsto \frac{1 + \left(v \cdot v\right) \cdot -5}{\pi \cdot \left(t \cdot \left(\left(1 - v \cdot v\right) \cdot \sqrt{2 \cdot \left(1 - v \cdot \left(v \cdot 3\right)\right)}\right)\right)} \]

Alternative 3: 99.3% accurate, 1.0× speedup?

\[\begin{array}{l} \\ \frac{1 - \left(v \cdot v\right) \cdot 5}{\left(1 - v \cdot v\right) \cdot \left(\left(\pi \cdot t\right) \cdot \sqrt{2 \cdot \left(1 - \left(v \cdot v\right) \cdot 3\right)}\right)} \end{array} \]
(FPCore (v t)
 :precision binary64
 (/
  (- 1.0 (* (* v v) 5.0))
  (* (- 1.0 (* v v)) (* (* PI t) (sqrt (* 2.0 (- 1.0 (* (* v v) 3.0))))))))
double code(double v, double t) {
	return (1.0 - ((v * v) * 5.0)) / ((1.0 - (v * v)) * ((((double) M_PI) * t) * sqrt((2.0 * (1.0 - ((v * v) * 3.0))))));
}
public static double code(double v, double t) {
	return (1.0 - ((v * v) * 5.0)) / ((1.0 - (v * v)) * ((Math.PI * t) * Math.sqrt((2.0 * (1.0 - ((v * v) * 3.0))))));
}
def code(v, t):
	return (1.0 - ((v * v) * 5.0)) / ((1.0 - (v * v)) * ((math.pi * t) * math.sqrt((2.0 * (1.0 - ((v * v) * 3.0))))))
function code(v, t)
	return Float64(Float64(1.0 - Float64(Float64(v * v) * 5.0)) / Float64(Float64(1.0 - Float64(v * v)) * Float64(Float64(pi * t) * sqrt(Float64(2.0 * Float64(1.0 - Float64(Float64(v * v) * 3.0)))))))
end
function tmp = code(v, t)
	tmp = (1.0 - ((v * v) * 5.0)) / ((1.0 - (v * v)) * ((pi * t) * sqrt((2.0 * (1.0 - ((v * v) * 3.0))))));
end
code[v_, t_] := N[(N[(1.0 - N[(N[(v * v), $MachinePrecision] * 5.0), $MachinePrecision]), $MachinePrecision] / N[(N[(1.0 - N[(v * v), $MachinePrecision]), $MachinePrecision] * N[(N[(Pi * t), $MachinePrecision] * N[Sqrt[N[(2.0 * N[(1.0 - N[(N[(v * v), $MachinePrecision] * 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}

\\
\frac{1 - \left(v \cdot v\right) \cdot 5}{\left(1 - v \cdot v\right) \cdot \left(\left(\pi \cdot t\right) \cdot \sqrt{2 \cdot \left(1 - \left(v \cdot v\right) \cdot 3\right)}\right)}
\end{array}
Derivation
  1. Initial program 99.4%

    \[\frac{1 - 5 \cdot \left(v \cdot v\right)}{\left(\left(\pi \cdot t\right) \cdot \sqrt{2 \cdot \left(1 - 3 \cdot \left(v \cdot v\right)\right)}\right) \cdot \left(1 - v \cdot v\right)} \]
  2. Final simplification99.4%

    \[\leadsto \frac{1 - \left(v \cdot v\right) \cdot 5}{\left(1 - v \cdot v\right) \cdot \left(\left(\pi \cdot t\right) \cdot \sqrt{2 \cdot \left(1 - \left(v \cdot v\right) \cdot 3\right)}\right)} \]

Alternative 4: 98.2% accurate, 1.1× speedup?

\[\begin{array}{l} \\ \frac{1}{\left(\pi \cdot t\right) \cdot \sqrt{2}} \end{array} \]
(FPCore (v t) :precision binary64 (/ 1.0 (* (* PI t) (sqrt 2.0))))
double code(double v, double t) {
	return 1.0 / ((((double) M_PI) * t) * sqrt(2.0));
}
public static double code(double v, double t) {
	return 1.0 / ((Math.PI * t) * Math.sqrt(2.0));
}
def code(v, t):
	return 1.0 / ((math.pi * t) * math.sqrt(2.0))
function code(v, t)
	return Float64(1.0 / Float64(Float64(pi * t) * sqrt(2.0)))
end
function tmp = code(v, t)
	tmp = 1.0 / ((pi * t) * sqrt(2.0));
end
code[v_, t_] := N[(1.0 / N[(N[(Pi * t), $MachinePrecision] * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}

\\
\frac{1}{\left(\pi \cdot t\right) \cdot \sqrt{2}}
\end{array}
Derivation
  1. Initial program 99.4%

    \[\frac{1 - 5 \cdot \left(v \cdot v\right)}{\left(\left(\pi \cdot t\right) \cdot \sqrt{2 \cdot \left(1 - 3 \cdot \left(v \cdot v\right)\right)}\right) \cdot \left(1 - v \cdot v\right)} \]
  2. Simplified99.3%

    \[\leadsto \color{blue}{\frac{1 + \left(v \cdot v\right) \cdot -5}{\pi \cdot \left(t \cdot \left(\sqrt{2 \cdot \left(1 - v \cdot \left(v \cdot 3\right)\right)} \cdot \left(1 - v \cdot v\right)\right)\right)}} \]
  3. Taylor expanded in v around 0 98.1%

    \[\leadsto \color{blue}{\frac{1}{\sqrt{2} \cdot \left(t \cdot \pi\right)}} \]
  4. Final simplification98.1%

    \[\leadsto \frac{1}{\left(\pi \cdot t\right) \cdot \sqrt{2}} \]

Alternative 5: 98.4% accurate, 1.1× speedup?

\[\begin{array}{l} \\ \frac{\frac{1}{\pi}}{t \cdot \sqrt{2}} \end{array} \]
(FPCore (v t) :precision binary64 (/ (/ 1.0 PI) (* t (sqrt 2.0))))
double code(double v, double t) {
	return (1.0 / ((double) M_PI)) / (t * sqrt(2.0));
}
public static double code(double v, double t) {
	return (1.0 / Math.PI) / (t * Math.sqrt(2.0));
}
def code(v, t):
	return (1.0 / math.pi) / (t * math.sqrt(2.0))
function code(v, t)
	return Float64(Float64(1.0 / pi) / Float64(t * sqrt(2.0)))
end
function tmp = code(v, t)
	tmp = (1.0 / pi) / (t * sqrt(2.0));
end
code[v_, t_] := N[(N[(1.0 / Pi), $MachinePrecision] / N[(t * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}

\\
\frac{\frac{1}{\pi}}{t \cdot \sqrt{2}}
\end{array}
Derivation
  1. Initial program 99.4%

    \[\frac{1 - 5 \cdot \left(v \cdot v\right)}{\left(\left(\pi \cdot t\right) \cdot \sqrt{2 \cdot \left(1 - 3 \cdot \left(v \cdot v\right)\right)}\right) \cdot \left(1 - v \cdot v\right)} \]
  2. Simplified99.3%

    \[\leadsto \color{blue}{\frac{1 + \left(v \cdot v\right) \cdot -5}{\pi \cdot \left(t \cdot \left(\sqrt{2 \cdot \left(1 - v \cdot \left(v \cdot 3\right)\right)} \cdot \left(1 - v \cdot v\right)\right)\right)}} \]
  3. Taylor expanded in v around 0 98.1%

    \[\leadsto \color{blue}{\frac{1}{\sqrt{2} \cdot \left(t \cdot \pi\right)}} \]
  4. Step-by-step derivation
    1. inv-pow98.1%

      \[\leadsto \color{blue}{{\left(\sqrt{2} \cdot \left(t \cdot \pi\right)\right)}^{-1}} \]
    2. associate-*r*98.1%

      \[\leadsto {\color{blue}{\left(\left(\sqrt{2} \cdot t\right) \cdot \pi\right)}}^{-1} \]
    3. unpow-prod-down98.2%

      \[\leadsto \color{blue}{{\left(\sqrt{2} \cdot t\right)}^{-1} \cdot {\pi}^{-1}} \]
  5. Applied egg-rr98.2%

    \[\leadsto \color{blue}{{\left(\sqrt{2} \cdot t\right)}^{-1} \cdot {\pi}^{-1}} \]
  6. Step-by-step derivation
    1. unpow-198.2%

      \[\leadsto \color{blue}{\frac{1}{\sqrt{2} \cdot t}} \cdot {\pi}^{-1} \]
    2. unpow-198.2%

      \[\leadsto \frac{1}{\sqrt{2} \cdot t} \cdot \color{blue}{\frac{1}{\pi}} \]
  7. Simplified98.2%

    \[\leadsto \color{blue}{\frac{1}{\sqrt{2} \cdot t} \cdot \frac{1}{\pi}} \]
  8. Step-by-step derivation
    1. associate-*l/98.3%

      \[\leadsto \color{blue}{\frac{1 \cdot \frac{1}{\pi}}{\sqrt{2} \cdot t}} \]
    2. *-un-lft-identity98.3%

      \[\leadsto \frac{\color{blue}{\frac{1}{\pi}}}{\sqrt{2} \cdot t} \]
  9. Applied egg-rr98.3%

    \[\leadsto \color{blue}{\frac{\frac{1}{\pi}}{\sqrt{2} \cdot t}} \]
  10. Final simplification98.3%

    \[\leadsto \frac{\frac{1}{\pi}}{t \cdot \sqrt{2}} \]

Alternative 6: 98.7% accurate, 1.1× speedup?

\[\begin{array}{l} \\ \frac{\frac{\frac{1}{\pi}}{\sqrt{2}}}{t} \end{array} \]
(FPCore (v t) :precision binary64 (/ (/ (/ 1.0 PI) (sqrt 2.0)) t))
double code(double v, double t) {
	return ((1.0 / ((double) M_PI)) / sqrt(2.0)) / t;
}
public static double code(double v, double t) {
	return ((1.0 / Math.PI) / Math.sqrt(2.0)) / t;
}
def code(v, t):
	return ((1.0 / math.pi) / math.sqrt(2.0)) / t
function code(v, t)
	return Float64(Float64(Float64(1.0 / pi) / sqrt(2.0)) / t)
end
function tmp = code(v, t)
	tmp = ((1.0 / pi) / sqrt(2.0)) / t;
end
code[v_, t_] := N[(N[(N[(1.0 / Pi), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision] / t), $MachinePrecision]
\begin{array}{l}

\\
\frac{\frac{\frac{1}{\pi}}{\sqrt{2}}}{t}
\end{array}
Derivation
  1. Initial program 99.4%

    \[\frac{1 - 5 \cdot \left(v \cdot v\right)}{\left(\left(\pi \cdot t\right) \cdot \sqrt{2 \cdot \left(1 - 3 \cdot \left(v \cdot v\right)\right)}\right) \cdot \left(1 - v \cdot v\right)} \]
  2. Simplified99.3%

    \[\leadsto \color{blue}{\frac{1 + \left(v \cdot v\right) \cdot -5}{\pi \cdot \left(t \cdot \left(\sqrt{2 \cdot \left(1 - v \cdot \left(v \cdot 3\right)\right)} \cdot \left(1 - v \cdot v\right)\right)\right)}} \]
  3. Taylor expanded in v around 0 98.1%

    \[\leadsto \color{blue}{\frac{1}{\sqrt{2} \cdot \left(t \cdot \pi\right)}} \]
  4. Step-by-step derivation
    1. inv-pow98.1%

      \[\leadsto \color{blue}{{\left(\sqrt{2} \cdot \left(t \cdot \pi\right)\right)}^{-1}} \]
    2. associate-*r*98.1%

      \[\leadsto {\color{blue}{\left(\left(\sqrt{2} \cdot t\right) \cdot \pi\right)}}^{-1} \]
    3. unpow-prod-down98.2%

      \[\leadsto \color{blue}{{\left(\sqrt{2} \cdot t\right)}^{-1} \cdot {\pi}^{-1}} \]
  5. Applied egg-rr98.2%

    \[\leadsto \color{blue}{{\left(\sqrt{2} \cdot t\right)}^{-1} \cdot {\pi}^{-1}} \]
  6. Step-by-step derivation
    1. unpow-198.2%

      \[\leadsto \color{blue}{\frac{1}{\sqrt{2} \cdot t}} \cdot {\pi}^{-1} \]
    2. unpow-198.2%

      \[\leadsto \frac{1}{\sqrt{2} \cdot t} \cdot \color{blue}{\frac{1}{\pi}} \]
  7. Simplified98.2%

    \[\leadsto \color{blue}{\frac{1}{\sqrt{2} \cdot t} \cdot \frac{1}{\pi}} \]
  8. Step-by-step derivation
    1. associate-*l/98.3%

      \[\leadsto \color{blue}{\frac{1 \cdot \frac{1}{\pi}}{\sqrt{2} \cdot t}} \]
    2. *-un-lft-identity98.3%

      \[\leadsto \frac{\color{blue}{\frac{1}{\pi}}}{\sqrt{2} \cdot t} \]
    3. associate-/r*98.6%

      \[\leadsto \color{blue}{\frac{\frac{\frac{1}{\pi}}{\sqrt{2}}}{t}} \]
  9. Applied egg-rr98.6%

    \[\leadsto \color{blue}{\frac{\frac{\frac{1}{\pi}}{\sqrt{2}}}{t}} \]
  10. Final simplification98.6%

    \[\leadsto \frac{\frac{\frac{1}{\pi}}{\sqrt{2}}}{t} \]

Alternative 7: 97.7% accurate, 1.1× speedup?

\[\begin{array}{l} \\ \frac{\sqrt{0.5}}{\pi \cdot t} \end{array} \]
(FPCore (v t) :precision binary64 (/ (sqrt 0.5) (* PI t)))
double code(double v, double t) {
	return sqrt(0.5) / (((double) M_PI) * t);
}
public static double code(double v, double t) {
	return Math.sqrt(0.5) / (Math.PI * t);
}
def code(v, t):
	return math.sqrt(0.5) / (math.pi * t)
function code(v, t)
	return Float64(sqrt(0.5) / Float64(pi * t))
end
function tmp = code(v, t)
	tmp = sqrt(0.5) / (pi * t);
end
code[v_, t_] := N[(N[Sqrt[0.5], $MachinePrecision] / N[(Pi * t), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}

\\
\frac{\sqrt{0.5}}{\pi \cdot t}
\end{array}
Derivation
  1. Initial program 99.4%

    \[\frac{1 - 5 \cdot \left(v \cdot v\right)}{\left(\left(\pi \cdot t\right) \cdot \sqrt{2 \cdot \left(1 - 3 \cdot \left(v \cdot v\right)\right)}\right) \cdot \left(1 - v \cdot v\right)} \]
  2. Step-by-step derivation
    1. associate-*l*99.3%

      \[\leadsto \frac{1 - 5 \cdot \left(v \cdot v\right)}{\color{blue}{\left(\pi \cdot t\right) \cdot \left(\sqrt{2 \cdot \left(1 - 3 \cdot \left(v \cdot v\right)\right)} \cdot \left(1 - v \cdot v\right)\right)}} \]
    2. associate-/r*99.5%

      \[\leadsto \color{blue}{\frac{\frac{1 - 5 \cdot \left(v \cdot v\right)}{\pi \cdot t}}{\sqrt{2 \cdot \left(1 - 3 \cdot \left(v \cdot v\right)\right)} \cdot \left(1 - v \cdot v\right)}} \]
    3. sub-neg99.5%

      \[\leadsto \frac{\frac{\color{blue}{1 + \left(-5 \cdot \left(v \cdot v\right)\right)}}{\pi \cdot t}}{\sqrt{2 \cdot \left(1 - 3 \cdot \left(v \cdot v\right)\right)} \cdot \left(1 - v \cdot v\right)} \]
    4. +-commutative99.5%

      \[\leadsto \frac{\frac{\color{blue}{\left(-5 \cdot \left(v \cdot v\right)\right) + 1}}{\pi \cdot t}}{\sqrt{2 \cdot \left(1 - 3 \cdot \left(v \cdot v\right)\right)} \cdot \left(1 - v \cdot v\right)} \]
    5. sqr-neg99.5%

      \[\leadsto \frac{\frac{\left(-5 \cdot \color{blue}{\left(\left(-v\right) \cdot \left(-v\right)\right)}\right) + 1}{\pi \cdot t}}{\sqrt{2 \cdot \left(1 - 3 \cdot \left(v \cdot v\right)\right)} \cdot \left(1 - v \cdot v\right)} \]
    6. *-commutative99.5%

      \[\leadsto \frac{\frac{\left(-\color{blue}{\left(\left(-v\right) \cdot \left(-v\right)\right) \cdot 5}\right) + 1}{\pi \cdot t}}{\sqrt{2 \cdot \left(1 - 3 \cdot \left(v \cdot v\right)\right)} \cdot \left(1 - v \cdot v\right)} \]
    7. distribute-rgt-neg-in99.5%

      \[\leadsto \frac{\frac{\color{blue}{\left(\left(-v\right) \cdot \left(-v\right)\right) \cdot \left(-5\right)} + 1}{\pi \cdot t}}{\sqrt{2 \cdot \left(1 - 3 \cdot \left(v \cdot v\right)\right)} \cdot \left(1 - v \cdot v\right)} \]
    8. fma-def99.5%

      \[\leadsto \frac{\frac{\color{blue}{\mathsf{fma}\left(\left(-v\right) \cdot \left(-v\right), -5, 1\right)}}{\pi \cdot t}}{\sqrt{2 \cdot \left(1 - 3 \cdot \left(v \cdot v\right)\right)} \cdot \left(1 - v \cdot v\right)} \]
    9. sqr-neg99.5%

      \[\leadsto \frac{\frac{\mathsf{fma}\left(\color{blue}{v \cdot v}, -5, 1\right)}{\pi \cdot t}}{\sqrt{2 \cdot \left(1 - 3 \cdot \left(v \cdot v\right)\right)} \cdot \left(1 - v \cdot v\right)} \]
    10. metadata-eval99.5%

      \[\leadsto \frac{\frac{\mathsf{fma}\left(v \cdot v, \color{blue}{-5}, 1\right)}{\pi \cdot t}}{\sqrt{2 \cdot \left(1 - 3 \cdot \left(v \cdot v\right)\right)} \cdot \left(1 - v \cdot v\right)} \]
  3. Simplified99.5%

    \[\leadsto \color{blue}{\frac{\frac{\mathsf{fma}\left(v \cdot v, -5, 1\right)}{\pi \cdot t}}{\sqrt{2 + \left(v \cdot v\right) \cdot -6} \cdot \left(1 - v \cdot v\right)}} \]
  4. Taylor expanded in v around 0 97.8%

    \[\leadsto \color{blue}{\frac{\sqrt{0.5}}{t \cdot \pi}} \]
  5. Final simplification97.8%

    \[\leadsto \frac{\sqrt{0.5}}{\pi \cdot t} \]

Alternative 8: 97.8% accurate, 1.1× speedup?

\[\begin{array}{l} \\ \frac{\frac{\sqrt{0.5}}{t}}{\pi} \end{array} \]
(FPCore (v t) :precision binary64 (/ (/ (sqrt 0.5) t) PI))
double code(double v, double t) {
	return (sqrt(0.5) / t) / ((double) M_PI);
}
public static double code(double v, double t) {
	return (Math.sqrt(0.5) / t) / Math.PI;
}
def code(v, t):
	return (math.sqrt(0.5) / t) / math.pi
function code(v, t)
	return Float64(Float64(sqrt(0.5) / t) / pi)
end
function tmp = code(v, t)
	tmp = (sqrt(0.5) / t) / pi;
end
code[v_, t_] := N[(N[(N[Sqrt[0.5], $MachinePrecision] / t), $MachinePrecision] / Pi), $MachinePrecision]
\begin{array}{l}

\\
\frac{\frac{\sqrt{0.5}}{t}}{\pi}
\end{array}
Derivation
  1. Initial program 99.4%

    \[\frac{1 - 5 \cdot \left(v \cdot v\right)}{\left(\left(\pi \cdot t\right) \cdot \sqrt{2 \cdot \left(1 - 3 \cdot \left(v \cdot v\right)\right)}\right) \cdot \left(1 - v \cdot v\right)} \]
  2. Step-by-step derivation
    1. associate-*l*99.3%

      \[\leadsto \frac{1 - 5 \cdot \left(v \cdot v\right)}{\color{blue}{\left(\pi \cdot t\right) \cdot \left(\sqrt{2 \cdot \left(1 - 3 \cdot \left(v \cdot v\right)\right)} \cdot \left(1 - v \cdot v\right)\right)}} \]
    2. associate-/r*99.5%

      \[\leadsto \color{blue}{\frac{\frac{1 - 5 \cdot \left(v \cdot v\right)}{\pi \cdot t}}{\sqrt{2 \cdot \left(1 - 3 \cdot \left(v \cdot v\right)\right)} \cdot \left(1 - v \cdot v\right)}} \]
    3. sub-neg99.5%

      \[\leadsto \frac{\frac{\color{blue}{1 + \left(-5 \cdot \left(v \cdot v\right)\right)}}{\pi \cdot t}}{\sqrt{2 \cdot \left(1 - 3 \cdot \left(v \cdot v\right)\right)} \cdot \left(1 - v \cdot v\right)} \]
    4. +-commutative99.5%

      \[\leadsto \frac{\frac{\color{blue}{\left(-5 \cdot \left(v \cdot v\right)\right) + 1}}{\pi \cdot t}}{\sqrt{2 \cdot \left(1 - 3 \cdot \left(v \cdot v\right)\right)} \cdot \left(1 - v \cdot v\right)} \]
    5. sqr-neg99.5%

      \[\leadsto \frac{\frac{\left(-5 \cdot \color{blue}{\left(\left(-v\right) \cdot \left(-v\right)\right)}\right) + 1}{\pi \cdot t}}{\sqrt{2 \cdot \left(1 - 3 \cdot \left(v \cdot v\right)\right)} \cdot \left(1 - v \cdot v\right)} \]
    6. *-commutative99.5%

      \[\leadsto \frac{\frac{\left(-\color{blue}{\left(\left(-v\right) \cdot \left(-v\right)\right) \cdot 5}\right) + 1}{\pi \cdot t}}{\sqrt{2 \cdot \left(1 - 3 \cdot \left(v \cdot v\right)\right)} \cdot \left(1 - v \cdot v\right)} \]
    7. distribute-rgt-neg-in99.5%

      \[\leadsto \frac{\frac{\color{blue}{\left(\left(-v\right) \cdot \left(-v\right)\right) \cdot \left(-5\right)} + 1}{\pi \cdot t}}{\sqrt{2 \cdot \left(1 - 3 \cdot \left(v \cdot v\right)\right)} \cdot \left(1 - v \cdot v\right)} \]
    8. fma-def99.5%

      \[\leadsto \frac{\frac{\color{blue}{\mathsf{fma}\left(\left(-v\right) \cdot \left(-v\right), -5, 1\right)}}{\pi \cdot t}}{\sqrt{2 \cdot \left(1 - 3 \cdot \left(v \cdot v\right)\right)} \cdot \left(1 - v \cdot v\right)} \]
    9. sqr-neg99.5%

      \[\leadsto \frac{\frac{\mathsf{fma}\left(\color{blue}{v \cdot v}, -5, 1\right)}{\pi \cdot t}}{\sqrt{2 \cdot \left(1 - 3 \cdot \left(v \cdot v\right)\right)} \cdot \left(1 - v \cdot v\right)} \]
    10. metadata-eval99.5%

      \[\leadsto \frac{\frac{\mathsf{fma}\left(v \cdot v, \color{blue}{-5}, 1\right)}{\pi \cdot t}}{\sqrt{2 \cdot \left(1 - 3 \cdot \left(v \cdot v\right)\right)} \cdot \left(1 - v \cdot v\right)} \]
  3. Simplified99.5%

    \[\leadsto \color{blue}{\frac{\frac{\mathsf{fma}\left(v \cdot v, -5, 1\right)}{\pi \cdot t}}{\sqrt{2 + \left(v \cdot v\right) \cdot -6} \cdot \left(1 - v \cdot v\right)}} \]
  4. Taylor expanded in v around 0 97.8%

    \[\leadsto \color{blue}{\frac{\sqrt{0.5}}{t \cdot \pi}} \]
  5. Step-by-step derivation
    1. associate-/r*97.8%

      \[\leadsto \color{blue}{\frac{\frac{\sqrt{0.5}}{t}}{\pi}} \]
  6. Simplified97.8%

    \[\leadsto \color{blue}{\frac{\frac{\sqrt{0.5}}{t}}{\pi}} \]
  7. Final simplification97.8%

    \[\leadsto \frac{\frac{\sqrt{0.5}}{t}}{\pi} \]

Reproduce

?
herbie shell --seed 2023268 
(FPCore (v t)
  :name "Falkner and Boettcher, Equation (20:1,3)"
  :precision binary64
  (/ (- 1.0 (* 5.0 (* v v))) (* (* (* PI t) (sqrt (* 2.0 (- 1.0 (* 3.0 (* v v)))))) (- 1.0 (* v v)))))