Interval Computation as an Important Part of Granular Computing: An Introduction

Handbook of Granular Computing

Volumn , Issue , 2008, Pages 1-31

  Kreinovich, Vladik ^a  

^a 500 W University Avenue   (United States)

Author keywords

Constraint satisfaction and optimization; Data processing notion; Handling measurement uncertainty; Interval computation; Interval computation problem; Interval to fuzzy uncertainty; Measuring difficult to measure quantities; Real life computations

Indexed keywords

EID: 84889374621     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1002/9780470724163.ch1     Document Type: Chapter

References (57)

1. V. Kreinovich, A. Lakeyev, J. Rohn, and P. Kahl. Computational Complexity and Feasibility of Data Processing and Interval Computations. Kluwer, Dordrecht, 1997.
2. S.G. Rabinovich. Measurement Errors and Uncertainty. Theory and Practice. Springer-Verlag, Berlin, 2005.
3. G. Klir and B. Yuan. Fuzzy Sets and Fuzzy Logic: Theory and Applications. Prentice Hall, Upper Saddle River, NJ, 1995.
4. H.T. Nguyen and E.A. Walker. A First Course in Fuzzy Logic. CRC Press, Boca Raton, FL, 2005.
5. H.T. Nguyen. A note on the extension principle for fuzzy sets. J. Math. Anal. Appl. 64 (1978) 359-380.
6. M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.F. Freeman, San Francisco, CA, 1979.
7. C.H. Papadimitriou. Computational Complexity. Addison-Wesley, Reading, MA, 1994.
8. S. Vavasis. Nonlinear Optimization: Complexity Issues. Oxford University Press, New York, 1991.
9. S. Ferson, L. Ginzburg, V. Kreinovich, L. Longpré, and M. Aviles. Computing variance for interval data is NP-hard. ACM SIGACT News 33(2) (2002) 108-118.
10. S. Ferson, L. Ginzburg, V. Kreinovich, L. Longpré, and M. Aviles. Exact bounds on finite populations of interval data. Reliab. Comput. 11(3) (2005) 207-233.
11. A.A. Gaganov. Computational Complexity of the Range of the Polynomial in Several Variables. M.S. Thesis. Mathematics Department, Leningrad University, Leningrad, USSR, 1981.
12. A.A. Gaganov, Computational complexity of the range of the polynomial in several variables. Cybernetics, Vol. 21, (1985) 418-421.
13. C.P. Robert and G. Casella. Monte Carlo Statistical Methods. Springer-Verlag, New York, 2004.
14. B. Chokr and V. Kreinovich. How far are we from the complete knowledge: complexity of knowledge acquisition in Dempster-Shafer approach. In: R.R. Yager, J. Kacprzyk, and M. Pedrizzi (eds) . Advances in the Dempster-Shafer Theory of Evidence. Wiley, New York, 1994, pp. 555-576.
15. E. T. Jaynes and G.L. Bretthorst. Probability Theory: The Logic of Science. Cambridge University Press, Cambridge, UK, 2003.
16. G.J. Klir. Uncertainty and Information: Foundations of Generalized Information Theory. Wiley, Hoboken, NJ, 2005.
17. D.J. Sheskin. Handbook of Parametric and Nonparametric Statistical Procedures. Chapman & Hall/CRC, Boca Raton, FL, 2004.
18. H.M. Wadswort (ed.) . Handbook of Statistical Methods for Engineers and Scientists. McGraw-Hill, New York, 1990.
19. V. Kreinovich, J. Beck, C. Ferregut, A. Sanchez, G.R. Keller, M. Averill, and S.A. Starks. Monte-Carlo-type techniques for processing interval uncertainty, and their potential engineering applications. Reliab. Comput. 13(1) (2007) 25-69.
20. V. Kreinovich and S. Ferson. A new Cauchy-based black-box technique for uncertainty in risk analysis. Reliab. Eng. Syst. Saf. 85(1-3) (2004) 267-279.
21. Archimedes. On the measurement of the circle. In: T.L. Heath (ed.) , The Works of Archimedes. Cambridge University Press, Cambridge, 1897; Dover edition, 1953, pp. 91-98.
22. W.H. Young. Sull due funzioni a piu valori constituite dai limiti d'una funzione di variable reale a destra ed a sinistra di ciascun punto. Rend. Acad. Lincei CI. Sei. Fes. 17(5) (1908) 582-587.
23. R.C. Young. The algebra of multi-valued quantities. Math. Ann. 104 (1931) 260-290.
24. P.S. Dwyer. Linear Computations. Wiley, New York, 1951.
25. M. Warmus. Calculus of approximations. Bull. Acad. Pol. sei. 4(5) (1956) 253-257.
26. M. Warmus. Approximations and inequalities in the calculus of approximations. Classification of approximate numbers. Bull. Acad. Polon. Sei., Ser. Sei. Math. Astron. Phys. 9 (1961) 241-245.
27. T. Sunaga. Theory of interval algebra and its application to numerical analysis. In: RAAG Memoirs, Ggujutsu Bunken Fukuy-kai. Research Association of Applied Geometry (RAAG) , Tokyo, Japan, 1958, Vol. 2, 1958, pp. 29-46 (547-564) .
28. R.E. Moore. Automatic Error Analysis in Digital Computation. Technical Report, Space Div. Report LMSD84821. Lockheed Missiles and Space Co., Sunnyvale, California, 1959.
29. R.E. Moore. Interval Arithmetic and Automatic Error Analysis in Digital Computing. Ph.D. Dissertation. Department of Mathematics, Stanford University, Stanford, CA, 1962. Published as Applied Mathematics and Statistics Laboratories Technical Report No. 25.
30. R.E. Moore. The automatic analysis and control of error in digital computing based on the use of interval numbers. In: L.B. Rail (ed.) , Error in Digital Computation. Wiley, New York, 1965, Vol. I, pp. 61-130.
31. R.E. Moore. Automatic local coordinate transformations to reduce the growth of error bounds in interval computation of solutions of ordinary differential equations. In: L.B. Rail (ed.) , Error in Digital Computation. Wiley, New York, 1965, Vol. II, pp. 103-140.
32. R.E. Moore, W. Strother, and C.T. Yang. Interval Integrals. Technical Report, Space Div. Report LMSD703073, Lockheed Missiles and Space Co., 1960.
33. R.E. Moore and C.T. Yang. Interval Analysis I. Technical Report, Space Div. Report LMSD285875. Lockheed Missiles and Space Co., 1959.
34. R.E. Moore. Interval Analysis. Prentice Hall, Englewood Cliffs, NJ, 1966.
35. R.E. Moore. Methods and Applications of Interval Analysis. SIAM, Philadelphia, 1979.
36. Interval computations Web site, Helveticahttp://www.cs.utep.edu/interval-comp, 2008.
37. L. Jaulin, M. Kieffer, O. Didrit, and E. Walter. Applied Interval Analysis: With Examples in Parameter and State Estimation, Robust Control and Robotics. Springer-Verlag, London, 2001.
38. S. Markov and K. Okumura. The contribution of T. Sunaga to interval analysis and reliable computing. In: T. Csendes (ed.) , Developments in Reliable Computing. Kluwer, Dordrecht, 1999, pp. 167-188.
39. R.E. Moore, The dawning. Reliab. Comput. 5 (1999) 423-424.
40. G. Heindl. An Improved Algorithm for Computing the Product of Two Machine Intervals. Interner Bericht IAGMPI-9304. Fachbereich Mathematik, Gesamthochschule Wuppertal, 1993.
41. C. Hamzo and V. Kreinovich. On average bit complexity of interval arithmetic. Bull. Eur. Assoc. Theor. Comput. Sei. 68 (1999) 153-156.
42. M. Berz and G. Hoffstätter. Computation and application of Taylor polynomials with interval remainder bounds. Reliab. Comput. 4(1) (1998) 83-97.
43. A. Neumaier. Taylor forms-use and limits. Reliab. Comput. 9 (2002) 43-79.
44. N. Revol, K. Makino, and M. Berz. Taylor models and floating-point arithmetic: proof that arithmetic operations are validated in COSY. J. Log. Algebr. Program. 64(1) (2005) 135-154.
45. R.B. Kearfott and V. Kreinovich (eds) . Applications of Interval Computations. Kluwer, Dordrecht, 1996.
46. R. Hammer, M. Hocks, U. Kulisch, and D. Ratz. Numerical Toolbox for Verified Computing. I. Basic Numerical Problems. Springer-Verlag, Heidelberg, New York, 1993.
47. B.R. Barmish. New Tools for Robustness of Linear Systems. McMillan, New York, 1994.
48. S.R Bhattacharyya, H. Chapellat, and L. Keel. Robust Control: The Parametric Approach. Prentice-Hall, Engle-wood Cliffs, NJ, 1995.
49. E.R. Hansen and G.W. Walster. Global Optimization Using Internal Analysis. MIT Press, Cambridge, MA, 2004.
50. R.B. Kearfott. Rigorous Global Search: Continuous Problems. Kluwer, Dordrecht, 1996.
51. J. Haas, M. Hutchings, and R. Schlafy. The double bubble conjecture. Electron. Res. Announc. Am. Math. Soc. 1 (1995) 98-102.
52. T.C. Hales. A proof of the Kepler conjecture. Ann. Math. 162 (2005) 1065-1185.
53. S. Ferson. Risk Assessment with Uncertainty Numbers: Risk Calc. CRC Press, Boca Raton, FL, 2002.
54. V. Kreinovich, L. Longpré, S.A. Starks, G. Xiang, J. Beck, R. Kandathi, A. Nayak, S. Ferson, and J. Hajagos. Interval versions of statistical techniques, with applications to environmental analysis, bioinformatics, and privacy in statistical databases. J. Comput. Appl. Math. 199(2) (2007) 418-123.
55. V. Kreinovich, G. Xiang, S.A. Starks, L. Longpré, M. Ceberio, R. Araiza, J. Beck, R. Kandathi, A. Nayak, R. Torres, and J. Hajagos. Towards combining probabilistic and interval uncertainty in engineering calculations: algorithms for computing statistics under interval uncertainty, and their computational complexity. Reliab. Comput. 12(6) (2006) 471-501.
56. J.M. Mendel. Uncertain Rule-Based Fuzzy Logic Systems: Introduction and New Directions. Prentice Hall, Englewood Cliffs, NJ, 2001.
57. W. Pedrycz (ed.) . Granular Computing: An Emerging Paradigm. Springer-Verlag. New York, 2001.