Rust f32::atanh

Percentage Accurate: 99.8% → 99.8%
Time: 2.7s
Alternatives: 6
Speedup: 1.0×

Specification

?
\[\begin{array}{l} \\ 0.5 \cdot \mathsf{log1p}\left(\frac{2 \cdot x}{1 - x}\right) \end{array} \]
(FPCore (x) :precision binary32 (* 0.5 (log1p (/ (* 2.0 x) (- 1.0 x)))))
float code(float x) {
	return 0.5f * log1pf(((2.0f * x) / (1.0f - x)));
}
function code(x)
	return Float32(Float32(0.5) * log1p(Float32(Float32(Float32(2.0) * x) / Float32(Float32(1.0) - x))))
end
\begin{array}{l}

\\
0.5 \cdot \mathsf{log1p}\left(\frac{2 \cdot x}{1 - x}\right)
\end{array}

Local Percentage Accuracy vs ?

The average percentage accuracy by input value. Horizontal axis shows value of an input variable; the variable is choosen in the title. Vertical axis is accuracy; higher is better. Red represent the original program, while blue represents Herbie's suggestion. These can be toggled with buttons below the plot. The line is an average while dots represent individual samples.

Accuracy vs Speed?

Herbie found 6 alternatives:

AlternativeAccuracySpeedup
The accuracy (vertical axis) and speed (horizontal axis) of each alternatives. Up and to the right is better. The red square shows the initial program, and each blue circle shows an alternative.The line shows the best available speed-accuracy tradeoffs.

Initial Program: 99.8% accurate, 1.0× speedup?

\[\begin{array}{l} \\ 0.5 \cdot \mathsf{log1p}\left(\frac{2 \cdot x}{1 - x}\right) \end{array} \]
(FPCore (x) :precision binary32 (* 0.5 (log1p (/ (* 2.0 x) (- 1.0 x)))))
float code(float x) {
	return 0.5f * log1pf(((2.0f * x) / (1.0f - x)));
}
function code(x)
	return Float32(Float32(0.5) * log1p(Float32(Float32(Float32(2.0) * x) / Float32(Float32(1.0) - x))))
end
\begin{array}{l}

\\
0.5 \cdot \mathsf{log1p}\left(\frac{2 \cdot x}{1 - x}\right)
\end{array}

Alternative 1: 99.8% accurate, 1.0× speedup?

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ x\_s \cdot \left(0.5 \cdot \mathsf{log1p}\left(\frac{x\_m + x\_m}{1 - x\_m}\right)\right) \end{array} \]
x\_m = (fabs.f32 x)
x\_s = (copysign.f32 #s(literal 1 binary32) x)
(FPCore (x_s x_m)
 :precision binary32
 (* x_s (* 0.5 (log1p (/ (+ x_m x_m) (- 1.0 x_m))))))
x\_m = fabs(x);
x\_s = copysign(1.0, x);
float code(float x_s, float x_m) {
	return x_s * (0.5f * log1pf(((x_m + x_m) / (1.0f - x_m))));
}
x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m)
	return Float32(x_s * Float32(Float32(0.5) * log1p(Float32(Float32(x_m + x_m) / Float32(Float32(1.0) - x_m)))))
end
\begin{array}{l}
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)

\\
x\_s \cdot \left(0.5 \cdot \mathsf{log1p}\left(\frac{x\_m + x\_m}{1 - x\_m}\right)\right)
\end{array}
Derivation
  1. Initial program 99.8%

    \[0.5 \cdot \mathsf{log1p}\left(\frac{2 \cdot x}{1 - x}\right) \]
  2. Applied rewrites99.8%

    \[\leadsto 0.5 \cdot \color{blue}{\mathsf{log1p}\left(\frac{x + x}{1 - x}\right)} \]
  3. Add Preprocessing

Alternative 2: 99.1% accurate, 1.2× speedup?

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ x\_s \cdot \mathsf{fma}\left(\mathsf{fma}\left(x\_m \cdot 0.2, x\_m, 0.3333333333333333\right), \left(x\_m \cdot x\_m\right) \cdot x\_m, x\_m\right) \end{array} \]
x\_m = (fabs.f32 x)
x\_s = (copysign.f32 #s(literal 1 binary32) x)
(FPCore (x_s x_m)
 :precision binary32
 (*
  x_s
  (fma (fma (* x_m 0.2) x_m 0.3333333333333333) (* (* x_m x_m) x_m) x_m)))
x\_m = fabs(x);
x\_s = copysign(1.0, x);
float code(float x_s, float x_m) {
	return x_s * fmaf(fmaf((x_m * 0.2f), x_m, 0.3333333333333333f), ((x_m * x_m) * x_m), x_m);
}
x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m)
	return Float32(x_s * fma(fma(Float32(x_m * Float32(0.2)), x_m, Float32(0.3333333333333333)), Float32(Float32(x_m * x_m) * x_m), x_m))
