Search NASA⌕ Search

SEARCH · Search NASA

Results for “Numerical algorithm”

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 865 records · Page 48

Tartarus: A relativistic Green's function quantum average atom code

A relativistic Green’s Function quantum average atom model is implemented in the Tartarus code for the calculation of equation of state data in dense plasmas. We first present the relativistic extension of the quantum Green’s Function average atom model described by Starrett [1]. The Green’s Function approach addresses the numerical challenges arising from resonances in the continuum density of states without the need for resonance tracking algorithms or adaptive meshes, though there are still numerical challenges inherent to this algorithm. We discuss how these challenges are addressed in the Tartarus algorithm. The outputs of the calculation are shown in comparison to PIMC/DFT-MD simulations of the Principal Shock Hugoniot in Silicon. Finally, we also present the calculation of the Hugoniot for Silver coming from both the relativistic and nonrelativistic modes of the Tartarus code.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Energy-preserving coupling of explicit particle-in-cell with Monte Carlo collisions

The particle-in-cell (PIC) and Monte Carlo collisions (MCC) methods are workhorses of many numerical simulations of physical systems. Recently, it was pointed out that, while the two methods can be exactly—or nearly—energy-conserving independently, combining the two leads to anomalous numerical heating. This paper reviews the standard explicit PIC-MCC algorithm, elucidates the origins of the anomalous numerical heating, and explains how to couple the two methods such that the anomalous numerical heating is avoided.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Quantum optimization algorithms: Energetic implications

Since the dawn of quantum computing (QC), theoretical developments like Shor's algorithm proved the conceptual superiority of QC over traditional computing. However, such quantum supremacy claims are difficult to achieve in practice because of the technical challenges of realizing noiseless qubits. In the near future, QC applications will need to rely on noisy quantum devices that offload part of their work to classical devices. One way to achieve this is by using parameterized quantum circuits in optimization or even in machine learning tasks. The energy requirements of quantum algorithms have not yet been studied extensively. Here in this article, we explore several optimization algorithms using both theoretical insights and numerical experiments to understand their impact on energy consumption. Specifically, we highlight why and how algorithms like quantum natural gradient descent, simultaneous perturbation stochastic approximations or circuit learning methods, are at least 2x to 4x more energy efficient than their classical counterparts; why feedback-based quantum optimization is energy-inefficient; and how techniques like Rosalin can improve the energy efficiency of other algorithms by a factor of ≥2 0 x. Finally, we use the NchooseK high-level programming model to run optimization problems on both gate-based quantum computers and quantum annealers. Empirical data indicate that these optimization problems run faster, have better success rates, and consume less energy on quantum annealers than on their gate-based counterparts.

97 MATHEMATICS AND COMPUTING↗

Comparative analysis of algorithms for compensation of nonlinear distortions in fibre-optic links

We report the results of numerical modelling and comparative analysis of two algorithms for digital signal processing intended for signal demodulation in fibre-optic links (FOLs) operating in a nonlinear mode. The first algorithm is based on the use of nonlinear Schrödinger filters and the second one utilises the ‘reception in general with bit-by-bit decision making’ technique. It is found that the latter algorithm is more noiseproof, compared to the first one (with a SNR gain of about 0.5 dB), in single-channel fibre-optic links, and its operation does not require knowledge of the link parameters; therefore, the second algorithm can also be constructed for wavelength-division multiplexing systems. (paper)

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Liquid and liquid–gas flows at all speeds

