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 235 records · Page 13

An energy-aware multiobjective ant colony algorithm to minimize total completion time and energy cost on a single-machine preemptive scheduling

Energy-aware scheduling in manufacturing operations with time-of-use electricity tariffs is a challenging problem. Sustainable manufacturing is gaining significant momentum: companies are not only improving their product quality, but also optimizing the production processes to improve energy consumption (i.e., minimizing energy cost) in order to manage environmental challenges which contribute to global climate change. The purpose of this paper is to study a preemptive scheduling problem on a single-machine to minimize the total completion time and total energy cost under time-of-use electricity tariffs, which is a mixed-integer multiobjective mathematical programming model. To solve these objectives, we develop several new holistic ant colony optimization algorithms. The proposed model is solved via several methods including weighted sum method (WSM) using CPLEX, and multiobjective ant colony optimization based on a dominance ranking (ACO-DR) or based on a dominance ranking procedure and crowding distance comparison (ACO-DRC) or based on a heuristic approach to obtain an approximate Pareto-front and also provide information on when to start and resume each job for any solution on the Pareto-front. We provide detailed experimental results evaluating the performance of the proposed algorithms. In a case study, we demonstrate how the results of the multiobjective model could be utilized in decision making using the multiobjective optimization on the basis of ratio analysis (MOORA) method. Furthermore, this proposed model and heuristics allows decision makers to operate in challenging-data enabled environments in industrial internet of things ecosystem, and assists in optimizing production planning to improve energy cost.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Dynamics of multicomponent vesicles in a viscous fluid

We develop and investigate numerically a thermodynamically consistent model of two-dimensional multicomponent vesicles in an incompressible viscous fluid. The model is derived using an energy variation approach that accounts for different lipid surface phases, the excess energy (line energy) associated with surface phase domain boundaries, bending energy, spontaneous curvature, local inextensibility and fluid flow via the Stokes equations. The equations are high-order (fourth order) nonlinear and nonlocal due to incompressibility of the fluid and the local inextensibility of the vesicle membrane. To solve the equations numerically, we develop a nonstiff, pseudo-spectral boundary integral method that relies on an analysis of the equations at small scales. The algorithm is closely related to that developed very recently by Veerapaneni et al. [81] for homogeneous vesicles although we use a different and more efficient time stepping algorithm and a reformulation of the inextensibility equation. We present simulations of multicomponent vesicles in an initially quiescent fluid and investigate the effect of varying the average surface concentration of an initially unstable mixture of lipid phases. The phases then redistribute and alter the morphology of the vesicle and its dynamics. When an applied shear is introduced, an initially elliptical vesicle tank-treads and attains a steady shape and surface phase distribution. A sufficiently elongated vesicle tumbles and the presence of different surface phases with different bending stiffnesses and spontaneous curvatures yields a complex evolution of the vesicle morphology as the vesicle bends in regions where the bending stiffness and spontaneous curvature are small.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Simulating Catalysis with Realistic Pellet Geometries Using Mesoflow: A Case Study of Catalytic Propane Dehydrogenation

We present a case study of catalytic propane dehydrogenation with our open-source multiphysics solver, Mesoflow. The solver was developed to simulate reactive flow coupled to heterogeneous catalytic reactions and deactivation in the context of complex, mesoscale geometry. The method leverages cartesian block-structured adaptive mesh refinement to capture realistic catalyst microstructural features acquired directly from X-ray computed tomography data. A kinetic model for propane dehydrogenation and catalyst deactivation was developed based on temporal analysis of products (TAP) reactor experiments. The TAP reactor experiments allow for precise characterization of intrinsic kinetic reaction steps which are implemented into Mesoflow simulations to model the spatial and temporal evolution of reactants, products, and catalyst active sites. The short-term and long-term deactivation behavior is studied by using XCT data collected from fresh and aged catalyst pellets, which exhibit different microstructural features. This study employs time-splitting algorithms to connect disparate reaction and flow timescales, enabling the simulations to achieve realistic deactivation timescales on the order of minutes while the flow time-scales for small particles (100 microns) are several milliseconds. We also introduce a flexible automated python script that writes the necessary files to construct a Mesoflow simulation from user-created chemical mechanisms. We will also introduce a few new features that are added to Mesoflow such as higher order schemes, implicit chemistry integrators and the ability to run on AMD and NVIDIA graphics-processing-units.

