Numeric.Integration.TanhSinh:everywhere from integration-0.2.1

Average Error: 5.5 → 0.2

Time: 6.0s

Precision: binary64

Cost: 6985

Math

\[x \cdot \left(1 + y \cdot y\right) \]

↓

\[\begin{array}{l} \mathbf{if}\;y \leq -2 \cdot 10^{+156} \lor \neg \left(y \leq 5 \cdot 10^{+64}\right):\\ \;\;\;\;y \cdot \left(y \cdot x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(x, y \cdot y, x\right)\\ \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (* x (+ 1.0 (* y y))))

↓

(FPCore (x y)
 :precision binary64
 (if (or (<= y -2e+156) (not (<= y 5e+64))) (* y (* y x)) (fma x (* y y) x)))

C

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

↓

double code(double x, double y) {
	double tmp;
	if ((y <= -2e+156) || !(y <= 5e+64)) {
		tmp = y * (y * x);
	} else {
		tmp = fma(x, (y * y), x);
	}
	return tmp;
}

Julia

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

↓

function code(x, y)
	tmp = 0.0
	if ((y <= -2e+156) || !(y <= 5e+64))
		tmp = Float64(y * Float64(y * x));
	else
		tmp = fma(x, Float64(y * y), x);
	end
	return tmp
end

Wolfram

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

↓

code[x_, y_] := If[Or[LessEqual[y, -2e+156], N[Not[LessEqual[y, 5e+64]], $MachinePrecision]], N[(y * N[(y * x), $MachinePrecision]), $MachinePrecision], N[(x * N[(y * y), $MachinePrecision] + x), $MachinePrecision]]

Target

Original	5.5
Target	0.1
Herbie	0.2

\[x + \left(x \cdot y\right) \cdot y \]

Derivation

1. Split input into 2 regimes

2. if y < -2e156 or 5e64 < y

   1. Initial program 37.3

      \[x \cdot \left(1 + y \cdot y\right) \]

   2. Taylor expanded in y around inf 37.3

      \[\leadsto \color{blue}{{y}^{2} \cdot x} \]

   3. Simplified 0.2

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

      [Start] 37.3	\[ {y}^{2} \cdot x \]
      unpow2 [=>] 37.3	\[ \color{blue}{\left(y \cdot y\right)} \cdot x \]
      associate-*l* [=>] 0.2	\[ \color{blue}{y \cdot \left(y \cdot x\right)} \]

   if -2e156 < y < 5e64

   1. Initial program 0.2

      \[x \cdot \left(1 + y \cdot y\right) \]

   2. Simplified 0.2

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

      [Start] 0.2	\[ x \cdot \left(1 + y \cdot y\right) \]
      distribute-lft-in [=>] 0.2	\[ \color{blue}{x \cdot 1 + x \cdot \left(y \cdot y\right)} \]
      +-commutative [=>] 0.2	\[ \color{blue}{x \cdot \left(y \cdot y\right) + x \cdot 1} \]
      *-rgt-identity [=>] 0.2	\[ x \cdot \left(y \cdot y\right) + \color{blue}{x} \]
      fma-def [=>] 0.2	\[ \color{blue}{\mathsf{fma}\left(x, y \cdot y, x\right)} \]

3. Recombined 2 regimes into one program.

4. Final simplification 0.2

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -2 \cdot 10^{+156} \lor \neg \left(y \leq 5 \cdot 10^{+64}\right):\\ \;\;\;\;y \cdot \left(y \cdot x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(x, y \cdot y, x\right)\\ \end{array} \]

Alternatives

Alternative 1
Error	0.1
Cost	713

\[\begin{array}{l} \mathbf{if}\;y \leq -9.5 \cdot 10^{+153} \lor \neg \left(y \leq 5 \cdot 10^{+64}\right):\\ \;\;\;\;y \cdot \left(y \cdot x\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(y \cdot y + 1\right)\\ \end{array} \]

Alternative 2
Error	6.4
Cost	580

\[\begin{array}{l} \mathbf{if}\;y \cdot y \leq 1:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(y \cdot y\right)\\ \end{array} \]

Alternative 3
Error	1.0
Cost	580

\[\begin{array}{l} \mathbf{if}\;y \cdot y \leq 0.002:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(y \cdot x\right)\\ \end{array} \]

Alternative 4
Error	20.1
Cost	64

\[x \]

Reproduce

herbie shell --seed 2023083 
(FPCore (x y)
  :name "Numeric.Integration.TanhSinh:everywhere from integration-0.2.1"
  :precision binary64

  :herbie-target
  (+ x (* (* x y) y))

  (* x (+ 1.0 (* y y))))