Search NASA⌕ Search

DOE OSTI · 984556

Determining Interactions in PSA models: Application to a Space PSA

Abstract

This paper addresses use of an importance measure interaction study of a probabilistic risk analysis (PSA) performed for a hypothetical aerospace lunar mission. The PSA methods used in this study follow the general guidance provided in the NASA Probabilistic Risk Assessment Procedures Guide for NASA Managers and Practitioners. For the PSA portion, we used phased-based event tree and fault tree logic structures are used to model a lunar mission, including multiple phases (from launch to return to the Earth surface) and multiple critical systems. Details of the analysis results are not provided in this paper – instead specific basic events are denoted by number (e.g., the first event is 1, the second is 2, and so on). However, in the model, we used approximately 150 fault trees and over 800 basic events. Following analysis and truncation of cut sets, we were left with about 400 basic events to evaluate. We used this model to explore interactions between different basic events and systems. These sensitivity studies provide high-level insights into features of the PSA for the hypothetical lunar mission.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Smith, C, Borgonovo, E. 2010-06-01. Determining Interactions in PSA models: Application to a Space PSA. https://searchnasa.com/record/osti%3A984556/determining-interactions-in-psa-models-application-to-a-space-psa

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Search NASA by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related reports

TANTE: Time-adaptive operator learning via neural Taylor expansion

Operator learning for time-dependent partial differential equations (PDEs) has seen rapid progress in recent years, enabling efficient approximation of complex spatiotemporal dynamics. However, most existing methods rely on fixed time step sizes during rollout, which limits their ability to adapt to varying temporal complexity and often leads to error accumulation. In this work, we propose the Time-Adaptive Transformer with Neural Taylor Expansion (TANTE), a novel operator-learning framework that produces continuous-time predictions with adaptive step sizes. TANTE predicts future states by performing a Taylor expansion at the current state, where neural networks learn both the higher-order temporal derivatives and the local radius of convergence. This allows the model to dynamically adjust its rollout based on the local behavior of the solution, thereby reducing cumulative error and improving computational efficiency. We demonstrate the effectiveness of TANTE across a wide range of PDE benchmarks, achieving superior accuracy and adaptability compared to fixed-step baselines, delivering accuracy gains of 60-80 % and speed-ups of 30-40 % at inference time.

97 MATHEMATICS AND COMPUTING↗

Structured illumination for surface-resolved grazing-incidence X-ray scattering

Grazing-incidence (GI) scattering techniques are widely used to characterize thin films, offering high surface sensitivity and insight into morphology and structure. However, these approaches typically provide statistical averaged information due to elongated footprint or limited spatial resolution due to beam size. Here we introduce a method that combines structured illumination with GI X-ray scattering and leverages our computational imaging approach to resolve local structural details. We demonstrate that our method captures local features of an organic semiconductor thin film without the need for sample rotation as in tomography. The method expands GI techniques from statistical averaging to high-resolution imaging, thereby providing the capability for detailed analysis of local material properties, such as domain shape, orientation and polymorphism, which are critical for advancing material design towards more efficient and tailored materials.

97 MATHEMATICS AND COMPUTING↗