Search NASA⌕ Search

SEARCH · Search NASA

Results for “numerical algorithms”

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 505 records · Page 28

ZEUS: An Efficient GPU Optimization Method Integrating PSO, BFGS, and Automatic Differentiation

We introduce a novel, efficient computational method, ZEUS, for numerical optimization, and provide an open-source implementation. It has four key ingredients: (1) particle swarm optimization (PSO), (2) the use of the Broyden-Fletcher-Goldfarb-Shanno (BFGS) method, (3) automatic differentiation (AD), and (4) GPUs. Our approach addresses the computational challenges inherent in high-dimensional, non-convex optimization problems. In the first phase of the algorithm, we get a potentially good set of starting points using PSO. Thereafter, we run BFGS independently in parallel from these starting points. BFGS is one of the best-performing algorithms for numerical optimization. However, it requires the gradient of the function being optimized. ZEUS integrates automatic differentiation into BFGS thus avoiding the need for the user to calculate derivatives explicitly. The use of GPUs allows ZEUS to speed up the calculations substantially. We carry out systematic studies to explore the trade-offs between the number of PSO iterations taken, starting points, and BFGS iteration depth. We show that a handful of iterations of PSO can improve global convergence when combined with BFGS. We also present performance studies using common test functions. The source code can be found at https://github.com/fnal-numerics/global-optimizer-gpu.

Soos, Dominik [Old Dominion U.]↗

A Posteriori Error Analysis of Two-Stage Computation Methods with Application to Efficient Discretization and the Parareal Algorithm

We consider numerical methods for initial value problems that employ a two stage approach consisting of solution on a relatively coarse discretization followed by solution on a relatively fine discretization. Examples include adaptive error control, parallel-in-time solution schemes, and efficient solution of adjoint problems for computing a posteriori error estimates. We describe a general formulation of two stage computations then perform a general a posteriori error analysis based on computable residuals and solution of an adjoint problem. The analysis accommodates various variations in the two stage computation and in formulation of the adjoint problems. We apply the analysis to compute “dual-weighted” a posteriori error estimates, to develop novel algorithms for efficient solution that take into account cancellation of error, and to the Parareal Algorithm. We test the various results using several numerical examples.

97 MATHEMATICS AND COMPUTING↗

The Bloch equation for spin dynamics in electron storage rings: Computational and theoretical aspects

In this paper, we describe our work on spin polarization in high-energy electron storage rings which we base on the Full Bloch equation (FBE) for the polarization density and which aims towards the [Formula: see text] option of the proposed Future Circular Collider (FCC-ee) and the proposed Circular Electron Positron Collider (CEPC). The FBE takes into account non spin-flip and spin-flip effects due to synchrotron radiation including the spin-diffusion effects and the Sokolov–Ternov effect with its Baier–Katkov generalization as well as the kinetic-polarization effect. This mathematical model is an alternative to the standard mathematical model based on the Derbenev–Kondratenko formulas. For our numerical and analytical studies of the FBE, we develop an approximation to the latter to obtain an effective FBE. This is accomplished by finding a third mathematical model based on a system of stochastic differential equations (SDEs) underlying the FBE and by approximating that system via the method of averaging from perturbative ODE theory. We also give an overview of our algorithm for numerically integrating the effective FBE. This discretizes the phase space using spectral methods and discretizes time via the additive Runge–Kutta (ARK) method which is a high-order semi-implicit method. We also discuss the relevance of the third mathematical model for spin tracking.

Physics↗

Differential holography

Differential Holography technology measures the amplitude and/or phase of, e.g., an incident linearly polarized spatially coherent quasi-monochromatic optical field by optically computing the first derivative of the field and linearly mapping it to an irradiance signal detectable by an image sensor. This information recorded on the image sensor is then recovered by a simple algorithm. In some embodiments, an input field is split into two or more beams to independently compute the horizontal and vertical derivatives (using amplitude gradient filters in orthogonal orientations) for detection on one image sensor in separate regions of interest (ROIs) or on multiple image sensors. A third unfiltered beam recorded in a third ROI directly measures amplitude variations in the input field to numerically remove its contribution as noise before recovering the original wavefront using a numerical in algorithm. When combined, the measured amplitude and phase constitute a holographic recording of the incident optical field.

