An official website of the United States government
Abstract When limit-state functions are highly nonlinear, traditional reliability methods, such as the first-order and second-order reliability methods, are not accurate. Monte Carlo simulation (MCS), on the other hand, is accurate if a sufficient sample size is used but is computationally intensive. This research proposes a new system reliability method that combines MCS and the Kriging method with improved accuracy and efficiency. Accurate surrogate models are created for limit-state functions with minimal variance in the estimate of the system reliability, thereby producing high accuracy for the system reliability prediction. Instead of employing global optimization, this method uses MCS samples from which training points for the surrogate models are selected. By considering the autocorrelation of a surrogate model, this method captures the more accurate contribution of each MCS sample to the uncertainty in the estimate of the serial system reliability and therefore chooses training points efficiently. Good accuracy and efficiency are demonstrated by four examples.
more »
« less
Dynamic reliability of infrastructure networks using augmented Monte Carlo simulation
Infrastructure networks offer critical services to modern society. They dynamically interact with the environment, operators, and users. Infrastructure networks are unique engineered systems, large in scale and high in complexity. One fundamental issue for their reliability assessment is the uncertainty propagation from stochastic disturbances across interconnected components. Monte Carlo simulation (MCS) remains approachable to quantify stochastic dynamics from components to systems. Its application depends on time efficiency along with the capability of delivering reliable approximations. In this paper, we introduce Quasi Monte Carlo (QMC) sampling techniques to improve modeling efficiency. Also, we suggest a principled Monte Carlo (PMC) method that equips the crude MCS with Probably Approximately Correct (PAC) approaches to deliver guaranteed approximations. We compare our proposed schemes with a competitive approach for stochastic dynamic analysis, namely the Probability Density Evolution Method (PDEM). Our computational experiments are on ideal but complex enough source-terminal (S-T) dynamic network reliability problems. We endow network links with oscillators so that they can jump across safe and failed states allowing us to treat the problem from a stochastic process perspective. We find that QMC alone can yield practical accuracy, and PMC with a PAC algorithm can deliver accuracy guarantees. Also, QMC is more versatile and efficient than the PDEM for network reliability assessment. The QMC and PMC methods provide advanced uncertainty propagation techniques to support decision makers with their reliability problems.
more »
« less
- Award ID(s):
- 2037545
- PAR ID:
- 10410345
- Editor(s):
- Li, J.; Spanos, P. D.; Chen, J. B.; Peng, Y. B.
- Date Published:
- Journal Name:
- The 13th International Conference on Structural Safety and Reliability (ICOSSAR 2021-2022)
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
We describe a new open-source Python-based package for high accuracy correlated electron calculations using quantum Monte Carlo (QMC) in real space: PyQMC. PyQMC implements modern versions of QMC algorithms in an accessible format, enabling algorithmic development and easy implementation of complex workflows. Tight integration with the PySCF environment allows for a simple comparison between QMC calculations and other many-body wave function techniques, as well as access to high accuracy trial wave functions.more » « less
-
null (Ed.)Abstract Quality inconsistency due to uncertainty hinders the extensive applications of a laser powder bed fusion (L-PBF) additive manufacturing process. To address this issue, this study proposes a new and efficient probabilistic method for the reliability analysis and design of the L-PBF process. The method determines a feasible region of the design space for given design requirements at specified reliability levels. If a design point falls into the feasible region, the design requirement will be satisfied with a probability higher or equal to the specified reliability. Since the problem involves the inverse reliability analysis that requires calling the direct reliability analysis repeatedly, directly using Monte Carlo simulation (MCS) is computationally intractable, especially for a high reliability requirement. In this work, a new algorithm is developed to combine MCS and the first-order reliability method (FORM). The algorithm finds the initial feasible region quickly by FORM and then updates it with higher accuracy by MCS. The method is applied to several case studies, where the normalized enthalpy criterion is used as a design requirement. The feasible regions of the normalized enthalpy criterion are obtained as contours with respect to the laser power and laser scan speed at different reliability levels, accounting for uncertainty in seven processing and material parameters. The results show that the proposed method dramatically alleviates the computational cost while maintaining high accuracy. This work provides a guidance for the process design with required reliability.more » « less
-
Abstract Interacting many-electron problems pose some of the greatest computational challenges in science, with essential applications across many fields. The solutions to these problems will offer accurate predictions of chemical reactivity and kinetics, and other properties of quantum systems 1–4 . Fermionic quantum Monte Carlo (QMC) methods 5,6 , which use a statistical sampling of the ground state, are among the most powerful approaches to these problems. Controlling the fermionic sign problem with constraints ensures the efficiency of QMC at the expense of potentially significant biases owing to the limited flexibility of classical computation. Here we propose an approach that combines constrained QMC with quantum computation to reduce such biases. We implement our scheme experimentally using up to 16 qubits to unbias constrained QMC calculations performed on chemical systems with as many as 120 orbitals. These experiments represent the largest chemistry simulations performed with the help of quantum computers, while achieving accuracy that is competitive with state-of-the-art classical methods without burdensome error mitigation. Compared with the popular variational quantum eigensolver 7,8 , our hybrid quantum-classical computational model offers an alternative path towards achieving a practical quantum advantage for the electronic structure problem without demanding exceedingly accurate preparation and measurement of the ground-state wavefunction.more » « less
-
Li, J.; Spanos, P. D.; Chen, J.-B.; Peng, Y.-B. (Ed.)Quantifying network reliability is a hard problem, proven to be #P-complete [1]. For real-world network planning and decision making, approximations for the network reliability problem are necessary. This study shows that tensor network contraction (TNC) methods can quickly estimate an upper bound of All Terminal Reliability, RelATR(G), by solving a superset of the network reliability problem: the edge cover problem, EC(G). In addition, these tensor contraction methods can exactly solve source-terminal (S-T) reliability for the class of directed acyclic networks, RelS−T (G). The computational complexity of TNC methods is parameterized by treewidth, significantly benefitting from recent advancements in approximate tree decomposition algorithms [2]. This parameterization does not rely on the reliability of the graph, which means these tensor contraction methods can determine reliability faster than Monte Carlo methods on highly reliable networks, while also providing exact answers or guaranteed upper bound estimates. These tensor contraction methods are applied to grid graphs, random cubic graphs, and a selection of 58 power transmission networks [3], demonstrating computational efficiency and effective approximation using EC(G).more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Conference Paper:
- The DOI is not currently available.
