Data.Spline.Key:interpolateKeys from smoothie-0.4.0.2

Percentage Accurate: 99.8% → 99.8%

Time: 7.3s

Alternatives: 3

Speedup: 1.0×

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

Specification

Math

\[\begin{array}{l} \\ \left(x \cdot x\right) \cdot \left(3 - x \cdot 2\right) \end{array} \]

FPCore

(FPCore (x) :precision binary64 (* (* x x) (- 3.0 (* x 2.0))))

C

double code(double x) {
	return (x * x) * (3.0 - (x * 2.0));
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = (x * x) * (3.0d0 - (x * 2.0d0))
end function

Java

public static double code(double x) {
	return (x * x) * (3.0 - (x * 2.0));
}

Python

def code(x):
	return (x * x) * (3.0 - (x * 2.0))

Julia

function code(x)
	return Float64(Float64(x * x) * Float64(3.0 - Float64(x * 2.0)))
end

MATLAB

function tmp = code(x)
	tmp = (x * x) * (3.0 - (x * 2.0));
end

Wolfram

code[x_] := N[(N[(x * x), $MachinePrecision] * N[(3.0 - N[(x * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Initial Program: 99.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(x \cdot x\right) \cdot \left(3 - x \cdot 2\right) \end{array} \]

FPCore

(FPCore (x) :precision binary64 (* (* x x) (- 3.0 (* x 2.0))))

C

double code(double x) {
	return (x * x) * (3.0 - (x * 2.0));
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = (x * x) * (3.0d0 - (x * 2.0d0))
end function

Java

public static double code(double x) {
	return (x * x) * (3.0 - (x * 2.0));
}

Python

def code(x):
	return (x * x) * (3.0 - (x * 2.0))

Julia

function code(x)
	return Float64(Float64(x * x) * Float64(3.0 - Float64(x * 2.0)))
end

MATLAB

function tmp = code(x)
	tmp = (x * x) * (3.0 - (x * 2.0));
end

Wolfram

code[x_] := N[(N[(x * x), $MachinePrecision] * N[(3.0 - N[(x * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Alternative 1: 99.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x \cdot \left(x \cdot \left(3 - x \cdot 2\right)\right) \end{array} \]

FPCore

(FPCore (x) :precision binary64 (* x (* x (- 3.0 (* x 2.0)))))

C

double code(double x) {
	return x * (x * (3.0 - (x * 2.0)));
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = x * (x * (3.0d0 - (x * 2.0d0)))
end function

Java

public static double code(double x) {
	return x * (x * (3.0 - (x * 2.0)));
}

Python

def code(x):
	return x * (x * (3.0 - (x * 2.0)))

Julia

function code(x)
	return Float64(x * Float64(x * Float64(3.0 - Float64(x * 2.0))))
end

MATLAB

function tmp = code(x)
	tmp = x * (x * (3.0 - (x * 2.0)));
end

Wolfram

code[x_] := N[(x * N[(x * N[(3.0 - N[(x * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.8%

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

   1. associate-*l* 99.8%

      \[\leadsto \color{blue}{x \cdot \left(x \cdot \left(3 - x \cdot 2\right)\right)} \]

3. Simplified 99.8%

   \[\leadsto \color{blue}{x \cdot \left(x \cdot \left(3 - x \cdot 2\right)\right)} \]
4. Add Preprocessing
5. Add Preprocessing

Alternative 2: 97.7% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.5 \lor \neg \left(x \leq 1.5\right):\\ \;\;\;\;x \cdot \left(x \cdot \left(x \cdot -2\right)\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(x \cdot 3\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (or (<= x -1.5) (not (<= x 1.5))) (* x (* x (* x -2.0))) (* x (* x 3.0))))

C

double code(double x) {
	double tmp;
	if ((x <= -1.5) || !(x <= 1.5)) {
		tmp = x * (x * (x * -2.0));
	} else {
		tmp = x * (x * 3.0);
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if ((x <= (-1.5d0)) .or. (.not. (x <= 1.5d0))) then
        tmp = x * (x * (x * (-2.0d0)))
    else
        tmp = x * (x * 3.0d0)
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if ((x <= -1.5) || !(x <= 1.5)) {
		tmp = x * (x * (x * -2.0));
	} else {
		tmp = x * (x * 3.0);
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if (x <= -1.5) or not (x <= 1.5):
		tmp = x * (x * (x * -2.0))
	else:
		tmp = x * (x * 3.0)
	return tmp

Julia

function code(x)
	tmp = 0.0
	if ((x <= -1.5) || !(x <= 1.5))
		tmp = Float64(x * Float64(x * Float64(x * -2.0)));
	else
		tmp = Float64(x * Float64(x * 3.0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if ((x <= -1.5) || ~((x <= 1.5)))
		tmp = x * (x * (x * -2.0));
	else
		tmp = x * (x * 3.0);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[Or[LessEqual[x, -1.5], N[Not[LessEqual[x, 1.5]], $MachinePrecision]], N[(x * N[(x * N[(x * -2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x * N[(x * 3.0), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.5 or 1.5 < x

   1. Initial program 99.9%

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

      1. associate-*l* 99.9%

         \[\leadsto \color{blue}{x \cdot \left(x \cdot \left(3 - x \cdot 2\right)\right)} \]

   3. Simplified 99.9%

      \[\leadsto \color{blue}{x \cdot \left(x \cdot \left(3 - x \cdot 2\right)\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 97.9%

      \[\leadsto x \cdot \left(x \cdot \color{blue}{\left(-2 \cdot x\right)}\right) \]
   6. Step-by-step derivation

      1. *-commutative 97.9%

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

   7. Simplified 97.9%

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

   if -1.5 < x < 1.5

   1. Initial program 99.7%

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

      1. associate-*l* 99.7%

         \[\leadsto \color{blue}{x \cdot \left(x \cdot \left(3 - x \cdot 2\right)\right)} \]

   3. Simplified 99.7%

      \[\leadsto \color{blue}{x \cdot \left(x \cdot \left(3 - x \cdot 2\right)\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 99.2%

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

4. Final simplification 98.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.5 \lor \neg \left(x \leq 1.5\right):\\ \;\;\;\;x \cdot \left(x \cdot \left(x \cdot -2\right)\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(x \cdot 3\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 62.4% accurate, 1.8× speedup

Math

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

FPCore

(FPCore (x) :precision binary64 (* x (* x 3.0)))

C

double code(double x) {
	return x * (x * 3.0);
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = x * (x * 3.0d0)
end function

Java

public static double code(double x) {
	return x * (x * 3.0);
}

Python

def code(x):
	return x * (x * 3.0)

Julia

function code(x)
	return Float64(x * Float64(x * 3.0))
end

MATLAB

function tmp = code(x)
	tmp = x * (x * 3.0);
end

Wolfram

code[x_] := N[(x * N[(x * 3.0), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.8%

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

   1. associate-*l* 99.8%

      \[\leadsto \color{blue}{x \cdot \left(x \cdot \left(3 - x \cdot 2\right)\right)} \]

3. Simplified 99.8%

   \[\leadsto \color{blue}{x \cdot \left(x \cdot \left(3 - x \cdot 2\right)\right)} \]
4. Add Preprocessing

5. Taylor expanded in x around 0 62.5%

   \[\leadsto x \cdot \left(x \cdot \color{blue}{3}\right) \]
6. Add Preprocessing

Developer target: 99.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x \cdot \left(x \cdot \left(3 - x \cdot 2\right)\right) \end{array} \]

FPCore

(FPCore (x) :precision binary64 (* x (* x (- 3.0 (* x 2.0)))))

C

double code(double x) {
	return x * (x * (3.0 - (x * 2.0)));
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = x * (x * (3.0d0 - (x * 2.0d0)))
end function

Java

public static double code(double x) {
	return x * (x * (3.0 - (x * 2.0)));
}

Python

def code(x):
	return x * (x * (3.0 - (x * 2.0)))

Julia

function code(x)
	return Float64(x * Float64(x * Float64(3.0 - Float64(x * 2.0))))
end

MATLAB

function tmp = code(x)
	tmp = x * (x * (3.0 - (x * 2.0)));
end

Wolfram

code[x_] := N[(x * N[(x * N[(3.0 - N[(x * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Reproduce

herbie shell --seed 2024110 
(FPCore (x)
  :name "Data.Spline.Key:interpolateKeys from smoothie-0.4.0.2"
  :precision binary64

  :alt
  (* x (* x (- 3.0 (* x 2.0))))

  (* (* x x) (- 3.0 (* x 2.0))))