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

Percentage Accurate: 99.3% → 98.8%

Time: 3.4s

Alternatives: 3

Speedup: N/A×

Specification

Math

\[\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

(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)))))

C

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)));
}

Java

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)));
}

Python

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)))

Julia

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

MATLAB

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

Wolfram

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]

Initial Program: 99.3% accurate, 1.0× speedup

Math

\[\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

(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)))))

C

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)));
}

Java

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)));
}

Python

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)))

Julia

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

MATLAB

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

Wolfram

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]

Alternative 1: 98.8% accurate, 3.3× speedup

Math

\[\begin{array}{l} \\ \frac{\frac{1}{\sqrt{2} \cdot \pi}}{t} \end{array} \]

FPCore

(FPCore (v t) :precision binary64 (/ (/ 1.0 (* (sqrt 2.0) PI)) t))

C

double code(double v, double t) {
	return (1.0 / (sqrt(2.0) * ((double) M_PI))) / t;
}

Java

public static double code(double v, double t) {
	return (1.0 / (Math.sqrt(2.0) * Math.PI)) / t;
}

Python

def code(v, t):
	return (1.0 / (math.sqrt(2.0) * math.pi)) / t

Julia

function code(v, t)
	return Float64(Float64(1.0 / Float64(sqrt(2.0) * pi)) / t)
end

MATLAB

function tmp = code(v, t)
	tmp = (1.0 / (sqrt(2.0) * pi)) / t;
end

Wolfram

code[v_, t_] := N[(N[(1.0 / N[(N[Sqrt[2.0], $MachinePrecision] * Pi), $MachinePrecision]), $MachinePrecision] / t), $MachinePrecision]

Derivation