end
\begin{array}{l}
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)

\\
x\_s \cdot \mathsf{fma}\left(\mathsf{fma}\left(x\_m \cdot 0.2, x\_m, 0.3333333333333333\right), \left(x\_m \cdot x\_m\right) \cdot x\_m, x\_m\right)
\end{array}
Derivation
  1. Initial program 99.8%

    \[0.5 \cdot \mathsf{log1p}\left(\frac{2 \cdot x}{1 - x}\right) \]
  2. Applied rewrites99.8%

    \[\leadsto 0.5 \cdot \color{blue}{\mathsf{log1p}\left(\frac{x + x}{1 - x}\right)} \]
  3. Taylor expanded in x around 0

    \[\leadsto \color{blue}{x \cdot \left(1 + {x}^{2} \cdot \left(\frac{1}{3} + \frac{1}{5} \cdot {x}^{2}\right)\right)} \]
  4. Applied rewrites99.1%

    \[\leadsto \color{blue}{x \cdot \left(1 + {x}^{2} \cdot \left(0.3333333333333333 + 0.2 \cdot {x}^{2}\right)\right)} \]
  5. Applied rewrites99.1%

    \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(x \cdot 0.2, x, 0.3333333333333333\right), \color{blue}{\left(x \cdot x\right) \cdot x}, x\right) \]
  6. Add Preprocessing

Alternative 3: 99.1% accurate, 1.2× speedup?

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ x\_s \cdot \left(\mathsf{fma}\left(\mathsf{fma}\left(x\_m \cdot 0.2, x\_m, 0.3333333333333333\right), x\_m \cdot x\_m, 1\right) \cdot x\_m\right) \end{array} \]
x\_m = (fabs.f32 x)
x\_s = (copysign.f32 #s(literal 1 binary32) x)
(FPCore (x_s x_m)
 :precision binary32
 (*
  x_s
  (* (fma (fma (* x_m 0.2) x_m 0.3333333333333333) (* x_m x_m) 1.0) x_m)))
x\_m = fabs(x);
x\_s = copysign(1.0, x);
float code(float x_s, float x_m) {
	return x_s * (fmaf(fmaf((x_m * 0.2f), x_m, 0.3333333333333333f), (x_m * x_m), 1.0f) * x_m);
}
x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m)
	return Float32(x_s * Float32(fma(fma(Float32(x_m * Float32(0.2)), x_m, Float32(0.3333333333333333)), Float32(x_m * x_m), Float32(1.0)) * x_m))
end
\begin{array}{l}
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)

\\
x\_s \cdot \left(\mathsf{fma}\left(\mathsf{fma}\left(x\_m \cdot 0.2, x\_m, 0.3333333333333333\right), x\_m \cdot x\_m, 1\right) \cdot x\_m\right)
\end{array}
Derivation
  1. Initial program 99.8%

    \[0.5 \cdot \mathsf{log1p}\left(\frac{2 \cdot x}{1 - x}\right) \]
  2. Applied rewrites99.8%

    \[\leadsto 0.5 \cdot \color{blue}{\mathsf{log1p}\left(\frac{x + x}{1 - x}\right)} \]
  3. Taylor expanded in x around 0

    \[\leadsto \color{blue}{x \cdot \left(1 + {x}^{2} \cdot \left(\frac{1}{3} + \frac{1}{5} \cdot {x}^{2}\right)\right)} \]
  4. Applied rewrites99.1%

    \[\leadsto \color{blue}{x \cdot \left(1 + {x}^{2} \cdot \left(0.3333333333333333 + 0.2 \cdot {x}^{2}\right)\right)} \]
  5. Applied rewrites99.1%

    \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(x \cdot 0.2, x, 0.3333333333333333\right), x \cdot x, 1\right) \cdot \color{blue}{x} \]
  6. Add Preprocessing

Alternative 4: 98.6% accurate, 1.9× speedup?

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ x\_s \cdot \mathsf{fma}\left(\left(x\_m \cdot x\_m\right) \cdot x\_m, 0.3333333333333333, x\_m\right) \end{array} \]
x\_m = (fabs.f32 x)
x\_s = (copysign.f32 #s(literal 1 binary32) x)
(FPCore (x_s x_m)
 :precision binary32
 (* x_s (fma (* (* x_m x_m) x_m) 0.3333333333333333 x_m)))
x\_m = fabs(x);
x\_s = copysign(1.0, x);
float code(float x_s, float x_m) {
	return x_s * fmaf(((x_m * x_m) * x_m), 0.3333333333333333f, x_m);
}
x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m)
	return Float32(x_s * fma(Float32(Float32(x_m * x_m) * x_m), Float32(0.3333333333333333), x_m))
