Search NASA⌕ Search

SEARCH · Search NASA

Results for “numerical algorithm computing”

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
All sourcesNASA NTRSDOE OSTI
DOE OSTI2018

Algorithm to calculate off-plane magnetic field from an on-plane field map

An algorithm is presented to calculate the field components [B x (x,y,z), B y (x,y,z), B z (x,y,z)] of the magnetic field at a point (x,y,z) in space, from the knowledge of the components [B x (x,y = 0,z), B y (x,y = 0,z), B z (x,y = 0,z)] on a ”reference plane”, which is normal to the y-axis at y=0. The algorithm, which is a general one and is not restricted to fields with mid-plane symmetry is based on the Taylor series expansion of the magnetic field components at any point in space in terms of the distance (y) of the point from the reference plane. The coefficients of the Taylor series expansion are expressed in terms of the on-plane field components and their partial derivatives with respect to spatial coordinates (x,z). The field components are usually generated from magnetic field measurements on a rectangular grid on the plane. The required partial derivatives of the field components on the plane can be computed with two methods; numerically, or by fitting a polynomial function to the experimentally measured values of the field components and subsequently take the required partial derivatives of the polynomial function. Each of these two method which calculates the partial derivatives of the field components on the plane, is applied to calculate the off-plane field components of the magnetic field generated by a modified Halbach magnet [1] of inner radius of 4.4 cm and it is found that each method provides accurate results with a relative error <1% deviation from the ”ideal” fields if the y distance of the point from the reference plane is smaller than 2 cm. This algorithm is part of the RAYTRACE computer code [2] and has been applied [3] on a dipole magnet with median plane symmetry.

43 PARTICLE ACCELERATORS↗
DOE OSTI2012

Relativistic current collection by a cylindrical Langmuir probe

The current I to a cylindrical Langmuir probe with a bias {Phi}{sub p} satisfying {beta}{identical_to}e{Phi}{sub p}/m{sub e}c{sup 2}{approx}O(1) is discussed. The probe is considered at rest in an unmagnetized plasma composed of electrons and ions with temperatures kT{sub e}{approx}kT{sub i} Much-Less-Than m{sub e}c{sup 2}. For small enough radius, the probe collects the relativistic orbital-motion-limited (OML) current I{sub OML}, which is shown to be larger than the non-relativistic result; the OML current is proportional to {beta}{sup 1/2} and {beta}{sup 3/2} in the limits {beta} Much-Less-Than 1 and {beta} Much-Greater-Than 1, respectively. Unlike the non-relativistic case, the electron density can exceed the unperturbed density value. An asymptotic theory allowed to compute the maximum radius of the probe to collect OML current, the sheath radius for probe radius well below maximum and how the ratio I/I{sub OML} drops below unity when the maximum radius is exceeded. A numerical algorithm that solves the Vlasov-Poisson system was implemented and density and potential profiles presented. The results and their implications in a possible mission to Jupiter with electrodynamic bare tethers are discussed.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2022

Effects of cosine tapering window on quantum phase estimation

Here, we provide a modification to the quantum phase estimation algorithm (QPEA) [Abrams and Lloyd, Phys. Rev. Lett. 83, 5162 (1999); Cleve et al., Proc. R. Soc. A 454, 339 (1998); Nielsen and Chuang, Quantum computation and quantum information, 2002.] inspired by classical windowing methods for spectral density estimation. From this modification we obtain an upper bound in the cost that implies a cubic improvement with respect to the algorithm's error rate. Numerical evaluation of the costs also demonstrates an improvement. Moreover, with similar techniques, we detail an iterative projective measurement method for ground state preparation that gives an exponential improvement over previous bounds using QPEA. Numerical tests that confirm the expected scaling behavior are also obtained. For these numerical tests we have used a lattice Thirring model as testing ground. Using well-known perturbation theory results, we also show how to more appropriately estimate the cost scaling with respect to state error instead of evolution operator error.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

New approach to QCD final-state evolution in processes with massive partons

We present an algorithm for massive parton evolution which is based on the differentially accurate simulation of soft-gluon radiation by means of a nontrivial azimuthal angle dependence of the splitting functions. The kinematics mapping is chosen such as to reflect the symmetry of the final state in soft-gluon radiation and collinear splitting processes. We compute the counterterms needed for a fully differential next-to-leading order matching and discuss the analytic structure of the parton shower in the next-to-leading logarithmic limit. We implement the new algorithm in the numerical code Alaric and present a first comparison to experimental data. Published by the American Physical Society 2024

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2012

