Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Computational Complexity”

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 937 records · Page 52
All sourcesNASA NTRSDOE OSTI
NASA NTRS1987

A Lanczos eigenvalue method on a parallel computer

Eigenvalue analyses of complex structures is a computationally intensive task which can benefit significantly from new and impending parallel computers. This study reports on a parallel computer implementation of the Lanczos method for free vibration analysis. The approach used here subdivides the major Lanczos calculation tasks into subtasks and introduces parallelism down to the subtask levels such as matrix decomposition and forward/backward substitution. The method was implemented on a commercial parallel computer and results were obtained for a long flexible space structure. While parallel computing efficiency for the Lanczos method was good for a moderate number of processors for the test problem, the greatest reduction in time was realized for the decomposition of the stiffness matrix, a calculation which took 70 percent of the time in the sequential program and which took 25 percent of the time on eight processors. For a sample calculation of the twenty lowest frequencies of a 486 degree of freedom problem, the total sequential computing time was reduced by almost a factor of ten using 16 processors.

Bostic, Susan W.↗
NASA NTRS1987

A Lanczos eigenvalue method on a parallel computer

Eigenvalue analyses of complex structures is a computationally intensive task which can benefit significantly from new and impending parallel computers. This study reports on a parallel computer implementation of the Lanczos method for free vibration analysis. The approach used here subdivides the major Lanczos calculation tasks into subtasks and introduces parallelism down to the subtask levels such as matrix decomposition and forward/backward substitution. The method was implemented on a commercial parallel computer and results were obtained for a long flexible space structure. While parallel computing efficiency is problem and computer dependent, the efficiency for the Lanczos method was good for a moderate number of processors for the test problem. The greatest reduction in time was realized for the decomposition of the stiffness matrix, a calculation which took 70 percent of the time in the sequential program and which took 25 percent of the time on eight processors. For a sample calculation of the twenty lowest frequencies of a 486 degree of freedom problem, the total sequential computing time was reduced by almost a factor of ten using 16 processors.

Bostic, Susan W.↗
NASA NTRS1976

Computer Program for Calculation of Complex Chemical Equilibrium Compositions, Rocket Performance, Incident and Reflected Shocks, and Chapman-Jouguet Detonations. Interim Revision, March 1976

A detailed description of the equations and computer program for computations involving chemical equilibria in complex systems is given. A free-energy minimization technique is used. The program permits calculations such as (1) chemical equilibrium for assigned thermodynamic states (T,P), (H,P), (S,P), (T,V), (U,V), or (S,V), (2) theoretical rocket performance for both equilibrium and frozen compositions during expansion, (3) incident and reflected shock properties, and (4) Chapman-Jouguet detonation properties. The program considers condensed species as well as gaseous species.

Sanford Gordon↗
NASA NTRS1983

User's guide for a computer program for calculating the zero-lift wave drag of complex aircraft configurations

A computer program was developed to extend the geometry input capabilities of previous versions of a supersonic zero lift wave drag computer program. The arbitrary geometry input description is flexible enough to describe almost any complex aircraft concept, so that highly accurate wave drag analysis can now be performed because complex geometries can be represented accurately and do not have to be modified to meet the requirements of a restricted input format.

Craidon, C. B.↗
NASA NTRS1984

Computer program for calculation of complex chemical equilibrium compositions and applications. Supplement 1: Transport properties

An addition to the computer program of NASA SP-273 is given that permits transport property calculations for the gaseous phase. Approximate mixture formulas are used to obtain viscosity and frozen thermal conductivity. Reaction thermal conductivity is obtained by the same method as in NASA TN D-7056. Transport properties for 154 gaseous species were selected for use with the program.

Gordon, S.↗
NASA NTRS2014

Path Toward a Unifid Geometry for Radiation Transport