Ravizza, Frank↗

Advanced fuel fusion, phase space engineering, and structure-preserving geometric algorithms

Non-thermal advanced fuel fusion trades the requirement of a large amount of recirculating tritium in the system for that of large recirculating power. Phase space engineering technologies utilizing externally injected electromagnetic fields can be applied to meet the challenge of maintaining non-thermal particle distributions at a reasonable cost. The physical processes of the phase space engineering are studied from a theoretical and algorithmic perspective. It is emphasized that the operational space of phase space engineering is limited by the underpinning symplectic dynamics of charged particles. The phase space incompressibility according to the Liouville theorem is just one of many constraints, and Gromov's non-squeezing theorem determines the minimum footprint of the charged particles on every conjugate phase space plane. In this sense and level of sophistication, the mathematical abstraction of phase space engineering is symplectic topology. To simulate the processes of phase space engineering, such as the Maxwell demon and electromagnetic energy extraction, and to accurately calculate the minimum footprints of charged particles, recently developed structure-preserving geometric algorithms can be used. The family of algorithms conserves exactly, on discretized spacetime, symplecticity and thus incompressibility, non-squeezability, and symplectic capacities. The algorithms apply to the dynamics of charged particles under the influence of external electromagnetic fields as well as the charged particle–electromagnetic field system governed by the Vlasov–Maxwell equations.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Computational projects with the Landau–Zener problem in the quantum mechanics classroom

The Landau–Zener problem, where a minimum energy separation is passed with constant rate in a two-state quantum-mechanical system, is an excellent model quantum system for a computational project. It requires a low-level computational effort, but has a number of complex numerical and algorithmic issues that can be resolved through dedicated work. It can be used to teach computational concepts, such as accuracy, discretization, and extrapolation, and it reinforces quantum concepts of time-evolution via a time-ordered product and of extrapolation to infinite time via time-dependent perturbation theory. Additionally, we discuss the concept of compression algorithms, which are employed in many advanced quantum computing strategies, and easy to illustrate with the Landau–Zener problem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Simulation-Based Inference for Neutrino Interaction Model Parameter Tuning

High-energy physics experiments studying neutrinos rely heavily on simulations of their interactions with atomic nuclei. Limitations in the theoretical understanding of these interactions typically necessitate ad hoc tuning of simulation model parameters to data. Traditional tuning methods for neutrino experiments have largely relied on simple algorithms for numerical optimization. While adequate for the modest goals of initial efforts, the complexity of future neutrino tuning campaigns is expected to increase substantially, and new approaches will be needed to make progress. In this paper, we examine the application of simulation-based inference (SBI) to the neutrino interaction model tuning for the first time. Using a previous tuning study performed by the MicroBooNE experiment as a test case, we find that our SBI algorithm can correctly infer the tuned parameter values when confronted with a mock data set generated according to the MicroBooNE procedure. This initial proof-of-principle illustrates a promising new technique for next-generation simulation tuning campaigns for the neutrino experimental community.

Tame-Narvaez, Karla Maria [Fermilab]↗

Simulation-based inference for neutrino interaction model parameter tuning