Adaptive Algebraic Multigrid for Finite Element Elliptic Equations with Random Coefficients

This thesis presents a two-grid algorithm based on Smoothed Aggregation Spectral Element Agglomeration Algebraic Multigrid (SA-ρAMGe) combined with adaptation. The aim is to build an efficient solver for the linear systems arising from discretization of second-order elliptic partial differential equations (PDEs) with stochastic coefficients. Examples include PDEs that model subsurface flow with random permeability field. During a Markov Chain Monte Carlo (MCMC) simulation process, that draws PDE coefficient samples from a certain distribution, the PDE coefficients change, hence the resulting linear systems to be solved change. At every such step the system (discretized PDE) needs to be solved and the computed solution used to evaluate some functional(s) of interest that then determine if the coefficient sample is acceptable or not. The MCMC process is hence computationally intensive and requires the solvers used to be efficient and fast. This fact that at every step of MCMC the resulting linear system changes, makes an already existing solver built for the old problem perhaps not as efficient for the problem corresponding to the new sampled coefficient. This motivates the main goal of our study, namely, to adapt an already existing solver to handle the problem (with changed coefficient) with the objective to achieve this goal to be faster and more efficient than building a completely new solver from scratch. Our approach utilizes the local element matrices (for the problem with changed coefficients) to build local problems associated with constructed by the method agglomerated elements (a set of subdomains that cover the given computational domain). We solve a generalized eigenproblem for each set in a subspace spanned by the previous local coarse space (used for the old solver) and a vector, component of the error, that the old solver cannot handle. A portion of the spectrum of these local eigen-problems (corresponding to eigenvalues close to zero) form the coarse basis used to define the new two-level method of our interest. We illustrate the performance of this adaptive two-level procedure with a large set of numerical experiments that demonstrate its efficiency over building the solvers from scratch.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Implementation of the Glued Sphere Discrete Element Model for Non-Spherical Particles in MFiX Software

To enhance solver capabilities, simulation flexibility and model validation within the MFiX software, the U.S. Department of Energy (DOE) is funding efforts to develop and integrate the glued-sphere discrete element method into the latest version of MFiX as a dedicated computational module. The glued-sphere discrete element method is a numerical technique to depict the behavior of non-spherical particles in granular flows or particulate systems by representing them as a collection of component spheres. These spheres are bonded together to approximate the shape and mechanical/chemical properties of a more complex particle. The method effectively reuses the existing sphere-sphere collision algorithm, interphase momentum and heat transfer calculations utilized in the traditional discrete element method, extending these capabilities to non-spherical particles. Additionally, this method explicitly resolves intra-particle temperature and species distributions. The MFiX glued-sphere computational module includes tools for generating glued sphere configurations, a dedicated solver, and visualization capabilities in post-processing. More specifically within the computational module, collision detection and calculations were first performed on component spheres and then mapped onto non-spherical particles. The linear spring-dashpot model was utilized to simulate the sphere-sphere interactions.

Ke, Renjie↗
DOE OSTI2016

PolyPole-1: An accurate numerical algorithm for intra-granular fission gas release

This paper describes the development of a new numerical algorithm (called PolyPole-1) to efficiently solve the equation for intra-granular fission gas release in nuclear fuel. The work was carried out in collaboration with Politecnico di Milano and Institute for Transuranium Elements. The PolyPole-1 algorithms is being implemented in INL's fuels code BISON code as part of BISON's fission gas release model. The transport of fission gas from within the fuel grains to the grain boundaries (intra-granular fission gas release) is a fundamental controlling mechanism of fission gas release and gaseous swelling in nuclear fuel. Hence, accurate numerical solution of the corresponding mathematical problem needs to be included in fission gas behaviour models used in fuel performance codes. Under the assumption of equilibrium between trapping and resolution, the process can be described mathematically by a single diffusion equation for the gas atom concentration in a grain. In this work, we propose a new numerical algorithm (PolyPole-1) to efficiently solve the fission gas diffusion equation in time-varying conditions. The PolyPole-1 algorithm is based on the analytic modal solution of the diffusion equation for constant conditions, with the addition of polynomial corrective terms that embody the information on the deviation from constant conditions. The new algorithm is verified by comparing the results to a finite difference solution over a large number of randomly generated operation histories. Furthermore, comparison to state-of-the-art algorithms used in fuel performance codes demonstrates that the accuracy of the PolyPole-1 solution is superior to other algorithms, with similar computational effort. Finally, the concept of PolyPole-1 may be extended to the solution of the general problem of intra-granular fission gas diffusion during non-equilibrium trapping and resolution, which will be the subject of future work.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2016