The Direct Accelerated Geometry for Radiation Analysis and Design (DAGRAD) element of the RadWorks Project under Advanced Exploration Systems (AES) within the Space Technology Mission Directorate (STMD) of NASA will enable new designs and concepts of operation for radiation risk assessment, mitigation and protection. This element is designed to produce a solution that will allow NASA to calculate the transport of space radiation through complex computer-aided design (CAD) models using the state-of-the-art analytic and Monte Carlo radiation transport codes. Due to the inherent hazard of astronaut and spacecraft exposure to ionizing radiation in low-Earth orbit (LEO) or in deep space, risk analyses must be performed for all crew vehicles and habitats. Incorporating these analyses into the design process can minimize the mass needed solely for radiation protection. Transport of the radiation fields as they pass through shielding and body materials can be simulated using Monte Carlo techniques or described by the Boltzmann equation, which is obtained by balancing changes in particle fluxes as they traverse a small volume of material with the gains and losses caused by atomic and nuclear collisions. Deterministic codes that solve the Boltzmann transport equation, such as HZETRN [high charge and energy transport code developed by NASA Langley Research Center (LaRC)], are generally computationally faster than Monte Carlo codes such as FLUKA, GEANT4, MCNP(X) or PHITS; however, they are currently limited to transport in one dimension, which poorly represents the secondary light ion and neutron radiation fields. NASA currently uses HZETRN space radiation transport software, both because it is computationally efficient and because proven methods have been developed for using this software to analyze complex geometries. Although Monte Carlo codes describe the relevant physics in a fully three-dimensional manner, their computational costs have thus far prevented their widespread use for analysis of complex CAD models, leading to the creation and maintenance of toolkit-specific simplistic geometry models. The work presented here builds on the Direct Accelerated Geometry Monte Carlo (DAGMC) toolkit developed for use with the Monte Carlo N-Particle (MCNP) transport code. The workflow for achieving radiation transport on CAD models using MCNP and FLUKA has been demonstrated and the results of analyses on realistic spacecraft/habitats will be presented. Future work is planned that will further automate this process and enable the use of multiple radiation transport codes on identical geometry models imported from CAD. This effort will enhance the modeling tools used by NASA to accurately evaluate the astronaut space radiation risk and accurately determine the protection provided by as-designed exploration mission vehicles and habitats

Lee, Kerry↗
DOE OSTI2025

Gate-Based Quantum Simulation of Gaussian Bosonic Circuits on Exponentially Many Modes

We introduce a framework for simulating, on an ( n + 1 )-qubit quantum computer, the action of a Gaussian bosonic (GB) circuit on a state over 2 n modes. Specifically, we encode the initial bosonic state’s expectation values over quadrature operators (and their covariance matrix) as an input qubit state. This is then evolved by a quantum circuit that effectively implements the symplectic propagators induced by the GB gates. We find families of GB circuits and initial states leading to efficient quantum simulations. For this purpose, we introduce a dictionary that maps between GB and qubit gates such that particle- (non-particle-) preserving GB gates lead to real- (imaginary-) time evolutions at the qubit level. For the special case of particle-preserving circuits, we present a bounded-error-quantum-polynomial time (BQP)-complete GB decision problem, indicating that GB evolutions of Gaussian states on exponentially many modes are as powerful as universal quantum computers. We also perform numerical simulations of an interferometer on ∼ 8 × 10 9 modes, illustrating the power of our framework. Published by the American Physical Society 2025

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2019

A Hybrid Approach for Solving Optimization Problems on Small Quantum Computers

Solving larger-sized problems is an important area of research in quantum computing. Designing hybrid quantum-classical algorithms is a promising approach to solving this. We discuss decomposition-based hybrid approaches for solving optimization problems and demonstrate them for applications related to community detection.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

ASCR@40: Four Decades of Department of Energy Leadership in Advanced Scientific Computing Research