AMReX↗

Time Analysis for Probabilistic Workflows

There are many theoretical and practical results in the area of workflow modeling, especially when the more formal workflows are used. In this paper we focus on probabilistic workflows. We show algorithms for time computations in probabilistic workflows. With time of activities more precisely modeled, we can achieve improvement in the work cooperation and analyses of cooperation including simulation and visualization.

Czejdo, Bogdan↗

Fully implicit crystal plasticity models representing orientations with modified Rodrigues parameters

Here, this work describes a crystal plasticity formulation combining several mathematical, numerical, and implementation choices to produce a highly efficient model. Specifically, the key choices in the implementation are (1) representing orientations with modified Rodrigues parameters, (2) implementing a fully coupled implicit time integration for the elastic stretch, the crystal orientations, and the model internal variables, (3) implementing the model in the NEML2 constitutive modeling framework, based on PyTorch, to vectorize the calculations and port the computation to GPUs and other hardware accelerators, and (4) an exact implementation of the consistent tangent matrix, even for arbitrary coupling to other field variables beyond the displacements, like temperature, neutron fluence, etc. The first two features of the model are, to our knowledge, novel. The paper considers each of these choices individually as well as the final model as a whole. This includes a full description of modified Rodrigues parameters, their advantages over other representations of orientations, the mathematical formulae and tools required to implement a model with modified Rodrigues parameters, and a detailed description of the geometry of the space of modified Rodrigues parameters (in an appendix). It also includes a description of a fully implicit time integration scheme for the orientations and the advantages in representing orientations with modified Rodrigues parameters in implementing such a model. The work then assess, via numerical examples, the advantages of fully coupled implicit time integration versus more common decoupled and explicit time integration schemes. These studies demonstrate the computational advantages of fully coupled integration versus other time integration algorithms, though the performance of the competing models depends on the complexity of the underlying single crystal model. The study concludes by demonstrating that the choice of time integration method affects the sharpness of the predicted texture, with explicit methods for integrating the orientations overestimating texture sharpness and implicit methods underestimating texture sharpness.

Crystal plasticity↗

Time lagged ordinal partition networks for capturing dynamics of continuous dynamical systems

We investigate a generalised version of the recently proposed ordinal partition time series to network transformation algorithm. First, we introduce a fixed time lag for the elements of each partition that is selected using techniques from traditional time delay embedding. The resulting partitions define regions in the embedding phase space that are mapped to nodes in the network space. Edges are allocated between nodes based on temporal succession thus creating a Markov chain representation of the time series. We then apply this new transformation algorithm to time series generated by the Rössler system and find that periodic dynamics translate to ring structures whereas chaotic time series translate to band or tube-like structures—thereby indicating that our algorithm generates networks whose structure is sensitive to system dynamics. Furthermore, we demonstrate that simple network measures including the mean out degree and variance of out degrees can track changes in the dynamical behaviour in a manner comparable to the largest Lyapunov exponent. We also apply the same analysis to experimental time series generated by a diode resonator circuit and show that the network size, mean shortest path length, and network diameter are highly sensitive to the interior crisis captured in this particular data set.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Efficient numerical algorithm for multi-level ionization of high-atomic-number gases

An efficient numerical algorithm for laser driven multi-level ionization of high-atomic-number gases is proposed and implemented in an electromagnetic particle-in-cell code SPACE. The algorithm is based on analytical solutions to the system of differential equations describing ionization evolution. Using analytical solutions resolves the multiscale issue of ionization due to different characteristic time scales of ionization processes and the main code time step. Algorithm efficiency and memory requirements are significantly improved by using a locally reduced system of differential equations. The algorithm also assigns proper orbital quantum numbers and their projections to ionization states. The algorithm is verified and validated using experimental data.

Cheng, A. (ORCID:000000021945282X)↗

Newmark local time stepping on high-performance computing architectures

