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

Percentage Accurate: 99.8% → 99.8%

Time: 8.2s

Alternatives: 3

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, 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.9%

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

3. Final simplification 99.9%

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

Alternative 2: 72.9% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -3.9 \cdot 10^{-15} \lor \neg \left(x \leq 6.6 \cdot 10^{-68}\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.9e-15) (not (<= x 6.6e-68)))
   (* 0.5 x)
   (* 0.5 (* y (sqrt z)))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -3.9e-15) || !(x <= 6.6e-68)) {
		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.9d-15)) .or. (.not. (x <= 6.6d-68))) 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.9e-15) || !(x <= 6.6e-68)) {
		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.9e-15) or not (x <= 6.6e-68):
		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.9e-15) || !(x <= 6.6e-68))
		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.9e-15) || ~((x <= 6.6e-68)))
		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.9e-15], N[Not[LessEqual[x, 6.6e-68]], $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.90000000000000026e-15 or 6.5999999999999997e-68 < 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 73.7%

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

   if -3.90000000000000026e-15 < x < 6.5999999999999997e-68

   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 83.1%

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

4. Final simplification 77.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -3.9 \cdot 10^{-15} \lor \neg \left(x \leq 6.6 \cdot 10^{-68}\right):\\ \;\;\;\;0.5 \cdot x\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \left(y \cdot \sqrt{z}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 50.7% 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.9%

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

3. Taylor expanded in x around inf 48.8%

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

4. Final simplification 48.8%

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

Reproduce

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