Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “requirements decomposition”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 55 records · Page 3

Enabling Space Exploration Medical System Development Using a Tool Ecosystem

The NASA Human Research Program's (HRP) Exploration Medical Capability (ExMC) Element is utilizing a Model Based Systems Engineering (MBSE) approach to enhance the development of systems engineering products that will be used to advance medical system designs for exploration missions beyond Low Earth Orbit. In support of future missions, the team is capturing content such as system behaviors, functional decompositions, architecture, system requirements and interfaces, and recommendations for clinical capabilities and resources in Systems Modeling Language (SysML) models. As these products mature, SysML models provide a way for ExMC to capture relationships among the various products, which includes supporting more integrated and multi-faceted views of future medical systems. In addition to using SysML models, HRP and ExMC are developing supplementary tools to support two key functions: 1) prioritizing current and future research activities for exploration missions in an objective manner; and 2) enabling risk-informed and evidence-based trade space analysis for future space vehicles, missions, and systems. This paper will discuss the long-term HRP and ExMC vision for the larger ecosystem of tools, which include dynamic Probabilistic Risk Assessment (PRA) capabilities, additional SysML models, a database of system component options, and data visualizations. It also includes a review of an initial Pilot Project focused on enabling medical system trade studies utilizing data that is coordinated across tools for consistent outputs (e.g., mission risk metrics that are associated with medical system mass values and medical conditions addressed). This first Pilot Project demonstrated successful operating procedures and integration across tools. Finally, the paper will also cover a second Pilot Project that utilizes tool enhancements such as medical system optimization capabilities, post-processing, and visualization of generated data for subject matter expert review, and increased integration amongst the tools themselves.

Amador, Jennifer R.↗

Determination of the oxidative stability of perfluoropolyalkyl ethers and correlation with chemical structure

The oxidative stabilities of several perfluoropolyalkyl ethers (PFPAE) with related chemical structures were determined by thermal gravimetric analysis and correlated with their chemical structures. These results show that oxidative stability increases as the number of difluoroformal groups decreases and as trifluoromethyl substituents are added. They are also consistent with a recently proposed intramolecular disproportionation reaction mechanism involving coordination of successive ether oxygens to a Lewis acid. Since polytetrafluoroethylene contains no oxygen, it provides an indication of the upper limit to oxidative stability of PFPAE fluids. These results also show that oxidative decomposition of PFPAE fluids requires the presence of an active metal as well as air. Consequently, it may be possible to minimize decomposition and thus improve oxidative stability by passivating reactive metal surfaces.

Helmick, Larry S.↗

Flexible User-Defined Domain Decomposition in Kilometer-Scale E3SM Land Model Simulation

The Energy Exascale Earth System Model (E3SM) Land Model (ELM) has been extended to kilometer-scale (km-ELM) resolutions, enabling high-fidelity simulations of terrestrial processes at 1 km x 1 km grid spacing. In ELM, domain decomposition partitions the computational domain across processors, ensuring efficient parallel execution. Currently, round-robin decomposition is applied, providing a straightforward way to distribute computational workload. As ELM continues evolving at the kilometer-scale (km-scale), particularly with integrating lateral flow modeling, decomposition strategies must also account for the increased workload and data movement. This paper introduces a flexible user-defined domain decomposition framework, allowing users to customize domain partitioning based on application requirements. The impact of different decomposition strategies is evaluated across various applications concerning computation, communication, and I/O. Results demonstrate that while 1D partitioning yields superior I/O performance, k-nearest neighbors (KNN) clustering effectively reduces inter-process communication overhead. This study lays the groundwork for scalable partitioning in large-scale land surface simulations, enhancing next-generation Earth system modeling.

Wang, Dali [ORNL] (ORCID:0000000168065108)↗

Real-Time Bayesian Inference at Extreme Scale: A Digital Twin for Tsunami Early Warning Applied to the Cascadia Subduction Zone

