Numeric.Integration.TanhSinh:everywhere from integration-0.2.1

Percentage Accurate: 94.3% → 99.9%

Time: 4.6s

Alternatives: 4

Speedup: 1.0×

• 24.3% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

\[\begin{array}{l} \\ x \cdot \left(1 + y \cdot y\right) \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 94.3% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x \cdot \left(1 + y \cdot y\right) \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.9% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= (* y y) 5e+41) (* x (+ (* y y) 1.0)) (* y (* y x))))

C

double code(double x, double y) {
	double tmp;
	if ((y * y) <= 5e+41) {
		tmp = x * ((y * y) + 1.0);
	} else {
		tmp = y * (y * x);
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((y * y) <= 5d+41) then
        tmp = x * ((y * y) + 1.0d0)
    else
        tmp = y * (y * x)
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((y * y) <= 5e+41) {
		tmp = x * ((y * y) + 1.0);
	} else {
		tmp = y * (y * x);
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y * y) <= 5e+41:
		tmp = x * ((y * y) + 1.0)
	else:
		tmp = y * (y * x)
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (Float64(y * y) <= 5e+41)
		tmp = Float64(x * Float64(Float64(y * y) + 1.0));
	else
		tmp = Float64(y * Float64(y * x));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y * y) <= 5e+41)
		tmp = x * ((y * y) + 1.0);
	else
		tmp = y * (y * x);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[N[(y * y), $MachinePrecision], 5e+41], N[(x * N[(N[(y * y), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], N[(y * N[(y * x), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 y y) < 5.00000000000000022e41

   1. Initial program 100.0%

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

   if 5.00000000000000022e41 < (*.f64 y y)

   1. Initial program 88.9%

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

   2. Taylor expanded in y around inf 88.9%

      \[\leadsto \color{blue}{{y}^{2} \cdot x} \]
   3. Step-by-step derivation

      1. unpow2 88.9%

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

      2. associate-*r* 99.9%

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

   4. Simplified 99.9%

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

4. Final simplification 99.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \cdot y \leq 5 \cdot 10^{+41}:\\ \;\;\;\;x \cdot \left(y \cdot y + 1\right)\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(y \cdot x\right)\\ \end{array} \]

Alternative 2: 98.6% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \cdot y \leq 2 \cdot 10^{-6}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(y \cdot x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (if (<= (* y y) 2e-6) x (* y (* y x))))

C

double code(double x, double y) {
	double tmp;
	if ((y * y) <= 2e-6) {
		tmp = x;
	} else {
		tmp = y * (y * x);
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((y * y) <= 2d-6) then
        tmp = x
    else
        tmp = y * (y * x)
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((y * y) <= 2e-6) {
		tmp = x;
	} else {
		tmp = y * (y * x);
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y * y) <= 2e-6:
		tmp = x
	else:
		tmp = y * (y * x)
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (Float64(y * y) <= 2e-6)
		tmp = x;
	else
		tmp = Float64(y * Float64(y * x));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y * y) <= 2e-6)
		tmp = x;
	else
		tmp = y * (y * x);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[N[(y * y), $MachinePrecision], 2e-6], x, N[(y * N[(y * x), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 y y) < 1.99999999999999991e-6

   1. Initial program 100.0%

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

   2. Taylor expanded in y around 0 99.1%

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

   if 1.99999999999999991e-6 < (*.f64 y y)

   1. Initial program 90.0%

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

   2. Taylor expanded in y around inf 87.9%

      \[\leadsto \color{blue}{{y}^{2} \cdot x} \]
   3. Step-by-step derivation

      1. unpow2 87.9%

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

      2. associate-*r* 97.7%

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

   4. Simplified 97.7%

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

4. Final simplification 98.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \cdot y \leq 2 \cdot 10^{-6}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(y \cdot x\right)\\ \end{array} \]

Alternative 3: 99.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x + y \cdot \left(y \cdot x\right) \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 95.2%

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

   1. distribute-rgt-in 95.2%

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

   2. *-un-lft-identity 95.2%

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

   3. +-commutative 95.2%

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

   4. associate-*l* 99.9%

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

3. Applied egg-rr 99.9%

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

4. Final simplification 99.9%

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

Alternative 4: 52.5% accurate, 7.0× speedup

Math

\[\begin{array}{l} \\ x \end{array} \]

FPCore

(FPCore (x y) :precision binary64 x)

C

double code(double x, double y) {
	return x;
}

Fortran

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

Java

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

Python

def code(x, y):
	return x

Julia

function code(x, y)
	return x
end

MATLAB

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

Wolfram

code[x_, y_] := x

Derivation

1. Initial program 95.2%

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

2. Taylor expanded in y around 0 53.6%

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

3. Final simplification 53.6%

   \[\leadsto x \]

Developer target: 99.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x + \left(x \cdot y\right) \cdot y \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

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