Diagrams.Solve.Polynomial:quartForm from diagrams-solve-0.1, D

Percentage Accurate: 100.0% → 100.0%

Time: 3.4s

Alternatives: 3

Speedup: 1.8×

Specification

Math

\[\begin{array}{l} \\ \frac{x \cdot y}{2} - \frac{z}{8} \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (- (/ (* x y) 2.0) (/ z 8.0)))

C

double code(double x, double y, double z) {
	return ((x * y) / 2.0) - (z / 8.0);
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = ((x * y) / 2.0d0) - (z / 8.0d0)
end function

Java

public static double code(double x, double y, double z) {
	return ((x * y) / 2.0) - (z / 8.0);
}

Python

def code(x, y, z):
	return ((x * y) / 2.0) - (z / 8.0)

Julia

function code(x, y, z)
	return Float64(Float64(Float64(x * y) / 2.0) - Float64(z / 8.0))
end

MATLAB

function tmp = code(x, y, z)
	tmp = ((x * y) / 2.0) - (z / 8.0);
end

Wolfram

code[x_, y_, z_] := N[(N[(N[(x * y), $MachinePrecision] / 2.0), $MachinePrecision] - N[(z / 8.0), $MachinePrecision]), $MachinePrecision]

Initial Program: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{x \cdot y}{2} - \frac{z}{8} \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (- (/ (* x y) 2.0) (/ z 8.0)))

C

double code(double x, double y, double z) {
	return ((x * y) / 2.0) - (z / 8.0);
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = ((x * y) / 2.0d0) - (z / 8.0d0)
end function

Java

public static double code(double x, double y, double z) {
	return ((x * y) / 2.0) - (z / 8.0);
}

Python

def code(x, y, z):
	return ((x * y) / 2.0) - (z / 8.0)

Julia

function code(x, y, z)
	return Float64(Float64(Float64(x * y) / 2.0) - Float64(z / 8.0))
end

MATLAB

function tmp = code(x, y, z)
	tmp = ((x * y) / 2.0) - (z / 8.0);
end

Wolfram

code[x_, y_, z_] := N[(N[(N[(x * y), $MachinePrecision] / 2.0), $MachinePrecision] - N[(z / 8.0), $MachinePrecision]), $MachinePrecision]

Alternative 1: 100.0% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(y \cdot 0.5, x, z \cdot -0.125\right) \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (fma (* y 0.5) x (* z -0.125)))

C

double code(double x, double y, double z) {
	return fma((y * 0.5), x, (z * -0.125));
}

Julia

function code(x, y, z)
	return fma(Float64(y * 0.5), x, Float64(z * -0.125))
end

Wolfram

