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

Percentage Accurate: 99.8% → 99.8%

Time: 7.6s

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.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 2: 74.6% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := y \cdot \sqrt{z}\\ \mathbf{if}\;t\_0 \leq -1.55 \cdot 10^{-5} \lor \neg \left(t\_0 \leq -7.2 \cdot 10^{-128} \lor \neg \left(t\_0 \leq -2.05 \cdot 10^{-151}\right) \land t\_0 \leq 1.85 \cdot 10^{+56}\right):\\ \;\;\;\;0.5 \cdot t\_0\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* y (sqrt z))))
   (if (or (<= t_0 -1.55e-5)
           (not
            (or (<= t_0 -7.2e-128)
                (and (not (<= t_0 -2.05e-151)) (<= t_0 1.85e+56)))))
     (* 0.5 t_0)
     (* 0.5 x))))

C

double code(double x, double y, double z) {
	double t_0 = y * sqrt(z);
	double tmp;
	if ((t_0 <= -1.55e-5) || !((t_0 <= -7.2e-128) || (!(t_0 <= -2.05e-151) && (t_0 <= 1.85e+56)))) {
		tmp = 0.5 * t_0;
	} else {
		tmp = 0.5 * x;
	}
	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)
    if ((t_0 <= (-1.55d-5)) .or. (.not. (t_0 <= (-7.2d-128)) .or. (.not. (t_0 <= (-2.05d-151))) .and. (t_0 <= 1.85d+56))) then
        tmp = 0.5d0 * t_0
    else
        tmp = 0.5d0 * x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = y * Math.sqrt(z);
	double tmp;
	if ((t_0 <= -1.55e-5) || !((t_0 <= -7.2e-128) || (!(t_0 <= -2.05e-151) && (t_0 <= 1.85e+56)))) {
		tmp = 0.5 * t_0;
	} else {
		tmp = 0.5 * x;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = y * math.sqrt(z)
	tmp = 0
	if (t_0 <= -1.55e-5) or not ((t_0 <= -7.2e-128) or (not (t_0 <= -2.05e-151) and (t_0 <= 1.85e+56))):
		tmp = 0.5 * t_0
	else:
		tmp = 0.5 * x
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(y * sqrt(z))
	tmp = 0.0
	if ((t_0 <= -1.55e-5) || !((t_0 <= -7.2e-128) || (!(t_0 <= -2.05e-151) && (t_0 <= 1.85e+56))))
		tmp = Float64(0.5 * t_0);
	else
		tmp = Float64(0.5 * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = y * sqrt(z);
	tmp = 0.0;
	if ((t_0 <= -1.55e-5) || ~(((t_0 <= -7.2e-128) || (~((t_0 <= -2.05e-151)) && (t_0 <= 1.85e+56)))))
		tmp = 0.5 * t_0;
	else
		tmp = 0.5 * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(y * N[Sqrt[z], $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[t$95$0, -1.55e-5], N[Not[Or[LessEqual[t$95$0, -7.2e-128], And[N[Not[LessEqual[t$95$0, -2.05e-151]], $MachinePrecision], LessEqual[t$95$0, 1.85e+56]]]], $MachinePrecision]], N[(0.5 * t$95$0), $MachinePrecision], N[(0.5 * x), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 y (sqrt.f64 z)) < -1.55000000000000007e-5 or -7.20000000000000049e-128 < (*.f64 y (sqrt.f64 z)) < -2.0500000000000001e-151 or 1.84999999999999998e56 < (*.f64 y (sqrt.f64 z))

   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. Step-by-step derivation

      1. +-commutative 99.7%

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

      2. *-commutative 99.7%

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

      3. add-sqr-sqrt 99.5%

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

      4. associate-*l* 99.5%

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

      5. fma-define 99.5%

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

      6. pow1/2 99.5%

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

      7. sqrt-pow1 99.6%

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

      8. metadata-eval 99.6%

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

      9. pow1/2 99.6%

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

      10. sqrt-pow1 99.5%

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

      11. metadata-eval 99.5%

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

   6. Applied egg-rr 99.5%

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

   7. Taylor expanded in z around inf 80.0%

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

   if -1.55000000000000007e-5 < (*.f64 y (sqrt.f64 z)) < -7.20000000000000049e-128 or -2.0500000000000001e-151 < (*.f64 y (sqrt.f64 z)) < 1.84999999999999998e56

   1. Initial program 99.9%

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

      1. metadata-eval 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in x around inf 84.6%

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

4. Final simplification 82.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \cdot \sqrt{z} \leq -1.55 \cdot 10^{-5} \lor \neg \left(y \cdot \sqrt{z} \leq -7.2 \cdot 10^{-128} \lor \neg \left(y \cdot \sqrt{z} \leq -2.05 \cdot 10^{-151}\right) \land y \cdot \sqrt{z} \leq 1.85 \cdot 10^{+56}\right):\\ \;\;\;\;0.5 \cdot \left(y \cdot \sqrt{z}\right)\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot x\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 50.1% 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 55.5%

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

6. Final simplification 55.5%

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

Reproduce

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