Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computational tractability”

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 145 records · Page 8
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Chaotic neural dynamics facilitate probabilistic computations through sampling

Cortical neurons exhibit highly variable responses over trials and time. Theoretical works posit that this variability arises potentially from chaotic network dynamics of recurrently connected neurons. Here, we demonstrate that chaotic neural dynamics, formed through synaptic learning, allow networks to perform sensory cue integration in a sampling-based implementation. We show that the emergent chaotic dynamics provide neural substrates for generating samples not only of a static variable but also of a dynamical trajectory, where generic recurrent networks acquire these abilities with a biologically plausible learning rule through trial and error. Furthermore, the networks generalize their experience in the stimulus-evoked samples to the inference without partial or all sensory information, which suggests a computational role of spontaneous activity as a representation of the priors as well as a tractable biological computation for marginal distributions. These findings suggest that chaotic neural dynamics may serve for the brain function as a Bayesian generative model.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2023

Motion Planning Algorithms for Safety and Quantum Computing Efficiency

Motion planning remains a fundamental problem in robotics. Sampling-based algorithms use randomization to allow efficient solutions to this complex problem. As mobile robots and autonomous vehicles become more prevalent in everyday life, motion planning must be applied to increasingly challenging scenarios. Safety has become a paramount concern in motion planning for ensuring robotic applications enrich human lives. To date, many motion planning techniques to increase safety in the face of uncertain and dynamic environments have been developed. This dissertation first addresses distributional safety of Rapidly-Exploring Random Trees (RRT) through our algorithm W-Safe RRT. To acknowledge distributional uncertainty and poor modeling, W-Safe RRT uses the Wasserstein metric to provide a probabilistic bound on the distributional distance between a robot and obstacles. Human-interpretable environmental agent classification allows online safety margin adaptation. We propose and analyze an integrating region method for online classification that increases actor labeling accuracy based on behavioral feature values when compared to state of the art methods. The method performs class assignments based on local maximum likelihood in a created behavioral feature-space, allowing a notion of classification uncertainty. Model-based methods with safety guarantees can quickly become computationally in tractable, especially with multiple agents, higher dimensions, and plentiful unknowns. Sampling based algorithms have been parallelized for computation with multi-core computers and GPUs. We consider the use of quantum algorithms and computers for sampling-based motion planning for the first time. Quantum computing performs operations on superpositions of states and can solve certain problems much more efficiently than classical computers, but introduces previously unseen challenges. With Quantum-RRT, we recast the motion planning problem into a database-search structure and use Quantum Amplitude Amplification to find reachable states in the database with a quadratic performance increase over classical methods. We address two error sources with this method: quantum measurement and quantum oracle errors. We then extend this method to Parallel Quantum-RRT, which uses a manager-worker architecture with multiple parallel quantum workers to increase database search efficiency. We compare algorithm architectures and characterize probabilities of multiple workers finding solutions. Lastly, we test in simulation the quantum algorithms against classical versions in a wide variety of scenarios, concluding that a similar parallelization improvement is to be found in the quantum case as was found in the parallelization of classical RRT.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1985

Computing three-dimensional incompressible flows with vortex elements

The techniques, capabilities and applicability of numerical models of three-dimensional, unsteady vortical flows with high Re are assessed. Vorticity is calculated only in appropriate regions and the velocity field is derived from the boundary conditions. Vorticity is assumed to take the shape of tubes with uniform core structures in the case of turbulence. The efforts being made to simplify equations for dense collections of vortex filaments in order to make them tractable to computer simulations are described. The effectiveness of vorticity arrow representations for accurately describing vorticity fields near surfaces is discussed, along with Lagrangian vortex elements, which may be of use in modelling the rotational part of flows around bluff bodies, nonuniform density flows and chemically reacting flows.

Leonard, A.↗
DOE OSTI2022

Output-weighted sampling for multi-armed bandits with extreme payoffs

We present a new type of acquisition function for online decision-making in multi-armed and contextual bandit problems with extreme payoffs. Specifically, we model the payoff function as a Gaussian process and formulate a novel type of upper confidence bound acquisition function that guides exploration towards the bandits that are deemed most relevant according to the variability of the observed rewards. This is achieved by computing a tractable likelihood ratio that quantifies the importance of the output relative to the inputs and essentially acts as an attention mechanism that promotes exploration of extreme rewards. Our formulation is supported by asymptotic zero-regret guarantees, and its performance is demonstrated across several synthetic benchmarks, as well as two realistic examples involving noisy sensor network data. Finally, we provide a JAX library for efficient bandit optimization using Gaussian processes.

Science & Technology - Other Topics↗
DOE OSTI2020

Quantum Machine Learning in High Energy Physics