A NEW METHOD FOR FINDING POINT SOURCES IN HIGH-ENERGY NEUTRINO DATA

The IceCube collaboration has reported the first detection of high-energy astrophysical neutrinos, including ∼50 high-energy starting events, but no individual sources have been identified. It is therefore important to develop the most sensitive and efficient possible algorithms to identify the point sources of these neutrinos. The most popular current method works by exploring a dense grid of possible directions to individual sources, and identifying the single direction with the maximum probability of having produced multiple detected neutrinos. This method has numerous strengths, but it is computationally intensive and because it focuses on the single best location for a point source, additional point sources are not included in the evidence. We propose a new maximum likelihood method that uses the angular separations between all pairs of neutrinos in the data. Unlike existing autocorrelation methods for this type of analysis, which also use angular separations between neutrino pairs, our method incorporates information about the point-spread function and can identify individual point sources. We find that if the angular resolution is a few degrees or better, then this approach reduces both false positive and false negative errors compared to the current method, and is also more computationally efficient up to, potentially, hundreds of thousands of detected neutrinos.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2013

PIROCK: A swiss-knife partitioned implicit–explicit orthogonal Runge–Kutta Chebyshev integrator for stiff diffusion–advection–reaction problems with or without noise

A partitioned implicit–explicit orthogonal Runge–Kutta method (PIROCK) is proposed for the time integration of diffusion–advection–reaction problems with possibly severely stiff reaction terms and stiff stochastic terms. The diffusion terms are solved by the explicit second order orthogonal Chebyshev method (ROCK2), while the stiff reaction terms (solved implicitly) and the advection and noise terms (solved explicitly) are integrated in the algorithm as finishing procedures. It is shown that the various coupling (between diffusion, reaction, advection and noise) can be stabilized in the PIROCK method. The method, implemented in a single black-box code that is fully adaptive, provides error estimators for the various terms present in the problem, and requires from the user solely the right-hand side of the differential equation. Numerical experiments and comparisons with existing Chebyshev methods, IMEX methods and partitioned methods show the efficiency and flexibility of our new algorithm.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Computational characterization of the secondary droplets formed during the impingement of a train of ethanol drops

This paper uniquely characterizes the secondary droplets formed during the impingement of a train of ethanol drops, using three-dimensional direct numerical simulations performed under conditions studied experimentally by Yarin and Weiss. Our numerical results have been previously validated against experimental data demonstrating the ability to accurately capture the splashing dynamics. In this work, the predictive ability of the model is leveraged to gain further insight into secondary droplet formation. We present a robust post-processing algorithm, which scrutinizes the liquid volume fraction field in the volume-of-fluid method and quantifies the number, volume and velocity of secondary droplets. The high-resolution computational simulations enable secondary droplet characterization within close proximity of the impingement point at small length and time scales, which is extremely challenging to achieve experimentally. By studying the temporal evolution of secondary droplet formation, direct connections are made between liquid structures seen in the simulation and the instantaneous distribution of secondary droplets, leading to detailed insight into the instability-driven breakup process of lamellae. Time-averaged secondary droplet characteristics are also studied to describe the global distribution of secondary droplets. Such analysis is vital to understanding fuel drop impingement in direct injection engines, facilitating the development of highly accurate spray–wall interaction models for use in Lagrangian solvers.

42 ENGINEERING↗
DOE OSTI2017

Efficient algorithms and implementations of entropy-based moment closures for rarefied gases

