On Average Bit Complexity of Interval Arithmetic

نویسندگان

  • C. Hamzo
  • Vladik Kreinovich
چکیده

In many practical situations, we know only the intervals which contain the actual (unknown) values of physical quantities. If we know the intervals x for a quantity x and y for another quantity y, then, for every arithmetic operation , the set of possible values of x y also forms an interval; the operations leading from x and y to this new interval are called interval arithmetic operations. For addition and subtraction, corresponding interval operations consist of two corresponding operations with real numbers, so there is no hope of making them faster. The best known algorithms for interval multiplication consists of 3 real-number multiplications and several comparisons. We describe a new algorithm for which the average time is equivalent to using only 2 multiplications of real numbers. What is interval arithmetic. Many computer algorithms for processing real numbers have been designed to process measurement results. Measurements are never 100% precise; therefore, when after measuring a physical quantity we get the measurement result e x, this does not mean that the actual value of this quantity is equal to e x: this actual value can take any value from the interval x = e x ? ; e x+ ], where is an upper bound on the measurement error (usually supplied by the manufacturer of the measuring instrument). If for two quantities x and y, we only know the intervals x = x; x] and y = y; y] of possible values, then, for every arithmetic operation (+; ?; ; =), we can only only conclude that x y 2 x y, where x y is deened as x y = fx y j x 2 x; y 2 yg: Thus deened arithmetic operations on the set of all intervals are called interval arithmetic. The results of interval arithmetic operations can be easily described in terms of lower and upper endpoints of the operand intervals: What is computational complexity of interval arithmetic? Formulation of the problem. When we process intervals corresponding to data uncertainty, our goal is to perform the corresponding interval arithmetic operations. The faster we perform them, the better, so the natural question is: what is the algebraic complexity of these operations? In other words, how many elementary operations with real numbers (actually, rational numbers) do we need to perform to implement one interval arithmetic operation? For addition, the answer is easy: addition of two intervals means two additions: …

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Arithmetic Aggregation Operators for Interval-valued Intuitionistic Linguistic Variables and Application to Multi-attribute Group Decision Making

The intuitionistic linguistic set (ILS) is an extension of linguisitc variable. To overcome the drawback of using single real number to represent membership degree and non-membership degree for ILS, the concept of interval-valued intuitionistic linguistic set (IVILS) is introduced through representing the membership degree and non-membership degree with intervals for ILS in this paper. The oper...

متن کامل

Design and Simulation of a 2GHz, 64×64 bit Arithmetic Logic Unit in 130nm CMOS Technology

The purpose of this paper is to design a 64×64 bit low power, low delay and high speed Arithmetic Logic Unit (ALU). Arithmetic Logic Unit performs arithmetic operation like addition, multiplication. Adders play important role in ALU. For designing adder, the combination of carry lookahead adder and carry select adder, also add-one circuit have been used to achieve high speed and low area. In mu...

متن کامل

A High-Speed Dual-Bit Parallel Adder based on Carbon Nanotube ‎FET technology for use in arithmetic units

In this paper, a Dual-Bit Parallel Adder (DBPA) based on minority function using Carbon-Nanotube Field-Effect Transistor (CNFET) is proposed. The possibility of having several threshold voltage (Vt) levels by CNFETs leading to wide use of them in designing of digital circuits. The main goal of designing proposed DBPA is to reduce critical path delay in adder circuits. The proposed design positi...

متن کامل

The Complexity of Subdivision for Diameter-Distance Tests

We present a general framework for analyzing the complexity of subdivisionbased algorithms whose tests are based on the sizes of regions and their distance to certain sets (often varieties) intrinsic to the problem under study. We call such tests diameterdistance tests. We illustrate that diameter-distance tests are common in the literature by proving that many interval arithmetic-based tests a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Bulletin of the EATCS

دوره 68  شماره 

صفحات  -

تاریخ انتشار 1999