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 559 records · Page 31

Development of a three-dimensional Navier-Stokes code on CDC star-100 computer

A three-dimensional code in body-fitted coordinates was developed using MacCormack's algorithm. The code is structured to be compatible with any general configuration, provided that the metric coefficients for the transformation are available. The governing equations are developed in primitive variables in order to facilitate the incorporation of physical boundary conditions and turbulence-closure models. MacCormack's two-step, unsplit, time-marching algorithm is used to solve the unsteady Navier-Stokes equations until steady-state solution is achieved. Cases discussed include (1) flat plate in supersonic free stream; (2) supersonic flow along an axial corner; (3) subsonic flow in an axial corner at M infinity = 0.95; and (4) supersonic flow in an axial corner at M infinity 1.5.

Vatsa, V. N.↗

UWB Tracking System Design with TDOA Algorithm

This presentation discusses an ultra-wideband (UWB) tracking system design effort using a tracking algorithm TDOA (Time Difference of Arrival). UWB technology is exploited to implement the tracking system due to its properties, such as high data rate, fine time resolution, and low power spectral density. A system design using commercially available UWB products is proposed. A two-stage weighted least square method is chosen to solve the TDOA non-linear equations. Matlab simulations in both two-dimensional space and three-dimensional space show that the tracking algorithm can achieve fine tracking resolution with low noise TDOA data. The error analysis reveals various ways to improve the tracking resolution. Lab experiments demonstrate the UWBTDOA tracking capability with fine resolution. This research effort is motivated by a prototype development project Mini-AERCam (Autonomous Extra-vehicular Robotic Camera), a free-flying video camera system under development at NASA Johnson Space Center for aid in surveillance around the International Space Station (ISS).

Ni, Jianjun↗

Hierarchical Trigger of the ALICE Calorimeters

The trigger of the ALICE electromagnetic calorimeters is implemented in 2 hierarchically connected layers of electronics. In the lower layer, level-0 algorithms search shower energy above threshold in locally confined Trigger Region Units (TRU). The top layer is implemented as a single, global trigger unit that receives the trigger data from all TRUs as input to the level-1 algorithm. This architecture was first developed for the PHOS high p{sub T} photon trigger before it was adopted by EMCal also for the jet trigger. TRU units digitize up to 112 analogue input signals from the Front End Electronics (FEE) and concentrate their digital stream in a single FPGA. A charge and time summing algorithm is combined with a peakfinder that suppresses spurious noise and is precise to single LHC bunches. With a peak-to-peak noise level of 150 MeV the linear dynamic range above threshold spans from MIP energies at 215 up to 50 GeV. Local level-0 decisions take less than 600 ns after LHC collisions, upon which all TRUs transfer their level-0 trigger data to the upstream global trigger module which searches within the remaining level-1 latency for high p{sub T} gamma showers (PHOS) and/or for Jet cone areas (EMCaL).

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Simulations for Full Unit-memory and Partial Unit-memory Convolutional Codes with Real-time Minimal-byte-error Probability Decoding Algorithm

A program which was written to simulate Real Time Minimal-Byte-Error Probability (RTMBEP) decoding of full unit-memory (FUM) convolutional codes on a 3-bit quantized AWGN channel is described. This program was used to compute the symbol-error probability of FUM codes and to determine the signal to noise (SNR) required to achieve a bit error rate (BER) of 10 to the minus 6th power for corresponding concatenated systems. A (6,6/30) FUM code, 6-bit Reed-Solomon code combination was found to achieve the required BER at a SNR of 1.886 dB. The RTMBEP algorithm was then modified for decoding partial unit-memory (PUM) convolutional codes. A simulation program was also written to simulate the symbol-error probability of these codes.

Vo, Q. D.↗

Performance analysis for the expanding search PN acquisition algorithm

An approach is described for approximating the cumulative probability distribution of the acquisition time of the serial pseudonoise (PN) search algorithm. The results are applicable to both variable and fixed dwell time systems. The theory is developed for the case where some a priori information is available on the PN code epoch (reacquisition problem or acquisition of very long codes). Also considered is the special case of a search over the whole code. The accuracy of the approximation is demonstrated by comparisons with published exact results for the fixed dwell time algorithm.

Braun, W. R.↗

Downlink Receiver Algorithms for Deep Space Optical Communications