1. Initial program 99.3%

   \[\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. Taylor expanded in v around 0

   \[\leadsto \color{blue}{\frac{1}{t \cdot \left(\mathsf{PI}\left(\right) \cdot \sqrt{2}\right)}} \]
3. Step-by-step derivation

   1. lower-/.f64 N/A

      \[\leadsto \frac{1}{\color{blue}{t \cdot \left(\mathsf{PI}\left(\right) \cdot \sqrt{2}\right)}} \]

   2. lower-*.f64 N/A

      \[\leadsto \frac{1}{t \cdot \color{blue}{\left(\mathsf{PI}\left(\right) \cdot \sqrt{2}\right)}} \]

   3. lower-*.f64 N/A

      \[\leadsto \frac{1}{t \cdot \left(\mathsf{PI}\left(\right) \cdot \color{blue}{\sqrt{2}}\right)} \]

   4. lower-PI.f64 N/A

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

   5. lower-sqrt.f64 98.4

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

4. Applied rewrites 98.4%

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

   1. lift-/.f64 N/A

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

   2. lift-*.f64 N/A

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

   3. *-commutative N/A

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

   4. associate-/r* N/A

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

   5. lower-/.f64 N/A

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

   6. lower-/.f64 98.8

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

   7. lift-*.f64 N/A

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

   8. *-commutative N/A

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

   9. lower-*.f64 98.8

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

6. Applied rewrites 98.8%

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

Alternative 2: 98.4% accurate, 3.3× speedup

Math

\[\begin{array}{l} \\ \frac{\frac{1}{t}}{\sqrt{2} \cdot \pi} \end{array} \]

FPCore

(FPCore (v t) :precision binary64 (/ (/ 1.0 t) (* (sqrt 2.0) PI)))

C

double code(double v, double t) {
	return (1.0 / t) / (sqrt(2.0) * ((double) M_PI));
}

Java

public static double code(double v, double t) {
	return (1.0 / t) / (Math.sqrt(2.0) * Math.PI);
}

Python

def code(v, t):
	return (1.0 / t) / (math.sqrt(2.0) * math.pi)

Julia

function code(v, t)
	return Float64(Float64(1.0 / t) / Float64(sqrt(2.0) * pi))
end

MATLAB

function tmp = code(v, t)
	tmp = (1.0 / t) / (sqrt(2.0) * pi);
end

Wolfram

code[v_, t_] := N[(N[(1.0 / t), $MachinePrecision] / N[(N[Sqrt[2.0], $MachinePrecision] * Pi), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.3%

   \[\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. Taylor expanded in v around 0

   \[\leadsto \color{blue}{\frac{1}{t \cdot \left(\mathsf{PI}\left(\right) \cdot \sqrt{2}\right)}} \]
3. Step-by-step derivation

   1. lower-/.f64 N/A

      \[\leadsto \frac{1}{\color{blue}{t \cdot \left(\mathsf{PI}\left(\right) \cdot \sqrt{2}\right)}} \]

   2. lower-*.f64 N/A

      \[\leadsto \frac{1}{t \cdot \color{blue}{\left(\mathsf{PI}\left(\right) \cdot \sqrt{2}\right)}} \]

   3. lower-*.f64 N/A

      \[\leadsto \frac{1}{t \cdot \left(\mathsf{PI}\left(\right) \cdot \color{blue}{\sqrt{2}}\right)} \]

   4. lower-PI.f64 N/A

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

   5. lower-sqrt.f64 98.4

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

4. Applied rewrites 98.4%

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

   1. lift-/.f64 N/A

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

   2. lift-*.f64 N/A

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

   3. associate-/r* N/A

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

   4. inv-pow N/A

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

   5. lower-/.f64 N/A

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

   6. inv-pow N/A

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

   7. lower-/.f64 98.4

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

   8. lift-*.f64 N/A

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

   9. *-commutative N/A

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

   10. lower-*.f64 98.4

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

6. Applied rewrites 98.4%

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

Alternative 3: 98.4% accurate, 3.4× speedup

Math

\[\begin{array}{l} \\ \frac{1}{t \cdot \left(\pi \cdot \sqrt{2}\right)} \end{array} \]

FPCore

(FPCore (v t) :precision binary64 (/ 1.0 (* t (* PI (sqrt 2.0)))))

C

double code(double v, double t) {
	return 1.0 / (t * (((double) M_PI) * sqrt(2.0)));
}

Java

public static double code(double v, double t) {
	return 1.0 / (t * (Math.PI * Math.sqrt(2.0)));
}

Python

def code(v, t):
	return 1.0 / (t * (math.pi * math.sqrt(2.0)))

Julia

function code(v, t)
	return Float64(1.0 / Float64(t * Float64(pi * sqrt(2.0))))
end

MATLAB

function tmp = code(v, t)
	tmp = 1.0 / (t * (pi * sqrt(2.0)));
end

Wolfram

code[v_, t_] := N[(1.0 / N[(t * N[(Pi * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.3%

   \[\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. Taylor expanded in v around 0

   \[\leadsto \color{blue}{\frac{1}{t \cdot \left(\mathsf{PI}\left(\right) \cdot \sqrt{2}\right)}} \]
3. Step-by-step derivation

   1. lower-/.f64 N/A

      \[\leadsto \frac{1}{\color{blue}{t \cdot \left(\mathsf{PI}\left(\right) \cdot \sqrt{2}\right)}} \]

   2. lower-*.f64 N/A

      \[\leadsto \frac{1}{t \cdot \color{blue}{\left(\mathsf{PI}\left(\right) \cdot \sqrt{2}\right)}} \]

   3. lower-*.f64 N/A

      \[\leadsto \frac{1}{t \cdot \left(\mathsf{PI}\left(\right) \cdot \color{blue}{\sqrt{2}}\right)} \]

   4. lower-PI.f64 N/A

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

   5. lower-sqrt.f64 98.4

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

4. Applied rewrites 98.4%

   \[\leadsto \color{blue}{\frac{1}{t \cdot \left(\pi \cdot \sqrt{2}\right)}} \]
5. Add Preprocessing

Reproduce

herbie shell --seed 2025156 
(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)))))