All speed flows and in particular low Mach number flow algorithms are addressed for the numerical approximation of the Kapila et al. [1] multiphase flow model. This model is valid for fluid mixtures evolving in mechanical equilibrium but out of temperature equilibrium and is efficient for material interfaces computation separating miscible and non-miscible fluids. In this context, the interface is considered as a numerically diffused zone, captured as well as all present waves (shocks, expansion waves). The same flow model can be used to solve cavitating and boiling flows [2]. Many applications occurring with liquid–gas interfaces and cavitating flows involve a very wide range of Mach number, from 10{sup −3} to supersonic (and even hypersonic) conditions with respect to the mixture sound speed. It is thus important to address numerical methods free of restrictions regarding the Mach number. To do this, a preconditioned Riemann solver is built and embedded into the Godunov explicit scheme. It is shown that this method converges to exact solutions but needs too small time steps to be efficient. An implicit version is then derived, first in one dimension and second in the frame of 2D unstructured meshes. Two-phase flow preconditioning is then addressed in the frame of the Saurel et al. [3] algorithm. Modifications of the preconditioned Riemann solver are needed and detailed. Convergence of both single phase and two-phase numerical solutions are demonstrated with the help of single phase and two-phase steady nozzle flow solutions. Last, the method is illustrated by the computation of real cavitating flows in Venturi nozzles. Vapour pocket size and instability frequencies are reproduced by the model and method without using any adjustable parameter.

42 ENGINEERING↗

Target tracking using DMLC for volumetric modulated arc therapy: A simulation study

Purpose: Target tracking using dynamic multileaf collimator (DMLC) is a promising approach for intrafraction motion management in radiation therapy. The purpose of this work is to develop a DMLC tracking algorithm capable of delivering volumetric-modulated arc therapy (VMAT) to the targets that experience two-dimensional (2D) rigid motion in the beam's eye view. Methods: The problem of VMAT delivery to moving targets is formulated as a control problem with constraints. The relationships between gantry speed, gantry acceleration, MLC leaf-velocity, dose rate, and target motion are derived. An iterative search algorithm is developed to find numerical solutions for efficient delivery of a specific VMAT plan to the moving target using 2D DMLC tracking. The delivery of five VMAT lung plans is simulated. The planned and delivered fluence maps in the target-reference frame are calculated and compared. Results: The simulation demonstrates that the 2D tracking algorithm is capable of delivering the VMAT plan to a moving target fast and accurately without violating the machine constraints and the integrity of the treatment plan. The average delivery time is only 29 s longer than that of no-tracking delivery, 101 versus 72 s, respectively. The fluence maps are normalized to 200 MU and the average root-mean-square error between the desired and the delivered fluence is 2.1 MU, compared to 14.8 MU for no-tracking and 3.6 MU for one-dimensional tracking. Conclusions: A locally optimal MLC tracking algorithm for VMAT delivery is proposed, aiming at shortest delivery time while maintaining treatment plan invariant. The inconsequential increase of treatment time due to DMLC tracking is clinically desirable, which makes VMAT with DMLC tracking attractive in treating moving tumors.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

DATeS: a highly extensible data assimilation testing suite v1.0

A flexible and highly extensible data assimilation testing suite, named DATeS, is described in this paper. DATeS aims to offer a unified testing environment that allows researchers to compare different data assimilation methodologies and understand their performance in various settings. The core of DATeS is implemented in Python and takes advantage of its object-oriented capabilities. The main components of the package (the numerical models, the data assimilation algorithms, the linear algebra solvers, and the time discretization routines) are independent of each other, which offers great flexibility to configure data assimilation applications. DATeS can interface easily with large third-party numerical models written in Fortran or in C,and with a plethora of external solvers.

97 MATHEMATICS AND COMPUTING↗

Gradient Coding With Iterative Block Leverage Score Sampling

Gradient coding is a method for mitigating straggling servers in a centralized computing network that uses erasure-coding techniques to distributively carry out first-order optimization methods. Randomized numerical linear algebra uses randomization to develop improved algorithms for large-scale linear algebra computations. In this study, we propose a method for distributed optimization that combines gradient coding and randomized numerical linear algebra. The proposed method uses a randomized ℓ 2 -subspace embedding and a gradient coding technique to distribute blocks of data to the computational nodes of a centralized network, and at each iteration the central server only requires a small number of computations to obtain the steepest descent update. The novelty of our approach is that the data is replicated according to importance scores, called block leverage scores, in contrast to most gradient coding approaches that uniformly replicate the data blocks. Furthermore, we do not require a decoding step at each iteration, avoiding a bottleneck in previous gradient coding schemes. We show that our approach results in a valid ℓ 2 -subspace embedding, and that our resulting approximation converges to the optimal solution.

