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 343 records · Page 19

Parallel CE/SE Computations via Domain Decomposition

This paper describes the parallelization strategy and achieved parallel efficiency of an explicit time-marching algorithm for solving conservation laws. The Space-Time Conservation Element and Solution Element (CE/SE) algorithm for solving the 2D and 3D Euler equations is parallelized with the aid of domain decomposition. The parallel efficiency of the resultant algorithm on a Silicon Graphics Origin 2000 parallel computer is checked.

Himansu, Ananda↗

Demonstration and performance of an online data selection algorithm for liquid argon time projection chambers using MicroBooNE

The MicroBooNE detector is a liquid argon time projection chamber (LArTPC) that produces three-dimensional images of particle interactions using ionization charge collected by anode wire plane arrays and scintillation light collected by a light detection system. In addition to testing long-standing experimental neutrino anomalies and performing measurements of neutrino interactions with argon nuclei using the Fermilab Booster Neutrino Beam, MicroBooNE aims to develop methodologies for rare beyond the Standard Model and off-beam physics searches. Looking ahead to the upcoming Deep Underground Neutrino Experiment (DUNE), with MicroBooNE serving as a valuable testbed, achieving high sensitivity and livetime for off-beam physics while satisfying data processing and storage constraints will require data-driven, intelligent, and online or real-time data selection techniques. These techniques are essential for reducing data rates and preserving rare signals with high accuracy. In this paper, we describe a fast data selection algorithm suitable for online execution to identify electrons from stopping cosmic ray muons in the MicroBooNE detector utilizing ionization charge information, and present its performance. This represents the first demonstration of online data selection in a LArTPC using real data and charge information exclusively and provides an important proof-of-principle for applying such techniques to other LArTPC experiments such as the Short-Baseline Near Detector and DUNE.

Abratenko, P. [Tufts U. (main)]↗

Online Learning Flight Control for Intelligent Flight Control Systems (IFCS)

The research accomplishments for the cooperative agreement 'Online Learning Flight Control for Intelligent Flight Control Systems (IFCS)' include the following: (1) previous IFC program data collection and analysis; (2) IFC program support site (configured IFC systems support network, configured Tornado/VxWorks OS development system, made Configuration and Documentation Management Systems Internet accessible); (3) Airborne Research Test Systems (ARTS) II Hardware (developed hardware requirements specification, developing environmental testing requirements, hardware design, and hardware design development); (4) ARTS II software development laboratory unit (procurement of lab style hardware, configured lab style hardware, and designed interface module equivalent to ARTS II faceplate); (5) program support documentation (developed software development plan, configuration management plan, and software verification and validation plan); (6) LWR algorithm analysis (performed timing and profiling on algorithm); (7) pre-trained neural network analysis; (8) Dynamic Cell Structures (DCS) Neural Network Analysis (performing timing and profiling on algorithm); and (9) conducted technical interchange and quarterly meetings to define IFC research goals.

Niewoehner, Kevin R.↗

Formulation and Comparison of Two Real-Time Predictive Gear Shift Algorithms for Connected/Automated Heavy-Duty Vehicles

Our work investigates the problem of predictive gear scheduling for fuel consumption minimization in connected/automated heavy trucks. The literature highlights the fuel economy benefits of such predictive scheduling, but there is a need to optimize such scheduling online, in real time. To address this need, we begin by using dynamic programming (DP) to schedule gear shifting offline, in a manner that achieves a globally optimal Pareto tradeoff between the conflicting objectives of minimizing fuel consumption and shift frequency. The computational cost of DP is unfavorable for online implementation, but we present two algorithms addressing this issue. Both algorithms rely on the fact that in the Pareto limit where fuel consumption minimization is the sole objective, DP furnishes a simple static shift map . Our first algorithm trains a recurrent neural network to prune the shift schedule generated by this map. The second algorithm performs this pruning in a direct manner tailored to reduce the schedule's rain flow count. We simulate these algorithms for different drive cycles. Both algorithms achieve a reasonable tradeoff between fuel consumption and gear shift frequency. Yet, the rain flow count algorithm is both more effective in approaching the DP-based Pareto front and more computationally efficient.