In multi-scale complex media, finite element meshes often require areas of local refinement, creating small elements that can dramatically reduce the global time-step for wave-propagation problems due to the CFL condition. Local time stepping (LTS) algorithms allow an explicit time-stepping scheme to adapt the time-step to the element size, allowing near-optimal time-steps everywhere in the mesh. We develop an efficient multilevel LTS-Newmark scheme and implement it in a widely used continuous finite element seismic wave-propagation package. In particular, we extend the standard LTS formulation with adaptations to continuous finite element methods that can be implemented very efficiently with very strong element-size contrasts (more than 100x). Capable of running on large CPU and GPU clusters, we present both synthetic validation examples and large scale, realistic application examples to demonstrate the performance and applicability of the method and implementation on thousands of CPU cores and hundreds of GPUs.

97 MATHEMATICS AND COMPUTING↗

Efficient hybrid explicit-implicit learning for multiscale problems

Splitting method is a powerful method to handle application problems by splitting physics, scales, domain, and so on. Many splitting algorithms have been designed for efficient temporal discretization. Here, in this paper, our goal is to use temporal splitting concepts in designing machine learning algorithms and, at the same time, help splitting algorithms by incorporating data and speeding them up. We propose a machine learning assisted splitting scheme which improves the efficiency of the scheme meanwhile preserves the accuracy. We consider a recently introduced multiscale splitting algorithms, where the multiscale problem is solved on a coarse grid. To approximate the dynamics, only a few degrees of freedom are solved implicitly, while others explicitly. This splitting concept allows identifying degrees of freedom that need implicit treatment. In this paper, we use this splitting concept in machine learning and propose several strategies. First, the implicit part of the solution can be learned as it is more difficult to solve, while the explicit part can be computed. This provides a speed-up and data incorporation for splitting approaches. Secondly, one can design a hybrid neural network architecture because handling explicit parts requires much fewer communications among neurons and can be done efficiently. Thirdly, one can solve the coarse grid component via PDEs or other approximation methods and construct simpler neural networks for the explicit part of the solutions. We discuss these options and implement one of them by interpreting it as a machine translation task. This interpretation of the splitting scheme successfully enables us using the Transformer since it can perform model reduction for multiple time series and learn the connection between them. We also find that the splitting scheme is a great platform to predict the coarse solution with insufficient information of the target model: the target problem is partially given and we need to solve it through a known problem which approximates the target. Our machine learning model can incorporate and encode the given information from two different problems and then solve the target problems. We conduct four numerical examples and the results show that our method is stable and accurate.

97 MATHEMATICS AND COMPUTING↗

Developing Soret Transport Coefficients for Lanthanides from Experimental Results

Understanding the nature of lanthanide transport in metallic fuels and its relation to fuel clad chemical interaction (FCCI) has been has been a topic that is long on interest and short on data. Recent experiments have shown a strong temperature-gradient based diffusion (Soret diffusion) and have thus provided vitally important information for modelers. However, details about the actual coefficients and many of the relevant processes that crucially participate in the cerium migration and precipitation process have not yet been disclosed. Using a combination of computing tools (primarily python and BISON) we are exploring methods that may extract useful information from visual data. In this specific example, we are using what is formally called 'blob detection' algorithms to analyzed the precipitate distribution of cerium in a U-Zr metal that has had a fixed temperature gradient enforced upon it for a specified period of time. These algorithms, once properly adapted to the problem at hand, may be useful at extracting information from radial and axial scans of metallic fuels which are much more abundant than direct measurements of lanthanides. We have developed a model that qualitatively works to move mass along a temperature gradient and precipitate heavily in the cold regions. Additionally, we have observed that the solubility of cerium in U-Zr held under this kind of temperature gradient is subject to some amount of U-Zr constituent redistribution. Our results predict movement of the Zr toward the hot end of the rod followed by a U-rich layer with the cooler 3/5 of the rod staying close the the initial U-Zr distribution. A more complete analysis will define groups of correlated parameters that correctly simulate the resulting distribution of precipitates. This restricted parameters space will give smaller bounds to modelers and will expedite the analysis of future works as new and more accurate data are made available. A follow-up experiment that started with 1/10 of the initial concentration of cerium may provide valuable additional information with regard to the effect of the rates of precipitation and dissolution as well as demonstrating the potential rapidity of migration in a lower burnup scenario. (authors)

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