97 MATHEMATICS AND COMPUTING↗

Characterization of tissue magnetic susceptibility-induced distortions for MRIgRT

Purpose: MR image geometric integrity is one of the building blocks of MRI-guided radiotherapy. In particular, tissue magnetic susceptibility-induced effects are patient-dependent and their behavior is difficult to assess and predict. In this study, the authors investigated in detail the characteristics of susceptibility ({chi}) distortions in the context of MRIgRT, including the case of two common MR-linac system configurations. Methods: The magnetic field distortions were numerically simulated for several imaging parameters and anatomical sites, i.e., brain, lung, pelvis (with air pockets), and prostate. The simulation process consisted of (a) segmentation of patient CT data into susceptibility relevant anatomical volumes (i.e., soft-tissue, bone and air/lung), (b) conversion of CT data into susceptibility masks by assigning bulk {chi} values to the structures defined at (a), (c) numerical computations of the local magnetic fields by using a finite difference algorithm, and (d) generation of the geometric distortion maps from the magnetic field distributions. For each patient anatomy, the distortions were quantified at the interfaces of anatomical structures with significantly different {chi} values. The analysis was performed for two specific orientations of the external main magnetic field (B{sub 0}) characteristic to the MR-linac systems, specifically along the z-axis for a bore MR scanner and in the (x,y)-plane for a biplanner magnet. The magnetic field local perturbations were reported in ppm. The metrics used to quantify the geometric distortions were the maximum, mean, and range of distortions. The numerical simulation algorithm was validated using phantom data measurements. Results: Susceptibility-induced distortions were determined for both quadratic and patient specific geometries. The numerical simulations showed a good agreement with the experimental data. The measurements were acquired at 1.5 and 3 T and with an encoding gradient varying between 3 and 20 mT/m by using an annular phantom mimicking the water-air and water-oil {chi} interfaces. For quadratic geometries, the magnitude of field distortion increased rapidly with the size of the inhomogeneity up to about 10 mm and then tended to plateau. This trend became more evident for materials with a larger {Delta}{chi} relative to water. The simulations showed only a slight increase in the maximum distortion values when the B{sub 0} orientation was varied with regard to the shape of the {chi} inhomogeneity. In the case of patient anatomy, the largest distortion values arose at the air-soft-tissue interface. Considering the two MR-linac system configurations and comparing the field distortion values corresponding to all organ structures, the distortions tended to be larger for the biplanar magnet. The authors provide a reference table with ppm values which can be used to easily evaluate the geometric distortions for patient data as a function of B{sub 0} and the strength of the encoding gradient. Conclusions: The susceptibility distortions were quantified as a function of multiple parameters such as the {chi} inhomogeneity size and shape, the magnitude of B{sub 0} and the readout gradient, and the orientation of B{sub 0} with respect to the sample geometry. The analysis was performed for several anatomical sites and corresponding to two B{sub 0} orientations as featured by MR-linac systems.

60 APPLIED LIFE SCIENCES↗

A new re-redistribution scheme for weighted state redistribution with adaptive mesh refinement

State redistribution (SRD) is a recently developed technique for stabilizing cut cells that result from finite-volume embedded boundary methods. SRD has been successfully applied to a variety of compressible and incompressible flow problems. When used in conjunction with adaptive mesh refinement (AMR), additional steps are needed to preserve the accuracy and conservation properties of the solution if the embedded boundary is not restricted to a single level of the mesh hierarchy. In this work, we extend the weighted state redistribution algorithm to cases where cut cells live at or near a coarse-fine interface within the domain. Here, we present numerical results that demonstrate that the algorithm is conservative when the coarse-fine interface intersects the embedded boundary. Additionally we compare the numerical solution of the Sod shock tube problem in an inclined cylinder with the analytic solution, and we compare the simulation of a shock hitting a cylindrical obstacle with experimental data. Finally we demonstrate the methodology for simulation of the multicomponent compressible Navier-Stokes equations in a piston-bowl geometry, and discuss the computational efficiency gained by not requiring the entire embedded boundary to be defined at the finest level.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Parallel heat transport in integrable and chaotic magnetic fields

