Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithm timings”

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 829 records · Page 46

Enhanced computational efficiency in the direct determination of the two-electron reduced density matrix from the anti-Hermitian contracted Schrödinger equation with application to ground and excited states of conjugated π-systems

Determination of the two-electron reduced density matrix (2-RDM) from the solution of the anti-Hermitian contracted Schrödinger equation (ACSE) yields accurate energies and properties for both ground and excited states. Here, we develop a more efficient method to solving the ACSE that uses second-order information to select a more optimal step towards the solution. Calculations on the ground and excited states of water, hydrogen fluoride, and conjugated π systems show that the improved ACSE algorithm is 10-20 times faster than the previous ACSE algorithm. The ACSE can treat both single- and multi-reference electron correlation with the initial 2-RDM from a complete-active-space self-consistent-field (CASSCF) calculation. Using the improved algorithm, we explore the relationship between truncation of the active space in the CASSCF calculation and the accuracy of the energy and 2-RDM from the ACSE calculation. The accuracy of the ACSE, we find, is less sensitive to the size of the active space than the accuracy of other wavefunction methods, which is useful when large active space calculations are computationally infeasible.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Controller-Based Energy-Aware Wireless Sensor Network Routing Using Quantum Algorithms

Energy-efficient routing in wireless sensor networks has attracted attention from researchers in both academia and industry, most recently motivated by the opportunity to use software-defined network-inspired approaches. These problems are NP-hard, with algorithms needing computation time that scales faster than polynomials in the problem size. Consequently, heuristic algorithms are used in practice, which are unable to guarantee optimally. In this article, we show proof-of-principle for the use of a quantum annealing processor instead of a classical processor, to find optimal or nearly optimal solutions very quickly. Our preliminary results for small networks show that this approach using quantum computing has great promise and may open the door for other significant improvements in the efficacy of network algorithms.

42 ENGINEERING↗

Self-potential monitoring of a salt plume

Nonintrusively monitoring the spread of contaminants in real time with a geophysical method is an important task in hydrogeophysics. We have developed a sandbox experiment showing that the self-potential method can locate both the source of leakage and the front of a contaminant plume. We monitored the leakage of a plume of salty water from a hole at the bottom of a small tank located at the top of a main sandbox. Initially, the sand was saturated by tap water. At a given time, a hole was opened at the bottom of the tank, allowing the salty water to migrate by diffusion and buoyancy-driven flow in the main sandbox. The bottom of the sandbox contained a network of 32 nonpolarizing silver-silver chloride electrodes with amplifiers, connected to a multichannel voltmeter. The self-potential response associated withthe migration of the salt plume in the sandbox was recorded over time. A self-potential anomaly was observed with amplitude varying from a few millivolts at the start of the leak to a few tens of millivolts after a few minutes. The self-potential data were inverted using a time-lapse tomographic algorithm to reconstruct the position of the volumetric source current density over time. A positive volumetric source current density was associated with the position of the leak at the bottom of the leaking tank, whereas a negative volumetric source current density was associated with the salinity front moving down inside the sandbox. These poles were well reproduced by performing a finite-element simulation of the problem. Using this information, we estimated the speed of the salt plume sinking inside the sandbox. Therefore, the self-potential method can be used to track, in real time, the position of the front of a contaminant plume in a porous material.

54 ENVIRONMENTAL SCIENCES↗

Near-Field Imaging of Shallow Chemical Detonations in Granite using Change Detection Methods of Borehole Seismic Data

As part of the Source Physics Experiment (SPE) Phase I shallow chemical detonation series, multiple surface and borehole active-source seismic campaigns were executed to perform high resolution imaging of seismic velocity changes in the granitic substrate. Cross-correlation data processing methods were implemented to efficiently and robustly perform semi-automated change detection of first-arrival times between campaigns. The change detection algorithm updates the arrival times, and consequently the velocity model, of each campaign. The resulting tomographic imagery reveals the evolution of the subsurface velocity structure as the detonations progressed.

42 ENGINEERING↗

Near-Field Imaging of Shallow Chemical Detonations in Granite using Change Detection Methods of Borehole Seismic Data

As part of the Source Physics Experiment (SPE) Phase I shallow chemical detonation series, multiple surface and borehole active-source seismic campaigns were executed to perform high-resolution imaging of seismic velocity changes in the granitic substrate. Cross-correlation data processing methods were implemented to efficiently and robustly perform semi-automated change detection of first-arrival times between campaigns. The change detection algorithm updates the arrival times, and consequently the velocity model, of each campaign. The resulting tomographic imagery reveals the evolution of the subsurface velocity structure as the detonations progressed.