We present a Bayesian inversion-based digital twin that employs acoustic pressure data from seafloor sensors, along with 3D coupled acoustic–gravity wave equations, to infer earthquake-induced spatiotemporal seafloor motion in real time and forecast tsunami propagation toward coastlines for early warning with quantified uncertainties. Our target is the Cascadia subduction zone, with one billion parameters. Computing the posterior mean alone would require 50 years on a 512 GPU machine. Instead, exploiting the shift invariance of the parameter-to-observable map and devising novel parallel algorithms, we induce a fast offline–online decomposition. The offline component requires just one adjoint wave propagation per sensor; using MFEM, we scale this part of the computation to the full El Capitan system (43,520 GPUs) with 92% weak parallel efficiency. Moreover, given real-time data, the online component exactly solves the Bayesian inverse and forecasting problems in 0.2 seconds on a modest GPU system, a ten-billion-fold speedup.

97 MATHEMATICS AND COMPUTING↗

Variance Decomposition of MEDLI2 Reconstructed Heating Using Neural Networks

The Mars Entry, Descent, and Landing Instrumentation (MEDLI2) sensor suite collected data during entry of the Mars 2020 Perseverance rover into Mars’ atmosphere. This suite included a network of MEDLI2 Instrumented Sensor Plugs (MISPs). Each MISP was comprised of a cylinder made of Thermal Protection System (TPS) material with 1-3 embedded thermocouples (TCs), and it was flush mounted into the heatshield or backshell. Data from these in-depth TCs were used to reconstruct the aeroheating environment of the vehicle throughout entry. Surface heating was posed as an inverse problem, with the goal of estimating the surface heating by minimizing an objective function of the difference between MISP temperature measurements during flight and the temperature predictions derived from the Fully Implicit Ablation and Thermal response (FIAT) program. Given an aerothermal environment, FIAT calculates the material response and provides in-depth temperatures throughout the TPS material. To achieve the reverse, an internal tool called FIAT_Opt runs through multiple different environments until the output temperature at the TC depth closely matches the flight data. 95% confidence intervals on the reconstructed surface heating were obtained using Monte Carlo analysis, in which uncertainties in the thermocouple depth and the TPS material properties (e.g., density, thermal conductivity, heat capacity, emissivity) based on flight-lot material testing were included. A variance decomposition method using Sobol indices was employed to assess the sensitivity of the reconstructed peak heating to the TC placement and material property uncertainties. Variance decomposition was found to require tens of thousands of FIAT_Opt runs in order for the Sobol indices to converge. With a single FIAT_Opt run taking on the order of 40 minutes, the required number of computations would take months to complete, even if using multiple CPUs. To mitigate this problem, three machine learning models (ridge regression with cross-validation, random forest regression, and a deep neural network) were trained and tested using the 2000 Monte Carlo runs that were already completed. A subset of 1600 runs were used to train the model (i.e., training set), while the remaining 400 runs were used as the test set. The predictions from the deep neural network (DNN) on the test set showed nearly perfect agreement to the actual values computed with FIAT_Opt (R2 > 0.99). Using the DNN as a surrogate model, the variance decomposition using 50,000 runs was completed within minutes. The resulting Sobol indices showed that the reconstructed peak surface heating was most sensitive to the uncertainties in the thermal conductivity (ST = 0.37) and heat capacity (ST = 0.26). This method can be leveraged to provide requirements for material property measurements needed to improve the accuracy of surface heating prediction and ultimately lead to the reduction of design margins in the future. This presentation will include background on the MEDLI2 suite; the method used for inverse heating estimation; the way that material property uncertainties were accounted for using Monte Carlo analysis; a brief background on variance decomposition; the motivation for using machine learning in this context; how a neural network was trained on the data to enable variance decomposition in a fraction of the time; and the variance decomposition results for one of the MISPs.

Hannah Alpert↗

BANDIT in NASTRAN

