Optimisation.CirclePacking:place from circle-packing-0.1.0.4, A

Percentage Accurate: 100.0% → 100.0%
Time: 3.1s
Alternatives: 3
Speedup: 1.0×

Specification

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

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

public static double code(double x, double y) {
	return Math.sqrt((x + y));
}

def code(x, y):
	return math.sqrt((x + y))

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

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

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

\begin{array}{l}

\\
\sqrt{x + y}
\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 3 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} \\ \sqrt{x + y} \end{array} \]
(FPCore (x y) :precision binary64 (sqrt (+ x y)))
double code(double x, double y) {
	return sqrt((x + y));
}

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

public static double code(double x, double y) {
	return Math.sqrt((x + y));
}

def code(x, y):
	return math.sqrt((x + y))

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

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

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

\begin{array}{l}

\\
\sqrt{x + y}
\end{array}

Alternative 1: 100.0% accurate, 0.5× speedup?

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

assert x < y;
public static double code(double x, double y) {
	return Math.sqrt(((1.0 + (x / y)) * y));
}

[x, y] = sort([x, y])
def code(x, y):
	return math.sqrt(((1.0 + (x / y)) * y))

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

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

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

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

  1. Initial program 100.0%

    \[\sqrt{x + y} \]
  2. Add Preprocessing

  3. Taylor expanded in y around inf

    \[\leadsto \sqrt{\color{blue}{y \cdot \left(1 + \frac{x}{y}\right)}} \]
  4. Step-by-step derivation

    1. *-commutativeN/A

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

    2. lower-*.f64N/A

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

    3. +-commutativeN/A

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

    4. lower-+.f64N/A

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

    5. lower-/.f6487.6

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

  5. Applied rewrites87.6%

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

  6. Final simplification87.6%

    \[\leadsto \sqrt{\left(1 + \frac{x}{y}\right) \cdot y} \]
  7. Add Preprocessing

Alternative 2: 100.0% accurate, 1.0× speedup?

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

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

[x, y] = sort([x, y])
def code(x, y):
	return math.sqrt((y + x))

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

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

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

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

  1. Initial program 100.0%

    \[\sqrt{x + y} \]
  2. Add Preprocessing

  3. Final simplification100.0%

    \[\leadsto \sqrt{y + x} \]
  4. Add Preprocessing

Alternative 3: 98.2% accurate, 1.3× speedup?

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ \sqrt{y} \end{array} \]
NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y) :precision binary64 (sqrt y))
assert(x < y);
double code(double x, double y) {
	return sqrt(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 = sqrt(y)
end function

assert x < y;
public static double code(double x, double y) {
	return Math.sqrt(y);
}

[x, y] = sort([x, y])
def code(x, y):
	return math.sqrt(y)

x, y = sort([x, y])
function code(x, y)
	return sqrt(y)
end

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

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

\begin{array}{l}
[x, y] = \mathsf{sort}([x, y])\\
\\
\sqrt{y}
\end{array}
Derivation

  1. Initial program 100.0%

    \[\sqrt{x + y} \]
  2. Add Preprocessing

  3. Taylor expanded in x around 0

    \[\leadsto \color{blue}{\sqrt{y}} \]
  4. Step-by-step derivation

    1. lower-sqrt.f6452.1

      \[\leadsto \color{blue}{\sqrt{y}} \]

  5. Applied rewrites52.1%

    \[\leadsto \color{blue}{\sqrt{y}} \]
  6. Add Preprocessing

Reproduce

?
herbie shell --seed 2024298 
(FPCore (x y)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, A"
  :precision binary64
  (sqrt (+ x y)))