Catalogo Articoli (Spogli Riviste)

OPAC HELP

Titolo:
AN O(N-CENTER-DOT(LOG(2)(N))(2)) ALGORITHM FOR COMPUTING THE RELIABILITY OF K-OUT-OF-N-G AND K-TO-L-OUT-OF-N-G SYSTEMS
Autore:
BELFORE LA;
Indirizzi:
MARQUETTE UNIV,DEPT ELECT & COMP ENGN,POB 1881 MILWAUKEE WI 53201
Titolo Testata:
IEEE transactions on reliability
fascicolo: 1, volume: 44, anno: 1995,
pagine: 132 - 136
SICI:
0018-9529(1995)44:1<132:AOAFCT>2.0.ZU;2-9
Fonte:
ISI
Lingua:
ENG
Keywords:
K-OUT-OF-N SYSTEM; K-TO-L-OUT-OF-N SYSTEM; GENERATING FUNCTION; COMPUTATIONAL EFFICIENCY; FAST FOURIER TRANSFORM;
Tipo documento:
Article
Natura:
Periodico
Settore Disciplinare:
CompuMath Citation Index
Science Citation Index Expanded
Science Citation Index Expanded
Science Citation Index Expanded
Citazioni:
10
Recensione:
Indirizzi per estratti:
Citazione:
L.A. Belfore, "AN O(N-CENTER-DOT(LOG(2)(N))(2)) ALGORITHM FOR COMPUTING THE RELIABILITY OF K-OUT-OF-N-G AND K-TO-L-OUT-OF-N-G SYSTEMS", IEEE transactions on reliability, 44(1), 1995, pp. 132-136

Abstract

This paper presents the RAFFT-GFP (Recursively Applied Fast Fourier Transform for Generator Function Products) algorithm as a computationally superior algorithm for expressing and computing the reliability of k-out-of-n:G and k-to-l-out-of-n:G systems using the fast Fourier transform. Originally suggested by Barlow and Heidtmann (1984), generatingfunctions provide a clear, concise method for computing the reliabilities of such systems. By recursively applying the FFT to computing generator function products, the RAFFT-GFP achieves an overall asymptoticcomputational complexity of O(n .(log(2)(n))(2)) for computing systemreliability. Algebraic manipulations suggested by Upadhyaya and Pham (1993) are reformulated in the context of generator functions to reduce the number of computations. The number of computations and the CPU time are used to compare the performance of the RAFFT-GFP algorithm to the best found in the literature. Due to larger overheads required, the RAFFT-GFP algorithm is superior for problem sizes larger than about 4000 components, in terms of both computation and CPU time for the examples studied in this paper. Lastly studies of very large systems withunequal reliabilities indicate that the binomial distribution gives agood approximation for generating function coefficients, allowing algebraic solutions for system reliability.

ASDD Area Sistemi Dipartimentali e Documentali, Università di Bologna, Catalogo delle riviste ed altri periodici
Documento generato il 27/01/21 alle ore 09:16:50