BANDIT has been implemented into the NASTRAN April '83 release. It is now a permanent feature in NASTRAN and will be included in all future releases for all four computing machines (IBM, CDC, UNIVAC, and VAX). Originally BANDIT operated as a preprocessor of NASTRAN. It read the NASTRAN input cards and produced a set of resequencing (SEOGP) cards that would greatly reduce the computational time required by the matrix decomposition module of NASTRAN for a large structure. In the past, many computer centers had installed BANDIT in their systems together with the NASTRAN program. The user would run the BANDIT program and NASTRAN as if they were one program (or two separated programs depending on how the two programs were actually tied together in the computer systems). In some cases, the user was required to pass the input cards and the output SEQGP cards between the two programs, and n others, the data was manipulated through the use of cataloged disc files. Although there is nothing wrong with this BANDIT-NASTRAN arrangement, there are, however, several shortcomings which are mentioned in this paper. The BANDIT in the NASTRAN April '83 release has removed all the deficiencies, and it comes in one version applicable to the four computing machines.

Chan, G. C.↗

The Effects of Polyolefin Structure and Source on Pyrolysis-Derived Plastic Oil Composition

Seven types of plastics were pyrolyzed in a fluidized bed reactor: post-consumer recycled (PCR) high-density polyethylene (HDPE), PCR polypropylene (PP), virgin resins of varying molecular weights of HDPE, virgin resins of low-density polyethylene (LDPE), linear low-density polyethylene (LLDPE), and (PP). Pyrolysis produced non-condensable gases (C1-C3), liquid phase products (C4-C40), and solids (C40+ and chars), with alkane, alkene, alkadiene, aromatic, and multi-cycloaromatics as the predominant compounds. Polymer structure had the greatest impact on product distribution, with minimal influence from molecular weight. Branches in polyethylene (PE) acted as thermal defects initiating degradation. Higher branch density in PE led to increased concentrations of aromatics, branched alkanes, and internal alkenes. PP and PE exhibited distinct degradation mechanisms, with PP requiring less energy for decomposition and yielding more oil. Here, pyrolysis oil from PCR HDPE and PCR PP contained a higher proportion of branched compounds. Additives in PCR plastics may promote isomerization during pyrolysis.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Aircraft vortex marking program

A simple, reliable device for identifying atmospheric vortices, principally as generated by in-flight aircraft and with emphasis on the use of nonpolluting aerosols for marking by injection into such vortex (-ices) is presented. The refractive index and droplet size were determined from an analysis of aerosol optical and transport properties as the most significant parameters in effecting vortex optimum light scattering (for visual sighting) and visual persistency of at least 300 sec. The analysis also showed that a steam-ejected tetraethylene glycol aerosol with droplet size near 1 micron and refractive index of approximately 1.45 could be a promising candidate for vortex marking. A marking aerosol was successfully generated with the steam-tetraethylene glycol mixture from breadboard system hardware. A compact 25 lb/f thrust (nominal) H2O2 rocket chamber was the key component of the system which produced the required steam by catalytic decomposition of the supplied H2O2.

Pompa, M. F.↗

Attitude determination and parameter estimation using vector observations

Procedures for attitude determination based on Wahba's loss function are generalized to include the estimation of parameters other than the attitude, such as sensor biases. Optimization with respect to the attitude requires either the singular value decomposition of a 3x3 matrix or finding the maximum eigenvalue and corresponding eigenvector of a 4x4 symmetric matrix, but does not require an a priori estimate of the attitude. Optimization with respect to the other parameters employs an iterative approach, which does require an a priori estimate of these parameters. Conventional state estimation methods require a priori estimates of both the parameters and the attitude, while the algorithms presented in this paper always compute the exact optimal attitude for given values of the parameters. The proposed method is shown to give the correct solution of an example problem. An expression for the covariance of the attitude and parameter estimates is derived.

Markley, F. Landis↗

Direct particle simulation on the Connection Machine CM-2