The goal of the Deep Space Optical Communications project at the Jet Propulsion Laboratory is to demonstrate laser communication links at ranges out to approximately 3 AU. In this paper, we discuss a downlink receiver concept capable of demodulating optical pulse-position modulated (PPM) waveforms with data rates varying from approximately 50 kbps up to 265 Mbps, using a range of PPM orders, slot widths, and code rates. The receiver operates on recorded timestamps corresponding to the times-of-arrival of photons detected by a photon-counting detector array followed by a commercial time-tagger. Algorithms are presented for slot, symbol, and frame synchronization as well as parameter estimation. Estimates of link performance are evaluated through Monte- Carlo simulation for an optical channel that includes optical losses, detector blocking, signal clock dynamics, and pointing-induced downlink fades. Based upon these simulation results, it is expected that link closure may be achieved with at least 3 dB of margin under a variety of relevant conditions.

Tkacenko, Andre↗

An identification algorithm for linear stochastic systems with time delays

Linear discrete stochastic control systems containing unknown multiple time delays, plant parameters and noise variances are considered. An algorithm is established which uses the maximum-likelihood technique to identify the unknown parameters. An estimated likelihood function is evaluated based on the previous parameter estimates, which in turn generates a new descent direction vector to update the unknown parameters. The delays and plant parameters are identified in their respective parameter spaces. An example of a second-order stochastic system has been implemented by digital simulation to demonstrate the applicability of the algorithm.

Leondes, C. T.↗

JavaGenes: Evolving Graphs with Crossover

Genetic algorithms usually use string or tree representations. We have developed a novel crossover operator for a directed and undirected graph representation, and used this operator to evolve molecules and circuits. Unlike strings or trees, a single point in the representation cannot divide every possible graph into two parts, because graphs may contain cycles. Thus, the crossover operator is non-trivial. A steady-state, tournament selection genetic algorithm code (JavaGenes) was written to implement and test the graph crossover operator. All runs were executed by cycle-scavagging on networked workstations using the Condor batch processing system. The JavaGenes code has evolved pharmaceutical drug molecules and simple digital circuits. Results to date suggest that JavaGenes can evolve moderate sized drug molecules and very small circuits in reasonable time. The algorithm has greater difficulty with somewhat larger circuits, suggesting that directed graphs (circuits) are more difficult to evolve than undirected graphs (molecules), although necessary differences in the crossover operator may also explain the results. In principle, JavaGenes should be able to evolve other graph-representable systems, such as transportation networks, metabolic pathways, and computer networks. However, large graphs evolve significantly slower than smaller graphs, presumably because the space-of-all-graphs explodes combinatorially with graph size. Since the representation strongly affects genetic algorithm performance, adding graphs to the evolutionary programmer's bag-of-tricks should be beneficial. Also, since graph evolution operates directly on the phenotype, the genotype-phenotype translation step, common in genetic algorithm work, is eliminated.

Globus, Al↗

Idaho National Laboratory Data Acquisition And Processing System

The INLDAS data acquisition and processing system is designed to develop prototype measurements and real-time processing techniques. The INLDAS hardware and firmware currently consists of National Instruments • NI-DAQmx 14.1 • cDAQ-9184 • 9205 • 9211 INLDAS can perform of standard data acquisition functions as well as novel functions and real-time processing algorithms. There are 3 acquisition modes to choose from: • Continuous mode runs when the user hits start, processing data and logging it to file • SWTrigger mode waits for one or more predefined triggers before acquiring data. It will buffer data as well, so it can record data that happened shortly before the trigger • Wakeup mode waits on predefined timers. When a time goes off, it acquires a preset amount of data There are also 3 Data Processing Modes • Normal mode does no processing besides the rolling average • FFT Mode Performs an FFT on incoming data every time the time window has elapsed • STFFT mode

Smith, JamesA↗

Transient finite element computations on the transputer system

The aim was to study the solution of transient finite element problems on the Transputer system of parallel processors. The central difference time integration rule was used so that no equation solving was necessary. Also investigated was subcycling time integration which uses different time steps in different subdomains of the finite element mesh. A one-dimensional bar problem was analyzed using the parallel time integration algorithm. This involves subdividing the bar into subproblems which are assigned to different processors. Results show that the significant speed-up can be obtained through parallel processing. Also subcycling can give an additional speed-up in certain classes of problems. A two-dimensional problem was also examined to evaluate the effect of the communication to computation ratio on solution time.

Smolinski, Patrick J.↗

Exploratory Nuclear Reactor Safety Analysis and Visualization via Integrated Topological and Geometric Techniques

