Title :
An Efficient Algorithm for Computing the Reliability of Consecutive-
-Out-Of-
:F Systems
Author :
Cluzeau, Thomas ; Keller, Jörg ; Schneeweiss, Winfrid
Author_Institution :
Ecole Nat. Super. d´´Ingenieurs de Limoges, Limoges
fDate :
3/1/2008 12:00:00 AM
Abstract :
Many algorithms for computing the reliability of linear or circular consecutive-k-out-of-n:F systems appeared in this Transactions. The best complexity estimate obtained for solving this problem is O(k3 log(n/k)) operations in the case of i.i.d. components. Using fast algorithms for computing a selected term of a linear recurrence with constant coefficients, we provide an algorithm having arithmetic complexity O(k log (k) log(log(k)) log(n)+komega) where 2<omega< 3 is the exponent of linear algebra. This algorithm holds generally for linear, and circular consecutive-k-out-of-n:F systems with independent but not necessarily identical components.
Keywords :
computational complexity; power system reliability; arithmetic complexity; consecutive-k-out-of-n:F systems; linear algebra; linear recurrence; reliability computing; Consecutive-$k$ -out-of-$n$:F systems;
Journal_Title :
Reliability, IEEE Transactions on
DOI :
10.1109/TR.2008.916879