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 37 records · Page 2

A Numerical Algorithm to Calculate the Pressure Distribution of the TPS Front End Due to Desorption Induced by Synchrotron Radiation

The pressure distribution is an important aspect of a UHV subsystem in either a storage ring or a front end. The design of the 3-GeV, 400-mA Taiwan Photon Source (TPS) foresees outgassing induced by photons and due to a bending magnet and an insertion device. An algorithm to calculate the photon-stimulated absorption (PSD) due to highly energetic radiation from a synchrotron source is presented. Several results using undulator sources such as IU20 are also presented, and the pressure distribution is illustrated.

43 PARTICLE ACCELERATORS↗

PAGANI: a parallel adaptive GPU algorithm for numerical integration

We present a new adaptive parallel algorithm for the challenging problem of multi-dimensional numerical integration on massively parallel architectures. Adaptive algorithms have demonstrated the best performance, but efficient many-core utilization is difficult to achieve because the adaptive work-load can vary greatly across the integration space and is impossible to predict a priori. Existing parallel algorithms utilize sequential computations on independent processors, which results in bottlenecks due to the need for data redistribution and processor synchronization. Our algorithm employs a high-throughput approach in which all existing sub-regions are processed and sub-divided in parallel. Repeated sub-region classification and filtering improves upon a brute-force approach and allows the algorithm to make efficient use of computation and memory resources. A CUDA implementation shows orders of magnitude speedup over the fastest open-source CPU method and extends the achievable accuracy for difficult integrands. Our algorithm typically outperforms other existing deterministic parallel methods.

Sakiotis, Ioannis↗

Seismic-acoustic finite-difference wave propagation algorithm.

An efficient numerical algorithm for treating earth models composed of fluid and solid portions is obtained via straightforward modifications to a 3D time-domain finite-difference algorithm for simulating isotropic elastic wave propagation.

58 GEOSCIENCES↗

Linear response of a Hall magnetic drift wave for verification of Hall MHD algorithms

Numerical implementations of Hall magnetohydrodynamics (Hall MHD) can be challenging due to the nonlinear multidimensional nature of the Hall term. Here, a model problem is presented that couples the hydrodynamic motion of the plasma to Hall MHD evolution of the magnetic field. The Hall MHD equations are linearized about unperturbed solutions in both cylindrical and Cartesian coordinates in two dimensions. The magnetic field is assumed to lie in the ignorable direction, and the linear response about the unperturbed solution is considered. The resulting ordinary differential equation is used to numerically compute the eigenfunctions and eigenfrequencies of the mode. The resulting eigenfunctions do not make the local wave approximation but are instead global solutions that depend on the spatial dependence of the unperturbed Alfvén speed. Hall MHD simulations are then performed in the Ares multiphysics code and shown to agree with the predicted phase velocities of the wave, and the simulated solutions are shown to numerically converge to the semianalytic modes. By varying the background density of the plasma (and correspondingly, the ion inertial length), the importance of Hall physics can be varied. This allows the test problem to transition from the classical MHD limit to the extreme Hall MHD limit. Furthermore, this problem is a useful tool for the verification of Hall MHD routines implemented in various codes, and the robustness of a routine can be tested in regimes in which Hall physics is dominant.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Recent numerical and algorithmic advances within the volume tracking framework for modeling interfacial flows

A review of recent advances made in numerical methods and algorithms within the volume tracking framework is presented. The volume tracking method, also known as the volume-of-fluid method has become an established numerical approach to model and simulate interfacial flows. Its advantage is its strict mass conservation. However, because the interface is not explicitly tracked but captured via the material volume fraction on a fixed mesh, accurate estimation of the interface position, its geometric properties and modeling of interfacial physics in the volume tracking framework remain difficult. Several improvements have been made over the last decade to address these challenges. In this study, the multimaterial interface reconstruction method via power diagram, curvature estimation via heights and mean values and the balanced-force algorithm for surface tension are highlighted.

97 MATHEMATICS AND COMPUTING↗

DYNAMIC STABILITY OF THE SOLAR SYSTEM: STATISTICALLY INCONCLUSIVE RESULTS FROM ENSEMBLE INTEGRATIONS

Due to the chaotic nature of the solar system, the question of its long-term stability can only be answered in a statistical sense, for instance, based on numerical ensemble integrations of nearby orbits. Destabilization of the inner planets, leading to close encounters and/or collisions can be initiated through a large increase in Mercury's eccentricity, with a currently assumed likelihood of ∼1%. However, little is known at present about the robustness of this number. Here I report ensemble integrations of the full equations of motion of the eight planets and Pluto over 5 Gyr, including contributions from general relativity. The results show that different numerical algorithms lead to statistically different results for the evolution of Mercury's eccentricity (e{sub M}). For instance, starting at present initial conditions (e{sub M}≃0.21), Mercury's maximum eccentricity achieved over 5 Gyr is, on average, significantly higher in symplectic ensemble integrations using heliocentric rather than Jacobi coordinates and stricter error control. In contrast, starting at a possible future configuration (e{sub M}≃0.53), Mercury's maximum eccentricity achieved over the subsequent 500 Myr is, on average, significantly lower using heliocentric rather than Jacobi coordinates. For example, the probability for e{sub M} to increase beyond 0.53 over 500 Myr is >90% (Jacobi) versus only 40%-55% (heliocentric). This poses a dilemma because the physical evolution of the real system—and its probabilistic behavior—cannot depend on the coordinate system or the numerical algorithm chosen to describe it. Some tests of the numerical algorithms suggest that symplectic integrators using heliocentric coordinates underestimate the odds for destabilization of Mercury's orbit at high initial e{sub M}.

79 ASTRONOMY AND ASTROPHYSICS↗

