## Abstract Consider a directed, sourceβsink network whose arcs either function or fail with known probabilities. This paper presents a decomposition algorithm for the exact computation of the reliability of such a network; that is, the probability that there exists a path from the network's source
A fast algorithm for reliability calculations in sparse networks
β Scribed by Dr. N. Spyratos; A. Bowen
- Publisher
- John Wiley and Sons
- Year
- 1977
- Tongue
- English
- Weight
- 767 KB
- Volume
- 7
- Category
- Article
- ISSN
- 0028-3045
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract A sparse approximate inverse (SAI) preconditioning of deflated blockβgeneralized minimal residual (GMRES) algorithm is proposed to solve large dense linear systems with multiple rightβhand sides arising from monostatic radar cross section (RCS) calculations. The multilevel fast multipol
## Abstract A new probabilistic analytical approach to evaluate seismic system reliability of large lifeline systems is presented in this paper. The algorithm takes the shortest path from the source to the terminal of a node weight or edge weight network as decomposition policy, using the Boolean l
The screened Coulomb (Yukawa or Debye-HΓΌckel) potential, = exp(-ΞΊr )/r , where r is the separation distance and ΞΊ is the Debye-HΓΌckel screening parameter, gives a good description of the electrostatic interactions in a variety of biologically and physically important charged systems. It is well know