Throughout its long history, the Office of Advanced Scientific Computing Research (ASCR) has built the critical technologies to ensure U.S. leadership in energy science and national security. It has made its parent agency, the Department of Energy (DOE) and its Office of Science, the world’s recognized leader in computational science. ASCR’s stated mission is “to discover, develop, and deploy computational and networking capabilities to analyze, model, simulate, and predict complex phenomena important to the DOE.” To accomplish this goal, ASCR oversees a large complex of computing and networking facilities and is responsible for procuring, deploying and operating high-performance computing (HPC), networking and storage resources; conducting basic research in mathematics and computer science; developing and sustaining a large body of software; and collaborating with other Office of Science programs, academia and industry. ASCR’s computational science leadership has a long history, predating even DOE’s inception. Applied mathematics and advanced computing were both elements of the Manhattan Project’s Theoretical Division. In the 1950s, DOE’s predecessor, the Atomic Energy Commission, created a mathematics program to develop and apply digital computing by supporting researchers at universities and AEC laboratories. Several organizational and name changes later, this program would grow and become ASCR.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1974

A comparison of computational methods and algorithms for the complex gamma function

A survey and comparison of some computational methods and algorithms for gamma and log-gamma functions of complex arguments are presented. Methods and algorithms reported include Chebyshev approximations, Pade expansion and Stirling's asymptotic series. The comparison leads to the conclusion that Algorithm 421 published in the Communications of ACM by H. Kuki is the best program either for individual application or for the inclusion in subroutine libraries.

Ng, E. W.↗
NASA NTRS2012

Methods for Computationally Efficient Structured CFD Simulations of Complex Turbomachinery Flows

This research presents more efficient computational methods by which to perform multi-block structured Computational Fluid Dynamics (CFD) simulations of turbomachinery, thus facilitating higher-fidelity solutions of complicated geometries and their associated flows. This computational framework offers flexibility in allocating resources to balance process count and wall-clock computation time, while facilitating research interests of simulating axial compressor stall inception with more complete gridding of the flow passages and rotor tip clearance regions than is typically practiced with structured codes. The paradigm presented herein facilitates CFD simulation of previously impractical geometries and flows. These methods are validated and demonstrate improved computational efficiency when applied to complicated geometries and flows.

Herrick, Gregory P.↗
DOE OSTI2023

Cloud Services Enable Efficient AI-Guided Simulation Workflows across Heterogeneous Resources

Applications which fuse machine learning and simulation are rarely best served by a single computing resource. Highly parallel simulation codes are best deployed on super- computers, while AI tasks used to decide which simulations to perform may be best suited to specialized accelerators. Here we present a Function-as-a-Service (FaaS) system for executing complex, distributed computational campaigns that achieves performance parity with conventional workflow systems without the complexities of secure network connections between compute providers. One innovation enabling high performance is a subsystem that directly moves task data between sites, separate from the cloud-hosted FaaS system used to distribute task instructions. We also introduce a flexible scheduling system that allows us access factor of 2 trade offs between the amount of resources required to solve a problem at each compute site. We anticipate that this system will upgrade multi-site applications from demonstration projects to routine practice in computational science.

Ward, Logan↗
DOE OSTI2015

PANORAMA: An approach to performance modeling and diagnosis of extreme-scale workflows

Here we report that computational science is well established as the third pillar of scientific discovery and is on par with experimentation and theory. However, as we move closer toward the ability to execute exascale calculations and process the ensuing extreme-scale amounts of data produced by both experiments and computations alike, the complexity of managing the compute and data analysis tasks has grown beyond the capabilities of domain scientists. Therefore, workflow management systems are absolutely necessary to ensure current and future scientific discoveries. A key research question for these workflow management systems concerns the performance optimization of complex calculation and data analysis tasks. The central contribution of this article is a description of the PANORAMA approach for modeling and diagnosing the run-time performance of complex scientific workflows. This approach integrates extreme-scale systems testbed experimentation, structured analytical modeling, and parallel systems simulation into a comprehensive workflow framework called Pegasus for understanding and improving the overall performance of complex scientific workflows.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

On-line Generation and Error Handling for Surrogate Models within Multifidelity Uncertainty Quantification