A recent trend in the nuclear power engineering field is the implementation of heavily computational and time consuming algorithms and codes for both design and safety analysis. In particular, the new generation of system analysis codes aim to embrace several phenomena such as thermo-hydraulic, structural behavior, and system dynamics, as well as uncertainty quantification and sensitivity analyses. The use of dynamic probabilistic risk assessment (PRA) methodologies allows a systematic approach to uncertainty quantification. Dynamic methodologies in PRA account for possible coupling between triggered or stochastic events through explicit consideration of the time element in system evolution, often through the use of dynamic system models (simulators). They are usually needed when the system has more than one failure mode, control loops, and/or hardware/process/software/human interaction. Dynamic methodologies are also capable of modeling the consequences of epistemic and aleatory uncertainties. The Monte-Carlo (MC) and the Dynamic Event Tree (DET) approaches belong to this new class of dynamic PRA methodologies. The major challenges in using MC and DET methodologies (as well as other dynamic methodologies) are the heavier computational and memory requirements compared to the classical ET analysis. This is due to the fact that each branch generated can contain time evolutions of a large number of variables (about 50,000 data channels are typically present in RELAP) and a large number of scenarios can be generated from a single initiating event (possibly on the order of hundreds or even thousands). Such large amounts of information are usually very difficult to organize in order to identify the main trends in scenario evolutions and the main risk contributors for each initiating event. This report aims to improve Dynamic PRA methodologies by tackling the two challenges mentioned above using: 1) adaptive sampling techniques to reduce computational cost of the analysis and 2) topology-based methodologies to interactively visualize multidimensional data and extract risk-informed insights. Regarding item 1) we employ learning algorithms that aim to infer/predict simulation outcome and decide the coordinate in the input space of the next sample that maximize the amount of information that can be gained from it. Such methodologies can be used to both explore and exploit the input space. The later one is especially used for safety analysis scopes to focus samples along the limit surface, i.e. the boundaries in the input space between system failure and system success. Regarding item 2) we present a software tool that is designed to analyze multi-dimensional data. We model a large-scale nuclear simulation dataset as a high-dimensional scalar function defined over a discrete sample of the domain. First, we provide structural analysis of such a function at multiple scales and provide insight into the relationship between the input parameters and the output. Second, we enable exploratory analysis for users, where we help the users to differentiate features from noise through multi-scale analysis on an interactive platform, based on domain knowledge and data characterization. Our analysis is performed by exploiting the topological and geometric properties of the domain, building statistical models based on its topological segmentations and providing interactive visual interfaces to facilitate such explorations.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Parareal in Time for Dynamic Simulations of Power Systems

In recent years, there have been significant developments in parallel algorithms and high performance parallel computing platforms. Parareal in time algorithm has become popular for long transient simulations (e.g., molecular dynamics, fusion, reacting flows). Parareal is a parallel algorithm which divides the time interval into sub-intervals and solves them concurrently. This paper investigates the applicability of the parareal algorithm to power system dynamic simulations. Preliminary results on the application of parareal for multi-machine power systems are reported in this paper. Two widely used test systems, WECC 3-generator 9-bus system, New England 10-generator 39- bus system, is used to explore the effectiveness of the parareal. Severe 3 phase bus faults are simulated using both the classical and detailed models of multi-machine power systems. Actual Speedup of 5-7 times is observed assuming ideal parallelization. It has been observed that the speedup factors of the order of 20 can be achieved by using fast coarse approximations of power system models. Dependency of parareal convergence on fault duration and location has been observed.

Gurrala, Gurunath↗

Simulation of 24,000 Electron Dynamics: Real-Time Time-Dependent Density Functional Theory (TDDFT) with the Real-Space Multigrids (RMG)

Here, we present the theory, implementation, and benchmarking of a real-time time-dependent density functional theory (RT-TDDFT) module within the RMG code, designed to simulate the electronic response of molecular systems to external perturbations. Our method offers insights into nonequilibrium dynamics and excited states across a diverse range of systems, from small organic molecules to large metallic nanoparticles. Benchmarking results demonstrate excellent agreement with established TDDFT implementations and showcase the superior stability of our time integration algorithm, enabling long-term simulations with minimal energy drift. The scalability and efficiency of RMG on massively parallel architectures allow for simulations of complex systems, such as plasmonic nanoparticles with thousands of atoms. Future extensions, including nuclear and spin dynamics, will broaden the applicability of this RT-TDDFT implementation, providing a powerful toolset for studies of photoactive materials, nanoscale devices, and other systems where real-time electronic dynamics is essential.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A conservative finite difference algorithm for the unsteady transonic potential equation in generalized coordinates

An implicit, approximate-factorization, finite-difference algorithm has been developed for the computation of unsteady, inviscid transonic flows in two and three dimensions. The computer program solves the full-potential equation in generalized coordinates in conservation-law form in order to properly capture shock-wave position and speed. A body-fitted coordinate system is employed for the simple and accurate treatment of boundary conditions on the body surface. The time-accurate algorithm is modified to a conventional ADI relaxation scheme for steady-state computations. Results from two- and three-dimensional steady and two-dimensional unsteady calculations are compared with existing methods.