42 ENGINEERING↗

Failure detection and identification

Using the geometric concept of an unobservability subspace, a solution is given to the problem of detecting and identifying control system component failures in linear, time-invariant systems. Conditions are developed for the existence of a causal, linear, time-invariant processor that can detect and uniquely identify a component failure, first for the case where components can fail simultaneously, and then for the case where they fail only one at a time. Explicit design algorithms are provided when these conditions are satisfied. In addition to time-domain solvability conditions, frequency-domain interpretations of the results are given, and connections are drawn with results already available in the literature.

Massoumnia, Mohammad-Ali↗

Fast Mix Table Construction for Material Discretization

An effective hybrid Monte Carlo--deterministic implementation typically requires the approximation of a continuous geometry description with a discretized piecewise-constant material field. The inherent geometry discretization error can be reduced somewhat by using material mixing, where multiple materials inside a discrete mesh voxel are homogenized. Material mixing requires the construction of a ``mix table,'' which stores the volume fractions in every mixture so that multiple voxels with similar compositions can reference the same mixture. Mix table construction is a potentially expensive serial operation for large problems with many materials and voxels. We formulate an efficient algorithm to construct a sparse mix table in $O(\text{number of voxels}\times \log \text{number of mixtures})$ time. The new algorithm is implemented in ADVANTG and used to discretize continuous geometries onto a structured Cartesian grid. When applied to an end-of-life MCNP model of the High Flux Isotope Reactor with 270 distinct materials, the new method improves the material mixing time by a factor of 100 compared to a naive mix table implementation.

Johnson, Seth R↗

Application of the Parareal Algorithm for Acoustic Wave Propagation

We present an application of the parareal algorithm to solve wave propagation problems in the time domain. The parareal algorithm is based on a decomposition of the integration time interval in time slices. It involves a serial prediction step based on a coarse approximation, and a correction step (computed in parallel) based on a fine approximation within each time slice. In our case, the spatial discretization is based on a spectral element approximation which allows flexible and accurate wave simulations in complex geological media. Fully explicit time advancing schemes are classically used for both coarse and fine solvers.In a first stage, we solve the 1D acoustic wave equation in an homogeneous medium in order to test stability and convergence properties of the parareal algorithm. We confirmed the stability problems outlined by Bal and Farhat et al. for hyperbolic problems. These stability issues are mitigated by a time-discontinuous Galerkin discretization of the coarse solver. It may also involve a coarser spatial discretization (hp-refinement) which helps to preserve stability and allows more significant computer savings. Besides, we explore the contribution of elastodynamic homogenization to build consistent coarse grid solvers. Extension to 2D/3D realistic geological media is an ongoing work.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A general algorithm for relating ground trajectory distance, elapsed flight time, and aircraft airspeed and its application to 4-D guidance

A general solution using an elliptic integral approximation which relates flight time, aircraft airspeed, and ground distance on straight-line and circular-arc trajectory segments is developed. The solution procedure is applicable to both constant and accelerating aircraft flight. In addition, wind shear including both magnitude and heading change is incorporated in the solution. The solution equations are used in a four-dimensional (4-D) control algorithm where both flight time and final airspeed are specified. The results show that the algorithm converges rapidly and accurately.

Foudriat, E. C.↗

A First-Passage Kinetic Monte Carlo algorithm for complex diffusion-reaction systems

We develop an asynchronous event-driven First-Passage Kinetic Monte Carlo (FPKMC) algorithm for continuous time and space systems involving multiple diffusing and reacting species of spherical particles in two and three dimensions. The FPKMC algorithm presented here is based on the method introduced in Oppelstrup et al. and is implemented in a robust and flexible framework. Unlike standard KMC algorithms such as the n-fold algorithm, FPKMC is most efficient at low densities where it replaces the many small hops needed for reactants to find each other with large first-passage hops sampled from exact time-dependent Green's functions, without sacrificing accuracy. We describe in detail the key components of the algorithm, including the event-loop and the sampling of first-passage probability distributions, and demonstrate the accuracy of the new method. We apply the FPKMC algorithm to the challenging problem of simulation of long-term irradiation of metals, relevant to the performance and aging of nuclear materials in current and future nuclear power plants. The problem of radiation damage spans many decades of time-scales, from picosecond spikes caused by primary cascades, to years of slow damage annealing and microstructure evolution. Our implementation of the FPKMC algorithm has been able to simulate the irradiation of a metal sample for durations that are orders of magnitude longer than any previous simulations using the standard Object KMC or more recent asynchronous algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A multiscale MDCT image-based breathing lung model with time-varying regional ventilation