Machine learning has been used in high energy physics for a long time, primarily at the analysis level with supervised classification. Quantum computing was postulated in the early 1980s as way to perform computations that would not be tractable with a classical computer. With the advent of noisy intermediate-scale quantum computing devices, more quantum algorithms are being developed with the aim at exploiting the capacity of the hardware for machine learning applications. An interesting question is whether there are ways to apply quantum machine learning to High Energy Physics. This paper reviews the first generation of ideas that use quantum machine learning on problems in high energy physics and provide an outlook on future applications.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2022

A Many-Body Perturbation Theory Approach to Energy Band Alignment at the Crystalline Tetracene–Silicon Interface

Hybrid inorganic–organic semiconductor (HIOS) interfaces are of interest for new photovoltaic devices operating above the Shockley–Queisser limit. Predicting energy band alignment at the interfaces is crucial for their design, but represents a challenging problem due to the large scales of the system, the energy precision required and a wide range of physical phenomena that occur at the interface. To tackle this problem, many-body perturbation theory in the non-self-consistent GW approximation, orbital relaxation corrections for organic semiconductors, and line-up potential method for inorganic semiconductors which allows for tractable and accurate computing of energy band alignment in crystalline van-der-Waals hybrid inorganic–organic semiconductor interfaces are used. In this work, crystalline tetracene physisorbed on the clean hydrogen-passivated 1 × 2 reconstructed (100) silicon surface is studied. Using this computational approach, it is found that the energy band alignment is determined by an interplay of the mutual dynamic dielectric screening of two materials and the formation of a dipole layer due to a weak hybridization of atomic/molecular orbitals at the interface. The significant role of the exchange-correlation effects in predicting band offsets for the hybrid inorganic–organic semiconductor interfaces is also emphasized.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2020

Averaged invariants in storage rings with synchrotron motion

In an ideal accelerator, the single-particle dynamics can be decoupled into transverse motion—the betatron oscillations— and longitudinal motion—the synchrotron oscillations. Chromatic and dispersive effects introduce a coupling between these dynamics, the so-called synchro-betatron coupling. We present an analysis of the fully coupled dynamics over a single synchrotron oscillation that leads to an averaged invariant with synchro-betatron coupling in a generic lattice. Here, we apply this analysis to two problems: first, a toy lattice where the computations are analytically tractable, then a design for a rapid cycling synchrotron built using the integrable optics described by Danilov and Nagaitsev, showing that although there is fairly complex behavior over the course of a synchrotron oscillation, the Danilov-Nagaitsev invariants are nevertheless periodic with the synchrotron motion.

43 PARTICLE ACCELERATORS↗
DOE OSTI2021

HIRM v1.0: a hybrid impulse response model for climate modeling and uncertainty analyses

Simple climate models (SCMs) are frequently used in research and decision-making communities because of their flexibility, tractability, and low computational cost. SCMs can be idealized, flexibly representing major climate dynamics as impulse response functions, or process-based, using explicit equations to model possibly nonlinear climate and Earth system dynamics. Each of these approaches has strengths and limitations. Here we present and test a hybrid impulse response modeling framework (HIRM) that combines the strengths of process-based SCMs in an idealized impulse response model, with HIRM's input derived from the output of a process-based model. This structure enables the model to capture some of the major nonlinear dynamics that occur in complex climate models as greenhouse gas emissions transform to atmospheric concentration to radiative forcing to climate change. As a test, the HIRM framework was configured to emulate the total temperature of the simple climate model Hector 2.0 under the four Representative Concentration Pathways and the temperature response of an abrupt 4 times CO 2 concentration step. HIRM was able to reproduce near-term and long-term Hector global temperature with a high degree of fidelity. Additionally, we conducted two case studies to demonstrate potential applications for this hybrid model: examining the effect of aerosol forcing uncertainty on global temperature and incorporating more process-based representations of black carbon into a SCM. The open-source HIRM framework has a range of applications including complex climate model emulation, uncertainty analyses of radiative forcing, attribution studies, and climate model development.

54 ENVIRONMENTAL SCIENCES↗
NASA NTRS1973

Reduction of truncation errors in modal analysis

A condensation method and computer program are described for large discrete parameter vibration analysis of complex structures that greatly reduces truncation errors and provides accurate definition of modes in a selected frequency range. A dynamic transformation is obtained from the partitioned equations of motion that relates modes not explicitly in the condensed solution to the retained modes at a selected system frequency. The generalized mass and stiffness matrices, obtained with existing modal synthesis methods, are reduced using this transformation and solved. Revised solutions are then obtained using new transformations at the calculated eigenvalues and are also used to assess the accuracy of the results. Computations are made tractable by simplified forms of the transformation that result with various modal synthesis methods. Three examples using the dynamic transformation in conjunction with a General Electric stiffness coupling method and the method of Craig and Bampton indicate large reductions in truncation errors and demonstrate the method for sequential groups of modes.

Kuhar, E. J.↗
NASA NTRS1988