We present efficient algorithms and implementations of the 35-moment system equipped with the maximum-entropy closure in the context of rarefied gases. While closures based on the principle of entropy maximization have been shown to yield very promising results for moderately rarefied gas flows, the computational cost of these closures is in general much higher than for closure theories with explicit closed-form expressions of the closing fluxes, such as Grad's classical closure. Following a similar approach as Garrett et al. (2015) , we investigate efficient implementations of the computationally expensive numerical quadrature method used for the moment evaluations of the maximum-entropy distribution by exploiting its inherent fine-grained parallelism with the parallelism offered by multi-core processors and graphics cards. We show that using a single graphics card as an accelerator allows speed-ups of two orders of magnitude when compared to a serial CPU implementation. To accelerate the time-to-solution for steady-state problems, we propose a new semi-implicit time discretization scheme. The resulting nonlinear system of equations is solved with a Newton type method in the Lagrange multipliers of the dual optimization problem in order to reduce the computational cost. Additionally, fully explicit time-stepping schemes of first and second order accuracy are presented. We investigate the accuracy and efficiency of the numerical schemes for several numerical test cases, including a steady-state shock-structure problem.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2023

Learning to Predict Arbitrary Quantum Processes

We present an efficient machine-learning (ML) algorithm for predicting any unknown quantum process ℰ over 𝑛 qubits. For a wide range of distributions 𝒟 on arbitrary 𝑛-qubit states, we show that this ML algorithm can learn to predict any local property of the output from the unknown process ℰ, with a small average error over input states drawn from 𝒟. The ML algorithm is computationally efficient even when the unknown process is a quantum circuit with exponentially many gates. Our algorithm combines efficient procedures for learning properties of an unknown state and for learning a low-degree approximation to an unknown observable. The analysis hinges on proving new norm inequalities, including a quantum analogue of the classical Bohnenblust-Hille inequality, which we derive by giving an improved algorithm for optimizing local Hamiltonians. Numerical experiments on predicting quantum dynamics with evolution time up to 10 6 and system size up to 50 qubits corroborate our proof. Overall, our results highlight the potential for ML models to predict the output of complex quantum dynamics much faster than the time needed to run the process itself.

quantum computation↗
DOE OSTI2015

Solutions of the two-dimensional Hubbard model: Benchmarks and results from a wide range of numerical algorithms

Numerical results for ground-state and excited-state properties (energies, double occupancies, and Matsubara-axis self-energies) of the single-orbital Hubbard model on a two-dimensional square lattice are presented, in order to provide an assessment of our ability to compute accurate results in the thermodynamic limit. Many methods are employed, including auxiliary-field quantum Monte Carlo, bare and bold-line diagrammatic Monte Carlo, method of dual fermions, density matrix embedding theory, density matrix renormalization group, dynamical cluster approximation, diffusion Monte Carlo within a fixed-node approximation, unrestricted coupled cluster theory, and multireference projected Hartree-Fock methods. Comparison of results obtained by different methods allows for the identification of uncertainties and systematic errors. The importance of extrapolation to converged thermodynamic-limit values is emphasized. Furthermore, cases where agreement between different methods is obtained establish benchmark results that may be useful in the validation of new approaches and the improvement of existing methods.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2017

Scalable domain decomposition solvers for stochastic PDEs in high performance computing

Stochastic spectral finite element models of practical engineering systems may involve solutions of linear systems or linearized systems for non-linear problems with billions of unknowns. For stochastic modeling, it is therefore essential to design robust, parallel and scalable algorithms that can efficiently utilize high-performance computing to tackle such large-scale systems. Domain decomposition based iterative solvers can handle such systems. And though these algorithms exhibit excellent scalabilities, significant algorithmic and implementational challenges exist to extend them to solve extreme-scale stochastic systems using emerging computing platforms. Intrusive polynomial chaos expansion based domain decomposition algorithms are extended here to concurrently handle high resolution in both spatial and stochastic domains using an in-house implementation. Sparse iterative solvers with efficient preconditioners are employed to solve the resulting global and subdomain level local systems through multi-level iterative solvers. We also use parallel sparse matrix–vector operations to reduce the floating-point operations and memory requirements. Numerical and parallel scalabilities of these algorithms are presented for the diffusion equation having spatially varying diffusion coefficient modeled by a non-Gaussian stochastic process. Scalability of the solvers with respect to the number of random variables is also investigated.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2024

Performance Portable Graphics Processing Unit Acceleration of a High-Order Finite Element Multiphysics Application