Particle simulation is a useful technique for analyzing low density flows. The Connection Machine CM-2 is a useful test bed for studying the fine-grain data objects decomposition and the coarse-grain domain decomposition single instruction multiple datastream (SIMD) approaches to particle simulation. Both approaches are investigated for the model problem of uniform flow through a channel and the algorithms required for the SIMD domain decomposition approach are presented. An unresolved issue with the domain decomposition approach is the effect of a poor partitioning on flows with real geometries. Initial results with the channel flow problem indicate that a poor partitioning has only a small detrimental effect on the overall performance.

Dagum, L.↗

Implicit transient finite element structural computations on MIMD systems - FETI vs. direct solvers

A domain decomposition method for implicit schemes that require significantly less storage and is several times faster than factorization algorithms is proposed. The transient domain decomposition method is an extension of the finite element tearing and interconnecting (FETI) method for the solution of static problems. Serial and parallel performance results obtained using the CRAY Y-MP/8 and the iPSC-860/128 systems demonstrate that the FETI method is superior to both serial and parallel direct methods.

Crivelli, Luis↗

Greedy emulators for nuclear two-body scattering

Applications of reduced basis method emulators are increasing in low-energy nuclear physics because they enable fast and accurate sampling of high-fidelity calculations, enabling robust uncertainty quantification. Here, in this paper, we develop, implement, and test two model-driven emulators based on the (Petrov-)Galerkin projection using the prototypical test case of two-body scattering with the Minnesota potential and a more realistic local chiral potential. The high-fidelity scattering equations are solved with the matrix Numerov method, a reformulation of the popular Numerov recurrence relation for solving special second-order differential equations as a linear system of coupled equations. A novel error estimator based on reduced-space residuals is applied to an active learning approach (a greedy algorithm) to choosing training samples (“snapshots”) for the emulator and contrasted with a proper orthogonal decomposition (POD) approach. Both approaches allow for computationally efficient offline-online decompositions, but the greedy approach requires many fewer snapshot calculations. These developments set the groundwork for emulating scattering observables based on chiral nucleon-nucleon and three-nucleon interactions and optical models, where computational speed-ups are necessary for Bayesian uncertainty quantification. Our emulators and error estimators are widely applicable to linear systems.

Bayesian methods↗

Implementation of a Goal-Based Systems Engineering Process Using the Systems Modeling Language (SysML)

Building upon the purpose, theoretical approach, and use of a Goal-Function Tree (GFT) being presented by Dr. Stephen B. Johnson, described in a related Infotech 2013 ISHM abstract titled "Goal-Function Tree Modeling for Systems Engineering and Fault Management", this paper will describe the core framework used to implement the GFTbased systems engineering process using the Systems Modeling Language (SysML). These two papers are ideally accepted and presented together in the same Infotech session. Statement of problem: SysML, as a tool, is currently not capable of implementing the theoretical approach described within the "Goal-Function Tree Modeling for Systems Engineering and Fault Management" paper cited above. More generally, SysML's current capabilities to model functional decompositions in the rigorous manner required in the GFT approach are limited. The GFT is a new Model-Based Systems Engineering (MBSE) approach to the development of goals and requirements, functions, and its linkage to design. As a growing standard for systems engineering, it is important to develop methods to implement GFT in SysML. Proposed Method of Solution: Many of the central concepts of the SysML language are needed to implement a GFT for large complex systems. In the implementation of those central concepts, the following will be described in detail: changes to the nominal SysML process, model view definitions and examples, diagram definitions and examples, and detailed SysML construct and stereotype definitions.

Patterson, Jonathan D.↗

Implementation of a Goal-Based Systems Engineering Process Using the Systems Modeling Language (SysML)