Analytical modeling of the structureborne noise path on a small twin-engine aircraft

The structureborne noise path of a six passenger twin-engine aircraft is analyzed. Models of the wing and fuselage structures as well as the interior acoustic space of the cabin are developed and used to evaluate sensitivity to structural and acoustic parameters. Different modeling approaches are used to examine aspects of the structureborne path. These approaches are guided by a number of considerations including the geometry of the structures, the frequency range of interest, and the tractability of the computations. Results of these approaches are compared with experimental data.

Cole, J. E., III↗
NASA NTRS1990

An approximate method for calculating three-dimensional inviscid hypersonic flow fields

An approximate solution technique was developed for 3-D inviscid, hypersonic flows. The method employs Maslen's explicit pressure equation in addition to the assumption of approximate stream surfaces in the shock layer. This approximation represents a simplification to Maslen's asymmetric method. The present method presents a tractable procedure for computing the inviscid flow over 3-D surfaces at angle of attack. The solution procedure involves iteratively changing the shock shape in the subsonic-transonic region until the correct body shape is obtained. Beyond this region, the shock surface is determined using a marching procedure. Results are presented for a spherically blunted cone, paraboloid, and elliptic cone at angle of attack. The calculated surface pressures are compared with experimental data and finite difference solutions of the Euler equations. Shock shapes and profiles of pressure are also examined. Comparisons indicate the method adequately predicts shock layer properties on blunt bodies in hypersonic flow. The speed of the calculations makes the procedure attractive for engineering design applications.

Riley, Christopher J.↗
NASA NTRS1991

Robustness in the presence of mixed parametric uncertainty and unmodeled dynamics

Continuing the development of the structured singular value approach to robust control design, the authors investigate the problem of computing the structured singular value (mu) in the case of mixed real parametric and complex uncertainty. The problem is shown to be equivalent to a smooth constrained finite-dimensional optimization problem. In view of the fact that the functional to be maximized may have several local extrema, an upper bound on mu whose computation is numerically tractable is established; this leads to a sufficient condition of robust stability and performance. A historical perspective on the development of the mu theory is included.

Fan, Michael K. H.↗
NASA NTRS1989

Requirements for multidisciplinary design of aerospace vehicles on high performance computers

The design of aerospace vehicles is becoming increasingly complex as the various contributing disciplines and physical components become more tightly coupled. This coupling leads to computational problems that will be tractable only if significant advances in high performance computing systems are made. Some of the modeling, algorithmic and software requirements generated by the design problem are discussed.

Voigt, Robert G.↗
DOE OSTI2021

A Kinetic Monte Carlo Approach for Simulating Cascading Transmission Line Failure

In this work, cascading transmission line failures are studied through a dynamical model of the power system operating under fixed conditions. The power grid is modeled as a stochastic dynamical system where first-principles electromechanical dynamics are excited by small Gaussian disturbances in demand and generation around a specified operating point. In this context, a single line failure is interpreted in a large deviation context as a first escape event across a surface in phase space defined by line security constraints. The resulting system of stochastic differential equations admits a transverse decomposition of the drift, which leads to considerable simplification in evaluating the quasipotential (rate function) and, consequently, computation of exit rates. Tractable expressions for the rate of transmission line failure in a restricted network are derived from large deviation theory arguments and validated against numerical simulations. Extensions to realistic settings are considered, and individual line failure models are aggregated into a Markov model of cascading failure inspired by chemical kinetics. Cascades are generated by traversing a graph composed of weighted edges representing transitions to degraded network topologies. Numerical results indicate that the Markov model can produce cascades with qualitative power-law properties similar to those observed in empirical cascades.

Kinetic Monte Carlo, rare events, Cascading Failur↗
NASA NTRS2006

Implementing Scientific Simulation Codes Highly Tailored for Vector Architectures Using Custom Configurable Computing Machines

The motivation for this work comes from an observation that amidst the push for Massively Parallel (MP) solutions to high-end computing problems such as numerical physical simulations, large amounts of legacy code exist that are highly optimized for vector supercomputers. Because re-hosting legacy code often requires a complete re-write of the original code, which can be a very long and expensive effort, this work examines the potential to exploit reconfigurable computing machines in place of a vector supercomputer to implement an essentially unmodified legacy source code. Custom and reconfigurable computing resources could be used to emulate an original application's target platform to the extent required to achieve high performance. To arrive at an architecture that delivers the desired performance subject to limited resources involves solving a multi-variable optimization problem with constraints. Prior research in the area of reconfigurable computing has demonstrated that designing an optimum hardware implementation of a given application under hardware resource constraints is an NP-complete problem. The premise of the approach is that the general issue of applying reconfigurable computing resources to the implementation of an application, maximizing the performance of the computation subject to physical resource constraints, can be made a tractable problem by assuming a computational paradigm, such as vector processing. This research contributes a formulation of the problem and a methodology to design a reconfigurable vector processing implementation of a given application that satisfies a performance metric. A generic, parametric, architectural framework for vector processing implemented in reconfigurable logic is developed as a target for a scheduling/mapping algorithm that maps an input computation to a given instance of the architecture. This algorithm is integrated with an optimization framework to arrive at a specification of the architecture parameters that attempts to minimize execution time, while staying within resource constraints. The flexibility of using a custom reconfigurable implementation is exploited in a unique manner to leverage the lessons learned in vector supercomputer development. The vector processing framework is tailored to the application, with variable parameters that are fixed in traditional vector processing. Benchmark data that demonstrates the functionality and utility of the approach is presented. The benchmark data includes an identified bottleneck in a real case study example vector code, the NASA Langley Terminal Area Simulation System (TASS) application.

