Abstract
This paper proposes an optimal algorithm to solve a circuit design problem. We consider the constrained minimax problem to find a circle which minimizes the maximal weighted distance to a set of points passing through two given points. The problem is reformulated to a minimization problem in one dimension. We propose an algorithm to find an exact solution to the problem, using Cardano's formula. The algorithm is of computational complexity O(n3). The stability of the algorithm comes from the exact formula. Several numerical results are also shown.
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.
