SEARCH · Engineering Papers

Results for “complex computing”

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.

SourceResearch connectionFrom yearThrough year

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

At least 1,711 records · Page 95

All sources NASA NTRS DOE OSTI

NASA NTRSDate not supplied

Gradient-Enhanced Reliability Analysis of Transonic Aeroelastic Flutter

Reliability computation for transonic aeroelastic systems is a challenging task, given the complex physical mechanisms involved, and broader challenges associated with computing small probabilities of failure/flutter. This paper demonstrates the use of four different reliability estimation tools, with a particular focus on tools that can utilize gradient information: the derivative of flutter boundaries with respect to random parametric inputs. Results are shown for two test cases: the AGARD 445.6 case and the Common Research Model, and the strength and weaknesses of each UQ tool are compared in terms of cost and accuracy. Two of the UQ tools used here require gradients as part of a search process, but the other two are sample-based, and are able to leverage the existence of gradients for improved performance.

Bret K Stanford↗

DOE OSTI2025

Evaluating Chemical Kinetics Predictions for Propane Using 3-D and 0-D Models in a Boosted Spark-Ignited Engine

Propane has been shown to be a promising alternative fuel to reduce emissions while simultaneously achieving high efficiencies in medium- and heavy-duty engines. These high-power density applications require boosted engines which, combined with high compression ratio, can lead to auto-ignition and knock. While three-dimensional (3-D) computational fluid dynamics (CFD) models are often used for resolving the complex fluid flow in engines, these models can become computationally expensive when simulating detailed chemical kinetics. Likewise, zero-dimensional (0-D) models are computationally concise enough for kinetics development, but lack any flow-field information which governs the flame propagation processes in spark ignition (SI) engines. This work presents a comprehensive comparison between 3-D and 0-D closed cycle simulations at knocking conditions in a high compression ratio high stroke-to-bore ratio propane engine. In order to initialize the flow-field for the 3-D closed cycle (intake valve closing, (IVC) to exhaust valve opening, (EVO)) simulation, a motored multi-cycle 3-D model was run using Converge to create a map at IVC, reducing the computational time. The map allowed a non-homogeneous 3-D closed cycle simulation to be satisfactorily validated against experiments, while a homogeneous case using only the turbulence field mapping was also simulated, mimicking 0-D modeling. The 3-D simulations were used to prescribe the initial conditions (e.g., IVC thermodynamics, speciation, burn-rate profile) for a 2-zone 0-D SI engine model in Chemkin Pro for both cases. It was found that 2-zone 0-D modeling underpredicted the knock onset timing, likely due to the lack of thermal stratification in the unburned gas region. Future work will carry multi-zone 0-D modeling to capture the fuel auto-ignition in the unburned region.