end
\begin{array}{l}
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)

\\
x\_s \cdot \mathsf{fma}\left(\left(x\_m \cdot x\_m\right) \cdot x\_m, 0.3333333333333333, x\_m\right)
\end{array}
Derivation
  1. Initial program 99.8%

    \[0.5 \cdot \mathsf{log1p}\left(\frac{2 \cdot x}{1 - x}\right) \]
  2. Taylor expanded in x around 0

    \[\leadsto \color{blue}{x \cdot \left(1 + \frac{1}{3} \cdot {x}^{2}\right)} \]
  3. Applied rewrites98.6%

    \[\leadsto \color{blue}{x \cdot \left(1 + 0.3333333333333333 \cdot {x}^{2}\right)} \]
  4. Applied rewrites98.6%

    \[\leadsto \mathsf{fma}\left(\left(x \cdot x\right) \cdot x, \color{blue}{0.3333333333333333}, x\right) \]
  5. Add Preprocessing

Alternative 5: 98.6% accurate, 1.9× speedup?

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ x\_s \cdot \left(\mathsf{fma}\left(x\_m \cdot 0.3333333333333333, x\_m, 1\right) \cdot x\_m\right) \end{array} \]
x\_m = (fabs.f32 x)
x\_s = (copysign.f32 #s(literal 1 binary32) x)
(FPCore (x_s x_m)
 :precision binary32
 (* x_s (* (fma (* x_m 0.3333333333333333) x_m 1.0) x_m)))
x\_m = fabs(x);
x\_s = copysign(1.0, x);
float code(float x_s, float x_m) {
	return x_s * (fmaf((x_m * 0.3333333333333333f), x_m, 1.0f) * x_m);
}
x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m)
	return Float32(x_s * Float32(fma(Float32(x_m * Float32(0.3333333333333333)), x_m, Float32(1.0)) * x_m))
end
\begin{array}{l}
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)

\\
x\_s \cdot \left(\mathsf{fma}\left(x\_m \cdot 0.3333333333333333, x\_m, 1\right) \cdot x\_m\right)
\end{array}
Derivation
  1. Initial program 99.8%

    \[0.5 \cdot \mathsf{log1p}\left(\frac{2 \cdot x}{1 - x}\right) \]
  2. Taylor expanded in x around 0

    \[\leadsto \color{blue}{x \cdot \left(1 + \frac{1}{3} \cdot {x}^{2}\right)} \]
  3. Applied rewrites98.6%

    \[\leadsto \color{blue}{x \cdot \left(1 + 0.3333333333333333 \cdot {x}^{2}\right)} \]
  4. Applied rewrites98.6%

    \[\leadsto \mathsf{fma}\left(x \cdot 0.3333333333333333, x, 1\right) \cdot \color{blue}{x} \]
  5. Add Preprocessing

Alternative 6: 97.1% accurate, 23.2× speedup?

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ x\_s \cdot x\_m \end{array} \]
x\_m = (fabs.f32 x)
x\_s = (copysign.f32 #s(literal 1 binary32) x)
(FPCore (x_s x_m) :precision binary32 (* x_s x_m))
x\_m = fabs(x);
x\_s = copysign(1.0, x);
float code(float x_s, float x_m) {
	return x_s * x_m;
}
x\_m =     private
x\_s =     private
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(4) function code(x_s, x_m)
use fmin_fmax_functions
    real(4), intent (in) :: x_s
    real(4), intent (in) :: x_m
    code = x_s * x_m
end function
x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m)
	return Float32(x_s * x_m)
end
x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp = code(x_s, x_m)
	tmp = x_s * x_m;
end
\begin{array}{l}
x\_m = \left|x\right|
\\
x\_s = \mathsf{copysign}\left(1, x\right)

\\
x\_s \cdot x\_m
\end{array}
Derivation
  1. Initial program 99.8%

    \[0.5 \cdot \mathsf{log1p}\left(\frac{2 \cdot x}{1 - x}\right) \]
  2. Taylor expanded in x around 0

    \[\leadsto \color{blue}{x} \]
  3. Applied rewrites97.1%

    \[\leadsto \color{blue}{x} \]
  4. Add Preprocessing

Reproduce

?
herbie shell --seed 2025161 
(FPCore (x)
  :name "Rust f32::atanh"
  :precision binary32
  (* 0.5 (log1p (/ (* 2.0 x) (- 1.0 x)))))