Abstract
System observability analysis has constant interest for several authors. Previously, we presented a novel method based on polynomial symbolic calculus. An evaluation of time computing of this method is here presented. The computation time, known as an inconvenient for symbolic algorithm, has never been precisely determined previously for this method. Here, we not only evaluate the time, but we also look closer the hardware requirement needed for the method, applying a novel test to precisely determine the efficiency. Finally, we implement the method to a large scale example.
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.
