Numeric.Integration.TanhSinh:simpson from integration-0.2.1

Percentage Accurate: 100.0% → 100.0%
Time: 1.2s
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, y] = \mathsf{sort}([x, y])\\ \\ y \cdot \left(x + x\right) \end{array} \]
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y) :precision binary64 (* y (+ x x)))
assert(x < y);
double code(double x, double y) {
	return y * (x + x);
}

NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = y * (x + x)
end function

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

[x, y] = sort([x, y])
def code(x, y):
	return y * (x + x)

x, y = sort([x, y])
function code(x, y)
	return Float64(y * Float64(x + x))
end

x, y = num2cell(sort([x, y])){:}
function tmp = code(x, y)
	tmp = y * (x + x);
end

NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := N[(y * N[(x + x), $MachinePrecision]), $MachinePrecision]

\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
y \cdot \left(x + x\right)
\end{array}
Derivation

  1. Initial program 100.0%

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

    1. distribute-rgt-inN/A

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

    2. distribute-lft-outN/A

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

    3. *-lowering-*.f64N/A

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

    4. +-lowering-+.f6499.6

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

  4. Applied egg-rr99.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, y] = \mathsf{sort}([x, y])\\ \\ x \cdot \left(y + y\right) \end{array} \]
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y) :precision binary64 (* x (+ y y)))
assert(x < y);
double code(double x, double y) {
	return x * (y + y);
}

NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = x * (y + y)
end function

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

[x, y] = sort([x, y])
def code(x, y):
	return x * (y + y)

x, y = sort([x, y])
function code(x, y)
	return Float64(x * Float64(y + y))
end

x, y = num2cell(sort([x, y])){:}
function tmp = code(x, y)
	tmp = x * (y + y);
end

NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := N[(x * N[(y + y), $MachinePrecision]), $MachinePrecision]

\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
x \cdot \left(y + y\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 2024205 
(FPCore (x y)
  :name "Numeric.Integration.TanhSinh:simpson  from integration-0.2.1"
  :precision binary64
  (* x (+ y y)))