Building upon the purpose, theoretical approach, and use of a Goal-Function Tree (GFT) being presented by Dr. Stephen B. Johnson, described in a related Infotech 2013 ISHM abstract titled "Goal-Function Tree Modeling for Systems Engineering and Fault Management", this paper will describe the core framework used to implement the GFTbased systems engineering process using the Systems Modeling Language (SysML). These two papers are ideally accepted and presented together in the same Infotech session. Statement of problem: SysML, as a tool, is currently not capable of implementing the theoretical approach described within the "Goal-Function Tree Modeling for Systems Engineering and Fault Management" paper cited above. More generally, SysML's current capabilities to model functional decompositions in the rigorous manner required in the GFT approach are limited. The GFT is a new Model-Based Systems Engineering (MBSE) approach to the development of goals and requirements, functions, and its linkage to design. As a growing standard for systems engineering, it is important to develop methods to implement GFT in SysML. Proposed Method of Solution: Many of the central concepts of the SysML language are needed to implement a GFT for large complex systems. In the implementation of those central concepts, the following will be described in detail: changes to the nominal SysML process, model view definitions and examples, diagram definitions and examples, and detailed SysML construct and stereotype definitions.

Breckenridge, Jonathan T.↗

Sulfate reduction and oxic respiration in marine sediments: implications for organic carbon preservation in euxinic environments

Compilations have been made of sulfate reduction rates and oxic respiration rates over the entire range of marine sedimentation rates, and sedimentary environments, including several euxinic sites. These data show, consistent with the findings of Jorgensen (1982, Nature, 296, 643-645), that sulfate reduction and oxic respiration oxidize equal amounts of organic carbon in nearshore sediments. As sedimentation rates decrease, oxic respiration, becomes progressively more important, and in deep-sea sediments 100-1000 times more organic carbon is oxidized by oxic respiration than by sulfate reduction. By contrast, nearly as much organic carbon is oxidized by sulfate reduction in euxinic sediments as is oxidized by the sum of sulfate reduction and oxic respiration in normal marine sediments of similar deposition rate. This observation appears at odds with the enhanced preservation of organic carbon observed in euxinic sediments. However, only small reductions in (depth-integrated) organic carbon decomposition rates (compared to normal marine) are required to give both high organic carbon concentrations and enhanced carbon preservation in euxinic sediments. Lower rates of organic carbon decomposition (if only by subtle amounts) are explained by the diminished ability of anaerobic bacteria to oxidize the full suite of sedimentary organic compounds.

NASA Center ARC↗

Second Generation RLV Space Vehicle Concept

NASA has a long history of conducting development programs and projects in a consistent fashion. Systems Engineering within those programs and projects has also followed a given method outlined by such documents as the NASA Systems Engineering Handbook. The relatively new NASA Space Launch Initiative (SLI) is taking a new approach to developing a space vehicle, with innovative management methods as well as new Systems Engineering processes. With the program less than a year into its life cycle, the efficacy of these new processes has yet to be proven or disproven. At $776M for phase 1, SLI represents a major portion of the NASA focus; however, the new processes being incorporated are not reflected in the training provided by NASA to its engineers. The NASA Academy of Program and Project Leadership (APPL) offers core classes in program and project management and systems engineering to NASA employees with the purpose of creating a "knowledge community where ideas, skills, and experiences are exchanged to increase each other's capacity for strong leadership". The SLI program is, in one sense, a combination of a conceptual design program and a technology program. The program as a whole doesn't map into the generic systems engineering project cycle as currently, and for some time, taught. For example, the NASA APPL Systems Engineering training course teaches that the "first step in developing an architecture is to define the external boundaries of the system", which will require definition of the interfaces with other systems and the next step will be to "define all the components that make up the next lower level of the system hierarchy" where fundamental requirements are allocated to each component. Whereas, the SLI technology risk reduction approach develops architecture subsystem technologies prior to developing architectures. The higher level architecture requirements are not allowed to fully develop and undergo decomposition and allocation down to the subsystems before the subsystems must develop allocated requirements based on the highest level of requirements. In the vernacular of the project cycles prior to the mid 1990's, the architecture definition portion of the program appears to be at a generic Phase A stage, while the subsystems are operating at Phase B. Even the management structure of the SLI program is innovative in its approach to Systems Engineering and is not reflected in the APPL training modules. The SLI program has established a Systems Engineering office as an office separate from the architecture development or the subsystem technology development, while that office does have representatives within these other offices. The distributed resources of the Systems Engineering Office are co-located with the respective Project Offices. This template is intended to provide systems engineering as an integrated function at the Program Level. the program management of SLI and the MAT agree that "program/project managers and the systems engineering team must work closely together towards the single objective of delivering quality products that meet the customer needs". This paper will explore the differences between the methods being taught by NASA, which represent decades of ideas, and those currently in practice in SLI. Time will tell if the innovation employed by SLI will prove to be the model of the future. For now, it is suggested that the training of the present exercise the flexibility of recognizing the new processes employed by a major new NASA program.

