math.abs on complex

Average Error: 31.2 → 18.2

Time: 949.0ms

Precision: 64

Math

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

↓

\[\begin{array}{l} \mathbf{if}\;re \le -1.16384431417639817 \cdot 10^{45}:\\ \;\;\;\;-1 \cdot re\\ \mathbf{elif}\;re \le 2.5593034083677195 \cdot 10^{66}:\\ \;\;\;\;\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 <= -1.1638443141763982e+45)) {
		VAR = ((double) (-1.0 * re));
	} else {
		double VAR_1;
		if ((re <= 2.5593034083677195e+66)) {
			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 < -1.1638443141763982e+45

   1. Initial program 43.8

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

   2. Taylor expanded around -inf 13.3

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

   if -1.1638443141763982e+45 < re < 2.5593034083677195e+66

   1. Initial program 21.6

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

   if 2.5593034083677195e+66 < re

   1. Initial program 47.1

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

   2. Taylor expanded around inf 12.7

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

4. Final simplification 18.2

   \[\leadsto \begin{array}{l} \mathbf{if}\;re \le -1.16384431417639817 \cdot 10^{45}:\\ \;\;\;\;-1 \cdot re\\ \mathbf{elif}\;re \le 2.5593034083677195 \cdot 10^{66}:\\ \;\;\;\;\sqrt{re \cdot re + im \cdot im}\\ \mathbf{else}:\\ \;\;\;\;re\\ \end{array}\]

Reproduce

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