Abstract
It is pointed out that system unavailability and failure frequency can be found for many sets of components data via symbolic formulas with few multiplications. The derivation of such symbolic formulas is possible by binary-tree algorithms (specifically the Shannon expansion) which could run very fast on supercomputers allowing for binary-tree parallelism. The reduction factor of the number of multiplications needed in nested versus polynomial forms is roughly half the height of the decomposition tree, and the height of the tree is roughly the number of system components.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
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.