Uncertainty quantification is recognized as a fundamental task to obtain predictive numerical simulations. However, many realistic engineering applications require complex and computationally expensive high-fidelity numerical simulations for the accurate characterization of the system responses. Moreover, complex physical models and extreme operative conditions can easily lead to hundreds of uncertain parameters that need to be propagated through high-fidelity codes. Under these circumstances, a single fidelity approach, i.e. a workflow that only uses high-fidelity simulations to perform the uncertainty quantification task, is unfeasible due to the prohibitive overall computational cost. In recent years, multifidelity strategies have been introduced to overcome this issue. The core idea of this family of methods is to combine simulations with varying levels of fidelity/accuracy in order to obtain the multifidelity estimators or surrogates with the same accuracy of their single fidelity counterparts at a much lower computational cost. This goal is usually accomplished by defining a prioria sequence of discretization levels or physical modeling assumptions that can be used to decrease the complexity of a numerical realization and thus its computational cost. However ,less attention has been dedicated to low-fidelity models that can be built directly from the small number of high-fidelity simulations available. In this work we focus our attention on Reduced-Order Models that can be considered a particular class of data-driven approaches. Our main goal is to explore the combination of multifidelity uncertainty quantification and reduced-order models to obtain an efficient framework for propagating uncertainties through expensive numerical codes.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1974

SUSSA ACTS: A computer program for steady and unsteady, subsonic and supersonic aerodynamics for aerospace complex transportation systems

The computer program SUSSA ACTS (Steady and Unsteady, Subsonic and Supersonic Aerodynamics for Complex Transportation Systems) are presented in the final version. The numerical formulation and the description of the program and numerical results are included. In particular, generalized forces for fully unsteady (complex frequency) aerodynamics for a wing-body configuration, in both subsonic and supersonic flows, are discussed. The mathematical analysis includes completely arbitrary motion. The numerical implementation was limited to steady and oscillatory flows. A more general aerodynamic formulation in the form of a fully transient response for time-domain analysis and the aerodynamic transfer function (Laplace transform of the fully unsteady operator) for frequency-domain analysis is outlined.

Tseng, K.↗
DOE OSTI2026

Synthesis and Computational Analysis of Uranium(III)-Pnictogen Bonds

In this report, we describe the synthesis and characterization of two novel complexes that contain uranium(III)-pnictogen (P: 1-PMes 2 ; As: 1-AsMes 2 ) bonds to elucidate the degrees of covalency among these bonds. To our knowledge, this is the first reported uranium(III)-arsenic complex to be synthesized and characterized. Analysis of the phosphorus and arsenic bonds reveals a similar electronic environment, assessed by UV–vis NIR, that is comparable to other previously reported uranium(III) complexes. A computational analysis of these compounds and their congeners, N, Sb, and Bi, was performed to identify trends in the overall bonding character of the complexes. This analysis shows that bond covalency decreases as the pnictogen becomes heavier and that overall the interaction energy and its components decrease down the group. Here, this study provides an in-depth analysis and understanding of the nature of bonding between hard actinide and soft pnictogen centers.

Actinides↗
DOE OSTI2024

Parameter identification methods for low-order gray box building energy models: A critical review

The body of knowledge on gray box building energy modeling (GBBEM) has been developed over the past few decades and has undergone some important changes recently. Starting with simple methods and simple buildings, the science of GBBEM has grown to encompass complex and more computationally intensive techniques and complex commercial buildings. Numerous works including a recent review have considered model structure and inputs in a nearly systematic way, but no extant work systematically reviews the approaches for GBBEM parameter search initialization and final identification, despite this being arguably the most difficult and impactful part of the modeling process. To this end, we critically review 55 extant works describing advantages, limitations, and domain of applicability of several classes of parameter initialization and optimization techniques specifically for GBBEM. We categorize the classes of methods and analyze the evidence of their applicability for different applications within the field of GBBEM. We find an emerging consensus that initialization of parameter searches for anything other than the simplest building elements is often challenging and sometimes requires a stochastic approach to begin the parameter identification process. After this initial process, faster methods have been used in some cases but often the nature of the problem requires stochastic methods for this portion of the process as well. For less complex systems, more deterministic and efficient methods have been shown to be effective. Finally, we draw conclusions as to the domain of applicability of different classes of initialization and optimization techniques for GBBEEM and offer suggestions for research directions that are likely to prove fruitful.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