33 ADVANCED PROPULSION SYSTEMS↗

Note: An improved 3D imaging system for electron-electron coincidence measurements

We demonstrate an improved imaging system that can achieve highly efficient 3D detection of two electrons in coincidence. The imaging system is based on a fast frame complementary metal-oxide semiconductor camera and a high-speed waveform digitizer. We have shown previously that this detection system is capable of 3D detection of ions and electrons with good temporal and spatial resolution. Here, we show that with a new timing analysis algorithm, this system can achieve an unprecedented dead-time (<0.7 ns) and dead-space (<1 mm) when detecting two electrons. A true zero dead-time detection is also demonstrated.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Improved Time-Stepping Methods in Global to Regional Ocean Modeling (Annual Status Report 2020)

Time stepping algorithms are an important part of ocean models, and strongly influence both the accuracy of solution and performance. There have been a number of projects investigating various improvements for ocean time-stepping schemes in the Model for Prediction Across Scales-Ocean (MPAS-Ocean), a component of the DOE Energy Exascale Earth System Model. Ocean dynamics include fast surface gravity waves, which are two-dimensional, and slower internal waves, which are three-dimensional, so ocean models use a split time-stepping scheme that separates these barotropic and baroclinic modes for efficiency. MPAS-Ocean runs on variable-resolution horizontal meshes, and must scale to tens of thousands of cores and millions of horizontal gridcells. Ocean models require time stepping algorithms that are customized to these needs, and which are tuned for performance on various resolutions and architectures.

58 GEOSCIENCES↗

Improved Time-Stepping Methods in Global to Regional Ocean Modeling (Annual Status Report)

Time stepping algorithms are an important part of ocean models, and strongly influence both the accuracy of solution and performance. There have been a number of projects investigating various improvements for ocean time-stepping schemes in the Model for Prediction Across Scales-Ocean (MPAS-Ocean), a component of the DOE Energy Exascale Earth System Model. Ocean dynamics include fast surface gravity waves, which are two-dimensional, and slower internal waves, which are three-dimensional, so ocean models use a split time-stepping scheme that separates these barotropic and baroclinic modes for efficiency. MPAS-Ocean runs on variable-resolution horizontal meshes, and must scale to tens of thousands of cores and millions of horizontal gridcells. Ocean models require time stepping algorithms that are customized to these needs, and which are tuned for performance on various resolutions and architectures.

58 GEOSCIENCES↗

Quantum algorithms for Gibbs sampling and hitting-time estimation

In this paper, we present quantum algorithms for solving two problems regarding stochastic processes. The first algorithm prepares the thermal Gibbs state of a quantum system and runs in time almost linear in √Nβ/Ζ and polynomial in log(1/ϵ), where N is the Hilbert space dimension, β is the inverse temperature, Ζ is the partition function, and ϵ is the desired precision of the output state. Our quantum algorithm exponentially improves the dependence on 1/ϵ and quadratically improves the dependence on β of known quantum algorithms for this problem. The second algorithm estimates the hitting time of a Markov chain. For a sparse stochastic matrix Ρ, it runs in time almost linear in 1/(ϵΔ 3/2 ), where ϵ is the absolute precision in the estimation and Δ is a parameter determined by Ρ, and whose inverse is an upper bound of the hitting time. Our quantum algorithm quadratically improves the dependence on 1/ϵ and 1/Δ of the analog classical algorithm for hitting-time estimation. Finally, both algorithms use tools recently developed in the context of Hamiltonian simulation, spectral gap amplification, and solving linear systems of equations.

97 MATHEMATICS AND COMPUTING↗

The Current Status of Unsteady CFD Approaches for Aerodynamic Flow Control

An overview of the current status of time dependent algorithms is presented. Special attention is given to algorithms used to predict fluid actuator flows, as well as other active and passive flow control devices. Capabilities for the next decade are predicted, and principal impediments to the progress of time-dependent algorithms are identified.

Carpenter, Mark H.↗

