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

↓
double code(double t, double l, double Om, double Omc) {
	return ((double) asin(((double) (((double) sqrt(((double) (1.0 - ((double) pow(((double) (Om / Omc)), 2.0)))))) / ((double) sqrt(((double) (1.0 + ((double) (2.0 * ((double) pow(((double) (((double) (1.0 / l)) * t)), 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.2
    \[\]
  2. Taylor expanded around -inf 51.2
    \[\leadsto \]
  3. Simplified10.2
    \[\leadsto \]
  4. Using strategy rm
  5. Applied sqrt-div10.3
    \[\leadsto \]
  6. Simplified10.2
    \[\leadsto \]
  7. Final simplification10.2
    \[\leadsto \]
Reproduce
herbie shell --seed 2020181 
(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)))))))