Diagrams.Solve.Polynomial:quadForm from diagrams-solve-0.1, B

Percentage Accurate: 99.8% → 99.8%

Time: 6.5s

Alternatives: 3

Speedup: 1.6×

Specification

Math

\[\begin{array}{l} \\ \frac{1}{2} \cdot \left(x + y \cdot \sqrt{z}\right) \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (* (/ 1.0 2.0) (+ x (* y (sqrt z)))))

C

double code(double x, double y, double z) {
	return (1.0 / 2.0) * (x + (y * sqrt(z)));
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = (1.0d0 / 2.0d0) * (x + (y * sqrt(z)))
end function

Java

public static double code(double x, double y, double z) {
	return (1.0 / 2.0) * (x + (y * Math.sqrt(z)));
}

Python

def code(x, y, z):
	return (1.0 / 2.0) * (x + (y * math.sqrt(z)))

Julia

function code(x, y, z)
	return Float64(Float64(1.0 / 2.0) * Float64(x + Float64(y * sqrt(z))))
end

MATLAB

function tmp = code(x, y, z)
	tmp = (1.0 / 2.0) * (x + (y * sqrt(z)));
end

Wolfram

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

Initial Program: 99.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{1}{2} \cdot \left(x + y \cdot \sqrt{z}\right) \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (* (/ 1.0 2.0) (+ x (* y (sqrt z)))))

C

double code(double x, double y, double z) {
	return (1.0 / 2.0) * (x + (y * sqrt(z)));
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = (1.0d0 / 2.0d0) * (x + (y * sqrt(z)))
end function

Java

public static double code(double x, double y, double z) {
	return (1.0 / 2.0) * (x + (y * Math.sqrt(z)));
}

Python

def code(x, y, z):
	return (1.0 / 2.0) * (x + (y * math.sqrt(z)))

Julia

function code(x, y, z)
	return Float64(Float64(1.0 / 2.0) * Float64(x + Float64(y * sqrt(z))))
end

MATLAB

function tmp = code(x, y, z)
	tmp = (1.0 / 2.0) * (x + (y * sqrt(z)));
end

Wolfram

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

Alternative 1: 99.8% accurate, 1.6× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 99.8%

   \[\frac{1}{2} \cdot \left(x + y \cdot \sqrt{z}\right) \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift-*.f64 N/A

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

   2. *-commutative N/A

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

   3. lower-*.f64 99.8

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

   4. lift-+.f64 N/A

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

   5. +-commutative N/A

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

   6. lift-*.f64 N/A

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

   7. lower-fma.f64 99.8

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

   8. lift-/.f64 N/A

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

   9. metadata-eval 99.8

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

4. Applied rewrites 99.8%

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

Alternative 2: 73.6% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -8.2 \cdot 10^{-39}:\\ \;\;\;\;x \cdot 0.5\\ \mathbf{elif}\;x \leq 5.2 \cdot 10^{-17}:\\ \;\;\;\;y \cdot \left(\sqrt{z} \cdot 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot 0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -8.2e-39)
   (* x 0.5)
   (if (<= x 5.2e-17) (* y (* (sqrt z) 0.5)) (* x 0.5))))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -8.2e-39) {
		tmp = x * 0.5;
	} else if (x <= 5.2e-17) {
		tmp = y * (sqrt(z) * 0.5);
	} else {
		tmp = x * 0.5;
	}
	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) :: tmp
    if (x <= (-8.2d-39)) then
        tmp = x * 0.5d0
    else if (x <= 5.2d-17) then
        tmp = y * (sqrt(z) * 0.5d0)
    else
        tmp = x * 0.5d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (x <= -8.2e-39) {
		tmp = x * 0.5;
	} else if (x <= 5.2e-17) {
		tmp = y * (Math.sqrt(z) * 0.5);
	} else {
		tmp = x * 0.5;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if x <= -8.2e-39:
		tmp = x * 0.5
	elif x <= 5.2e-17:
		tmp = y * (math.sqrt(z) * 0.5)
	else:
		tmp = x * 0.5
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= -8.2e-39)
		tmp = Float64(x * 0.5);
	elseif (x <= 5.2e-17)
		tmp = Float64(y * Float64(sqrt(z) * 0.5));
	else
		tmp = Float64(x * 0.5);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (x <= -8.2e-39)
		tmp = x * 0.5;
	elseif (x <= 5.2e-17)
		tmp = y * (sqrt(z) * 0.5);
	else
		tmp = x * 0.5;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -8.2e-39], N[(x * 0.5), $MachinePrecision], If[LessEqual[x, 5.2e-17], N[(y * N[(N[Sqrt[z], $MachinePrecision] * 0.5), $MachinePrecision]), $MachinePrecision], N[(x * 0.5), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if x < -8.2e-39 or 5.20000000000000006e-17 < x

   1. Initial program 99.9%

      \[\frac{1}{2} \cdot \left(x + y \cdot \sqrt{z}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{x \cdot \frac{1}{2}} \]

      2. lower-*.f64 76.8

         \[\leadsto \color{blue}{x \cdot 0.5} \]

   5. Applied rewrites 76.8%

      \[\leadsto \color{blue}{x \cdot 0.5} \]

   if -8.2e-39 < x < 5.20000000000000006e-17

   1. Initial program 99.7%

      \[\frac{1}{2} \cdot \left(x + y \cdot \sqrt{z}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. lower-sqrt.f64 77.3

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

   5. Applied rewrites 77.3%

      \[\leadsto \color{blue}{y \cdot \left(\sqrt{z} \cdot 0.5\right)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 3: 50.0% accurate, 5.8× speedup

Math

\[\begin{array}{l} \\ x \cdot 0.5 \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (* x 0.5))

C

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

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 * 0.5d0
end function

Java

public static double code(double x, double y, double z) {
	return x * 0.5;
}

Python

def code(x, y, z):
	return x * 0.5

Julia

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

MATLAB

function tmp = code(x, y, z)
	tmp = x * 0.5;
end

Wolfram

code[x_, y_, z_] := N[(x * 0.5), $MachinePrecision]

Derivation

1. Initial program 99.8%

   \[\frac{1}{2} \cdot \left(x + y \cdot \sqrt{z}\right) \]
2. Add Preprocessing

3. Taylor expanded in x around inf

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

   1. *-commutative N/A

      \[\leadsto \color{blue}{x \cdot \frac{1}{2}} \]

   2. lower-*.f64 52.4

      \[\leadsto \color{blue}{x \cdot 0.5} \]

5. Applied rewrites 52.4%

   \[\leadsto \color{blue}{x \cdot 0.5} \]
6. Add Preprocessing

Reproduce

herbie shell --seed 2024232 
(FPCore (x y z)
  :name "Diagrams.Solve.Polynomial:quadForm from diagrams-solve-0.1, B"
  :precision binary64
  (* (/ 1.0 2.0) (+ x (* y (sqrt z)))))