The Lawrence Livermore National Laboratory (LLNL) will soon have in place the El Capitan exascale supercomputer, based on advanced micro devices (AMD) graphics processing units (GPUs). As part of a multiyear effort under the National Nuclear Security Administration (NNSA) Advanced Simulation and Computing (ASC) program, we have been developing marbl, a next generation, performance portable multiphysics application based on high-order finite elements. In previous years, we successfully ported the Arbitrary Lagrangian–Eulerian (ALE), multimaterial, compressible flow capabilities of marbl to nvidia GPUs as described in Vargas et al. Here, in this paper, we describe our ongoing effort in extending marbl's GPU capabilities with additional physics, including multigroup radiation diffusion and thermonuclear burn for high energy density physics (HEDP) and fusion modeling. We also describe how our portability abstraction approach based on the raja Portability Suite and the mfem finite element discretization library has enabled us to achieve high performance on AMD based GPUs with minimal effort in hardware-specific porting. Throughout this work, we highlight numerical and algorithmic developments that were required to achieve GPU performance.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2026

Augmenting subspace optimization methods with linear bandits

In this work, we consider the framework of methods for unconstrained minimization that are, in each iteration, restricted to a model that is only a valid approximation to the objective function on some affine subspace containing an incumbent point. These methods are of practical interest in computational settings where derivative information is either expensive or impossible to obtain. Recent attention has been paid in the literature to employing randomized matrix sketching for generating the affine subspaces within this framework. We consider a relatively straightforward, deterministic augmentation of such a generic subspace optimization method. In particular, we consider a sequential optimization framework where actions consist of one-dimensional linear subspaces and rewards consist of (approximations to) the magnitudes of directional derivatives computed in the direction of the action subspace. Reward maximization in this context is consistent with maximizing lower bounds on descent guaranteed by first-order Taylor models. This sequential optimization problem can be analysed through the lens of dynamic regret. We modify an existing linear upper confidence bound (UCB) bandit method and prove sublinear dynamic regret in the subspace optimization setting. We demonstrate the efficacy of employing this linear UCB method in a setting where forward-mode algorithmic differentiation can provide directional derivatives in arbitrary directions and in a derivative-free setting. For the derivative-free setting, we propose SS-POUNDers, an extension of the derivative-free optimization method POUNDers that employs the linear UCB mechanism to identify promising subspaces. Our numerical experiments suggest a preference, in either computational setting, for employing a linear UCB mechanism within a subspace optimization method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Numerical Stiffness based Simulation of Mixed Transmission Systems

Inclusion of power electronics allows increased controllability and stability in power systems. The simulation of such systems on a large-scale is challenging due to the presence of a large number of switches and nonlinear devices. This paper presents an advanced simulation algorithm to solve the aforementioned problem. The algorithm considers separation of differential algebraic equations (DAEs) on the basis of numerical stiffness and applies hybrid discretization algorithms to simulate the DAEs. The DAEs, in this paper, represent the nonlinear nonautonomous switched system dynamics of power systems. Stability analysis is performed on a general class of nonlinear nonautonomous switched systems to show the constraints under which the proposed algorithm is stable. To show the validity of the proposed algorithm, two case studies are considered: single high-voltage direct current (HVdc) substation based on the modular multilevel converter (MMC); and an example three-terminal MMC-HVdc system. Furthermore, relaxation techniques are introduced to create a stable interface for the separated DAEs. The developed algorithms are also validated with PSCAD/EMTDC-detailed reference models.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2018

Overhead longwave infrared hyperspectral material identification using radiometric models

Material detection algorithms used in hyperspectral data processing are computationally efficient but can produce relatively high numbers of false positives. Material identification performed as a secondary processing step on detected pixels can help mitigate false positives. A material identification processing chain for longwave infrared hyperspectral data of solid materials collected from airborne platforms is presented. The algorithms utilize unwhitened radiance data and Nelder–Meade numerical optimization to estimate the temperature, humidity, and ozone levels of the atmospheric profile. Pixel unmixing is done using constrained linear regression and Bayesian information criteria for model selection. The resulting identification product includes an optimal atmospheric profile and a full radiance material model that includes material temperature, abundance values, and several fit statistics. A logistic regression method utilizing the model parameters to improve identification is also presented. Furthermore, several examples are provided using modeled data at several noise levels.

58 GEOSCIENCES↗