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

Percentage Accurate: 99.8% → 99.8%

Time: 8.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.9

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

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

4. Applied rewrites 99.9%

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

Alternative 2: 72.5% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := y \cdot \left(\sqrt{z} \cdot 0.5\right)\\ \mathbf{if}\;y \leq -1.2 \cdot 10^{+25}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \leq 3 \cdot 10^{+111}:\\ \;\;\;\;x \cdot 0.5\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* y (* (sqrt z) 0.5))))
   (if (<= y -1.2e+25) t_0 (if (<= y 3e+111) (* x 0.5) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = y * (sqrt(z) * 0.5);
	double tmp;
	if (y <= -1.2e+25) {
		tmp = t_0;
	} else if (y <= 3e+111) {
		tmp = x * 0.5;
	} 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 = y * (sqrt(z) * 0.5d0)
    if (y <= (-1.2d+25)) then
        tmp = t_0
    else if (y <= 3d+111) then
        tmp = x * 0.5d0
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = y * (Math.sqrt(z) * 0.5);
	double tmp;
	if (y <= -1.2e+25) {
		tmp = t_0;
	} else if (y <= 3e+111) {
		tmp = x * 0.5;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = y * (math.sqrt(z) * 0.5)
	tmp = 0
	if y <= -1.2e+25:
		tmp = t_0
	elif y <= 3e+111:
		tmp = x * 0.5
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(y * Float64(sqrt(z) * 0.5))
	tmp = 0.0
	if (y <= -1.2e+25)
		tmp = t_0;
	elseif (y <= 3e+111)
		tmp = Float64(x * 0.5);
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = y * (sqrt(z) * 0.5);
	tmp = 0.0;
	if (y <= -1.2e+25)
		tmp = t_0;
	elseif (y <= 3e+111)
		tmp = x * 0.5;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(y * N[(N[Sqrt[z], $MachinePrecision] * 0.5), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -1.2e+25], t$95$0, If[LessEqual[y, 3e+111], N[(x * 0.5), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if y < -1.19999999999999998e25 or 3e111 < y

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

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

   5. Applied rewrites 83.8%

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

   if -1.19999999999999998e25 < y < 3e111

   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 74.3

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

   5. Applied rewrites 74.3%

      \[\leadsto \color{blue}{x \cdot 0.5} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 3: 50.4% 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 50.5

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

5. Applied rewrites 50.5%

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

Reproduce

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