a parameter of renormalized beta distribution

Percentage Accurate: 99.8% → 99.8%

Time: 8.8s

Alternatives: 7

Speedup: 1.0×

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

Specification

\[\left(0 < m \land 0 < v\right) \land v < 0.25\]

Math

\[\begin{array}{l} \\ \left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right) \cdot m \end{array} \]

FPCore

(FPCore (m v) :precision binary64 (* (- (/ (* m (- 1.0 m)) v) 1.0) m))

C

double code(double m, double v) {
	return (((m * (1.0 - m)) / v) - 1.0) * m;
}

Fortran

real(8) function code(m, v)
    real(8), intent (in) :: m
    real(8), intent (in) :: v
    code = (((m * (1.0d0 - m)) / v) - 1.0d0) * m
end function

Java

public static double code(double m, double v) {
	return (((m * (1.0 - m)) / v) - 1.0) * m;
}

Python

def code(m, v):
	return (((m * (1.0 - m)) / v) - 1.0) * m

Julia

function code(m, v)
	return Float64(Float64(Float64(Float64(m * Float64(1.0 - m)) / v) - 1.0) * m)
end

MATLAB

function tmp = code(m, v)
	tmp = (((m * (1.0 - m)) / v) - 1.0) * m;
end

Wolfram

code[m_, v_] := N[(N[(N[(N[(m * N[(1.0 - m), $MachinePrecision]), $MachinePrecision] / v), $MachinePrecision] - 1.0), $MachinePrecision] * m), $MachinePrecision]

Initial Program: 99.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right) \cdot m \end{array} \]

FPCore

(FPCore (m v) :precision binary64 (* (- (/ (* m (- 1.0 m)) v) 1.0) m))

C

double code(double m, double v) {
	return (((m * (1.0 - m)) / v) - 1.0) * m;
}

Fortran

real(8) function code(m, v)
    real(8), intent (in) :: m
    real(8), intent (in) :: v
    code = (((m * (1.0d0 - m)) / v) - 1.0d0) * m
end function

Java

public static double code(double m, double v) {
	return (((m * (1.0 - m)) / v) - 1.0) * m;
}

Python

def code(m, v):
	return (((m * (1.0 - m)) / v) - 1.0) * m

Julia

function code(m, v)
	return Float64(Float64(Float64(Float64(m * Float64(1.0 - m)) / v) - 1.0) * m)
end

MATLAB

function tmp = code(m, v)
	tmp = (((m * (1.0 - m)) / v) - 1.0) * m;
end

Wolfram

code[m_, v_] := N[(N[(N[(N[(m * N[(1.0 - m), $MachinePrecision]), $MachinePrecision] / v), $MachinePrecision] - 1.0), $MachinePrecision] * m), $MachinePrecision]

Alternative 1: 99.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ m \cdot \left(\frac{m}{\frac{v}{1 - m}} + -1\right) \end{array} \]

FPCore

(FPCore (m v) :precision binary64 (* m (+ (/ m (/ v (- 1.0 m))) -1.0)))

C

double code(double m, double v) {
	return m * ((m / (v / (1.0 - m))) + -1.0);
}

Fortran

real(8) function code(m, v)
    real(8), intent (in) :: m
    real(8), intent (in) :: v
    code = m * ((m / (v / (1.0d0 - m))) + (-1.0d0))
end function

Java

public static double code(double m, double v) {
	return m * ((m / (v / (1.0 - m))) + -1.0);
}

Python

def code(m, v):
	return m * ((m / (v / (1.0 - m))) + -1.0)

Julia

function code(m, v)
	return Float64(m * Float64(Float64(m / Float64(v / Float64(1.0 - m))) + -1.0))
end

MATLAB

function tmp = code(m, v)
	tmp = m * ((m / (v / (1.0 - m))) + -1.0);
end

Wolfram