The study of transport in magnetized plasmas is a problem of fundamental interest in controlled fusion, space plasmas, and astrophysics research. Three issues make this problem particularly challenging: (i) The extreme anisotropy between the parallel (i.e., along the magnetic field), {chi}{sub ||} , and the perpendicular, {chi}{sub Up-Tack }, conductivities ({chi}{sub ||} /{chi}{sub Up-Tack} may exceed 10{sup 10} in fusion plasmas); (ii) Nonlocal parallel transport in the limit of small collisionality; and (iii) Magnetic field lines chaos which in general complicates (and may preclude) the construction of magnetic field line coordinates. Motivated by these issues, we present a Lagrangian Green's function method to solve the local and non-local parallel transport equation applicable to integrable and chaotic magnetic fields in arbitrary geometry. The method avoids by construction the numerical pollution issues of grid-based algorithms. The potential of the approach is demonstrated with nontrivial applications to integrable (magnetic island), weakly chaotic (Devil's staircase), and fully chaotic magnetic field configurations. For the latter, numerical solutions of the parallel heat transport equation show that the effective radial transport, with local and non-local parallel closures, is non-diffusive, thus casting doubts on the applicability of quasilinear diffusion descriptions. General conditions for the existence of non-diffusive, multivalued flux-gradient relations in the temperature evolution are derived.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Stochastic Dual Algorithm for Voltage Regulation in Distribution Networks with Discrete Loads

This paper considers power distribution networks with distributed energy resources and designs an incentive-based algorithm that allows the network operator and customers to pursue given operational and economic objectives while concurrently ensuring that voltages are within prescribed limits. Heterogeneous DERs with continuous and discrete control commands are considered. We address four major challenges: discrete decision variables, non-convexity due to a Stackelberg game structure, unavailability of private information from customers, and asynchronous operation. Starting from a non-convex setting, we develop a distributed stochastic dual algorithm that solves a relaxed problem, and prove that the proposed algorithm achieves the global optimal solution of the original problem on average. Feasible values for discrete decision variables are also recovered. Stability of the algorithm is analytically established and numerically corroborated.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Voro++: a three-dimensional Voronoi cell library in C++

Voro++ is a free software library for the computation of three dimensional Voronoi cells. It is primarily designed for applications in physics and materials science, where the Voronoi tessellation can be a useful tool in the analysis of densely-packed particle systems, such as granular materials or glasses. The software comprises of several C++ classes that can be modified and incorporated into other programs. A command-line utility is also provided that can use most features of the code. Voro++ makes use of a direct cell-by-cell construction, which is particularly suited to handling special boundary conditions and walls. It employs algorithms which are tolerant for numerical precision errors, and it has been successfully employed on very large particle systems.

36 MATERIALS SCIENCE↗

Symmetry dilemmas in quantum computing for chemistry: A comprehensive analysis

Symmetry adaptation, universality, and gate efficiency are central but often competing requirements in quantum algorithms for electronic structure and many-body physics. For example, fully symmetry-adapted universal operator pools typically generate long and deep quantum circuits; gate-efficient universal operator pools generally break symmetries; and gate-efficient, fully symmetry-adapted operator pools may not be universal. In this work, we analyze such symmetry dilemmas both theoretically and numerically. On the theory side, we prove that the popular, gate-efficient operator pool consisting of singlet spin-adapted singles and perfect-pairing doubles is not universal when spatial symmetry is enforced. To demonstrate the strengths and weaknesses of the three types of pools, we perform numerical simulations using an adaptive algorithm paired with operator pools that are (i) fully symmetry-adapted and universal, (ii) fully symmetry-adapted and non-universal, and (iii) breaking a single symmetry and universal. Our numerical simulations encompass three physically relevant scenarios in which the target state is (i) the global ground state, (ii) the ground state crossed by a state differing in multiple symmetry properties, and (iii) the ground state crossed by a state differing in a single symmetry property. Our results show when symmetry-breaking but universal pools can be used safely, when enforcing at least one distinguishing symmetry suffices, and when a particular symmetry must be rigorously preserved to avoid variational collapse. Together, the formal and numerical analyses provide a practical guide for designing and benchmarking symmetry-adapted operator pools that balance universality, resource requirements, and robust state targeting in quantum simulations for chemistry.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Dynamic mode decomposition with core sketch

