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 937 records · Page 52

Collaborative Research: Continuous Dynamic Grid Adaptation in a Global Atmospheric Model - Application and Refinement

This project had goals of advancing the performance capabilities of the numerical general circulation model EULAG and using it to produce a fully operational atmospheric global climate model (AGCM) that can employ either static or dynamic grid stretching for targeted phenomena. The resulting AGCM combined EULAG's advanced dynamics core with the "physics" of the NCAR Community Atmospheric Model (CAM). Effort discussed below shows how we improved model performance and tested both EULAG and the coupled CAM-EULAG in several ways to demonstrate the grid stretching and ability to simulate very well a wide range of scales, that is, multi-scale capability. We leveraged our effort through interaction with an international EULAG community that has collectively developed new features and applications of EULAG, which we exploited for our own work summarized here. Overall, the work contributed to over 40 peer-reviewed publications and over 70 conference/workshop/seminar presentations, many of them invited. 3a. EULAG Advances EULAG is a non-hydrostatic, parallel computational model for all-scale geophysical flows. EULAG's name derives from its two computational options: EULerian (flux form) or semi-LAGrangian (advective form). The model combines nonoscillatory forward-in-time (NFT) numerical algorithms with a robust elliptic Krylov solver. A signature feature of EULAG is that it is formulated in generalized time-dependent curvilinear coordinates. In particular, this enables grid adaptivity. In total, these features give EULAG novel advantages over many existing dynamical cores. For EULAG itself, numerical advances included refining boundary conditions and filters for optimizing model performance in polar regions. We also added flexibility to the model's underlying formulation, allowing it to work with the pseudo-compressible equation set of Durran in addition to EULAG's standard anelastic formulation. Work in collaboration with others also extended the demonstrated range of validity of soundproof models, showing that they are more broadly applicable than some had previously thought. Substantial testing of EULAG included application and extension of the Jablonowski-Williamson baroclinic wave test - an archetype of planetary weather - and further analysis of multi-scale interactions arising from collapse of temperature fronts in both the baroclinic wave test and simulations of the Held-Suarez idealized climate. These analyses revealed properties of atmospheric gravity waves not seen in previous work and further demonstrated the ability of EULAG to simulate realistic behavior over several orders of magnitude of length scales. Additional collaborative work enhanced capability for modeling atmospheric flows with adaptive moving meshes and demonstrated the ability of EULAG to move into petascale computing. 3b. CAM-EULAG Advances We have developed CAM-EULAG in collaboration with former project postdoc, now University of Cape Town Assistant Professor, Babatunde Abiodun. Initial study documented good model performance in aqua-planet simulations. In particular, we showed that the grid adaptivity (stretching) implemented in CAM-EULAG allows higher resolution in selected regions without causing anomalous behavior such as spurious wave reflection. We then used the stretched-grid version to analyze simulated extreme precipitation events in West Africa, comparing the precipitation and event environment with observed behavior. The model simulates fairly well the spatial scale and the interannual and intraseasonal variability of the extreme events, although its extreme precipitation intensity is weaker than observed. In addition, both observations and the simulations show possible forcing of extreme events by African easterly waves. 3c. Other Contributions Through our collaborations, we have made contributions to a wide range of outcomes. For research focused on terrestrial behavior, these have included (1) upwind schemes for gas dynamics, (2) a nonlinear perspective on the dynamics of the Madden-Julian Oscillation, (3) numerical realism of thermal convection, (4) extreme precipitation processes, (5) unstructured meshes, (6) porous-media analogies for simulating flow in urban environments, (7) Monge-Ampere enhancements of semi-Lagrangian methods and (8) further extensions of the generality of EULAG applications to geophysical problems. The generality of EULAG for multi-scale flow was also demonstrated through solar applications. Simulations of solar magnetohydrodynamics showed that EULAG produces the solar cycle fairly well. Although the model's solar cycle is significantly longer than observed, it shows remarkable agreement with observations in features of spatial evolution. These efforts in environments that are extreme from a geophysical perspective have helped to establish the robustness of EULAG as an all-scale code for geophysical applications.

54 ENVIRONMENTAL SCIENCES↗

Xyce TM Parallel Electronic Simulator: Users’ Guide, Version 5.3