Reverse time migration: A seismic processing application on the connection machine

The implementation of a reverse time migration algorithm on the Connection Machine, a massively parallel computer is described. Essential architectural features of this machine as well as programming concepts are presented. The data structures and parallel operations for the implementation of the reverse time migration algorithm are described. The algorithm matches the Connection Machine architecture closely and executes almost at the peak performance of this machine.

Fiebrich, Rolf-Dieter↗

Time and wavelength domain algorithms for chemical analysis by laser radar

Laser-induced fluorescence (LIF) is a promising technique for laser radar applications. Laser radar using LIF has already been applied to algae blooms and oil slicks. Laser radar using LIF has great potential for remote chemical analysis because LIF spectra are extremely sensitive to chemical composition. However, most samples in the real world contain mixtures of fluorescing components, not merely individual components. Multicomponent analysis of laser radar returns from mixtures is often difficult because LIF spectra from solids and liquids are very broad and devoid of line structure. Therefore, algorithms for interpreting LIF spectra from laser radar returns must be able to analyze spectra that overlap in multicomponent systems. This paper analyzes the possibility of using factor analysis-rank annihilation (FARA) to analyze emission-time matrices (ETM) from laser radar returns instead of excitation-emission matrices (EEM). The authors here define ETM as matrices where the rows (or columns) are emission spectra at fixed times and the columns (or rows) are temporal profiles for fixed emission wavelengths. Laser radar usually uses pulsed lasers for ranging purposes, which are suitable for measuring temporal profiles. Laser radar targets are hard instead of diffuse; that is, a definite surface emits the fluorescence instead of an extended volume. A hard target would not broaden the temporal profiles as would a diffuse target. Both fluorescence lifetimes and emission spectra are sensitive to chemical composition. Therefore, temporal profiles can be used instead of excitation spectra in FARA analysis of laser radar returns. The resulting laser radar returns would be ETM instead of EEM.

Rosen, David L.↗

Reducing acquisition times in multidimensional NMR with a time-optimized Fourier encoding algorithm

Speeding up the acquisition of multidimensional nuclear magnetic resonance (NMR) spectra is an important topic in contemporary NMR, with central roles in high-throughput investigations and analyses of marginally stable samples. A variety of fast NMR techniques have been developed, including methods based on non-uniform sampling and Hadamard encoding, that overcome the long sampling times inherent to schemes based on fast-Fourier-transform (FFT) methods. Here, we explore the potential of an alternative fast acquisition method that leverages a priori knowledge, to tailor polychromatic pulses and customized time delays for an efficient Fourier encoding of the indirect domain of an NMR experiment. By porting the encoding of the indirect-domain to the excitation process, this strategy avoids potential artifacts associated with non-uniform sampling schemes and uses a minimum number of scans equal to the number of resonances present in the indirect dimension. An added convenience is afforded by the fact that a usual 2D FFT can be used to process the generated data. Acquisitions of 2D heteronuclear correlation NMR spectra on quinine and on the anti-inflammatory drug isobutyl propionic phenolic acid illustrate the new method's performance. This method can be readily automated to deal with complex samples such as those occurring in metabolomics, in in-cell as well as in in vivo NMR applications, where speed and temporal stability are often primary concerns.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A time-split finite-volume algorithm for three-dimensional flow-field simulation

A general finite-volume algorithm is developed for solving three-dimensional, time-dependent, compressible Navier-Stokes equations for high Reynolds number flows over an arbitrary geometry. This algorithm adapts MacCormack's (1982) explicit-implicit scheme to a time-split, three-dimensional finite-volume concept in a general coordinate system. It is shown that the thin-layer approximation in all three spatial directions significantly reduces the evaluation of viscous terms and allows the algorithm to solve more complicated geometries with all boundaries in two or all three directions. The calculated results using this method are found to be in good agreement with the experimental measurements of a blunt-fin induced shock wave and boundary-layer interaction problems. Observations of the existence of peak pressure, primary horseshoe and secondary vortices, and reversed supersonic zones show that computational fluid dynamics can effectively supplement the wind tunnel tests for aerodynamic design as well as for understanding basic fluid dynamics.

