Title :
An O(k3·log(n/k)) algorithm for the consecutive-k-out-of-n:F system
Author :
Hwang, Frank K. ; Wright, Paul E.
Author_Institution :
AT&T Bell Labs., Murray Hill, NJ, USA
fDate :
3/1/1995 12:00:00 AM
Abstract :
The fastest generally-recognized algorithms for computing the reliability of consecutive-k-out-of-n:F systems require O(n) time, for both the linear and circular systems. The authors´ new algorithm requires O(k3·log(n/k)) time. The algorithm can be extended to yield an O(n·max{k3·log(n/k), log(n))} total time procedure for solving the combinatorial problem of counting the number of working states, with w working and n-w failed components, w=1,2,...,n
Keywords :
computational complexity; linear systems; reliability theory; O(k3·log(n/k)) algorithm; circular systems; combinatorial problem; computational complexity; consecutive-k-out-of-n:F system; failed components; linear systems; reliability calaculation; working states; Algorithm design and analysis; Computational complexity; Equations; Linear systems; Polynomials; Reliability theory;
Journal_Title :
Reliability, IEEE Transactions on