A novel algorithm is presented that links local structural variables (regional ventilation and deforming central airways) to global function (total lung volume) in the lung over three imaged lung volumes, to derive a breathing lung model for computational fluid dynamics simulation. The algorithm constitutes the core of an integrative, image-based computational framework for subject-specific simulation of the breathing lung. For the first time, the algorithm is applied to three multi-detector row computed tomography (MDCT) volumetric lung images of the same individual. A key technique in linking global and local variables over multiple images is an in-house mass-preserving image registration method. Throughout breathing cycles, cubic interpolation is employed to ensure C{sub 1} continuity in constructing time-varying regional ventilation at the whole lung level, flow rate fractions exiting the terminal airways, and airway deformation. The imaged exit airway flow rate fractions are derived from regional ventilation with the aid of a three-dimensional (3D) and one-dimensional (1D) coupled airway tree that connects the airways to the alveolar tissue. An in-house parallel large-eddy simulation (LES) technique is adopted to capture turbulent-transitional-laminar flows in both normal and deep breathing conditions. The results obtained by the proposed algorithm when using three lung volume images are compared with those using only one or two volume images. The three-volume-based lung model produces physiologically-consistent time-varying pressure and ventilation distribution. The one-volume-based lung model under-predicts pressure drop and yields un-physiological lobar ventilation. The two-volume-based model can account for airway deformation and non-uniform regional ventilation to some extent, but does not capture the non-linear features of the lung.

42 ENGINEERING↗

Deploying a Model Predictive Traffic Signal Control Algorithm - A Field Deployment Experiment Case Study

This paper presents a field deployment experiment of a real-time traffic signal control algorithm. We implemented the model predictive control (MPC) algorithm based on the virtual phase-link (VPL) model. We selected the deployment locations and times based on an energy saving potential concept. We developed a set of experiment systems, which included sensing, processing, and actuating components, to enable field deployment. We tested the systems rigorously before the experiment days. We reported the key procedures on the experiment days, including the steps taken, the real-time control procedure, and the monitoring of the experiment. We evaluated the impact of the deployment by looking at the changes in delay and energy consumption.

deployment↗

Multiphase complete exchange: A theoretical analysis

Complete Exchange requires each of N processors to send a unique message to each of the remaining N-1 processors. For a circuit switched hypercube with N = 2(sub d) processors, the Direct and Standard algorithms for Complete Exchange are optimal for very large and very small message sizes, respectively. For intermediate sizes, a hybrid Multiphase algorithm is better. This carries out Direct exchanges on a set of subcubes whose dimensions are a partition of the integer d. The best such algorithm for a given message size m could hitherto only be found by enumerating all partitions of d. The Multiphase algorithm is analyzed assuming a high performance communication network. It is proved that only algorithms corresponding to equipartitions of d (partitions in which the maximum and minimum elements differ by at most 1) can possibly be optimal. The run times of these algorithms plotted against m form a hull of optimality. It is proved that, although there is an exponential number of partitions, (1) the number of faces on this hull is Theta(square root of d), (2) the hull can be found in theta(square root of d) time, and (3) once it has been found, the optimal algorithm for any given m can be found in Theta(log d) time. These results provide a very fast technique for minimizing communication overhead in many important applications, such as matrix transpose, Fast Fourier transform, and ADI.

Bokhari, Shahid H.↗

An efficient algorithm for solution of the unsteady transonic small-disturbance equation

A time accurate approximate factorization (AF) algorithm is formulated for solution of the three dimensional unsteady transonic small-disturbance equation. The AF algorithm consists of a time linearization procedure coupled with a Newton iteration technique. Superior stability characteristics of the new algorithm are demonstrated through applications to steady and oscillatory flows at subsonic and supersonic freestream conditions for an F-5 fighter wing. For steady flow calculations, the size of the time step is cycled to achieve rapid convergence. For unsteady flow calculations, the AF algorithm is sufficiently robust to allow the step size to be selected based on accuracy rather than on stability considerations. Therefore, accurate solutions are obtained in only several hundred time steps yielding a significant computational cost savings when compared to alternative methods.

Batina, John T.↗