Abstract
In this paper, complex arithmetic in polar form, briefly sectors arithmetic is discussed. The fact that the family of sectors is not closed under addition and subtraction gives rise to the need of an optimized approximation. Precisely, the problem discussed, is to determine the smallest possible sector that contains the sum of two sectors. An efficient algorithm that is solving this problem is introduced and compared with existing algorithms in the literature. The algorithms are implemented in MATLAB R2020a and tested for all cases. It is also shown by examples that the proposed algorithms perform much better than their ancestors and avoid their errors.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
