math.square on complex, real part

Percentage Accurate: 94.2% → 97.1%

Time: 4.1s

Alternatives: 5

Speedup: 0.5×

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

Specification

Math

\[\begin{array}{l} \\ re \cdot re - im \cdot im \end{array} \]

FPCore

(FPCore re_sqr (re im) :precision binary64 (- (* re re) (* im im)))

C

double re_sqr(double re, double im) {
	return (re * re) - (im * im);
}

Fortran

real(8) function re_sqr(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    re_sqr = (re * re) - (im * im)
end function

Java

public static double re_sqr(double re, double im) {
	return (re * re) - (im * im);
}

Python

def re_sqr(re, im):
	return (re * re) - (im * im)

Julia

function re_sqr(re, im)
	return Float64(Float64(re * re) - Float64(im * im))
end

MATLAB

function tmp = re_sqr(re, im)
	tmp = (re * re) - (im * im);
end

Wolfram

re$95$sqr[re_, im_] := N[(N[(re * re), $MachinePrecision] - N[(im * im), $MachinePrecision]), $MachinePrecision]

Initial Program: 94.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ re \cdot re - im \cdot im \end{array} \]

FPCore

(FPCore re_sqr (re im) :precision binary64 (- (* re re) (* im im)))

C

double re_sqr(double re, double im) {
	return (re * re) - (im * im);
}

Fortran

real(8) function re_sqr(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    re_sqr = (re * re) - (im * im)
end function

Java

public static double re_sqr(double re, double im) {
	return (re * re) - (im * im);
}

Python

def re_sqr(re, im):
	return (re * re) - (im * im)

Julia

function re_sqr(re, im)
	return Float64(Float64(re * re) - Float64(im * im))
end

MATLAB

function tmp = re_sqr(re, im)
	tmp = (re * re) - (im * im);
end

Wolfram

re$95$sqr[re_, im_] := N[(N[(re * re), $MachinePrecision] - N[(im * im), $MachinePrecision]), $MachinePrecision]

Alternative 1: 97.1% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(re, re, im \cdot \left(-im\right)\right) \end{array} \]

FPCore

(FPCore re_sqr (re im) :precision binary64 (fma re re (* im (- im))))

C

double re_sqr(double re, double im) {
	return fma(re, re, (im * -im));
}

Julia

function re_sqr(re, im)
	return fma(re, re, Float64(im * Float64(-im)))
end

Wolfram