This manual describes the use of the Xyce Parallel Electronic Simulator. Xyce has been designed as a SPICE-compatible, high-performance analog circuit simulator, and has been written to support the simulation needs of the Sandia National Laboratories electrical designers. This development has focused on improving capability over the current state-of-the-art in the following areas: ■ Capability to solve extremely large circuit problems by supporting large-scale parallel computing platforms (up to thousands of processors). Note that this includes support for most popular parallel and serial computers. ■ Improved performance for all numerical kernels (e.g., time integrator, nonlinear and linear solvers) through state-of-the-art algorithms and novel techniques. ■ Device models which are specifically tailored to meet Sandia’s needs, including some radiation-aware devices (for Sandia users only). ■ Object-oriented code design and implementation using modern coding practices that ensure that the Xyce Parallel Electronic Simulator will be maintainable and extensible far into the future. Xyce is a parallel code in the most general sense of the phrase - a message passing parallel implementation - which allows it to run efficiently on the widest possible number of computing platforms. These include serial, shared-memory and distributed-memory parallel as well as heterogeneous platforms. Careful attention has been paid to the specific nature of circuit-simulation problems to ensure that optimal parallel efficiency is achieved as the number of processors grows. The development of Xyce provides a platform for computational research and development aimed specifically at the needs of the Laboratory. With Xyce, Sandia has an “in-house” capability with which both new electrical (e.g., device model development) and algorithmic (e.g., faster time-integration methods, parallel solver algorithms) research and development can be performed. As a result, Xyce is a unique electrical simulation capability, designed to meet the unique needs of the laboratory

42 ENGINEERING↗

Xyce Parallel Electronic Simulator : users' guide, version 4.1.

This manual describes the use of the Xyce Parallel Electronic Simulator. Xyce has been designed as a SPICE-compatible, high-performance analog circuit simulator, and has been written to support the simulation needs of the Sandia National Laboratories electrical designers. This development has focused on improving capability over the current state-of-the-art in the following areas: (1) Capability to solve extremely large circuit problems by supporting large-scale parallel computing platforms (up to thousands of processors). Note that this includes support for most popular parallel and serial computers. (2) Improved performance for all numerical kernels (e.g., time integrator, nonlinear and linear solvers) through state-of-the-art algorithms and novel techniques. (3) Device models which are specifically tailored to meet Sandia's needs, including some radiation-aware devices (for Sandia users only). (4) Object-oriented code design and implementation using modern coding practices that ensure that the Xyce Parallel Electronic Simulator will be maintainable and extensible far into the future. Xyce is a parallel code in the most general sense of the phrase - a message passing parallel implementation - which allows it to run efficiently on the widest possible number of computing platforms. These include serial, shared-memory and distributed-memory parallel as well as heterogeneous platforms. Careful attention has been paid to the specific nature of circuit-simulation problems to ensure that optimal parallel efficiency is achieved as the number of processors grows. The development of Xyce provides a platform for computational research and development aimed specifically at the needs of the Laboratory. With Xyce, Sandia has an 'in-house' capability with which both new electrical (e.g., device model development) and algorithmic (e.g., faster time-integration methods, parallel solver algorithms) research and development can be performed. As a result, Xyce is a unique electrical simulation capability, designed to meet the unique needs of the laboratory.

99 GENERAL AND MISCELLANEOUS↗

Generation of artificial helioseismic time-series

We present an outline of an algorithm to generate artificial helioseismic time-series, taking into account as much as possible of the knowledge we have on solar oscillations. The hope is that it will be possible to find the causes of some of the systematic errors in analysis algorithms by testing them with such artificial time-series.

Schou, J.↗

SU-E-T-95: Delivery Time Estimator

Purpose: The development and testing of a tool for the inclusion of delivery time as a parameter in plan optimization. Methods: We developed an algorithm that estimates the time required for the machine and personnel movements required to deliver a treatment plan on a linear accelerator. We included dose rate, leaf motion, collimator motion, gantry motion, and couch motions (including time to enter the room to rotate the couch safely). Vault-specific parameters to account for time to enter and perform couch angle adjustments were also included. This algorithm works for static, step and shoot IMRT, and VMAT beams photon beams and for fixed electron beams. This was implemented as a script in our treatment planning system. We validated the estimator against actual recorded delivery time from our R and V system as well as recorded times from our IMRT QA delivery. Results: Data was collected (Figure 1) for 12 treatment plans by examining the R and V beam start times, and by manually timing the QA treatment for a reference, but the QA measurements were only significant to the nearest minute. The average difference between the estimated and R and V times was 15%, and 11% when excluding the major outliers. Outliers arose due to respiratory aides and gating techniques which could not be accounted for in the estimator. Conclusion: Non-mechanical factors such as the time a therapist needs to walk in and out of the room to adjust the couch needed to be fine-tuned and cycled back into the algorithm to improve the estimate. The algorithm has been demonstrated to provide reasonable and useful estimates for delivery time. This estimate has provided a useful additional input for clinical decision-making when comparing several potential radiation treatment options.

