@article{ned-kre-sta-04-aa-others,
  title = {Interval Arithmetic, Affine Arithmetic, {Taylor} Series Methods: {Why}, What Next?},
  author = {Nedialko S. Nedialkov and Vladik Kreinovich and Scott A. Starks},
  journal = {Numerical Algorithms},
  volume = {37},
  pages = {325--336},
  year = 2004,
  abstract = {In interval computations, the range of each intermediate result $r$ is described by an interval $\mathbf{r}$. To decrease excess interval width, we can keep some information on how $r$ depends on the input $x=(x_1,...,x_n)$. There are several successful methods of approximating this dependence; in these methods, the dependence is approximated by linear functions (affine arithmetic) or by general polynomials (Taylor series methods). Why linear functions and polynomials? What other classes can we try? These questions are answered in this paper.},
  doi = {10.1023/B:NUMA.0000049478.42605.cf}
}