Introduction to Interval Analysis

By R. Moore, R. B. Kearfott, M. Cloud. 2009

2,469 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Isaac E. Elishakoff
2. Alba Sofi
3. G. Muscolino
4. Thomas Y. Hou
5. De Huang
6. Jafar Rezaei
7. Junfeng Yang
8. Denis V. Efimov

Citations in the corpus

• Efficient Formal Safety Analysis of Neural Networks (2018, background): “Recently, ReluVal, by Wang et al. [39], has used interval arithmetic [33] for rigorously estimating a neural network’s decision boundary by computing tight bounds on the outputs of a network for a given input range.”
• Verifying Neural Networks with Mixed Integer Programming (2017, neutral): “Interval arithmetic [13] allows us to derive reasonable bounds on variables efficiently.”
• Tolerance analysis of mechanical assemblies based on modal interval and small degrees of freedom (MI-SDOF) concepts (2010, background): “Moore et al. [ 27 ], Gardenes et al. [28], and Popova [29] represented modal interval arithmetic that is a logical extension of traditional interval arithmetic.”
• Interval arithmetic operations for uncertainty analysis with correlated interval variables (2016, neutral): “3 3] [2, 2] [2, 2] [2, 2] [2, 2 ] [2, 2] [0.”