Bridgeman, J. O.↗

Development of Transient Coupled Chemical-Thermal-Fluids Simulation for Unsealed Aluminum-Clad Spent Nuclear Fuel Storage Canister

This study examines a preliminary three-dimensional (3D) multi-physics computational fluid dynamics (CFD) model of the unsealed canisters containing aluminum-clad spent nuclear fuel from INL’s ATR in the irradiated fuel storage facility. This 3D CFD model considers fully resolved fuel plates in an unsealed canister with small mass exchange with surrounding air as time evolves in the simulation and contains a network of chemical reactions to consider due to several of the side reactions occurring in the presence of water vapor, nitrogen, oxygen and carbon dioxide rather than in helium backfilled DOE standard canisters. Prior to the CFD modeling, the full set of chemical reactions under these conditions was analyzed, reduced, and refit to a more manageable number of equations for the computational efficiency of the 3D CFD simulation. To deal with the long time-scale of interest for tracking the possible buildup of trace species such as nitric acid, NOx, and hydrogen, a segregated time stepping algorithm is used, wherein the velocity field is only updated periodically, and assume to be in a pseudo steady state. This study first examines the theory of the model, workflow to establish radiolysis reaction network, and initial simulations of the evolutions of thermal fields, hydrogen gas and nitric acid concentrations within unsealed canisters in conditions relevant to the INL INTEC CPP-603 facility over a long period of time.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Development of Transient Coupled Chemical-Thermal-Fluids Simulation for Unsealed Aluminum-Clad Spent Nuclear Fuel Storage Canister

This study examines a preliminary three-dimensional (3D) multi-physics computational fluid dynamics (CFD) model of the unsealed canisters containing aluminum-clad spent nuclear fuel from INL’s ATR in the irradiated fuel storage facility. This 3D CFD model considers fully resolved fuel plates in an unsealed canister with small mass exchange with surrounding air as time evolves in the simulation and contains a network of chemical reactions to consider due to several of the side reactions occurring in the presence of water vapor, nitrogen, oxygen and carbon dioxide rather than in helium backfilled DOE standard canisters. Prior to the CFD modeling, the full set of chemical reactions under these conditions was analyzed, reduced, and refit to a more manageable number of equations for the computational efficiency of the 3D CFD simulation. To deal with the long time-scale of interest for tracking the possible buildup of trace species such as nitric acid, NOx, and hydrogen, a segregated time stepping algorithm is used, wherein the velocity field is only updated periodically, and assume to be in a pseudo steady state. This study first examines the theory of the model, workflow to establish radiolysis reaction network, and initial simulations of the evolutions of thermal fields, hydrogen gas and nitric acid concentrations within unsealed canisters in conditions relevant to the INL INTEC CPP-603 facility over a long period of time.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Development of Transient Coupled Chemical-Thermal-Fluids Simulation for Unsealed Aluminum-Clad Spent Nuclear Fuel Storage Canister - 19273

This study examines a preliminary three-dimensional (3D) multi-physics computational fluid dynamics (CFD) model of the unsealed canisters containing aluminum-clad spent nuclear fuel from INL's ATR in the irradiated fuel storage facility. This 3D CFD model considers fully resolved fuel plates in an unsealed canister with small mass exchange with surrounding air as time evolves in the simulation and contains a network of chemical reactions to consider due to several of the side reactions occurring in the presence of water vapor, nitrogen, oxygen and carbon dioxide rather than in helium backfilled DOE standard canisters. Prior to the CFD modeling, the full set of chemical reactions under these conditions was analyzed, reduced, and refit to a more manageable number of equations for the computational efficiency of the 3D CFD simulation. To deal with the long time-scale of interest for tracking the possible buildup of trace species such as nitric acid, NOx, and hydrogen, a segregated time stepping algorithm is used, wherein the velocity field is only updated periodically, and assumed to be in a pseudo steady state. This study first examines the theory of the model, workflow to establish radiolysis reaction network, and initial simulations of the evolutions of thermal fields, hydrogen gas and nitric acid concentrations within unsealed canisters in conditions relevant to the INL INTEC CPP-603 facility over a long period of time. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Piloted simulation of an on-board trajectory optimization algorithm

This paper will describe a real time piloted simulation of algorithms designed for on-board computation of time-optimal intercept trajectories for an F-8 aircraft. The algorithms, which were derived using singular perturbation theory, generate commands that are displayed to the pilot on flight director needles on the 8-ball. By flying the airplane so as to zero the horizontal and vertical needles, the pilot flies an approximation to a time-optimal intercept trajectory. The various display and computation modes that are available will be described and results will be presented illustrating the performance of the algorithms with a pilot in the loop.

Price, D. B.↗