Hung, C. M.↗

Code Verification of a Warm Electron Diode Using the EMPIRE Plasma Simulation Code.

This report documents recent code verification exercises for a warm electron diode problem using the EMPIRE plasma code. This computationally expensive test was performed three times, including two different code versions and two different time integration algorithms, and the resulting code responses were analyzed for convergence to the analytical solution and orders-of-convergence using the StREEQ numerical error estimation tool. Significant deviations from the exact solution and expected orders-of-convergence, as well as changes in code behavior over time and due to choice of time integration algorithm were observed, illustrating the need to fix fundamental code issues as well as additional code verification testing before the code can be relied upon to accurately solve critical problems within its application space.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

An Efficient Numerical Algorithm for Solving Coupled Time-Dependent Ginzburg-Landau Equation for Superconductivity and Elasticity

A decoupled finite element algorithm is developed for simulating the vortex dynamics on an elastic superconductor which couples the time-dependent Ginzburg- Landau equation with the complex-valued superconducting order parameter and the vector-valued magnetic potential, and the elasticity equation. We present an iterative algorithm for the decoupled system arising from the time and spatial discretization using a combination of preconditioner, algebraic multigrid method (AMG) and preconditioned conjugate gradient method (PCG). The iterative algorithm allows us to perform large-scale three-dimensional simulations of mesoscale pattern formation during superconducting phase transitions with arbitrary elastic boundary conditions. Here, the performance and efficiency of the algorithm are numerically verified by several benchmark problems, exhibiting up to two orders of magnitude improvement depending on the scale of discrete system compared to the exact solver.

Efficiency↗

Scalable multiscale modeling of platelets with 100 million particles

Here, we developed the core components of the AI-aided multiple time stepping algorithm for multiscale modeling of cell dynamics. This algorithm was implemented and analyzed on two supercomputer architectures with an application of simulating the aggregation of 250 platelets, or 102 million particles. To scale on these computers with complex memory and network architectures with GPUs, we devised a biomechanics-informed task mapping scheme to optimize load imbalance, communications, and memory utilization. Our simulations, scaling well up to 192 nodes on a Summit-like supercomputer with a peak speed of 11 petaflops, achieved a rate of 423 μs/day which is 500 times faster than the conventional algorithm using static time step and this has enabled studies of record size blood clots at record spatial–temporal resolutions. Additionally, we discovered the sensitive dependence of the scalability and execution time on the methods of decomposition, CPU–GPU coupling, and task mapping.

97 MATHEMATICS AND COMPUTING↗

Stochastic modeling of evaporating sprays within a consistent hybrid joint PDF framework

In the present study, a framework for modeling two-phase evaporating flow is presented, which employs an Eulerian-Lagrangian-Lagrangian approach. For the continuous phase, a joint velocity-composition probability density function (PDF) method is used. Opposed to other approaches, such PDF methods require no modeling for turbulent convection and chemical source terms. For the dispersed phase, the PDF of velocity, diameter, temperature, seen gas velocity and seen gas composition is calculated. This provides a unified formulation, which allows to consistently address the different modeling issues associated with such a system. Because of the high dimensionality, particle methods are employed to solve the PDF transport equations. To further enhance computational efficiency, a local particle time-stepping algorithm is implemented and a particle time-averaging technique is employed to reduce statistical and bias errors. In comparison to previous studies, a significantly smaller number of droplet particles per grid cell can be employed for the computations, which rely on two-way coupling between the droplet and gas phases. The framework was validated using established experimental data and a good overall agreement can be observed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A variable multi-step method for transient heat conduction

A variable explicit time integration algorithm is developed for unsteady diffusion problems. The algorithm uses nodal partitioning and allows the nodal groups to be updated with different time steps. The stability of the algorithm is analyzed using energy methods and critical time steps are found in terms of element eigenvalues with no restrictions on element types. Several numerical examples are given to illustrate the accuracy of the method.

Smolinski, Patrick↗