High-energy physics experiments studying neutrinos rely heavily on simulations of their interactions with atomic nuclei. Limitations in the theoretical understanding of these interactions typically necessitate ad hoc tuning of simulation model parameters to data. Traditional tuning methods for neutrino experiments have largely relied on simple algorithms for numerical optimization. While adequate for the modest goals of initial efforts, the complexity of future neutrino tuning campaigns is expected to increase substantially, and new approaches will be needed to make progress. In this paper, we examine the application of simulation-based inference (SBI) to the neutrino interaction model tuning for the first time. Using a previous tuning study performed by the MicroBooNE experiment as a test case, we find that our SBI algorithm can correctly infer the tuned parameter values when confronted with a mock data set generated according to the MicroBooNE procedure. This initial proof-of-principle illustrates a promising new technique for next-generation simulation tuning campaigns for the neutrino experimental community.

Tame-Narvaez, Karla [Fermilab] (ORCID:000000022249↗

Growth model of binary alloy nanopowders for thermal plasma synthesis

A new model is developed for numerical analysis of the entire growth process of binary alloy nanopowders in thermal plasma synthesis. The model can express any nanopowder profile in the particle size-composition distribution (PSCD). Moreover, its numerical solution algorithm is arithmetic and straightforward so that the model is easy to use. By virtue of these features, the model effectively simulates the collective and simultaneous combined process of binary homogeneous nucleation, binary heterogeneous cocondensation, and coagulation among nanoparticles. The effect of the freezing point depression due to nanoscale particle diameters is also considered in the model. In this study, the metal-silicon systems are particularly chosen as representative binary systems involving cocondensation processes. In consequence, the numerical calculation with the present model reveals the growth mechanisms of the Mo-Si and Ti-Si nanopowders by exhibiting their PSCD evolutions. The difference of the materials' saturation pressures strongly affects the growth behaviors and mature states of the binary alloy nanopowder.

36 MATERIALS SCIENCE↗

Randomized Algorithms for Linear Solvers

Recently, randomized algorithms in numerical linear algebra, specifically those centered around random sketching, have gained traction in primarily theoretical research due to their potential to significantly reduce problem dimensionality at the cost of an O(1) multiplicative distortion factor. It has been assumed that this sketching can be done efficiently, but thorough investigation into how precisely to do it has been neglected. Moreover, the theory-based community has argued for sketching’s ability to reduce computational cost via complexity analysis, but has not researched how it affects the stability of the algorithms. At Sandia, efficient linear solvers that scale well on modern HPC architectures while maintaining stability are imperative for practical applications. In this LDRD, we developed a random sketching strategy that is substantially faster than existing ones, and demonstrate its superior performance in practice on a NVIDIA H100 GPU. Moreover, we show how this can be used to significantly outperform existing linear least squares solvers while improving the solver’s stability as well. Additionally, we demonstrate how this sketching strategy can be used to make a fast, stable QR factorization that can subsequently be used in s-step and block Krylov solvers. Finally, we incorporate a sketching-based block orthogonalization scheme into s-step GMRES, which is stable and faster than existing approaches on the Perlmutter supercomputer.

97 MATHEMATICS AND COMPUTING↗

Accelerating Numerical Calculation on the Cray XMT

The Cray XMT provides hardware support for parallel algorithms that would be communication- or memory-bound on other machines. Unfortunately, even if an algorithm meets these criteria, performance suffers if the algorithm is too numerically intensive. We present a lookup-based approach that achieves a significant performance advantage over explicit calculation. We describe an approach to balancing memory bandwidth against on-chip floating point capabilities, leading to further speedup. Finally, we provide table lookup algorithms for a number of common functions.

97 MATHEMATICS AND COMPUTING↗

Rayleigh wave numerical dispersion in a 3D finite-difference algorithm.

A Rayleigh wave propagates laterally without dispersion in the vicinity of the plane stress-free surface of a homogeneous and isotropic elastic halfspace. The phase speed is independent of frequency and depends only on the Poisson ratio of the medium. However, after temporal and spatial discretization, a Rayleigh wave simulated by a 3D staggered-grid finite-difference (FD) seismic wave propagation algorithm suffers from frequency- and direction-dependent numerical dispersion. The magnitude of this dispersion depends critically on FD algorithm implementation details. Nevertheless, proper gridding can control numerical dispersion to within an acceptable level, leading to accurate Rayleigh wave simulations. Many investigators have derived dispersion relations appropriate for body wave propagation by various FD algorithms. However, the situation for surface waves is less well-studied. We have devised a numerical search procedure to estimate Rayleigh phase speed and group speed curves for 3D O(2,2) and O(2,4) staggered-grid FD algorithms. In contrast with the continuous time-space situation (where phase speed is obtained by extracting the appropriate root of the Rayleigh cubic), we cannot develop a closed-form mathematical formula governing the phase speed. Rather, we numerically seek the particular phase speed that leads to a solution of the discrete wave propagation equations, while holding medium properties, frequency, horizontal propagation direction, and gridding intervals fixed. Group speed is then obtained by numerically differentiating the phase speed with respect to frequency. The problem is formulated for an explicit stress-free surface positioned at two different levels within the staggered spatial grid. Additionally, an interesting variant involving zero-valued medium properties above the surface is addressed. We refer to the latter as an implicit free surface. Our preliminary conclusion is that an explicit free surface, implemented with O(4) spatial FD operators and positioned at the level of the compressional stress components, leads to superior numerical dispersion performance. Phase speeds measured from fixed-frequency synthetic seismograms agree very well with the numerical predictions.

58 GEOSCIENCES↗

Towards a frequency-dependent discrete maximum principle for the implicit Monte Carlo equations

It has long been known that temperature solutions of the Implicit Monte Carlo (IMC) equations can exceed the external boundary temperatures, a so-called violation of the 'maximum principle.' Previous attempts at prescribing a maximum value of the time-step size {Delta}{sub t} that is sufficient to eliminate these violations have recommended a {Delta}{sub t} that is typically too small to be used in practice and that appeared to be much too conservative when compared to numerical solutions of the IMC equations for practical problems. In this paper, we derive a new estimator for the maximum time-step size that includes the spatial-grid size {Delta}{sub x}. This explicitly demonstrates that the effect of coarsening {Delta}{sub x} is to reduce the limitation on {Delta}{sub t}, which helps explain the overly conservative nature of the earlier, grid-independent results. We demonstrate that our new time-step restriction is a much more accurate means of predicting violations of the maximum principle. We discuss how the implications of the new, grid-dependent timestep restriction can impact IMC solution algorithms.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A finite-difference time-domain simulation of high power microwave generated plasma at atmospheric pressures

A finite-difference algorithm was developed to calculate several RF breakdown parameters, for example, the formative delay time that is observed between the initial application of a RF field to a dielectric surface and the formation of field-induced plasma interrupting the RF power flow. The analysis is focused on the surface being exposed to a background gas pressure above 50 Torr. The finite-difference algorithm provides numerical solutions to partial differential equations with high resolution in the time domain, making it suitable for simulating the time evolving interaction of microwaves with plasma; in lieu of direct particle tracking, a macroscopic electron density is used to model growth and transport. This approach is presented as an alternative to particle-in-cell methods due to its low complexity and runtime leading to more efficient analysis for a simulation of a microsecond scale pulse. The effect and development of the plasma is modeled in the simulation using scaling laws for ionization rates, momentum transfer collision rates, and diffusion coefficients, as a function of electric field, gas type and pressure. The incorporation of plasma material into the simulation involves using the Z-transform to derive a time-domain algorithm from the complex frequency-dependent permittivity of plasma. Therefore, the effect of the developing plasma on the instantaneous microwave field is calculated. Simulation results are compared with power measurements using an apparatus designed to facilitate surface flashover across a polycarbonate boundary in a controlled N{sub 2}, air, or argon environment at pressures exceeding 50 Torr.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A Decision-Making Machine Learning Approach in Hermite Spectral Approximations of Partial Differential Equations

The accuracy and effectiveness of Hermite spectral methods for the numerical discretization of partial differential equations on unbounded domains are strongly affected by the amplitude of the Gaussian weight function employed to describe the approximation space. This is particularly true if the problem is under-resolved, i.e., there are no enough degrees of freedom. The issue becomes even more crucial when the equation under study is time-dependent, forcing in this way the choice of Hermite functions where the corresponding weight depends on time. In order to adapt dynamically the approximation space, it is here proposed an automatic decision-making process that relies on machine learning techniques, such as deep neural networks and support vector machines. The algorithm is numerically tested with success on a simple 1D problem, but the main goal is its exportability in the context of more serious applications. Here we also show at the end an application in the framework of plasma physics.

97 MATHEMATICS AND COMPUTING↗

Extended Barton–Bandis model for rock joints under cyclic loading: Formulation and implicit algorithm

In this paper, the Barton–Bandis model for rock joints is extended to cyclic loading conditions, without any new material parameter. Also developed herein is an implicit solution algorithm for the extended Barton–Bandis model, which can also be used for the original Barton–Bandis model for which an implicit algorithm has been unavailable. To this end, we first cast the Barton–Bandis model into an incremental elasto-plastic framework, deriving an expression for the elastic shear stiffness being consistent with the original model formulation. We then extend the model formulation to cyclic loading conditions, incorporating the dependence of shear stress and dilation on the joint position and the shearing direction. The extension is achieved by introducing a few state-dependent variables which can be calculated with the existing material parameters. For robust and accurate utilization of the model, we also develop an implicit algorithm based on return mapping, which is unconditionally stable and guarantees the satisfaction of the strength criterion. We verify that the proposed model formulation and algorithm produce virtually the same results as the original Barton–Bandis model under monotonic shearing conditions. Here, we then validate the extended Barton–Bandis model against experimental data on natural rock joints under cycling loading conditions. The present work thus enables the Barton–Bandis model, which has been exceptionally popular in research and practice, to be applicable to a wider range of problems in rock mechanics and rock engineering.

58 GEOSCIENCES↗

Parameter Estimation and Model Validation of Nonlinear Dynamical Networks

In the performance period of this work under a DOE contract, the co-PIs, Philip Gill and Henry Abarbanel, developed new methods for statistical data assimilation for problems of DOE interest, including geophysical and biological problems. This included numerical optimization algorithms for variational principles, new parallel processing Monte Carlo routines for performing the path integrals of statistical data assimilation. These results have been summarized in the monograph: “Predicting the Future: Completing Models of Observed Complex Systems” by Henry Abarbanel, published by Spring-Verlag in June 2013. Additional results and details have appeared in the peer reviewed literature.

42 ENGINEERING↗

Modeling of intragranular misorientation and grain fragmentation in polycrystalline materials using the viscoplastic self-consistent formulation

In this paper, the recently established methodology to use known algorithmic expressions of the second moments of the stress field in the grains of a polycrystalline aggregate for calculating average fluctuations of lattice rotation rates and the associated average intragranular misorientation distributions using the mean-field viscoplastic self-consistent (VPSC) formulation is extended to solve the coupled problem of considering the effect of intragranular misorientations on stress and rotation rate fluctuations. In turn, these coupled expressions are used to formulate and implement a grain fragmentation (GF) model in VPSC. Case studies, including tension and plane-strain compression of face-centered cubic polycrystals are used to illustrate the capabilities of the new model. GF-VPSC predictions of intragranular misorientation distributions and texture evolution are compared with experiments and full-field numerical simulations, showing good agreement. In particular, the inclusion of misorientation spreads reduced the intensity of the deformed texture and thus improved the texture predictions. Finally and moreover, considering that intragranular misorientations act as driving forces for recrystallization, the new GF-VPSC formulation is shown to enable modeling of microstructure evolution during deformation and recrystallization, in a computationally efficient manner.

36 MATERIALS SCIENCE↗