math.abs on complex (squared)

Average Accuracy: 100.0% → 100.0%

Time: 798.0ms

Precision: binary64

Cost: 448

Math

\[re \cdot re + im \cdot im \]

↓

\[re \cdot re + im \cdot im \]

FPCore

(FPCore modulus_sqr (re im) :precision binary64 (+ (* re re) (* im im)))

↓

(FPCore modulus_sqr (re im) :precision binary64 (+ (* re re) (* im im)))

C

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

↓

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

Fortran

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

↓

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

Java

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

↓

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

Python

def modulus_sqr(re, im):
	return (re * re) + (im * im)

↓

def modulus_sqr(re, im):
	return (re * re) + (im * im)

Julia

function modulus_sqr(re, im)
	return Float64(Float64(re * re) + Float64(im * im))
end

↓

function modulus_sqr(re, im)
	return Float64(Float64(re * re) + Float64(im * im))
end

MATLAB

function tmp = modulus_sqr(re, im)
	tmp = (re * re) + (im * im);
end

↓

function tmp = modulus_sqr(re, im)
	tmp = (re * re) + (im * im);
end

Wolfram

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

↓

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

Derivation

1. Initial program 100.0%

   \[re \cdot re + im \cdot im \]

2. Final simplification 100.0%

   \[\leadsto re \cdot re + im \cdot im \]

Reproduce

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