A Study of Model-Based Protective Fast-Charging and Associated Degradation in Commercial Smartphone Cells: Insights on Cathode Degradation as a Result of Lithium Depositions on the Anode

The ever expanding mobile consumer electronic market has accelerated the need for safe and efficient fast-charging approaches that improve the overall speed of battery charging without hastened deterioration of the battery performance. Herein, the impact of a resource inexpensive, physics-based, electrochemically optimized fast-charging algorithm (charging time < 2 h) for mobile devices is investigated. A critical difference in the amount and morphology of lithium deposits on the anode for cells fast-charged without an optimized algorithm is observed and found to be the main cause of capacity decay. Furthermore, an in-depth study of the LiCoO 2 cathode regions opposite to pronounced lithium deposits on the anode reveals a “mirroring” phenomenon, i.e., a frozen monoclinic phase, and inactivity to relithiation. In operando hard X-ray absorption spectroscopy reveals that degraded spots on harvested cathodes seem to be activated again and participate in the intercalation process when lithiated at low rates from lithium foil counter electrodes. On the other hand, tests at higher C-rates, closer to the actual fast-charging rate, reveal only negligible oxidation state changes and therefore poor performance.

25 ENERGY STORAGE↗

Approximation algorithms in combinatorial scientific computing

We survey recent work on approximation algorithms for computing degree-constrained subgraphs in graphs and their applications in combinatorial scientific computing. The problems we consider include maximization versions of cardinality matching, edge-weighted matching, vertex-weighted matching and edge-weighted $b$ -matching, and minimization versions of weighted edge cover and $b$ -edge cover. Exact algorithms for these problems are impractical for massive graphs with several millions of edges. For each problem we discuss theoretical foundations, the design of several linear or near-linear time approximation algorithms, their implementations on serial and parallel computers, and applications. Our focus is on practical algorithms that yield good performance on modern computer architectures with multiple threads and interconnected processors. We also include information about the software available for these problems.

Mathematics↗

SU-E-T-31: A Fast Finite Size Pencil Beam (FSPB) Convolution Algorithm for a New Co-60 Arc Therapy Machine

Purpose: Present a fast Finite Size Pencil Beam (FSPB) convolution algorithm for a new Co-60 arc therapy machine. The FSPB algorithm accounts for (i) strong angular divergence (short SAD), (ii) heterogeneity effect for primary attenuation, and (iii) source energy spectrum. Methods: The FSPB algorithm is based on a 0.5×0.5-cm2 dose kernel calculated using the GEPTS (Gamma Electron and Positron Transport System) Monte Carlo code. The dose kernel is tabulated using a thin XYZ mesh (0.1 mm steps in lateral directions) for radius less than 1 cm and using an RZ mesh (with varying steps) for larger radial distance. To account for SSD effect, 11 dose kernels with SSDs varying between 30 cm to 80 cm are calculated. Maynord factor and “lateral stretching” are applied to account for differences between closest and actual SSD. Appropriate rotations and second order interpolation are used to calculate the dose from a given beamlet to a point. Results: Accuracy: Dose distributions in water with 80 cm SSD are calculated using the new FSPB convolution algorithm and full Monte Carlo simulation (gold standard). Figs 1–4 show excellent agreements between FSPB and Monte Carlo calculations for different field sizes and at different depths. The dose distribution for a prostate case is calculated using FSPB (Fig.5). Sixty conformal beams with rectum blocking are assumed. Figs 6–8 show the comparison with Monte Carlo simulation based on the same beam apertures. The excellent agreement demonstrates the accuracy of the new algorithm in handling SSD variation, oblique incidence, and scatter contribution.Speed: The FSPB convolution algorithm calculates 28 million dose points per second using a single 2.2-GHz CPU. The present algorithm is seven times faster than a similar algorithm from Gu et al. (Phys. Med. Biol. 54, 2009, 6287–6297). Conclusion: A fast and accurate FSPB convolution algorithm was developed and benchmarked.

60 APPLIED LIFE SCIENCES↗

Analytic derivative couplings for spin-flip configuration interaction singles and spin-flip time-dependent density functional theory