re$95$sqr[re_, im_] := N[(re * re + N[(im * (-im)), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 93.4%

   \[re \cdot re - im \cdot im \]
2. Step-by-step derivation

   1. sqr-neg 93.4%

      \[\leadsto re \cdot re - \color{blue}{\left(-im\right) \cdot \left(-im\right)} \]

   2. cancel-sign-sub 93.4%

      \[\leadsto \color{blue}{re \cdot re + im \cdot \left(-im\right)} \]

   3. fma-define 96.9%

      \[\leadsto \color{blue}{\mathsf{fma}\left(re, re, im \cdot \left(-im\right)\right)} \]

3. Simplified 96.9%

   \[\leadsto \color{blue}{\mathsf{fma}\left(re, re, im \cdot \left(-im\right)\right)} \]
4. Add Preprocessing
5. Add Preprocessing

Alternative 2: 74.7% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;im \cdot im \leq 5 \cdot 10^{-58} \lor \neg \left(im \cdot im \leq 2 \cdot 10^{+65}\right) \land im \cdot im \leq 2 \cdot 10^{+238}:\\ \;\;\;\;re \cdot re\\ \mathbf{else}:\\ \;\;\;\;im \cdot \left(-im\right)\\ \end{array} \end{array} \]

FPCore

(FPCore re_sqr (re im)
 :precision binary64
 (if (or (<= (* im im) 5e-58)
         (and (not (<= (* im im) 2e+65)) (<= (* im im) 2e+238)))
   (* re re)
   (* im (- im))))

C

double re_sqr(double re, double im) {
	double tmp;
	if (((im * im) <= 5e-58) || (!((im * im) <= 2e+65) && ((im * im) <= 2e+238))) {
		tmp = re * re;
	} else {
		tmp = im * -im;
	}
	return tmp;
}

Fortran

real(8) function re_sqr(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    real(8) :: tmp
    if (((im * im) <= 5d-58) .or. (.not. ((im * im) <= 2d+65)) .and. ((im * im) <= 2d+238)) then
        tmp = re * re
    else
        tmp = im * -im
    end if
    re_sqr = tmp
end function

Java

public static double re_sqr(double re, double im) {
	double tmp;
	if (((im * im) <= 5e-58) || (!((im * im) <= 2e+65) && ((im * im) <= 2e+238))) {
		tmp = re * re;
	} else {
		tmp = im * -im;
	}
	return tmp;
}

Python

def re_sqr(re, im):
	tmp = 0
	if ((im * im) <= 5e-58) or (not ((im * im) <= 2e+65) and ((im * im) <= 2e+238)):
		tmp = re * re
	else:
		tmp = im * -im
	return tmp

Julia

function re_sqr(re, im)
	tmp = 0.0
	if ((Float64(im * im) <= 5e-58) || (!(Float64(im * im) <= 2e+65) && (Float64(im * im) <= 2e+238)))
		tmp = Float64(re * re);
	else
		tmp = Float64(im * Float64(-im));
	end
	return tmp
end

MATLAB

function tmp_2 = re_sqr(re, im)
	tmp = 0.0;
	if (((im * im) <= 5e-58) || (~(((im * im) <= 2e+65)) && ((im * im) <= 2e+238)))
		tmp = re * re;
	else
		tmp = im * -im;
	end
	tmp_2 = tmp;
end

Wolfram

re$95$sqr[re_, im_] := If[Or[LessEqual[N[(im * im), $MachinePrecision], 5e-58], And[N[Not[LessEqual[N[(im * im), $MachinePrecision], 2e+65]], $MachinePrecision], LessEqual[N[(im * im), $MachinePrecision], 2e+238]]], N[(re * re), $MachinePrecision], N[(im * (-im)), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 im im) < 4.99999999999999977e-58 or 2e65 < (*.f64 im im) < 2.0000000000000001e238

   1. Initial program 100.0%

      \[re \cdot re - im \cdot im \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. difference-of-squares 100.0%

         \[\leadsto \color{blue}{\left(re + im\right) \cdot \left(re - im\right)} \]

      2. sub-neg 100.0%

         \[\leadsto \left(re + im\right) \cdot \color{blue}{\left(re + \left(-im\right)\right)} \]

      3. add-sqr-sqrt 45.8%

         \[\leadsto \left(re + im\right) \cdot \left(re + \color{blue}{\sqrt{-im} \cdot \sqrt{-im}}\right) \]

      4. sqrt-unprod 89.4%

         \[\leadsto \left(re + im\right) \cdot \left(re + \color{blue}{\sqrt{\left(-im\right) \cdot \left(-im\right)}}\right) \]

      5. sqr-neg 89.4%

         \[\leadsto \left(re + im\right) \cdot \left(re + \sqrt{\color{blue}{im \cdot im}}\right) \]

      6. sqrt-prod 43.5%

         \[\leadsto \left(re + im\right) \cdot \left(re + \color{blue}{\sqrt{im} \cdot \sqrt{im}}\right) \]

      7. add-sqr-sqrt 80.7%

         \[\leadsto \left(re + im\right) \cdot \left(re + \color{blue}{im}\right) \]

   4. Applied egg-rr 80.7%

      \[\leadsto \color{blue}{\left(re + im\right) \cdot \left(re + im\right)} \]

   5. Taylor expanded in re around inf 81.1%

      \[\leadsto \left(re + im\right) \cdot \color{blue}{re} \]

   6. Taylor expanded in re around inf 81.3%

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

   if 4.99999999999999977e-58 < (*.f64 im im) < 2e65 or 2.0000000000000001e238 < (*.f64 im im)

   1. Initial program 86.2%

      \[re \cdot re - im \cdot im \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0 83.4%

      \[\leadsto \color{blue}{-1 \cdot {im}^{2}} \]
   4. Step-by-step derivation

      1. neg-mul-1 83.4%

         \[\leadsto \color{blue}{-{im}^{2}} \]

   5. Simplified 83.4%

      \[\leadsto \color{blue}{-{im}^{2}} \]
   6. Step-by-step derivation

      1. unpow2 83.4%

         \[\leadsto -\color{blue}{im \cdot im} \]

      2. distribute-lft-neg-in 83.4%

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

   7. Applied egg-rr 83.4%

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

4. Final simplification 82.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;im \cdot im \leq 5 \cdot 10^{-58} \lor \neg \left(im \cdot im \leq 2 \cdot 10^{+65}\right) \land im \cdot im \leq 2 \cdot 10^{+238}:\\ \;\;\;\;re \cdot re\\ \mathbf{else}:\\ \;\;\;\;im \cdot \left(-im\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 97.0% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;im \cdot im \leq 4 \cdot 10^{+304}:\\ \;\;\;\;re \cdot re - im \cdot im\\ \mathbf{else}:\\ \;\;\;\;im \cdot \left(-im\right)\\ \end{array} \end{array} \]

FPCore

(FPCore re_sqr (re im)
 :precision binary64
 (if (<= (* im im) 4e+304) (- (* re re) (* im im)) (* im (- im))))

C

double re_sqr(double re, double im) {
	double tmp;
	if ((im * im) <= 4e+304) {
		tmp = (re * re) - (im * im);
	} else {
		tmp = im * -im;
	}
	return tmp;
}

Fortran

real(8) function re_sqr(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    real(8) :: tmp
    if ((im * im) <= 4d+304) then
        tmp = (re * re) - (im * im)
    else
        tmp = im * -im
    end if
    re_sqr = tmp
end function

Java

public static double re_sqr(double re, double im) {
	double tmp;
	if ((im * im) <= 4e+304) {
		tmp = (re * re) - (im * im);
	} else {
		tmp = im * -im;
	}
	return tmp;
}

Python

def re_sqr(re, im):
	tmp = 0
	if (im * im) <= 4e+304:
		tmp = (re * re) - (im * im)
	else:
		tmp = im * -im
	return tmp

Julia

function re_sqr(re, im)
	tmp = 0.0
	if (Float64(im * im) <= 4e+304)
		tmp = Float64(Float64(re * re) - Float64(im * im));
	else
		tmp = Float64(im * Float64(-im));
	end
	return tmp
end

MATLAB

function tmp_2 = re_sqr(re, im)
	tmp = 0.0;
	if ((im * im) <= 4e+304)
		tmp = (re * re) - (im * im);
	else
		tmp = im * -im;
	end
	tmp_2 = tmp;
end

Wolfram

re$95$sqr[re_, im_] := If[LessEqual[N[(im * im), $MachinePrecision], 4e+304], N[(N[(re * re), $MachinePrecision] - N[(im * im), $MachinePrecision]), $MachinePrecision], N[(im * (-im)), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 im im) < 3.9999999999999998e304

   1. Initial program 100.0%

      \[re \cdot re - im \cdot im \]
   2. Add Preprocessing

   if 3.9999999999999998e304 < (*.f64 im im)

   1. Initial program 76.4%

      \[re \cdot re - im \cdot im \]
   2. Add Preprocessing

   3. Taylor expanded in re around 0 88.9%

      \[\leadsto \color{blue}{-1 \cdot {im}^{2}} \]
   4. Step-by-step derivation

      1. neg-mul-1 88.9%

         \[\leadsto \color{blue}{-{im}^{2}} \]

   5. Simplified 88.9%

      \[\leadsto \color{blue}{-{im}^{2}} \]
   6. Step-by-step derivation

      1. unpow2 88.9%

         \[\leadsto -\color{blue}{im \cdot im} \]

      2. distribute-lft-neg-in 88.9%

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

   7. Applied egg-rr 88.9%

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

4. Final simplification 96.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;im \cdot im \leq 4 \cdot 10^{+304}:\\ \;\;\;\;re \cdot re - im \cdot im\\ \mathbf{else}:\\ \;\;\;\;im \cdot \left(-im\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 53.9% accurate, 2.3× speedup

Math

\[\begin{array}{l} \\ re \cdot re \end{array} \]

FPCore

(FPCore re_sqr (re im) :precision binary64 (* re re))

C

double re_sqr(double re, double im) {
	return re * re;
}

Fortran

real(8) function re_sqr(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    re_sqr = re * re
end function

Java

public static double re_sqr(double re, double im) {
	return re * re;
}

Python

def re_sqr(re, im):
	return re * re

Julia

function re_sqr(re, im)
	return Float64(re * re)
end

MATLAB

function tmp = re_sqr(re, im)
	tmp = re * re;
end

Wolfram

re$95$sqr[re_, im_] := N[(re * re), $MachinePrecision]

Derivation

1. Initial program 93.4%

   \[re \cdot re - im \cdot im \]
2. Add Preprocessing
3. Step-by-step derivation

   1. difference-of-squares 100.0%

      \[\leadsto \color{blue}{\left(re + im\right) \cdot \left(re - im\right)} \]

   2. sub-neg 100.0%

      \[\leadsto \left(re + im\right) \cdot \color{blue}{\left(re + \left(-im\right)\right)} \]

   3. add-sqr-sqrt 45.6%

      \[\leadsto \left(re + im\right) \cdot \left(re + \color{blue}{\sqrt{-im} \cdot \sqrt{-im}}\right) \]

   4. sqrt-unprod 71.0%

      \[\leadsto \left(re + im\right) \cdot \left(re + \color{blue}{\sqrt{\left(-im\right) \cdot \left(-im\right)}}\right) \]

   5. sqr-neg 71.0%

      \[\leadsto \left(re + im\right) \cdot \left(re + \sqrt{\color{blue}{im \cdot im}}\right) \]

   6. sqrt-prod 27.2%

      \[\leadsto \left(re + im\right) \cdot \left(re + \color{blue}{\sqrt{im} \cdot \sqrt{im}}\right) \]

   7. add-sqr-sqrt 49.7%

      \[\leadsto \left(re + im\right) \cdot \left(re + \color{blue}{im}\right) \]

4. Applied egg-rr 49.7%

   \[\leadsto \color{blue}{\left(re + im\right) \cdot \left(re + im\right)} \]

5. Taylor expanded in re around inf 54.2%

   \[\leadsto \left(re + im\right) \cdot \color{blue}{re} \]

6. Taylor expanded in re around inf 50.6%

   \[\leadsto \color{blue}{re} \cdot re \]
7. Add Preprocessing

Alternative 5: 10.8% accurate, 2.3× speedup

Math

\[\begin{array}{l} \\ im \cdot im \end{array} \]

FPCore

(FPCore re_sqr (re im) :precision binary64 (* im im))

C

double re_sqr(double re, double im) {
	return im * im;
}

Fortran

real(8) function re_sqr(re, im)
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    re_sqr = im * im
end function

Java

public static double re_sqr(double re, double im) {
	return im * im;
}

Python

def re_sqr(re, im):
	return im * im

Julia

function re_sqr(re, im)
	return Float64(im * im)
end

MATLAB

function tmp = re_sqr(re, im)
	tmp = im * im;
end

Wolfram

re$95$sqr[re_, im_] := N[(im * im), $MachinePrecision]

Derivation

1. Initial program 93.4%

   \[re \cdot re - im \cdot im \]
2. Add Preprocessing

3. Taylor expanded in re around 0 55.2%

   \[\leadsto \color{blue}{-1 \cdot {im}^{2}} \]
4. Step-by-step derivation

   1. neg-mul-1 55.2%

      \[\leadsto \color{blue}{-{im}^{2}} \]

5. Simplified 55.2%

   \[\leadsto \color{blue}{-{im}^{2}} \]
6. Step-by-step derivation

   1. add-sqr-sqrt 5.1%

      \[\leadsto \color{blue}{\sqrt{-{im}^{2}} \cdot \sqrt{-{im}^{2}}} \]

   2. sqrt-unprod 13.8%

      \[\leadsto \color{blue}{\sqrt{\left(-{im}^{2}\right) \cdot \left(-{im}^{2}\right)}} \]

   3. sqr-neg 13.8%

      \[\leadsto \sqrt{\color{blue}{{im}^{2} \cdot {im}^{2}}} \]

   4. sqrt-unprod 9.9%

      \[\leadsto \color{blue}{\sqrt{{im}^{2}} \cdot \sqrt{{im}^{2}}} \]

   5. add-sqr-sqrt 9.9%

      \[\leadsto \color{blue}{{im}^{2}} \]

   6. unpow2 9.9%

      \[\leadsto \color{blue}{im \cdot im} \]

7. Applied egg-rr 9.9%

   \[\leadsto \color{blue}{im \cdot im} \]
8. Add Preprocessing

Reproduce

herbie shell --seed 2024170 
(FPCore re_sqr (re im)
  :name "math.square on complex, real part"
  :precision binary64
  (- (* re re) (* im im)))