Average Error: 29.2 → 1.0
Time: 35.6s
Precision: binary64
\[[a, b] = \mathsf{sort}([a, b]) \\]
\[\log \left(e^{a} + e^{b}\right) \]
↓
\[\mathsf{log1p}\left(e^{a}\right) + \frac{b}{e^{a} + 1} \]
\log \left(e^{a} + e^{b}\right)
↓
\mathsf{log1p}\left(e^{a}\right) + \frac{b}{e^{a} + 1}

(FPCore (a b) :precision binary64 (log (+ (exp a) (exp b))))
↓
(FPCore (a b) :precision binary64 (+ (log1p (exp a)) (/ b (+ (exp a) 1.0))))
double code(double a, double b) {
	return log(exp(a) + exp(b));
}
↓
double code(double a, double b) {
	return log1p(exp(a)) + (b / (exp(a) + 1.0));
}

Error

Bits error versus a

Bits error versus b

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 29.2

    \[\log \left(e^{a} + e^{b}\right) \]

  2. Taylor expanded in b around 0 1.1

    \[\leadsto \color{blue}{\log \left(1 + e^{a}\right) + \frac{b}{1 + e^{a}}} \]

  3. Simplified1.0

    \[\leadsto \color{blue}{\mathsf{log1p}\left(e^{a}\right) + \frac{b}{1 + e^{a}}} \]

  4. Final simplification1.0

    \[\leadsto \mathsf{log1p}\left(e^{a}\right) + \frac{b}{e^{a} + 1} \]

Reproduce

herbie shell --seed 2022077 
(FPCore (a b)
  :name "symmetry log of sum of exp"
  :precision binary64
  (log (+ (exp a) (exp b))))