With the increase in collected data volumes, either from experimental measurements or high fidelity simulations, there is an ever-growing need to develop computationally efficient tools to process, analyze, and interpret these datasets. Modal analysis techniques have gained great interest due to their ability to identify patterns in the data and extract valuable information about the system being considered. Dynamic mode decomposition (DMD) relies on elements of the Koopman approximation theory to compute a set of modes, each associated with a fixed oscillation frequency and a decay/growth rate. Extracting these details from large datasets can be computationally expensive due to the need to implement singular value decomposition of the input data matrix. Sketching algorithms have become popular in numerical linear algebra where statistical theoretic approaches are utilized to reduce the cost of major operations. A sketch of a matrix is another matrix, which is significantly smaller, but still sufficiently approximates the original system. We put forth an efficient DMD framework, SketchyDMD, based on a core sketching algorithm that captures information about the range and corange (their mutual relationship) of input data. The proposed sketching-based framework can accelerate various portions of the DMD routines, compared to classical methods that operate directly on the raw input data. We conduct numerical experiments using the spherical shallow water equations as a prototypical model in the context of geophysical flows. In conclusion, we show that the proposed SketchyDMD is superior to existing randomized DMD methods that are based on capturing only the range of the input data.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Application of stochastic weighted algorithms to a multidimensional silica particle model

Highlights: •Stochastic weighted algorithms (SWAs) are developed for a detailed silica model. •An implementation of SWAs with the transition kernel is presented. •The SWAs’ solutions converge to the direct simulation algorithm’s (DSA) solution. •The efficiency of SWAs is evaluated for this multidimensional particle model. •It is shown that SWAs can be used for coagulation problems in industrial systems. -- Abstract: This paper presents a detailed study of the numerical behaviour of stochastic weighted algorithms (SWAs) using the transition regime coagulation kernel and a multidimensional silica particle model. The implementation in the SWAs of the transition regime coagulation kernel and associated majorant rates is described. The silica particle model of Shekar et al. [S. Shekar, A.J. Smith, W.J. Menz, M. Sander, M. Kraft, A multidimensional population balance model to describe the aerosol synthesis of silica nanoparticles, Journal of Aerosol Science 44 (2012) 83–98] was used in conjunction with this coagulation kernel to study the convergence properties of SWAs with a multidimensional particle model. High precision solutions were calculated with two SWAs and also with the established direct simulation algorithm. These solutions, which were generated using large number of computational particles, showed close agreement. It was thus demonstrated that SWAs can be successfully used with complex coagulation kernels and high dimensional particle models to simulate real-world systems.

97 MATHEMATICS AND COMPUTING↗

Nonlinear Acceleration of Transport Criticality Problems

We present a nonlinear acceleration algorithm for the transport criticality problem. The algorithm combines the well-known nonlinear diffusion acceleration (NDA) with a recently developed, Newton-based, nonlinear criticality acceleration (NCA) algorithm. The algorithm first employs the NDA to reduce the system to scalar flux, then the NCA is applied to the resulting drift-diffusion system. We apply a nonlinear elimination technique to eliminate the eigenvalue from the Jacobian matrix. Numerical results show that the algorithm reduces the CPU time a factor of 400 in a very diffusive system) and a factor of 5 in a non-diffusive system.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Nonlinear Acceleration of Transport Criticality Problems [Slides]

We present a nonlinear acceleration algorithm for the transport criticality problem. The algorithm combines the well-known nonlinear diffusion acceleration (NDA) with a recently developed, Newton-brused, nonlinear criticality acceleration (NCA) algorithm. The algorithm first employs the NDA to reduce the system to scalar flux, then the NCA is applied to the resulting drift-diffusion system. We apply a nonlinear elimination technique to eliminate the eigenvalue from the Jacobian matrix. Numerical results show that the algorithm reduces the CPU time a factor of 400 in a very diffusive system, and a factor of 5 in a non-diffusive system.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