Skip to main content
Springer Nature Link
Log in

On the Asaithambi-Zuhe-Moore algorithm for computing the range of values

  • Published:
Computing Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

Asaithambi, Zuhe, and Moore (Computing 28, 225–237, 1982) presented an algorithm to find good upper and lower bounds on the range of values of a function of several variables on an n- dimensional rectangle. Unfortunately, the algorithm presented there contains some errors. In this paper, we point out these errors, show how they may be corrected, and suggest improvements of the algorithm.

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

Access this article

Log in via an institution

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

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  • Asaithambi N. S., Zuhe S. and Moore R. E. (1982). On computing the range of values. Computing 28: 225–237

    Article  Google Scholar 

  • Moore R. E. (1979). Methods and applications of interval analysis. SIAM, Philadelphia

    MATH  Google Scholar 

  • Ichida K. and Fujii Y. (1979). An interval arithmetic method for global optimization. Computing 23: 85–97

    Article  MATH  Google Scholar 

  • Ratschek H. and Rokne J. (1988). New computer methods for global optimization. Wiley , New York

    MATH  Google Scholar 

  • Jansson, C., Knuppel, O.: A global minimization method: the multi-dimensional case. TUHH (Technische Universitat Hamburg-Harburg), Bericht 92.1, 1992, pp. 47–48.

  • Ratz D. and Csendes T. (1995). On the selection of subdivision directions in interval branch-and-bound methods for global optimization. J. Global Optim. 7: 183–207

    Article  MATH  Google Scholar 

  • Sun Microsystems, Palo Alto, CA, USA: Forte FORTRAN 95 User Manual, 2001.

Download references

Author information

Authors and Affiliations

  1. Systems and Control Engineering Group, Department of Electrical Engineering, IIT, Bombay, 400 076, India

    P. S. V. Nataraj & N. Kubal

Authors
  1. P. S. V. Nataraj
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. N. Kubal
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to P. S. V. Nataraj.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nataraj, P.S.V., Kubal, N. On the Asaithambi-Zuhe-Moore algorithm for computing the range of values. Computing 80, 247–253 (2007). https://doi.org/10.1007/s00607-007-0231-5

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00607-007-0231-5

Keywords