code[m_, v_] := N[(m * N[(N[(m / N[(v / N[(1.0 - m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.9%

   \[\left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right) \cdot m \]
2. Step-by-step derivation

   1. *-commutative 99.9%

      \[\leadsto \color{blue}{m \cdot \left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right)} \]

   2. sub-neg 99.9%

      \[\leadsto m \cdot \color{blue}{\left(\frac{m \cdot \left(1 - m\right)}{v} + \left(-1\right)\right)} \]

   3. associate-/l* 99.8%

      \[\leadsto m \cdot \left(\color{blue}{m \cdot \frac{1 - m}{v}} + \left(-1\right)\right) \]

   4. metadata-eval 99.8%

      \[\leadsto m \cdot \left(m \cdot \frac{1 - m}{v} + \color{blue}{-1}\right) \]

3. Simplified 99.8%

   \[\leadsto \color{blue}{m \cdot \left(m \cdot \frac{1 - m}{v} + -1\right)} \]
4. Add Preprocessing
5. Step-by-step derivation

   1. clear-num 99.8%

      \[\leadsto m \cdot \left(m \cdot \color{blue}{\frac{1}{\frac{v}{1 - m}}} + -1\right) \]

   2. un-div-inv 99.9%

      \[\leadsto m \cdot \left(\color{blue}{\frac{m}{\frac{v}{1 - m}}} + -1\right) \]

6. Applied egg-rr 99.9%

   \[\leadsto m \cdot \left(\color{blue}{\frac{m}{\frac{v}{1 - m}}} + -1\right) \]

7. Final simplification 99.9%

   \[\leadsto m \cdot \left(\frac{m}{\frac{v}{1 - m}} + -1\right) \]
8. Add Preprocessing

Alternative 2: 99.7% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;m \leq 1.85 \cdot 10^{-17}:\\ \;\;\;\;m \cdot \left(-1 + \frac{m}{v}\right)\\ \mathbf{else}:\\ \;\;\;\;m \cdot \left(\left(1 - m\right) \cdot \frac{m}{v}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (m v)
 :precision binary64
 (if (<= m 1.85e-17) (* m (+ -1.0 (/ m v))) (* m (* (- 1.0 m) (/ m v)))))

C

double code(double m, double v) {
	double tmp;
	if (m <= 1.85e-17) {
		tmp = m * (-1.0 + (m / v));
	} else {
		tmp = m * ((1.0 - m) * (m / v));
	}
	return tmp;
}

Fortran

real(8) function code(m, v)
    real(8), intent (in) :: m
    real(8), intent (in) :: v
    real(8) :: tmp
    if (m <= 1.85d-17) then
        tmp = m * ((-1.0d0) + (m / v))
    else
        tmp = m * ((1.0d0 - m) * (m / v))
    end if
    code = tmp
end function

Java

public static double code(double m, double v) {
	double tmp;
	if (m <= 1.85e-17) {
		tmp = m * (-1.0 + (m / v));
	} else {
		tmp = m * ((1.0 - m) * (m / v));
	}
	return tmp;
}

Python

def code(m, v):
	tmp = 0
	if m <= 1.85e-17:
		tmp = m * (-1.0 + (m / v))
	else:
		tmp = m * ((1.0 - m) * (m / v))
	return tmp

Julia

function code(m, v)
	tmp = 0.0
	if (m <= 1.85e-17)
		tmp = Float64(m * Float64(-1.0 + Float64(m / v)));
	else
		tmp = Float64(m * Float64(Float64(1.0 - m) * Float64(m / v)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(m, v)
	tmp = 0.0;
	if (m <= 1.85e-17)
		tmp = m * (-1.0 + (m / v));
	else
		tmp = m * ((1.0 - m) * (m / v));
	end
	tmp_2 = tmp;
end

Wolfram

code[m_, v_] := If[LessEqual[m, 1.85e-17], N[(m * N[(-1.0 + N[(m / v), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(m * N[(N[(1.0 - m), $MachinePrecision] * N[(m / v), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if m < 1.8499999999999999e-17

   1. Initial program 99.8%

      \[\left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right) \cdot m \]
   2. Add Preprocessing

   3. Taylor expanded in m around 0 99.8%

      \[\leadsto \left(\frac{\color{blue}{m}}{v} - 1\right) \cdot m \]

   if 1.8499999999999999e-17 < m

   1. Initial program 99.9%

      \[\left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right) \cdot m \]
   2. Step-by-step derivation

      1. *-commutative 99.9%

         \[\leadsto \color{blue}{m \cdot \left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right)} \]

      2. sub-neg 99.9%

         \[\leadsto m \cdot \color{blue}{\left(\frac{m \cdot \left(1 - m\right)}{v} + \left(-1\right)\right)} \]

      3. associate-/l* 99.9%

         \[\leadsto m \cdot \left(\color{blue}{m \cdot \frac{1 - m}{v}} + \left(-1\right)\right) \]

      4. metadata-eval 99.9%

         \[\leadsto m \cdot \left(m \cdot \frac{1 - m}{v} + \color{blue}{-1}\right) \]

   3. Simplified 99.9%

      \[\leadsto \color{blue}{m \cdot \left(m \cdot \frac{1 - m}{v} + -1\right)} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. clear-num 99.9%

         \[\leadsto m \cdot \left(m \cdot \color{blue}{\frac{1}{\frac{v}{1 - m}}} + -1\right) \]

      2. un-div-inv 99.9%

         \[\leadsto m \cdot \left(\color{blue}{\frac{m}{\frac{v}{1 - m}}} + -1\right) \]

   6. Applied egg-rr 99.9%

      \[\leadsto m \cdot \left(\color{blue}{\frac{m}{\frac{v}{1 - m}}} + -1\right) \]

   7. Taylor expanded in v around 0 99.9%

      \[\leadsto m \cdot \color{blue}{\frac{m \cdot \left(1 - m\right)}{v}} \]
   8. Step-by-step derivation

      1. associate-*l/ 99.9%

         \[\leadsto m \cdot \color{blue}{\left(\frac{m}{v} \cdot \left(1 - m\right)\right)} \]

   9. Simplified 99.9%

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

4. Final simplification 99.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;m \leq 1.85 \cdot 10^{-17}:\\ \;\;\;\;m \cdot \left(-1 + \frac{m}{v}\right)\\ \mathbf{else}:\\ \;\;\;\;m \cdot \left(\left(1 - m\right) \cdot \frac{m}{v}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 51.0% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;m \leq 1:\\ \;\;\;\;m \cdot \left(-1 + \frac{m}{v}\right)\\ \mathbf{else}:\\ \;\;\;\;-m\\ \end{array} \end{array} \]

FPCore

(FPCore (m v) :precision binary64 (if (<= m 1.0) (* m (+ -1.0 (/ m v))) (- m)))

C

double code(double m, double v) {
	double tmp;
	if (m <= 1.0) {
		tmp = m * (-1.0 + (m / v));
	} else {
		tmp = -m;
	}
	return tmp;
}

Fortran

real(8) function code(m, v)
    real(8), intent (in) :: m
    real(8), intent (in) :: v
    real(8) :: tmp
    if (m <= 1.0d0) then
        tmp = m * ((-1.0d0) + (m / v))
    else
        tmp = -m
    end if
    code = tmp
end function

Java

public static double code(double m, double v) {
	double tmp;
	if (m <= 1.0) {
		tmp = m * (-1.0 + (m / v));
	} else {
		tmp = -m;
	}
	return tmp;
}

Python

def code(m, v):
	tmp = 0
	if m <= 1.0:
		tmp = m * (-1.0 + (m / v))
	else:
		tmp = -m
	return tmp

Julia

function code(m, v)
	tmp = 0.0
	if (m <= 1.0)
		tmp = Float64(m * Float64(-1.0 + Float64(m / v)));
	else
		tmp = Float64(-m);
	end
	return tmp
end

MATLAB

function tmp_2 = code(m, v)
	tmp = 0.0;
	if (m <= 1.0)
		tmp = m * (-1.0 + (m / v));
	else
		tmp = -m;
	end
	tmp_2 = tmp;
end

Wolfram

code[m_, v_] := If[LessEqual[m, 1.0], N[(m * N[(-1.0 + N[(m / v), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], (-m)]

Derivation

1. Split input into 2 regimes

2. if m < 1

   1. Initial program 99.8%

      \[\left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right) \cdot m \]
   2. Add Preprocessing

   3. Taylor expanded in m around 0 97.3%

      \[\leadsto \left(\frac{\color{blue}{m}}{v} - 1\right) \cdot m \]

   if 1 < m

   1. Initial program 99.9%

      \[\left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right) \cdot m \]
   2. Step-by-step derivation

      1. *-commutative 99.9%

         \[\leadsto \color{blue}{m \cdot \left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right)} \]

      2. sub-neg 99.9%

         \[\leadsto m \cdot \color{blue}{\left(\frac{m \cdot \left(1 - m\right)}{v} + \left(-1\right)\right)} \]

      3. associate-/l* 99.9%

         \[\leadsto m \cdot \left(\color{blue}{m \cdot \frac{1 - m}{v}} + \left(-1\right)\right) \]

      4. metadata-eval 99.9%

         \[\leadsto m \cdot \left(m \cdot \frac{1 - m}{v} + \color{blue}{-1}\right) \]

   3. Simplified 99.9%

      \[\leadsto \color{blue}{m \cdot \left(m \cdot \frac{1 - m}{v} + -1\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in m around 0 5.5%

      \[\leadsto \color{blue}{-1 \cdot m} \]
   6. Step-by-step derivation

      1. neg-mul-1 5.5%

         \[\leadsto \color{blue}{-m} \]

   7. Simplified 5.5%

      \[\leadsto \color{blue}{-m} \]
3. Recombined 2 regimes into one program.

4. Final simplification 50.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;m \leq 1:\\ \;\;\;\;m \cdot \left(-1 + \frac{m}{v}\right)\\ \mathbf{else}:\\ \;\;\;\;-m\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 99.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ m \cdot \left(-1 + m \cdot \frac{1 - m}{v}\right) \end{array} \]

FPCore

(FPCore (m v) :precision binary64 (* m (+ -1.0 (* m (/ (- 1.0 m) v)))))

C

double code(double m, double v) {
	return m * (-1.0 + (m * ((1.0 - m) / v)));
}

Fortran

real(8) function code(m, v)
    real(8), intent (in) :: m
    real(8), intent (in) :: v
    code = m * ((-1.0d0) + (m * ((1.0d0 - m) / v)))
end function

Java

public static double code(double m, double v) {
	return m * (-1.0 + (m * ((1.0 - m) / v)));
}

Python

def code(m, v):
	return m * (-1.0 + (m * ((1.0 - m) / v)))

Julia

function code(m, v)
	return Float64(m * Float64(-1.0 + Float64(m * Float64(Float64(1.0 - m) / v))))
end

MATLAB

function tmp = code(m, v)
	tmp = m * (-1.0 + (m * ((1.0 - m) / v)));
end

Wolfram

code[m_, v_] := N[(m * N[(-1.0 + N[(m * N[(N[(1.0 - m), $MachinePrecision] / v), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.9%

   \[\left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right) \cdot m \]
2. Step-by-step derivation

   1. *-commutative 99.9%

      \[\leadsto \color{blue}{m \cdot \left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right)} \]

   2. sub-neg 99.9%

      \[\leadsto m \cdot \color{blue}{\left(\frac{m \cdot \left(1 - m\right)}{v} + \left(-1\right)\right)} \]

   3. associate-/l* 99.8%

      \[\leadsto m \cdot \left(\color{blue}{m \cdot \frac{1 - m}{v}} + \left(-1\right)\right) \]

   4. metadata-eval 99.8%

      \[\leadsto m \cdot \left(m \cdot \frac{1 - m}{v} + \color{blue}{-1}\right) \]

3. Simplified 99.8%

   \[\leadsto \color{blue}{m \cdot \left(m \cdot \frac{1 - m}{v} + -1\right)} \]
4. Add Preprocessing

5. Final simplification 99.8%

   \[\leadsto m \cdot \left(-1 + m \cdot \frac{1 - m}{v}\right) \]
6. Add Preprocessing

Alternative 5: 36.3% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;v \leq 3.7 \cdot 10^{-206}:\\ \;\;\;\;m \cdot \frac{m}{v}\\ \mathbf{else}:\\ \;\;\;\;-m\\ \end{array} \end{array} \]

FPCore

(FPCore (m v) :precision binary64 (if (<= v 3.7e-206) (* m (/ m v)) (- m)))

C

double code(double m, double v) {
	double tmp;
	if (v <= 3.7e-206) {
		tmp = m * (m / v);
	} else {
		tmp = -m;
	}
	return tmp;
}

Fortran

real(8) function code(m, v)
    real(8), intent (in) :: m
    real(8), intent (in) :: v
    real(8) :: tmp
    if (v <= 3.7d-206) then
        tmp = m * (m / v)
    else
        tmp = -m
    end if
    code = tmp
end function

Java

public static double code(double m, double v) {
	double tmp;
	if (v <= 3.7e-206) {
		tmp = m * (m / v);
	} else {
		tmp = -m;
	}
	return tmp;
}

Python

def code(m, v):
	tmp = 0
	if v <= 3.7e-206:
		tmp = m * (m / v)
	else:
		tmp = -m
	return tmp

Julia

function code(m, v)
	tmp = 0.0
	if (v <= 3.7e-206)
		tmp = Float64(m * Float64(m / v));
	else
		tmp = Float64(-m);
	end
	return tmp
end

MATLAB

function tmp_2 = code(m, v)
	tmp = 0.0;
	if (v <= 3.7e-206)
		tmp = m * (m / v);
	else
		tmp = -m;
	end
	tmp_2 = tmp;
end

Wolfram

code[m_, v_] := If[LessEqual[v, 3.7e-206], N[(m * N[(m / v), $MachinePrecision]), $MachinePrecision], (-m)]

Derivation

1. Split input into 2 regimes

2. if v < 3.69999999999999998e-206

   1. Initial program 99.8%

      \[\left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right) \cdot m \]
   2. Step-by-step derivation

      1. *-commutative 99.8%

         \[\leadsto \color{blue}{m \cdot \left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right)} \]

      2. associate-/l* 99.6%

         \[\leadsto m \cdot \left(\color{blue}{m \cdot \frac{1 - m}{v}} - 1\right) \]

      3. fma-neg 99.6%

         \[\leadsto m \cdot \color{blue}{\mathsf{fma}\left(m, \frac{1 - m}{v}, -1\right)} \]

      4. metadata-eval 99.6%

         \[\leadsto m \cdot \mathsf{fma}\left(m, \frac{1 - m}{v}, \color{blue}{-1}\right) \]

   3. Simplified 99.6%

      \[\leadsto \color{blue}{m \cdot \mathsf{fma}\left(m, \frac{1 - m}{v}, -1\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in m around 0 48.6%

      \[\leadsto m \cdot \mathsf{fma}\left(m, \color{blue}{\frac{1}{v}}, -1\right) \]

   6. Taylor expanded in m around inf 43.5%

      \[\leadsto m \cdot \color{blue}{\frac{m}{v}} \]

   if 3.69999999999999998e-206 < v

   1. Initial program 99.9%

      \[\left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right) \cdot m \]
   2. Step-by-step derivation

      1. *-commutative 99.9%

         \[\leadsto \color{blue}{m \cdot \left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right)} \]

      2. sub-neg 99.9%

         \[\leadsto m \cdot \color{blue}{\left(\frac{m \cdot \left(1 - m\right)}{v} + \left(-1\right)\right)} \]

      3. associate-/l* 99.9%

         \[\leadsto m \cdot \left(\color{blue}{m \cdot \frac{1 - m}{v}} + \left(-1\right)\right) \]

      4. metadata-eval 99.9%

         \[\leadsto m \cdot \left(m \cdot \frac{1 - m}{v} + \color{blue}{-1}\right) \]

   3. Simplified 99.9%

      \[\leadsto \color{blue}{m \cdot \left(m \cdot \frac{1 - m}{v} + -1\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in m around 0 37.2%

      \[\leadsto \color{blue}{-1 \cdot m} \]
   6. Step-by-step derivation

      1. neg-mul-1 37.2%

         \[\leadsto \color{blue}{-m} \]

   7. Simplified 37.2%

      \[\leadsto \color{blue}{-m} \]
3. Recombined 2 regimes into one program.

4. Final simplification 39.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;v \leq 3.7 \cdot 10^{-206}:\\ \;\;\;\;m \cdot \frac{m}{v}\\ \mathbf{else}:\\ \;\;\;\;-m\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 36.4% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;v \leq 5.4 \cdot 10^{-206}:\\ \;\;\;\;\frac{m}{\frac{v}{m}}\\ \mathbf{else}:\\ \;\;\;\;-m\\ \end{array} \end{array} \]

FPCore

(FPCore (m v) :precision binary64 (if (<= v 5.4e-206) (/ m (/ v m)) (- m)))

C

double code(double m, double v) {
	double tmp;
	if (v <= 5.4e-206) {
		tmp = m / (v / m);
	} else {
		tmp = -m;
	}
	return tmp;
}

Fortran

real(8) function code(m, v)
    real(8), intent (in) :: m
    real(8), intent (in) :: v
    real(8) :: tmp
    if (v <= 5.4d-206) then
        tmp = m / (v / m)
    else
        tmp = -m
    end if
    code = tmp
end function

Java

public static double code(double m, double v) {
	double tmp;
	if (v <= 5.4e-206) {
		tmp = m / (v / m);
	} else {
		tmp = -m;
	}
	return tmp;
}

Python

def code(m, v):
	tmp = 0
	if v <= 5.4e-206:
		tmp = m / (v / m)
	else:
		tmp = -m
	return tmp

Julia

function code(m, v)
	tmp = 0.0
	if (v <= 5.4e-206)
		tmp = Float64(m / Float64(v / m));
	else
		tmp = Float64(-m);
	end
	return tmp
end

MATLAB

function tmp_2 = code(m, v)
	tmp = 0.0;
	if (v <= 5.4e-206)
		tmp = m / (v / m);
	else
		tmp = -m;
	end
	tmp_2 = tmp;
end

Wolfram

code[m_, v_] := If[LessEqual[v, 5.4e-206], N[(m / N[(v / m), $MachinePrecision]), $MachinePrecision], (-m)]

Derivation

1. Split input into 2 regimes

2. if v < 5.4000000000000002e-206

   1. Initial program 99.8%

      \[\left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right) \cdot m \]
   2. Step-by-step derivation

      1. *-commutative 99.8%

         \[\leadsto \color{blue}{m \cdot \left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right)} \]

      2. associate-/l* 99.6%

         \[\leadsto m \cdot \left(\color{blue}{m \cdot \frac{1 - m}{v}} - 1\right) \]

      3. fma-neg 99.6%

         \[\leadsto m \cdot \color{blue}{\mathsf{fma}\left(m, \frac{1 - m}{v}, -1\right)} \]

      4. metadata-eval 99.6%

         \[\leadsto m \cdot \mathsf{fma}\left(m, \frac{1 - m}{v}, \color{blue}{-1}\right) \]

   3. Simplified 99.6%

      \[\leadsto \color{blue}{m \cdot \mathsf{fma}\left(m, \frac{1 - m}{v}, -1\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in m around 0 48.6%

      \[\leadsto m \cdot \mathsf{fma}\left(m, \color{blue}{\frac{1}{v}}, -1\right) \]

   6. Taylor expanded in m around inf 43.5%

      \[\leadsto m \cdot \color{blue}{\frac{m}{v}} \]
   7. Step-by-step derivation

      1. clear-num 43.4%

         \[\leadsto m \cdot \color{blue}{\frac{1}{\frac{v}{m}}} \]

      2. div-inv 43.6%

         \[\leadsto \color{blue}{\frac{m}{\frac{v}{m}}} \]

   8. Applied egg-rr 43.6%

      \[\leadsto \color{blue}{\frac{m}{\frac{v}{m}}} \]

   if 5.4000000000000002e-206 < v

   1. Initial program 99.9%

      \[\left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right) \cdot m \]
   2. Step-by-step derivation

      1. *-commutative 99.9%

         \[\leadsto \color{blue}{m \cdot \left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right)} \]

      2. sub-neg 99.9%

         \[\leadsto m \cdot \color{blue}{\left(\frac{m \cdot \left(1 - m\right)}{v} + \left(-1\right)\right)} \]

      3. associate-/l* 99.9%

         \[\leadsto m \cdot \left(\color{blue}{m \cdot \frac{1 - m}{v}} + \left(-1\right)\right) \]

      4. metadata-eval 99.9%

         \[\leadsto m \cdot \left(m \cdot \frac{1 - m}{v} + \color{blue}{-1}\right) \]

   3. Simplified 99.9%

      \[\leadsto \color{blue}{m \cdot \left(m \cdot \frac{1 - m}{v} + -1\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in m around 0 37.2%

      \[\leadsto \color{blue}{-1 \cdot m} \]
   6. Step-by-step derivation

      1. neg-mul-1 37.2%

         \[\leadsto \color{blue}{-m} \]

   7. Simplified 37.2%

      \[\leadsto \color{blue}{-m} \]
3. Recombined 2 regimes into one program.

4. Final simplification 39.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;v \leq 5.4 \cdot 10^{-206}:\\ \;\;\;\;\frac{m}{\frac{v}{m}}\\ \mathbf{else}:\\ \;\;\;\;-m\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 27.5% accurate, 5.5× speedup

Math

\[\begin{array}{l} \\ -m \end{array} \]

FPCore

(FPCore (m v) :precision binary64 (- m))

C

double code(double m, double v) {
	return -m;
}

Fortran

real(8) function code(m, v)
    real(8), intent (in) :: m
    real(8), intent (in) :: v
    code = -m
end function

Java

public static double code(double m, double v) {
	return -m;
}

Python

def code(m, v):
	return -m

Julia

function code(m, v)
	return Float64(-m)
end

MATLAB

function tmp = code(m, v)
	tmp = -m;
end

Wolfram

code[m_, v_] := (-m)

Derivation

1. Initial program 99.9%

   \[\left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right) \cdot m \]
2. Step-by-step derivation

   1. *-commutative 99.9%

      \[\leadsto \color{blue}{m \cdot \left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right)} \]

   2. sub-neg 99.9%

      \[\leadsto m \cdot \color{blue}{\left(\frac{m \cdot \left(1 - m\right)}{v} + \left(-1\right)\right)} \]

   3. associate-/l* 99.8%

      \[\leadsto m \cdot \left(\color{blue}{m \cdot \frac{1 - m}{v}} + \left(-1\right)\right) \]

   4. metadata-eval 99.8%

      \[\leadsto m \cdot \left(m \cdot \frac{1 - m}{v} + \color{blue}{-1}\right) \]

3. Simplified 99.8%

   \[\leadsto \color{blue}{m \cdot \left(m \cdot \frac{1 - m}{v} + -1\right)} \]
4. Add Preprocessing

5. Taylor expanded in m around 0 26.7%

   \[\leadsto \color{blue}{-1 \cdot m} \]
6. Step-by-step derivation

   1. neg-mul-1 26.7%

      \[\leadsto \color{blue}{-m} \]

7. Simplified 26.7%

   \[\leadsto \color{blue}{-m} \]

8. Final simplification 26.7%

   \[\leadsto -m \]
9. Add Preprocessing

Reproduce

herbie shell --seed 2024055 
(FPCore (m v)
  :name "a parameter of renormalized beta distribution"
  :precision binary64
  :pre (and (and (< 0.0 m) (< 0.0 v)) (< v 0.25))
  (* (- (/ (* m (- 1.0 m)) v) 1.0) m))