math.abs on complex

Average Error: 31.0 → 17.6

Time: 965.0ms

Precision: 64

Math

\[\sqrt{re \cdot re + im \cdot im}\]

↓

\[\begin{array}{l} \mathbf{if}\;re \le -2.20183780306174354 \cdot 10^{112}:\\ \;\;\;\;-1 \cdot re\\ \mathbf{elif}\;re \le 9.92580502184387772 \cdot 10^{51}:\\ \;\;\;\;\sqrt{re \cdot re + im \cdot im}\\ \mathbf{else}:\\ \;\;\;\;re\\ \end{array}\]

C

double code(double re, double im) {
	return ((double) sqrt(((double) (((double) (re * re)) + ((double) (im * im))))));
}

↓

double code(double re, double im) {
	double VAR;
	if ((re <= -2.2018378030617435e+112)) {
		VAR = ((double) (-1.0 * re));
	} else {
		double VAR_1;
		if ((re <= 9.925805021843878e+51)) {
			VAR_1 = ((double) sqrt(((double) (((double) (re * re)) + ((double) (im * im))))));
		} else {
			VAR_1 = re;
		}
		VAR = VAR_1;
	}
	return VAR;
}

Error

Bits error versus re

Bits error versus im

Derivation

1. Split input into 3 regimes

2. if re < -2.2018378030617435e+112

   1. Initial program 54.1

      \[\sqrt{re \cdot re + im \cdot im}\]

   2. Taylor expanded around -inf 9.8

      \[\leadsto \color{blue}{-1 \cdot re}\]

   if -2.2018378030617435e+112 < re < 9.925805021843878e+51

   1. Initial program 21.1

      \[\sqrt{re \cdot re + im \cdot im}\]

   if 9.925805021843878e+51 < re

   1. Initial program 44.5

      \[\sqrt{re \cdot re + im \cdot im}\]

   2. Taylor expanded around inf 12.3

      \[\leadsto \color{blue}{re}\]
3. Recombined 3 regimes into one program.

4. Final simplification 17.6

   \[\leadsto \begin{array}{l} \mathbf{if}\;re \le -2.20183780306174354 \cdot 10^{112}:\\ \;\;\;\;-1 \cdot re\\ \mathbf{elif}\;re \le 9.92580502184387772 \cdot 10^{51}:\\ \;\;\;\;\sqrt{re \cdot re + im \cdot im}\\ \mathbf{else}:\\ \;\;\;\;re\\ \end{array}\]

Reproduce

herbie shell --seed 2020130 
(FPCore (re im)
  :name "math.abs on complex"
  :precision binary64
  (sqrt (+ (* re re) (* im im))))