07 ISOTOPE AND RADIATION SOURCES↗

MANCINTAP: Time and space dependent neutron activation tool algorithm improvement and analysis of a PWR nozzle gallery

MANCINTAP [1], a fully automated tool for determining the activation patterns in complex 4D scenarios and evaluating the distribution of the ensuing radiation fields, has been improved. The constraint of forcing the user to define a single global mesh in order to approximate the whole problem, a limitation which prevented an accurate description of detail-rich geometries, has been overcome. The algorithm was improved and many limitations were relaxed. MANCINTAP is now capable of handling many different geometry elements in a given area at once, even if they have very different geometries and characteristic dimensions, thus allowing a vastly more complete and detailed analysis. Different meshes can be superimposed to the 3D geometry, allowing for an appropriate, dedicated treatment of all the relevant features of the problem, and the results are automatically combined in order to provide a global perspective. These new capabilities were accurately tested by applying the tool to the study of time-dependent radiation levels during shutdown in the upper reactor cavity and nozzle gallery regions of a 2-loop PWR reactor. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

A fourth-order adaptive mesh refinement algorithm for the multicomponent, reacting compressible Navier–Stokes equations

In this study, we present a fourth-order in space and time block-structured adaptive mesh refinement algorithm for the compressible multicomponent reacting Navier–Stokes equations. The algorithm uses a finite-volume approach that incorporates a fourth-order discretisation of the convective terms. The time-stepping algorithm is based on a multi-level spectral deferred corrections method that enables explicit treatment of advection and diffusion coupled with an implicit treatment of reactions. The temporal scheme is embedded in a block-structured adaptive mesh refinement algorithm that includes subcycling in time with spectral deferred correction sweeps applied on levels. Here we present the details of the multi-level scheme paying particular attention to the treatment of coarse–fine boundaries required to maintain fourth-order accuracy in time. We then demonstrate the convergence properties of the algorithm on several test cases including both non-reacting and reacting flows. Finally we present simulations of a vitiated dimethyl ether jet in 2D and a turbulent hydrogen jet in 3D, both with detailed kinetics and transport.

97 MATHEMATICS AND COMPUTING↗

Spectral factorization in periodically time-varying systems and application to navigation problems.

Spectral factorization has been used previously to derive the steady-state solution of Kalman filtering equations without iteration for constant coefficient systems. The present work extends the spectral factorization algorithm to time-varying systems having periodic coefficient matrices for cases of both discrete and continuous systems. Time-consuming, expensive iterations of sequential covariance equations are not required to reach the final solution since this is an algebraic algorithm employing existing eigenvalue, eigenvector subroutines. The computer program incorporating the algorithm is suitable for sensitivity studies in formulating navigation and guidance strategies of low-thrust interplanetary missions. The determination of an optimum tracking pattern from an earth station is examined as an example.

Nishimura, T.↗

Reactive burn models and ignition & growth concept