code[x_, y_, z_] := N[(N[(y * 0.5), $MachinePrecision] * x + N[(z * -0.125), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 100.0%

   \[\frac{x \cdot y}{2} - \frac{z}{8} \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift--.f64 N/A

      \[\leadsto \color{blue}{\frac{x \cdot y}{2} - \frac{z}{8}} \]

   2. sub-neg N/A

      \[\leadsto \color{blue}{\frac{x \cdot y}{2} + \left(\mathsf{neg}\left(\frac{z}{8}\right)\right)} \]

   3. lift-/.f64 N/A

      \[\leadsto \color{blue}{\frac{x \cdot y}{2}} + \left(\mathsf{neg}\left(\frac{z}{8}\right)\right) \]

   4. lift-*.f64 N/A

      \[\leadsto \frac{\color{blue}{x \cdot y}}{2} + \left(\mathsf{neg}\left(\frac{z}{8}\right)\right) \]

   5. associate-/l* N/A

      \[\leadsto \color{blue}{x \cdot \frac{y}{2}} + \left(\mathsf{neg}\left(\frac{z}{8}\right)\right) \]

   6. *-commutative N/A

      \[\leadsto \color{blue}{\frac{y}{2} \cdot x} + \left(\mathsf{neg}\left(\frac{z}{8}\right)\right) \]

   7. lower-fma.f64 N/A

      \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{y}{2}, x, \mathsf{neg}\left(\frac{z}{8}\right)\right)} \]

   8. div-inv N/A

      \[\leadsto \mathsf{fma}\left(\color{blue}{y \cdot \frac{1}{2}}, x, \mathsf{neg}\left(\frac{z}{8}\right)\right) \]

   9. lower-*.f64 N/A

      \[\leadsto \mathsf{fma}\left(\color{blue}{y \cdot \frac{1}{2}}, x, \mathsf{neg}\left(\frac{z}{8}\right)\right) \]

   10. metadata-eval N/A

       \[\leadsto \mathsf{fma}\left(y \cdot \color{blue}{\frac{1}{2}}, x, \mathsf{neg}\left(\frac{z}{8}\right)\right) \]

   11. lift-/.f64 N/A

       \[\leadsto \mathsf{fma}\left(y \cdot \frac{1}{2}, x, \mathsf{neg}\left(\color{blue}{\frac{z}{8}}\right)\right) \]

   12. distribute-neg-frac2 N/A

       \[\leadsto \mathsf{fma}\left(y \cdot \frac{1}{2}, x, \color{blue}{\frac{z}{\mathsf{neg}\left(8\right)}}\right) \]

   13. div-inv N/A

       \[\leadsto \mathsf{fma}\left(y \cdot \frac{1}{2}, x, \color{blue}{z \cdot \frac{1}{\mathsf{neg}\left(8\right)}}\right) \]

   14. lower-*.f64 N/A

       \[\leadsto \mathsf{fma}\left(y \cdot \frac{1}{2}, x, \color{blue}{z \cdot \frac{1}{\mathsf{neg}\left(8\right)}}\right) \]

   15. metadata-eval N/A

       \[\leadsto \mathsf{fma}\left(y \cdot \frac{1}{2}, x, z \cdot \frac{1}{\color{blue}{-8}}\right) \]

   16. metadata-eval 100.0

       \[\leadsto \mathsf{fma}\left(y \cdot 0.5, x, z \cdot \color{blue}{-0.125}\right) \]

4. Applied rewrites 100.0%

   \[\leadsto \color{blue}{\mathsf{fma}\left(y \cdot 0.5, x, z \cdot -0.125\right)} \]
5. Add Preprocessing

Alternative 2: 79.3% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := 0.5 \cdot \left(y \cdot x\right)\\ \mathbf{if}\;y \cdot x \leq -3 \cdot 10^{-36}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \cdot x \leq 2.6 \cdot 10^{-63}:\\ \;\;\;\;z \cdot -0.125\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* 0.5 (* y x))))
   (if (<= (* y x) -3e-36) t_0 (if (<= (* y x) 2.6e-63) (* z -0.125) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = 0.5 * (y * x);
	double tmp;
	if ((y * x) <= -3e-36) {
		tmp = t_0;
	} else if ((y * x) <= 2.6e-63) {
		tmp = z * -0.125;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: t_0
    real(8) :: tmp
    t_0 = 0.5d0 * (y * x)
    if ((y * x) <= (-3d-36)) then
        tmp = t_0
    else if ((y * x) <= 2.6d-63) then
        tmp = z * (-0.125d0)
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = 0.5 * (y * x);
	double tmp;
	if ((y * x) <= -3e-36) {
		tmp = t_0;
	} else if ((y * x) <= 2.6e-63) {
		tmp = z * -0.125;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = 0.5 * (y * x)
	tmp = 0
	if (y * x) <= -3e-36:
		tmp = t_0
	elif (y * x) <= 2.6e-63:
		tmp = z * -0.125
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(0.5 * Float64(y * x))
	tmp = 0.0
	if (Float64(y * x) <= -3e-36)
		tmp = t_0;
	elseif (Float64(y * x) <= 2.6e-63)
		tmp = Float64(z * -0.125);
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = 0.5 * (y * x);
	tmp = 0.0;
	if ((y * x) <= -3e-36)
		tmp = t_0;
	elseif ((y * x) <= 2.6e-63)
		tmp = z * -0.125;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(0.5 * N[(y * x), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(y * x), $MachinePrecision], -3e-36], t$95$0, If[LessEqual[N[(y * x), $MachinePrecision], 2.6e-63], N[(z * -0.125), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 x y) < -3.0000000000000002e-36 or 2.6000000000000001e-63 < (*.f64 x y)

   1. Initial program 100.0%

      \[\frac{x \cdot y}{2} - \frac{z}{8} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \left(x \cdot y\right)} \]
   4. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \color{blue}{\frac{1}{2} \cdot \left(x \cdot y\right)} \]

      2. lower-*.f64 75.0

         \[\leadsto 0.5 \cdot \color{blue}{\left(x \cdot y\right)} \]

   5. Applied rewrites 75.0%

      \[\leadsto \color{blue}{0.5 \cdot \left(x \cdot y\right)} \]

   if -3.0000000000000002e-36 < (*.f64 x y) < 2.6000000000000001e-63

   1. Initial program 100.0%

      \[\frac{x \cdot y}{2} - \frac{z}{8} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{-1}{8} \cdot z} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{z \cdot \frac{-1}{8}} \]

      2. lower-*.f64 85.3

         \[\leadsto \color{blue}{z \cdot -0.125} \]

   5. Applied rewrites 85.3%

      \[\leadsto \color{blue}{z \cdot -0.125} \]
3. Recombined 2 regimes into one program.

4. Final simplification 79.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \cdot x \leq -3 \cdot 10^{-36}:\\ \;\;\;\;0.5 \cdot \left(y \cdot x\right)\\ \mathbf{elif}\;y \cdot x \leq 2.6 \cdot 10^{-63}:\\ \;\;\;\;z \cdot -0.125\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(y \cdot x\right)\\ \end{array} \]
5. Add Preprocessing

Reproduce

herbie shell --seed 2024223 
(FPCore (x y z)
  :name "Diagrams.Solve.Polynomial:quartForm  from diagrams-solve-0.1, D"
  :precision binary64
  (- (/ (* x y) 2.0) (/ z 8.0)))