Skip to main content

Can We Improve the Standard Algorithm of Interval Computation by Taking Almost Monotonicity into Account?

  • Conference paper
  • First Online:
Fuzzy Techniques: Theory and Applications (IFSA/NAFIPS 2019 2019)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 1000))

Included in the following conference series:

  • 716 Accesses

Abstract

In many practical situations, it is necessary to perform interval computations – i.e., to find the range of a given function \(y=f(x_1,\ldots ,x_n)\) on given intervals – e.g., when we want to find guaranteed bounds of a quantity that is computed based on measurements, and for these measurements, we only have upper bounds of the measurement error. The standard algorithm for interval computations first checks for monotonicity. However, when the function f is almost monotonic, this algorithm does not utilize this fact. In this paper, we show that such closeness-to-monotonicity can be efficiently utilized.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Jaulin, L., Kiefer, M., Didrit, O., Walter, E.: Applied Interval Analysis, with Examples in Parameter and State Estimation, Robust Control, and Robotics. Springer, London (2001). https://doi.org/10.1007/978-1-4471-0249-6

    Book  MATH  Google Scholar 

  2. Kreinovich, V., Lakeyev, A., Rohn, J., Kahl, P.: Computational Complexity and Feasibility of Data Processing and Interval Computations. Kluwer, Dordrecht (1998)

    Book  Google Scholar 

  3. Mayer, G.: Interval Analysis and Automatic Result Verification. de Gruyter, Berlin (2017)

    Book  Google Scholar 

  4. Moore, R.E., Kearfott, R.B., Cloud, M.J.: Introduction to Interval Analysis. SIAM, Philadelphia (2009)

    Book  Google Scholar 

  5. Rabinovich, S.G.: Measurement Errors and Uncertainties: Theory and Practice. Springer, New York (2005)

    MATH  Google Scholar 

  6. Vavasis, S.A.: Nonlinear Optimization: Complexity Issues. Oxford University Press, New York (1991)

    MATH  Google Scholar 

Download references

Acknowledgements

This work was supported in part by the US National Science Foundation grant HRD-1242122 (Cyber-ShARE Center of Excellence).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Vladik Kreinovich .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Ceberio, M., Kosheleva, O., Kreinovich, V. (2019). Can We Improve the Standard Algorithm of Interval Computation by Taking Almost Monotonicity into Account?. In: Kearfott, R., Batyrshin, I., Reformat, M., Ceberio, M., Kreinovich, V. (eds) Fuzzy Techniques: Theory and Applications. IFSA/NAFIPS 2019 2019. Advances in Intelligent Systems and Computing, vol 1000. Springer, Cham. https://doi.org/10.1007/978-3-030-21920-8_68

Download citation

Publish with us

Policies and ethics