Plastic-bonded explosives are heterogeneous materials. Experimentally, shock initiation is sensitive to small amounts of porosity, due to the formation of hot spots (small localized regions of high temperature). This leads to the Ignition and Growth concept, introduced by Lee and Tarver in 1980, as the basis for reactive burn models. A homogeneized burn rate needs to account for three mesoscale physical effects (i) the density of burnt hot spots, which depends on the lead shock strength; (ii) the growth of the burn fronts triggered by hot spots, which depends on the local deflagration speed; (iii) a geometric factor that accounts for the overlap of deflagration wavelets from adjacent hot spots. These effects can be combined and the burn model defined by specifying the reaction progress variable {lambda}(t) as a function of a dimensionless reaction length {tau}{sub hs}(t)/{ell}{sub hs}, rather than by xpecifying an explicit burn rate. The length scale {ell}{sub hs} is the average distance between hot spots, which is proportional to [N{sub hs}(P{sub s})]{sup -1/3}, where N{sub hs} is the number density of hot spots activated by the lead shock. The reaction length {tau}{sub hs}(t) = {line_integral}{sub 0}{sup t} D(P(t'))dt' is the distance the burn front propagates from a single hot spot, where D is the deflagration speed and t is the time since the shock arrival. A key implementation issue is how to determine the lead shock strength in conjunction with a shock capturing scheme. They have developed a robust algorithm for this purpose based on the Hugoniot jump condition for the energy. The algorithm utilizes the time dependence of density, pressure and energy within each cell. The method is independent of the numerical dissipation used for shock capturing. It is local and can be used in one or more space dimensions. The burn model has a small number of parameters which can be calibrated to fit velocity gauge data from shock initiation experiments.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Identification of periods of clear sky irradiance in time series of GHI measurements

In this study, we present a simple algorithm for identifying periods of time with broadband global horizontal irradiance (GHI) similar to that occurring during clear sky conditions from a time series of GHI measurements. Other available methods to identify these periods do so by identifying periods with clear sky conditions using additional measurements, such as direct or diffuse irradiance. Our algorithm compares characteristics of the time series of measured GHI with the output of a clear sky model without requiring additional measurements. We validate our algorithm using data from several locations by comparing our results with those obtained from a clear sky detection algorithm, and with satellite and ground-based sky imagery.

14 SOLAR ENERGY↗

A compact digital time differential perturbed angular correlation-spectrometer using field programmable gate arrays and various timestamp algorithms

A user-friendly fully digital time differential perturbed angular correlation (TDPAC)-spectrometer with six detectors and fast digitizers using field programmable gate arrays (FPGA) is described and performance data are given. The new spectrometer has an online data analysis feature, a compact size, and a time resolution such as conventional analog spectrometers. Its calculation intensive part was implemented inside the digitizer. This gives the possibility to change parameters (energy windows, constant fraction trigger delay) and see their influence immediately in the {gamma}-{gamma} correlation diagrams. Tests were performed which showed that the time resolution using a {sup 60}Co source with energy window set at 1.17 MeV and 1.33 MeV is 265 ps with LaBr{sub 3}(Ce) scintillators and 254 ps with BaF{sub 2} scintillators. A true constant fraction algorithm turned out to be slightly better than the constant fraction of amplitude method. The spectrometer performance was tested with a TDPAC measurement using a {sup 44}Ti in rutile source and a positron lifetime measurement using {sup 22}Na. The maximum possible data rate of the spectrometer is 1.1 x 10{sup 6} {gamma} quanta per detector and second.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Attitude determination and calibration using a recursive maximum likelihood-based adaptive Kalman filter

An adaptive Kalman filter design that utilizes recursive maximum likelihood parameter identification is discussed. At the center of this design is the Kalman filter itself, which has the responsibility for attitude determination. At the same time, the identification algorithm is continually identifying the system parameters. The approach is applicable to nonlinear, as well as linear systems. This adaptive Kalman filter design has much potential for real time implementation, especially considering the fast clock speeds, cache memory and internal RAM available today. The recursive maximum likelihood algorithm is discussed in detail, with special attention directed towards its unique matrix formulation. The procedure for using the algorithm is described along with comments on how this algorithm interacts with the Kalman filter.

Kelly, D. A.↗

SU-E-T-629: Prediction of the ViewRay Radiotherapy Treatment Time for Clinical Logistics

Purpose: An algorithm is developed in our clinic, given a new treatment plan, to predict treatment delivery time for radiation therapy (RT) treatments of patients on ViewRay magnetic resonance-image guided radiation therapy (MR-IGRT) delivery system. This algorithm is necessary for managing patient treatment appointments, and is useful as an indicator to assess the treatment plan complexity. Methods: A patient’s total treatment delivery time, not including time required for localization, may be described as the sum of four components: (1) the treatment initialization time; (2) the total beam-on time; (3) the gantry rotation time; and (4) the multileaf collimator (MLC) motion time. Each of the four components is predicted separately. The total beam-on time can be calculated using both the planned beam-on time and the decay-corrected delivery dose rate. To predict the remaining components, we quantitatively analyze the patient treatment delivery record files. The initialization time is demonstrated to be random since it depends on the final gantry angle and MLC leaf positions of the previous treatment. Based on modeling the relationships between the gantry rotation angles and the corresponding rotation time, and between the furthest MLC leaf moving distance and the corresponding MLC motion time, the total delivery time is predicted using linear regression. Results: The proposed algorithm has demonstrated the feasibility of predicting the ViewRay treatment delivery time for any treatment plan of any patient. The average prediction error is 0.89 minutes or 5.34%, and the maximal prediction error is 2.09 minutes or 13.87%. Conclusion: We have developed a treatment delivery time prediction algorithm based on the analysis of previous patients’ treatment delivery records. The accuracy of our prediction is sufficient for guiding and arranging patient treatment appointments on a daily basis. The predicted delivery time could also be used as an indicator to assess the treatment plan complexity. This work was supported by a research grant from Viewray Inc.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Application of machine learning approaches in the analysis of mass absorption cross-section of black carbon aerosols: Aerosol composition dependencies and sensitivity analyses

Physics-based models typically require an in-depth understanding of a phenomenon and assumptions of the underlying process(es), which are often hard to obtain in practice, whereas data-driven machine learning models learn the structure and patterns in the training data without any prior theoretical assumptions and then use inference to develop useful predictions. A novel machine learning-based algorithm has been previously developed for the prediction of black carbon mass absorption cross-section (MAC BC ) and applied to a variety of different atmospheric environments. In contrast to light scattering theories which require assumptions about the underlying physics, this algorithm uses time-series data of aerosol properties to estimate the temporally-varying MAC BC at 870 nm. Here, we analyze our algorithm and discuss the influence of aerosol optical properties (such as Ångström exponents and single scattering albedo) and chemical composition on the model outputs and the associated accuracy. Additionally, we conduct sensitivity analyses on our models to understand how the predictions change in response to different sets of input variables. Our support vector machine (SVM) for regression model is the least sensitive to variations in the input variables, although all models tend to exhibit a degradation to their accuracy when scattering Ångström exponents are less than one.

54 ENVIRONMENTAL SCIENCES↗

Complex network approach to fractional time series

In order to extract correlation information inherited in stochastic time series, the visibility graph algorithm has been recently proposed, by which a time series can be mapped onto a complex network. We demonstrate that the visibility algorithm is not an appropriate one to study the correlation aspects of a time series. We then employ the horizontal visibility algorithm, as a much simpler one, to map fractional processes onto complex networks. The degree distributions are shown to have parabolic exponential forms with Hurst dependent fitting parameter. Further, we take into account other topological properties such as maximum eigenvalue of the adjacency matrix and the degree assortativity, and show that such topological quantities can also be used to predict the Hurst exponent, with an exception for anti-persistent fractional Gaussian noises. To solve this problem, we take into account the Spearman correlation coefficient between nodes' degrees and their corresponding data values in the original time series.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Comparing Methods for Dynamic Airspace Configuration

This paper compares airspace design solutions for dynamically reconfiguring airspace in response to nominal daily traffic volume fluctuation. Airspace designs from seven algorithmic methods and a representation of current day operations in Kansas City Center were simulated with two times today's demand traffic. A three-configuration scenario was used to represent current day operations. Algorithms used projected unimpeded flight tracks to design initial 24-hour plans to switch between three configurations at predetermined reconfiguration times. At each reconfiguration time, algorithms used updated projected flight tracks to update the subsequent planned configurations. Compared to the baseline, most airspace design methods reduced delay and increased reconfiguration complexity, with similar traffic pattern complexity results. Design updates enabled several methods to as much as half the delay from their original designs. Freeform design methods reduced delay and increased reconfiguration complexity the most.

Zelinski, Shannon↗

Comparing Methods for Dynamic Airspace Configuration

This paper compares airspace design solutions for dynamically reconfiguring airspace in response to nominal daily traffic volume fluctuation. Airspace designs from seven algorithmic methods and a representation of current day operations in Kansas City Center were simulated with two times today's demand traffic. A three-configuration scenario was used to represent current day operations. Algorithms used projected unimpeded flight tracks to design initial 24-hour plans to switch between three configurations at predetermined reconfiguration times. At each reconfiguration time, algorithms used updated projected flight tracks to update the subsequent planned configurations. Compared to the baseline, most airspace design methods reduced delay and increased reconfiguration complexity, with similar traffic pattern complexity results. Design updates enabled several methods to as much as half the delay from their original designs. Freeform design methods reduced delay and increased reconfiguration complexity the most.

Zelinski, Shannon↗

A Pulsar-Inspired Timing Framework for Power System: Optimization and Performance Evaluation

Due to their excellent stability, neutron pulsar stars are considered promising candidate timing sources for power system applications. However, the complexity of pulsar signals necessitates advanced processing algorithms to provide accurate timing references. This paper presents the foundational framework for pulsar signal processing, serving as the basis for further optimization. To enhance the timing accuracy and computation efficiency in pulsar period searches, three algorithms are proposed as the initial optimization step: wavelet de-noising, fast folding, and cross-correlation for profile evaluation. Wavelet de-noising improves signal-to-noise ratio (SNR) by 36%–70%. Fast folding reduces computation time from hundreds of seconds to mere milliseconds. Cross-correlation works better than traditional SNR-based methods by effectively identifying the optimal period. The performance of the proposed algorithms is evaluated using observation data from telescopes. Together, these algorithms significantly improve pulsar timing performance, reducing the error of the Pulse Per Second (PPS) signal from hundreds to tens of microseconds.

Wu, Ori [ORNL] (ORCID:0000000326723410)↗