Numeric.Integration.TanhSinh:simpson from integration-0.2.1

Percentage Accurate: 100.0% → 100.0%
Time: 1.4s
Alternatives: 2
Speedup: 1.0×

Specification

?
\[\begin{array}{l} \\ x \cdot \left(y + y\right) \end{array} \]
(FPCore (x y) :precision binary64 (* x (+ y y)))
double code(double x, double y) {
	return x * (y + y);
}

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = x * (y + y)
end function

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

def code(x, y):
	return x * (y + y)

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

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

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

\begin{array}{l}

\\
x \cdot \left(y + y\right)
\end{array}

Sampling outcomes in binary64 precision:

Local Percentage Accuracy vs ?

The average percentage accuracy by input value. Horizontal axis shows value of an input variable; the variable is choosen in the title. Vertical axis is accuracy; higher is better. Red represent the original program, while blue represents Herbie's suggestion. These can be toggled with buttons below the plot. The line is an average while dots represent individual samples.

Accuracy vs Speed?

Herbie found 2 alternatives:

AlternativeAccuracySpeedup
The accuracy (vertical axis) and speed (horizontal axis) of each alternatives. Up and to the right is better. The red square shows the initial program, and each blue circle shows an alternative.The line shows the best available speed-accuracy tradeoffs.

Initial Program: 100.0% accurate, 1.0× speedup?

\[\begin{array}{l} \\ x \cdot \left(y + y\right) \end{array} \]
(FPCore (x y) :precision binary64 (* x (+ y y)))
double code(double x, double y) {
	return x * (y + y);
}

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = x * (y + y)
end function

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

def code(x, y):
	return x * (y + y)

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

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

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

\begin{array}{l}

\\
x \cdot \left(y + y\right)
\end{array}

Alternative 1: 100.0% accurate, 1.0× speedup?

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ [x_m, y] = \mathsf{sort}([x_m, y])\\ \\ x\_s \cdot \left(y \cdot \left(x\_m + x\_m\right)\right) \end{array} \]
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m and y should be sorted in increasing order before calling this function.
(FPCore (x_s x_m y) :precision binary64 (* x_s (* y (+ x_m x_m))))
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y);
double code(double x_s, double x_m, double y) {
	return x_s * (y * (x_m + x_m));
}

x\_m = abs(x)
x\_s = copysign(1.0d0, x)
NOTE: x_m and y should be sorted in increasing order before calling this function.
real(8) function code(x_s, x_m, y)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    code = x_s * (y * (x_m + x_m))
end function

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
assert x_m < y;
public static double code(double x_s, double x_m, double y) {
	return x_s * (y * (x_m + x_m));
}

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
[x_m, y] = sort([x_m, y])
def code(x_s, x_m, y):
	return x_s * (y * (x_m + x_m))

x\_m = abs(x)
x\_s = copysign(1.0, x)
x_m, y = sort([x_m, y])
function code(x_s, x_m, y)
	return Float64(x_s * Float64(y * Float64(x_m + x_m)))
end

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
x_m, y = num2cell(sort([x_m, y])){:}
function tmp = code(x_s, x_m, y)
	tmp = x_s * (y * (x_m + x_m));
end

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m and y should be sorted in increasing order before calling this function.
code[x$95$s_, x$95$m_, y_] := N[(x$95$s * N[(y * N[(x$95$m + x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

\begin{array}{l}
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y] = \mathsf{sort}([x_m, y])\\
\\
x\_s \cdot \left(y \cdot \left(x\_m + x\_m\right)\right)
\end{array}
Derivation

  1. Initial program 100.0%

    \[x \cdot \left(y + y\right) \]
  2. Add Preprocessing
  3. Step-by-step derivation

    1. lift-*.f64N/A

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

    2. lift-+.f64N/A

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

    3. distribute-rgt-inN/A

      \[\leadsto \color{blue}{y \cdot x + y \cdot x} \]

    4. distribute-lft-outN/A

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

    5. lower-*.f64N/A

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

    6. lower-+.f6499.6

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

  4. Applied rewrites99.6%

    \[\leadsto \color{blue}{y \cdot \left(x + x\right)} \]
  5. Add Preprocessing

Alternative 2: 100.0% accurate, 1.0× speedup?

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ [x_m, y] = \mathsf{sort}([x_m, y])\\ \\ x\_s \cdot \left(x\_m \cdot \left(y + y\right)\right) \end{array} \]
x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
NOTE: x_m and y should be sorted in increasing order before calling this function.
(FPCore (x_s x_m y) :precision binary64 (* x_s (* x_m (+ y y))))
x\_m = fabs(x);
x\_s = copysign(1.0, x);
assert(x_m < y);
double code(double x_s, double x_m, double y) {
	return x_s * (x_m * (y + y));
}

x\_m = abs(x)
x\_s = copysign(1.0d0, x)
NOTE: x_m and y should be sorted in increasing order before calling this function.
real(8) function code(x_s, x_m, y)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    code = x_s * (x_m * (y + y))
end function

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
assert x_m < y;
public static double code(double x_s, double x_m, double y) {
	return x_s * (x_m * (y + y));
}

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
[x_m, y] = sort([x_m, y])
def code(x_s, x_m, y):
	return x_s * (x_m * (y + y))

x\_m = abs(x)
x\_s = copysign(1.0, x)
x_m, y = sort([x_m, y])
function code(x_s, x_m, y)
	return Float64(x_s * Float64(x_m * Float64(y + y)))
end

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
x_m, y = num2cell(sort([x_m, y])){:}
function tmp = code(x_s, x_m, y)
	tmp = x_s * (x_m * (y + y));
end

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x_m and y should be sorted in increasing order before calling this function.
code[x$95$s_, x$95$m_, y_] := N[(x$95$s * N[(x$95$m * N[(y + y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

\begin{array}{l}
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)
\\
[x_m, y] = \mathsf{sort}([x_m, y])\\
\\
x\_s \cdot \left(x\_m \cdot \left(y + y\right)\right)
\end{array}
Derivation

  1. Initial program 100.0%

    \[x \cdot \left(y + y\right) \]
  2. Add Preprocessing
  3. Add Preprocessing

Reproduce

?
herbie shell --seed 2024309 
(FPCore (x y)
  :name "Numeric.Integration.TanhSinh:simpson  from integration-0.2.1"
  :precision binary64
  (* x (+ y y)))