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

Percentage Accurate: 99.8% → 99.8%

Time: 7.2s

Alternatives: 4

Speedup: 1.0×

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, 0.5× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 99.8%

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

   1. metadata-eval 99.8%

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

   2. +-commutative 99.8%

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

   3. fma-def 99.8%

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

3. Simplified 99.8%

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

5. Final simplification 99.8%

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

Alternative 2: 73.6% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -3.8 \cdot 10^{-14} \lor \neg \left(x \leq 4.15 \cdot 10^{+71}\right):\\ \;\;\;\;0.5 \cdot x\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(y \cdot \sqrt{z}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -3.8e-14) (not (<= x 4.15e+71)))
   (* 0.5 x)
   (* 0.5 (* y (sqrt z)))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -3.8e-14) || !(x <= 4.15e+71)) {
		tmp = 0.5 * x;
	} else {
		tmp = 0.5 * (y * sqrt(z));
	}
	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 <= (-3.8d-14)) .or. (.not. (x <= 4.15d+71))) then
        tmp = 0.5d0 * x
    else
        tmp = 0.5d0 * (y * sqrt(z))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((x <= -3.8e-14) || !(x <= 4.15e+71)) {
		tmp = 0.5 * x;
	} else {
		tmp = 0.5 * (y * Math.sqrt(z));
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x <= -3.8e-14) or not (x <= 4.15e+71):
		tmp = 0.5 * x
	else:
		tmp = 0.5 * (y * math.sqrt(z))
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -3.8e-14) || !(x <= 4.15e+71))
		tmp = Float64(0.5 * x);
	else
		tmp = Float64(0.5 * Float64(y * sqrt(z)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x <= -3.8e-14) || ~((x <= 4.15e+71)))
		tmp = 0.5 * x;
	else
		tmp = 0.5 * (y * sqrt(z));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -3.8e-14], N[Not[LessEqual[x, 4.15e+71]], $MachinePrecision]], N[(0.5 * x), $MachinePrecision], N[(0.5 * N[(y * N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -3.8000000000000002e-14 or 4.1499999999999998e71 < x

   1. Initial program 100.0%

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

      1. metadata-eval 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{0.5 \cdot \left(x + y \cdot \sqrt{z}\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 85.8%

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

   if -3.8000000000000002e-14 < x < 4.1499999999999998e71

   1. Initial program 99.7%

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

      1. metadata-eval 99.7%

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

   3. Simplified 99.7%

      \[\leadsto \color{blue}{0.5 \cdot \left(x + y \cdot \sqrt{z}\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 75.9%

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

4. Final simplification 79.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -3.8 \cdot 10^{-14} \lor \neg \left(x \leq 4.15 \cdot 10^{+71}\right):\\ \;\;\;\;0.5 \cdot x\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(y \cdot \sqrt{z}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 99.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z) {
	return 0.5 * (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 = 0.5d0 * (x + (y * sqrt(z)))
end function

Java

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

Python

def code(x, y, z):
	return 0.5 * (x + (y * math.sqrt(z)))

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.8%

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

   1. metadata-eval 99.8%

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

3. Simplified 99.8%

   \[\leadsto \color{blue}{0.5 \cdot \left(x + y \cdot \sqrt{z}\right)} \]
4. Add Preprocessing

5. Final simplification 99.8%

   \[\leadsto 0.5 \cdot \left(x + y \cdot \sqrt{z}\right) \]
6. Add Preprocessing

Alternative 4: 50.6% accurate, 36.3× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = 0.5d0 * x
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.8%

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

   1. metadata-eval 99.8%

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

3. Simplified 99.8%

   \[\leadsto \color{blue}{0.5 \cdot \left(x + y \cdot \sqrt{z}\right)} \]
4. Add Preprocessing

5. Taylor expanded in x around inf 49.4%

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

6. Final simplification 49.4%

   \[\leadsto 0.5 \cdot x \]
7. Add Preprocessing

Reproduce

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