We revisit the calculation of analytic derivative couplings for configuration interaction singles (CIS), and derive and implement these couplings for its spin-flip variant for the first time. Our algorithm is closely related to the CIS analytic energy gradient algorithm and should be straightforward to implement in any quantum chemistry code that has CIS analytic energy gradients. The additional cost of evaluating the derivative couplings is small in comparison to the cost of evaluating the gradients for the two electronic states in question. Incorporation of an exchange-correlation term provides an ad hoc extension of this formalism to time-dependent density functional theory within the Tamm-Dancoff approximation, without the need to invoke quadratic response theory or evaluate third derivatives of the exchange-correlation functional. Application to several different conical intersections in ethylene demonstrates that minimum-energy crossing points along conical seams can be located at substantially reduced cost when analytic derivative couplings are employed, as compared to use of a branching-plane updating algorithm that does not require these couplings. Application to H{sub 3} near its D{sub 3h} geometry demonstrates that correct topology is obtained in the vicinity of a conical intersection involving a degenerate ground state.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Validation of the stochastic inversion algorithm for acoustic travel-time tomography: a large eddy simulation study

Acoustic tomography (AT) is explored as a remote sensing technique to obtain instantaneous snapshots of temperature and velocity fluctuations for wind energy applications. This study integrates Large Eddy Simulation (LES) with the Stochastic Inversion (SI) method to validate the algorithm’s capacity for accurate reconstruction of atmospheric fluctuations. The initial findings demonstrate the efficacy of the method in accurately capturing the predominant flow structures. Normalized L2 error evaluations further inform the algorithm’s precision, with errors accentuated in less sampled peripheral regions. The results underscore the method’s promise as a non-intrusive observational tool, with ongoing development poised to improve its precision and reliability.

17 WIND ENERGY↗

The Feasibility of Incorporating a 3D Velocity Model Into Earthquake Location Around Salt Lake City, UT Using a Physics Informed Neural Network

Earthquake location algorithms typically require travel time calculation. Doing this calculation in 3D, despite advances in algorithm efficiency and computational power, can still be prohibitively expensive in terms of resources and storage. Implementation of high-resolution 3D models in routine earthquake location would be a significant step forward in most of the world. Machine learning algorithms have potential to act as substitutes for travel time calculation algorithms or stored travel time tables. We investigate EikoNet - a physics informed neural network machine learning model that estimates travel times very quickly and comes with negligible memory-overhead. Specifically, we apply EikoNet to the Wasatch Fault Community Velocity Model (WFCVM), a highly detailed and complex 3D velocity model of the Salt Lake City, UT region. While routine locations in the area and studies of the 2020 Magna, UT earthquake sequence used a 1D velocity model, a 3D model may help better our understanding the structure of the major fault in the region. Our primary goal was to test the speed, memory requirements, and accuracy of EikoNet compared to a reference eikonal solver. We find that while the EikoNet is exceedingly fast and requires little memory overhead, achieving acceptable accuracy in estimated travel times is difficult and requires extensive computational resources.

58 GEOSCIENCES↗

A fast multigrid algorithm for energy minimization under planar density constraints.

The two-dimensional layout optimization problem reinforced by the efficient space utilization demand has a wide spectrum of practical applications. Formulating the problem as a nonlinear minimization problem under planar equality and/or inequality density constraints, we present a linear time multigrid algorithm for solving a correction to this problem. The method is demonstrated in various graph drawing (visualization) instances.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Modeling of the SPERT Transients Using SERPENT2 with Time Dependent Capabilities

Over the last decade, multiphysics coupled calculations have become one of the most important research topics in the area of development and enhancement of reactor analysis and simulation tools. One of the main applications of these coupled simulations is transient analysis, which may involve modeling of experiments, normal plant operation or accident scenarios. Traditionally, the reactor physics side of coupled simulations has been represented by deterministic or hybrid Monte Carlo - deterministic methods. Monte Carlo techniques are limited by their high computational cost. However increased computing power makes their application to multiphysics modeling of transients feasible. Active research is underway to develop algorithms for time dependent calculations, implement them in Monte Carlo codes, and evaluate their performance. In this paper time dependent simulations of the SPERT experiments using the Serpent2 code are presented.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