Douvry-Rabjeau, Julien [Oakland University, Roches↗

NASA NTRSDate not supplied

GlennICE 2.2 Capabilities and Results

GlennICE (Glenn Icing Computational Environment) is a computational tool designed to calculate ice growth on complex three-dimensional geometries using the input from a user-supplied computational fluid dynamics (CFD) solution for the geometry of interest. The NASA John H. Glenn Research Center at Lewis Field is developing this tool to aid those evaluating, designing and certifying aircraft, engines, and aircraft components for flight in icing conditions. This domestically available software is being developed to enable the introduction of new icing physics into a computational environment in a manner that is open for evaluation and eventual use by industry, academia, and other government organizations. This paper will document the current capabilities for version 2.1 of this software and provide example cases with comparison to available experimental data.

Icing↗

NASA NTRSDate not supplied

GlennICE 2.2 Capabilities and Results

Icing↗

NASA NTRSDate not supplied

Scalability of GlennICE in a Parallel Environment

The Glenn Icing Computational Environment (GlennICE) is a computational tool designed to calculate ice growth on complex three-dimensional geometries using the input from a user-supplied computational fluid dynamics (CFD) solution for the geometry of interest. The most significant developments in the advancement of GlennICE have been investigating the convergence of the collection efficiency, efficiently finding trajectories, and improving the refinement methodology. Such developments have increased the efficiency of GlennICE for practical engineering application. With the increasing demand for applying GlennICE for more memory-intensive problems, the scalability of GlennICE has yet to be investigated. This paper is aimed at presenting a method to benchmark the scalability of GlennICE utilizing a relevant engineering problem within a parallel environment. This leads to the final goal of investigating whether an increase in the number of processors utilized results in a linear speedup of the GlennICE software.

Computational Icing, Icing, CFD, MPI↗

NASA NTRS2024

GlennICE Manual 4.1.0

Icing↗

DOE OSTI2022

Quantifying transport and electrocatalytic reaction processes in a gastight rotating cylinder electrode reactor via integration of Computational Fluid Dynamics modeling and experiments

Understanding the complexity of the multiple processes of mass, momentum, charge, and heat transport, and how these affect reaction kinetics at the electrode/electrolyte interface is one of the major challenges in the field of energy and catalysis. The rapid and rational scale-up of electrocatalytic systems to industrial scales require a detailed understanding of nonlinear transport-reaction processes, accessible only through the building of multi-physics models that capture with high fidelity the complexity of real-world devices. The gastight rotating cylinder electrode (RCE) reactor is a promising lab-scale tool that can decouple transport from intrinsic kinetics to generate data for first-principle models useful in the design of industrial, electrochemical reactors. Computational Fluid Dynamics (CFD) studies have previously been used to investigate the bulk flow in RCE reactors for simple corrosion and electroplating processes. However, the quantification of changes in local concentration within the viscous layer where catalysis takes place requires capturing the correct flow conditions inside the hydrodynamic boundary layer near the surface of the electrode. Further, this requires simulations with spatial resolution in the nm and μm scale and temporal resolutions between ms and s scales that are similar to the timescales for reactions on the electrode surface. In this study, experimental electrocatalysis is combined with CFD modeling to elucidate and parameterize the hydrodynamics in a gastight RCE reactor. CFD simulations of the electrochemical ferricyanide reduction reaction under mass transport limited conditions are used to evaluate the validity of the CFD model parameters by comparing calculated dimensionless mass transport descriptors to dimensionless correlations obtained experimentally. Justifications for assumptions and details of the simulation methods used in this study are presented to provide a detailed understanding of the effect that each model parameter has on the ability to accurately simulate electrocatalysis in RCE systems. The simulation methodology reported here is a first step towards the development of multi-scale models for the study of transport dependent electrocatalytic processes, such as the electrochemical transformation of CO 2 to fuels and chemicals.

42 ENGINEERING↗

DOE OSTI2023

A gated graph transformer for protein complex structure quality assessment and its performance in CASP15

Abstract Motivation Proteins interact to form complexes to carry out essential biological functions. Computational methods such as AlphaFold-multimer have been developed to predict the quaternary structures of protein complexes. An important yet largely unsolved challenge in protein complex structure prediction is to accurately estimate the quality of predicted protein complex structures without any knowledge of the corresponding native structures. Such estimations can then be used to select high-quality predicted complex structures to facilitate biomedical research such as protein function analysis and drug discovery. Results In this work, we introduce a new gated neighborhood-modulating graph transformer to predict the quality of 3D protein complex structures. It incorporates node and edge gates within a graph transformer framework to control information flow during graph message passing. We trained, evaluated and tested the method (called DProQA) on newly-curated protein complex datasets before the 15th Critical Assessment of Techniques for Protein Structure Prediction (CASP15) and then blindly tested it in the 2022 CASP15 experiment. The method was ranked 3rd among the single-model quality assessment methods in CASP15 in terms of the ranking loss of TM-score on 36 complex targets. The rigorous internal and external experiments demonstrate that DProQA is effective in ranking protein complex structures. Availability and implementation The source code, data, and pre-trained models are available at https://github.com/jianlin-cheng/DProQA.

59 BASIC BIOLOGICAL SCIENCES↗

NASA NTRS1989

CFD analysis for high speed inlets

The increased national interest in high speed flight has increased research for high speed propulsion components. The highly 3-D flows present in supersonic/hypersonic inlets are currently being studied at NASA-Lewis both experimentally and computationally using a family of steady Parabolized Navier-Stokes (PNS) and Navier-Stokes (NS) solvers and unsteady NS solvers. Some of the results of these efforts are presented with an emphasis on the comparison of the computational and experimental results. The flow in high speed inlets typically involves the interaction of compression shock waves and boundary layers on the internal surfaces. The fundamentals of these interactions have been studied experimentally for many years, while more recently, computations have been used to study these complex 3-D flow fields. Attempts to control the flow through boundary layer bleed are being investigated computationally prior to wind tunnel experiments. The ultimate goal is the higher performing inlets required for high speed flight.

Benson, Tom↗

NASA NTRS1992

Software Surface Modeling and Grid Generation Steering Committee

It is a NASA objective to promote improvements in the capability and efficiency of computational fluid dynamics. Grid generation, the creation of a discrete representation of the solution domain, is an essential part of computational fluid dynamics. However, grid generation about complex boundaries requires sophisticated surface-model descriptions of the boundaries. The surface modeling and the associated computation of surface grids consume an extremely large percentage of the total time required for volume grid generation. Efficient and user friendly software systems for surface modeling and grid generation are critical for computational fluid dynamics to reach its potential. The papers presented here represent the state-of-the-art in software systems for surface modeling and grid generation. Several papers describe improved techniques for grid generation.

Smith, Robert E.↗

NASA NTRS1995

Program Helps To Determine Chemical-Reaction Mechanisms

General Chemical Kinetics and Sensitivity Analysis (LSENS) computer code developed for use in solving complex, homogeneous, gas-phase, chemical-kinetics problems. Provides for efficient and accurate chemical-kinetics computations and provides for sensitivity analysis for variety of problems, including problems involving honisothermal conditions. Incorporates mathematical models for static system, steady one-dimensional inviscid flow, reaction behind incident shock wave (with boundary-layer correction), and perfectly stirred reactor. Computations of equilibrium properties performed for following assigned states: enthalpy and pressure, temperature and pressure, internal energy and volume, and temperature and volume. Written in FORTRAN 77 with exception of NAMELIST extensions used for input.

Bittker, D. A.↗

DOE OSTI2025

A fault-tolerant neutral-atom architecture for universal quantum computation

Quantum error correction (QEC) is essential for the realization of large-scale quantum computers. However, owing to the complexity of operating on the encoded ‘logical’ qubits, understanding the physical principles for building fault-tolerant quantum devices and combining them into efficient architectures is an outstanding scientific challenge. Here we use reconfigurable arrays of up to 448 neutral atoms to implement the key elements of a universal, fault-tolerant quantum processing architecture and experimentally explore their underlying working mechanisms. We first use surface codes to study how repeated QEC suppresses errors, demonstrating 2.14(13)x below-threshold performance in a four-round characterization circuit by leveraging atom loss detection and machine learning decoding. We then investigate logical entanglement using transversal gates and lattice surgery and extend it to universal logic through transversal teleportation with three-dimensional [[15,1,3]] codes, enabling arbitrary-angle synthesis with polylogarithmic overhead. Finally, we develop mid-circuit qubit reuse16, increasing experimental cycle rates by two orders of magnitude and enabling deep-circuit protocols with dozens of logical qubits and hundreds of logical teleportations with [[7,1,3]] and high-rate [[16,6,4]] codes while maintaining constant internal entropy. Our experiments show key principles for efficient architecture design, involving the interplay between quantum logic and entropy removal, judiciously using physical entanglement in logic gates and magic state generation, and leveraging teleportations for universality and physical qubit reset. These results establish foundations for scalable, universal error-corrected processing and its practical implementation in neutral atom systems.

atomic and molecular physics↗

NASA NTRS2020

Investigating Local Buckling and Plastic Collapse in Multifunctional Sandwich Composite Cores using a Unit Cell Method

The primary goal of developing analytical models of composite sandwich cores has been to obtain simple expressions for elastic and failure response to improve the rapid analysis of composite structures. An earlier investigation by the authors was made to verify the accuracy of widely-used analytical models that calculate equivalent elastic moduli of a uniform homogeneous single layer of material in place of the complex honeycomb core properties in sandwich composites. This transformation of elastic properties permits a coarsening of the finite element model (FEM) of the core to a fraction of the computational cost in simulating the original complex core architecture. In addition, the core was assumed constructed of multi-layered isotropic walls to support potential additional functionality beyond simple load-carrying capability.

Erik Saether↗

NASA NTRS2009

Computing Bounds on Resource Levels for Flexible Plans

A new algorithm efficiently computes the tightest exact bound on the levels of resources induced by a flexible activity plan (see figure). Tightness of bounds is extremely important for computations involved in planning because tight bounds can save potentially exponential amounts of search (through early backtracking and detection of solutions), relative to looser bounds. The bound computed by the new algorithm, denoted the resource-level envelope, constitutes the measure of maximum and minimum consumption of resources at any time for all fixed-time schedules in the flexible plan. At each time, the envelope guarantees that there are two fixed-time instantiations one that produces the minimum level and one that produces the maximum level. Therefore, the resource-level envelope is the tightest possible resource-level bound for a flexible plan because any tighter bound would exclude the contribution of at least one fixed-time schedule. If the resource- level envelope can be computed efficiently, one could substitute looser bounds that are currently used in the inner cores of constraint-posting scheduling algorithms, with the potential for great improvements in performance. What is needed to reduce the cost of computation is an algorithm, the measure of complexity of which is no greater than a low-degree polynomial in N (where N is the number of activities). The new algorithm satisfies this need. In this algorithm, the computation of resource-level envelopes is based on a novel combination of (1) the theory of shortest paths in the temporal-constraint network for the flexible plan and (2) the theory of maximum flows for a flow network derived from the temporal and resource constraints. The measure of asymptotic complexity of the algorithm is O(N O(maxflow(N)), where O(x) denotes an amount of computing time or a number of arithmetic operations proportional to a number of the order of x and O(maxflow(N)) is the measure of complexity (and thus of cost) of a maximumflow algorithm applied to an auxiliary flow network of 2N nodes. The algorithm is believed to be efficient in practice; experimental analysis shows the practical cost of maxflow to be as low as O(N1.5). The algorithm could be enhanced following at least two approaches. In the first approach, incremental subalgorithms for the computation of the envelope could be developed. By use of temporal scanning of the events in the temporal network, it may be possible to significantly reduce the size of the networks on which it is necessary to run the maximum-flow subalgorithm, thereby significantly reducing the time required for envelope calculation. In the second approach, the practical effectiveness of resource envelopes in the inner loops of search algorithms could be tested for multi-capacity resource scheduling. This testing would include inner-loop backtracking and termination tests and variable and value-ordering heuristics that exploit the properties of resource envelopes more directly.

Muscvettola, Nicola↗

DOE OSTI2020

Modular performance prediction for scientific workflows using Machine Learning

Scientific workflows provide an opportunity for declarative computational experiment design in an intuitive and efficient way. A distributed workflow is typically executed on a variety of resources, and it uses a variety of computational algorithms or tools to achieve the desired outcomes. Such a variety imposes additional complexity in scheduling these workflows on large scale computers. As computation becomes more distributed, insights into expected workload that a workflow presents become critical for effective resource allocation. In this paper, we present a modular framework that leverages Machine Learning for creating precise performance predictions of a workflow. The central idea is to partition a workflow in such a way that makes the task of forecasting each atomic unit manageable and gives us a way to combine the individual predictions efficiently. We recognize a combination of an executable and a specific physical resource as a single module. This gives us a handle to characterize workload and machine power as a single unit of prediction. Overall, our modular technique of creating atomic modules and deployment of longest-path approach to estimate workflow performance, allows the framework to adapt to highly complex nested directed acyclic workflows and scale to new scenarios, since it does not make assumptions of underlying workflow structure. We present performance estimation results of independent workflow modules executed on the XSEDE SDSC Comet cluster using various Machine Learning algorithms. The results provide insights into the behavior and effectiveness of different algorithms in the context of scientific workflow performance prediction.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1991

Development of a pressure based multigrid solution method for complex fluid flows

In order to reduce the computational difficulty associated with a single grid (SG) solution procedure, the multigrid (MG) technique was identified as a useful means for improving the convergence rate of iterative methods. A full MG full approximation storage (FMG/FAS) algorithm is used to solve the incompressible recirculating flow problems in complex geometries. The algorithm is implemented in conjunction with a pressure correction staggered grid type of technique using the curvilinear coordinates. In order to show the performance of the method, two flow configurations, one a square cavity and the other a channel, are used as test problems. Comparisons are made between the iterations, equivalent work units, and CPU time. Besides showing that the MG method can yield substantial speed-up with wide variations in Reynolds number, grid distributions, and geometry, issues such as the convergence characteristics of different grid levels, the choice of convection schemes, and the effectiveness of the basic iteration smoothers are studied. An adaptive grid scheme is also combined with the MG procedure to explore the effects of grid resolution on the MG convergence rate as well as the numerical accuracy.

Shyy, Wei↗

DOE OSTI2021

A practical extension of the recursive multi-fidelity model for the emulation of hole closure experiments

We report in regimes of high strain rate, the strength of materials often cannot be measured directly in experiments. Instead, the strength is inferred based on an experimental observable, such as a change in shape, that is matched by simulations supported by a known strength model. In hole closure experiments, the rate and degree to which a central hole in a plate of material closes during a dynamic loading event are used to infer material strength parameters. Due to the complexity of the experiment, many computationally expensive, three-dimensional simulations are necessary to train an emulator for calibration or other analyses. These simulations can be run at multiple grid resolutions, where dense grids are slower but more accurate. In an effort to reduce the computational cost, a combination of simulations with different resolutions can be combined to develop an accurate emulator within a limited training time. We explore the novel design and construction of an appropriate functional recursive multi-fidelity emulator of a strength model for tantalum in hole closure experiments that can be applied to arbitrarily large training data. Hence, by formulating a multi-fidelity model to employ low-fidelity simulations, we were able to reduce the error of our emulator by approximately 81% with only an approximately 1.6% increase in computing resource utilization.

36 MATERIALS SCIENCE↗

DOE OSTI2026

Multipoint Aerostructural Optimization of Wind Turbine Rotors Using a Coupled Blade‐Resolved Aerostructural Solver

Physics‐based design optimization workflows thread the needle between computational cost limitations and simulation complexity, often compromising between modeling detail and the range of operating design conditions. Multipoint aerostructural optimization of wind turbine rotors has so far been confined to low‐fidelity analyses or to high‐fidelity studies with simplified structural models, leaving the most complex design trade‐offs unexplored. We close this gap by performing the first tightly coupled gradient‐based multipoint aerostructural rotor optimization using 3D aerodynamic and structural solvers with discrete coupled adjoints. The optimizer simultaneously varies blade planform, airfoil shapes, and structural thickness through more than 270 design variables, minimizing a weighted combination of rotor mass and power across multiple wind speeds. Applied to a modified DTU 10‐MW benchmark under conservative structural and aerodynamic constraints, our multipoint optimization reduces rotor mass by up to 36% and increases power by 12%–15% across the main operating conditions; biasing the objective toward power yields power gains up to 18% and a 17% mass reduction. For a nominal wind distribution, 3‐point rotor designs accounting for low RPM and high thrust conditions capture dominant trade‐offs and outperform single‐point designs. Adding two off‐design points changes individual‐condition power by less than 3% but leaves the weighted average within 0.5%, and the mass‐power bias has a stronger effect on the final design than the operating‐point weighting itself. Our framework extends naturally to richer load cases and site‐specific wind distributions, providing a basis for high‐fidelity multipoint design earlier in industrial workflows.

17 WIND ENERGY↗