Verification of MOOSE/Bison's Heat Conduction Solver Using Combined Spatiotemporal Convergence Analysis

Bison is a computational physics code that uses the finite element method to model the thermo-mechanical response of nuclear fuel. Since Bison is used to inform high-consequence decisions, it is important that its computational results are reliable and predictive. One important step in assessing the reliability and predictive capabilities of a simulation tool is the verification process, which quantifies numerical errors in a discrete solution relative to the exact solution of the mathematical model. One step in the verification process—called code verification—ensures that the implemented numerical algorithm is a faithful representation of the underlying mathematical model, including partial differential or integral equations, initial and boundary conditions, and auxiliary relationships. In this paper, the code verification process is applied to spatiotemporal heat conduction problems in Bison. Simultaneous refinement of the discretization in space and time is employed to reveal any potential mistakes in the numerical algorithms for the interactions between the spatial and temporal components of the solution. For each verification problem, the correct spatial and temporal order of accuracy is demonstrated for both first- and second-order accurate finite elements and a variety of time-integration schemes. Furthermore, these results provide strong evidence that the Bison numerical algorithm for solving spatiotemporal problems reliably represents the underlying mathematical model in MOOSE. The selected test problems can also be used in other simulation tools that numerically solve for conduction or diffusion.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

An evaluation of solution algorithms and numerical approximation methods for modeling an ion exchange process

The focus of this work is on the modeling of an ion exchange process that occurs in drinking water treatment applications. The model formulation consists of a two-scale model in which a set of microscale diffusion equations representing ion exchange resin particles that vary in size and age are coupled through a boundary condition with a macroscopic ordinary differential equation (ODE), which represents the concentration of a species in a well-mixed reactor. We introduce a new age-averaged model (AAM) that averages all ion exchange particle ages for a given size particle to avoid the expensive Monte-Carlo simulation associated with previous modeling applications. We discuss two different numerical schemes to approximate both the original Monte-Carlo algorithm and the new AAM for this two-scale problem. The first scheme is based on the finite element formulation in space coupled with an existing backward difference formula-based ODE solver in time. The second scheme uses an integral equation based Krylov deferred correction (KDC) method and a fast elliptic solver (FES) for the resulting elliptic equations. Numerical results are presented to validate the new AAM algorithm, which is also shown to be more computationally efficient than the original Monte-Carlo algorithm. We also demonstrate that the higher order KDC scheme is more efficient than the traditional finite element solution approach and this advantage becomes increasingly important as the desired accuracy of the solution increases. We also discuss issues of smoothness, which affect the efficiency of the KDC-FES approach, and outline additional algorithmic changes that would further improve the efficiency of these developing methods for a wide range of applications.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Comparison of source-location algorithms for atmospheric samplers

Numerous algorithms have been developed to determine the source characteristics for an atmospheric release, e.g., (Bieringer et al., 2017). This study compares three models that have been applied to the data collected by the International Monitoring System operated by the Comprehensive Nuclear-Test-Ban Treaty Preparatory Commission to estimate source event parameters. Each model uses a different approach to estimate the parameters. A deterministic model uses a possible source region (PSR) approach (Ringbom et al., 2014) that is based on the correlation between predicted and measured sample values. An unnamed model developed at Pacific Northwest National Laboratory (herein called BAYEST) uses a Bayesian formulation (Eslinger et al., 2019; Eslinger et al., 2020; Eslinger and Schrom, 2016). The FREAR model uses a different Bayesian formulation (De Meutter and Hoffman, 2020; De Meutter et al., 2021; Pieter De Meutter, 2021). The performance of the three source-location models is evaluated with 100 synthetic release cases for the single xenon isotope, 133 Xe. The release cases resulted in detections in a fictitious network with 120 noble gas samplers. All three source-location models use the same sampling data. The two Bayesian models yield more accurate location estimates than the deterministic PSR model, with FREAR having slightly better location performance than BAYEST. Samplers with collection periods of 3, 6, 8, 12, and 24-h were used. Results from BAYEST show that location accuracy improves with each reduction in sample collection length. The BAYEST model is slightly better for estimating the start time of the release. The PSR model has about the same spread in start times as the FREAR model, but the PSR results have a better average start time. The Bayesian source-location algorithms give more accurate results than the PSR approach, and provide release magnitude estimates, while the base PSR model does not estimate the release magnitude. This investigation demonstrates that a reasonably dense sampling grid will sometimes yield poor location and time estimates regardless of the model. The poor estimates generally coincide with cases where there is a much larger distance between the release point and the first detecting sampler than the average sampler spacing.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗

Numerical simulation of photoexcited polaron states in water

We consider the dynamic polaron model of the hydrated electron state on the basis of a system of three nonlinear partial differential equations with appropriate initial and boundary conditions. A parallel numerical algorithm for the numerical solution of this system has been developed. Its effectiveness has been tested on a few multi-processor systems. A numerical simulation of the polaron states formation in water under the action of the ultraviolet range laser irradiation has been performed. The numerical results are shown to be in a reasonable agreement with experimental data and theoretical predictions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Discontinuous Galerkin Dynamical Core in HOMME

Atmospheric numerical modeling has been going through radical changes over the past decade. One major reason for this trend is due to the recent paradigm change in scientific computing , triggered by the arrival of petascale computing resources with core counts in the tens of thousands to hundreds of thousands range. Modern atmospheric modelers must adapt grid systems and numerical algorithms to facilitate an unprecedented levels of scalability on these modern highly parallel computer architectures. The numerical algorithms which can address these challenges should have the local properties such as high on-processor floating-point operation count to bytes moved and minimum parallel communication overhead.

17 WIND ENERGY↗