Bailey, Michelle↗

A transient FETI methodology for large-scale parallel implicit computations in structural mechanics

Explicit codes are often used to simulate the nonlinear dynamics of large-scale structural systems, even for low frequency response, because the storage and CPU requirements entailed by the repeated factorizations traditionally found in implicit codes rapidly overwhelm the available computing resources. With the advent of parallel processing, this trend is accelerating because explicit schemes are also easier to parallelize than implicit ones. However, the time step restriction imposed by the Courant stability condition on all explicit schemes cannot yet -- and perhaps will never -- be offset by the speed of parallel hardware. Therefore, it is essential to develop efficient and robust alternatives to direct methods that are also amenable to massively parallel processing because implicit codes using unconditionally stable time-integration algorithms are computationally more efficient when simulating low-frequency dynamics. Here we present a domain decomposition method for implicit schemes that requires significantly less storage than factorization algorithms, that is several times faster than other popular direct and iterative methods, that can be easily implemented on both shared and local memory parallel processors, and that is both computationally and communication-wise efficient. The proposed transient domain decomposition method is an extension of the method of Finite Element Tearing and Interconnecting (FETI) developed by Farhat and Roux for the solution of static problems. Serial and parallel performance results on the CRAY Y-MP/8 and the iPSC-860/128 systems are reported and analyzed for realistic structural dynamics problems. These results establish the superiority of the FETI method over both the serial/parallel conjugate gradient algorithm with diagonal scaling and the serial/parallel direct method, and contrast the computational power of the iPSC-860/128 parallel processor with that of the CRAY Y-MP/8 system.

Farhat, Charbel↗

A transient FETI methodology for large-scale parallel implicit computations in structural mechanics, part 2

Explicit codes are often used to simulate the nonlinear dynamics of large-scale structural systems, even for low frequency response, because the storage and CPU requirements entailed by the repeated factorizations traditionally found in implicit codes rapidly overwhelm the available computing resources. With the advent of parallel processing, this trend is accelerating because explicit schemes are also easier to parallellize than implicit ones. However, the time step restriction imposed by the Courant stability condition on all explicit schemes cannot yet and perhaps will never be offset by the speed of parallel hardware. Therefore, it is essential to develop efficient and robust alternatives to direct methods that are also amenable to massively parallel processing because implicit codes using unconditionally stable time-integration algorithms are computationally more efficient than explicit codes when simulating low-frequency dynamics. Here we present a domain decomposition method for implicit schemes that requires significantly less storage than factorization algorithms, that is several times faster than other popular direct and iterative methods, that can be easily implemented on both shared and local memory parallel processors, and that is both computationally and communication-wise efficient. The proposed transient domain decomposition method is an extension of the method of Finite Element Tearing and Interconnecting (FETI) developed by Farhat and Roux for the solution of static problems. Serial and parallel performance results on the CRAY Y-MP/8 and the iPSC-860/128 systems are reported and analyzed for realistic structural dynamics problems. These results establish the superiority of the FETI method over both the serial/parallel conjugate gradient algorithm with diagonal scaling and the serial/parallel direct method, and contrast the computational power of the iPSC-860/128 parallel processor with that of the CRAY Y-MP/8 system.

Farhat, Charbel↗