| Summary: | This paper focuses on the division of intervals in rectangular form. The particular case where the intervals are in the complex plane is considered. For two rectangular complex intervals $Z_{1}$ and $Z_{2}$ finding the smallest rectangle containing the exact set $\left\{ z_{1}\ast z_{2}:z_{1}\in Z_{1},z_{2}\in Z_{2}\right\} $ of the operation $\ast\in\{+,-,\cdot ,\diagup\}$ is the main objective of complex interval arithmetic. For the operations addition, subtraction and multiplication, the optimal solution can be easily found. In the case of division the solution requires rather complicated calculations. This is due to the fact that space of rectangular intervals is not closed under division. The quotient of two rectangular intervals is an irregular shape in general. This work introduces a new method for the determination of the smallest rectangle containing the result in the case of division. The method obtains the optimal solution with less computational cost compared to the algorithms currently available.
|
|---|