Average Error: 10.3 → 10.3
Time: 22.3s
Precision: binary64
\[\]
↓
\[\]
↓
double code(double t, double l, double Om, double Omc) {
	return asin(sqrt((1.0 - pow((Om / Omc), 2.0)) / (1.0 + (2.0 * pow((t / l), 2.0)))));
}

↓
double code(double t, double l, double Om, double Omc) {
	return asin(sqrt(1.0 - pow((Om / Omc), 2.0)) / sqrt(1.0 + (2.0 * pow((t / l), 2.0))));
}

Error
Bits error versus t
Bits error versus l
Bits error versus Om
Bits error versus Omc
Try it out
Your Program's Arguments
Results
Enter valid numbers for all inputs
Derivation
  1. Initial program 10.3
    \[\]
  2. Using strategy rm
  3. Applied sqrt-div10.3
    \[\leadsto \]
  4. Final simplification10.3
    \[\leadsto \]
Reproduce
herbie shell --seed 2020338 
(FPCore (t l Om Omc)
  :name "Toniolo and Linder, Equation (2)"
  :precision binary64
  (asin (sqrt (/ (- 1.0 (pow (/ Om Omc) 2.0)) (+ 1.0 (* 2.0 (pow (/ t l) 2.0)))))))