Rutishauser, David↗
NASA NTRS2011

Comparison of DSMC and CFD Solutions of Fire II Including Radiative Heating

The ability to compute rarefied, ionized hypersonic flows is becoming more important as missions such as Earth reentry, landing high mass payloads on Mars, and the exploration of the outer planets and their satellites are being considered. These flows may also contain significant radiative heating. To prepare for these missions, NASA is developing the capability to simulate rarefied, ionized flows and to then calculate the resulting radiative heating to the vehicle's surface. In this study, the DSMC codes DAC and DS2V are used to obtain charge-neutral ionization solutions. NASA s direct simulation Monte Carlo code DAC is currently being updated to include the ability to simulate charge-neutral ionized flows, take advantage of the recently introduced Quantum-Kinetic chemistry model, and to include electronic energy levels as an additional internal energy mode. The Fire II flight test is used in this study to assess these new capabilities. The 1634 second data point was chosen for comparisons to be made in order to include comparisons to computational fluid dynamics solutions. The Knudsen number at this point in time is such that the DSMC simulations are still tractable and the CFD computations are at the edge of what is considered valid. It is shown that there can be quite a bit of variability in the vibrational temperature inferred from DSMC solutions and that, from how radiative heating is computed, the electronic temperature is much better suited for radiative calculations. To include the radiative portion of heating, the flow-field solutions are post-processed by the non-equilibrium radiation code HARA. Acceptable agreement between CFD and DSMC flow field solutions is demonstrated and the progress of the updates to DAC, along with an appropriate radiative heating solution, are discussed. In addition, future plans to generate more high fidelity radiative heat transfer solutions are discussed.

Liechty, Derek S.↗
DOE OSTI2020

Time-sliced quantum circuit partitioning for modular architectures

Current quantum computer designs will not scale. To scale beyond small prototypes, quantum architectures will likely adopt a modular approach with clusters of tightly connected quantum bits and sparser connections between clusters. We exploit this clustering and the statically-known control flow of quantum programs to create tractable partitioning heuristics which map quantum circuits to modular physical machines one time slice at a time. Specifically, we create optimized mappings for each time slice, accounting for the cost to move data from the previous time slice and using a tunable lookahead scheme to reduce the cost to move to future time slices. We compare our approach to a traditional statically-mapped, owner-computes model. Our results show strict improvement over the static mapping baseline. Here, we reduce the non-local communication overhead by 89.8% in the best case and by 60.9% on average. Our techniques, unlike many exact solver methods, are computationally tractable.

Baker, Jonathan M.↗
DOE OSTI2023

Extreme-scale stochastic optimization and simulation via learning-enhanced decomposition and parallelization (Final Technical Report)

Stochastic optimization and simulation models ubiquitously arise in designing and operating complex service/engineering systems. They can be extreme in scale due to high-dimensional data and decisions, and can also involve decisions made sequentially in response to newly revealed data, both causing significant computational challenge. The objective of this research is to explore a unified framework that integrates machine learning with discrete optimization and risk-averse modeling, to improve the efficiency of decomposition paradigms for stochastic optimization and simulations at extreme scale. The models we consider represent a broad class of complex decision-making problems, where 0-1 or continuous decisions are made before and/or after knowing multiple sources of uncertainties that could be correlated. We will employ machine learning methods to dynamically decide and prioritize computational procedures, including cut generation, branching, and bounding of the optimal objective. Furthermore, the research will shed new lights on the traditional decomposition algorithms for extreme-scale computing. Deliverables of the research include new modeling and computational methods for advancing the state-of-the-art research in optimization and simulation, bringing many relevant risk-averse, data-driven optimization problems in practice within the range of tractability. Examples include distributed computing server scheduling and sensor deployment for monitoring critical infrastructures. Success in this effort will enable progress in solving multiple extreme-scale problems in the complex system design and operations arising from DoE missions in energy, environment, and national security.

24 POWER TRANSMISSION AND DISTRIBUTION↗