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 847 records · Page 47

Statistical computation of tolerance limits

Based on a new theory, two computer codes were developed specifically to calculate the exact statistical tolerance limits for normal distributions within unknown means and variances for the one-sided and two-sided cases for the tolerance factor, k. The quantity k is defined equivalently in terms of the noncentral t-distribution by the probability equation. Two of the four mathematical methods employ the theory developed for the numerical simulation. Several algorithms for numerically integrating and iteratively root-solving the working equations are written to augment the program simulation. The program codes generate some tables of k's associated with the varying values of the proportion and sample size for each given probability to show accuracy obtained for small sample sizes.

Wheeler, J. T.↗

Fundamental form of the electrostatic δf-PIC algorithm and discovery of a converged numerical instability

The δf particle-in-cell algorithm has been a useful tool in studying the physics of plasmas, particularly turbulent magnetized plasmas in the context of gyrokinetics. The reduction in noise due to not having to resolve the full distribution function indicates an efficiency advantage over the standard (“full-f”) particle-in-cell. Despite its successes, the algorithm behaves strangely in some circumstances. In this work, we document a fully resolved numerical instability that occurs in the simplest of multiple-species test cases: the electrostatic Ω{sub H} mode. There is also a poorly understood numerical instability that occurs when one is under-resolved in particle number, which may require a prohibitively large number of particles to stabilize. Both of these are independent of the time-stepping scheme, and we conclude that they exist if the time advancement were exact. The exact analytic form of the algorithm is presented, and several schemes for mitigating these instabilities are also presented.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Numerical comparison of discrete Kalman filter algorithms - Orbit determination case study

Numerical characteristics of various Kalman filter algorithms are illustrated with a realistic orbit determination study. The case study of this paper highlights the numerical deficiencies of the conventional and stabilized Kalman algorithms. Computational errors associated with these algorithms are found to be so large as to obscure important mismodeling effects and thus cause misleading estimates of filter accuracy. The positive result of this study is that the U-D covariance factorization algorithm has excellent numerical properties and is computationally efficient, having CPU costs that differ negligibly from the conventional Kalman costs. Accuracies of the U-D filter using single precision arithmetic consistently match the double precision reference results. Numerical stability of the U-D filter is further demonstrated by its insensitivity to variations in the a priori statistics.

Bierman, G. J.↗

Benchmark solutions for the galactic ion transport equations with spatial and energy coupling

In order to anticipate future space shielding requirements, NASA has initiated an effort to formulate computational methods to simulate radiation effects in space. As part of the program, numerical transport algorithms have been developed for the deterministic Boltzman equation describing galactic cosmic ray (GCR) interactions with matter. It thus becomes necessary to assess the accuracy of proposed deterministic algorithms. For this reason, analytical benchmark solutions to mathematically tractable galactic cosmic ray equations have recently been obtained. Even though these problems involve simplifying assumptions of the associated physics, they still contain the essential features of the basic transport processes. The solutions obtained are features of the basic transport processes. The solutions obtained are compared to results from numerical algorithms in order to ensure proper coding and to provide a measure of the accuracy of the numerical methods used in the algorithm. For the first time, mathematical methods have been applied to the galactic ion transport (GIT) equations in the straight ahead approximation with constant nuclear properties. The approach utilizes a Laplace transforms inversion yielding a closed form benchmark solution which is also computationally efficient.

Ganapol, Barry D.↗

Numerical Analysis of Fixed Point Algorithms in the Presence of Hardware Faults

The exponential growth of computational power of the extreme scale machines over the past few decades has led to a corresponding decrease in reliability and a sharp increase of the frequency of hardware faults. Our research focuses on the mathematical challenges presented by the silent hardware faults. i.e., faults that can perturb the result of computations in an inconspicuous way. Using the approach of selective reliability we present an analytic fault mode that can be used to study the resilience properties of a numerical algorithm. We apply our approach to the classical fixed point iteration and demonstrate that in the presence of hardware faults, the classical method fails to converge in expectation. We preset a modified resilient algorithm that detects and rejects faults resulting in error with large magnitude, while small faults are negated by the natural self-correcting properties of the algorithm. We show that our method is convergent (in first and second statistical moments) even in the presence of silent hardware faults.

algorithmic resilience↗

Neutron transport in Eulerian coordinates with bulk material motion

A consistent, numerically stable algorithm for the solution of the neutron transport equation in the presence of a moving material background is presented for one-dimensional spherical geometry. Manufactured solutions are used to demonstrate the correctness and stability of our numerical algorithm. The importance of including moving material corrections is shown for the r-process in proto-neutron stars. (authors)

97 MATHEMATICS AND COMPUTING↗

Use of Polarization Lidar for Investigation of Meteorological Formations

This paper presents the results of theoretical and experimental, investigations of depolarization characteristics of different meteorological formations. Experimental investigations are carried out with a monostatic lidar. The ruby laser radiation is polarized in a vertical plane. The radiation reflected is accepted by a lens system of 150 rom in diameter and a viewing angle of 12' and further it is divided by Wollaston prism into the components polarized orthogonally. In this case the principal plane of the prism is exposed parallel with the laser polarization plane. Investigations show the degree of radiation polarization, reflected from water clouds, to be changed within 1/0.7 (seldom up to 0.6) depending on their density. In most cases a signal reflected from the cloud leading edge is polarized completely. The time shift is observed between polarized and crosspolarized components of a Fignal, reflected from a cloud, depending on the density of a meteorological object. While penetrating into the cloud depth a degree of polarization decreases up to 0.8-0.7, and the character of this decrease is different for various types of clouds. For crystal clouds the shift between the components of the reflected signal is not observed and the magnitude of polarization degree amounts to 0.1/0.3 in comparison with water clouds. The polarization degree of radiation reflected by fog is not less than 0.6, and that in the rains of average intensity (about 5 mm/h) is always about 1. The authors have suggested an algorithm of numerical solution of nonstationary transfer equation in the vector form to forecast the influence of multiple scattering effects on polarization characteristics of the lidar light signal. The method of statistical simulation (Monte-Carlo technique) forms the basis of the algorithm. Numerical estimates obtained for a model of stratocumulus at lambda = 0.6943 microns under boundary conditions close to the conditions of natural experiment being discussed proved to be in a good agreement with the results of observation. Specifically, Fig. 1 shows the profiles of polarization (p) versus depth (L) of the following drop formations: fog (curve 1) with horizontal meteorological visibility of 4 km two stratocumulus at a height of 1100 m with the attenuation factors delta = 0.01m(exp -1) (curve 2) and delta = 0.05m(exp -1) (curve 3). Curve 3 shows the results of numerical estimates and the value of their statistical error.

Balin, Yu. S.↗

Numerical magetohydrodynamics in astronphysics: Algorithm and tests for one-dimensional flow`

We describe a numerical code to solve the equations for ideal magnetohydrodynamics (MHD). It is based on an explicit finite difference scheme on an Eulerian grid, called the total variation diminishing (TVD) scheme, which is a second-order-accurate extension of the Roe-type upwind scheme. We also describe a non-linear Riemann solver for ideal MHD, which includes rarefractions as well as shocks. The numerical code and the Riemann solver have been used to test each other. Extensive tests encompassing all the possible ideal MHD structures with planar symmetries (i.e., one-dimensional flows) are presented. These include those for which the field structure is two dimensional (i.e., those flows often called '1 + 1/2 dimensional') as well as those for which the magnetic field plane rotates (i.e., those flows often called '1 + 1/2 + 1/2 dimensional'). Results indicate that the code can resolve strong fast, slow, and magnetosonic shocks within two to four cells, but more cells are required if shocks become weak. With proper steepening, we could resolve rotational discontinuities within three to five cells. However, without successful implementation of steepening, contact discontinuities are resolved with approximately 10 cells and tangential discountinuities are resolved with approximately 15 cells. Out tests confirm that slow compound structures with tow-dimensional magnetic fields are composed of intermediate shocks (so-called 2-4 intermediate shocks) followed by slow rarefaction waves. Finally, tests demostrate that in two-dimensional magnetohydrodynamics, fast compound structures, which are composed of intermediate shocks (so-called 1-3 intermediate shocks) preceeded by fast rarefaction waves, are also possible.

Ryu, Dongsu↗

Numerical Models For Control Of Robots

Algorithm develops numerical models of kinematics of robots for use in directing movements of robots. Based on empirical data. Predicts movements from previous measurements of actual movements. Replaces analytical or iterative models used commonly.

Waggener, Mary S.↗

Stochastic weighted particle methods for population balance equations with coagulation, fragmentation and spatial inhomogeneity

Graphical abstract: -- Highlights: •Problems concerning multi-compartment population balance equations are studied. •A class of fragmentation weight transfer functions is presented. •Three stochastic weighted algorithms are compared against the direct simulation algorithm. •The numerical errors of the stochastic solutions are assessed as a function of fragmentation rate. •The algorithms are applied to a multi-dimensional granulation model. -- Abstract: This paper introduces stochastic weighted particle algorithms for the solution of multi-compartment population balance equations. In particular, it presents a class of fragmentation weight transfer functions which are constructed such that the number of computational particles stays constant during fragmentation events. The weight transfer functions are constructed based on systems of weighted computational particles and each of it leads to a stochastic particle algorithm for the numerical treatment of population balance equations. Besides fragmentation, the algorithms also consider physical processes such as coagulation and the exchange of mass with the surroundings. The numerical properties of the algorithms are compared to the direct simulation algorithm and an existing method for the fragmentation of weighted particles. It is found that the new algorithms show better numerical performance over the two existing methods especially for systems with significant amount of large particles and high fragmentation rates.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Three-dimensional incompressible Navier-Stokes solver using lower-upper symmetric-Gauss-Seidel algorithm

A numerical method based on the pseudocompressibility concept is developed for solving the three-dimensional incompressible Navier-Stokes equations using the lower-upper symmetric-Gauss-Seidel implicit scheme. Very high efficiency is achieved in a new flow solver, INS3D-LU code, by accomplishing the complete vectorizability of the algorithm on oblique planes of sweep in three dimensions.

Yoon, Seokkwan↗

Technical Report: Scalable Parallel Algorithms for High Dimensional Numerical Integration

We implemented a scalable parallel quasi-Monte Carlo numerical high-dimensional integration for tera-scale data points. The implemented algorithm uses the Sobol s quasi-sequences to generate random samples. Sobol s sequence was used to avoid clustering effects in the generated random samples and to produce low-discrepancy random samples which cover the entire integration domain. The performance of the algorithm was tested. Obtained results prove the scalability and accuracy of the implemented algorithms. The implemented algorithm could be used in different applications where a huge data volume is generated and numerical integration is required. We suggest using the hyprid MPI and OpenMP programming model to improve the performance of the algorithms. If the mixed model is used, attention should be paid to the scalability and accuracy.

97 MATHEMATICS AND COMPUTING↗

An Efficient Deterministic Parallel Algorithm for Adaptive Multidimensional Numerical Integration on GPUs

Recent development in Graphics Processing Units (GPUs) has enabled a new possibility for highly efficient parallel computing in science and engineering. Their massively parallel architecture makes GPUs very effective for algorithms where processing of large blocks of data can be executed in parallel. Multidimensional integration has important applications in areas like computational physics, plasma physics, computational fluid dynamics, quantum chemistry, molecular dynamics and signal processing. The computationally intensive nature of multidimensional integration requires a high-performance implementation. In this study, we present an efficient deterministic parallel algorithm for adaptive multidimensional numerical integration on GPUs. Various optimization techniques are applied to maximize the utilization of the GPU. GPU-based implementation outperforms the best known sequential methods and achieves a speed-up of up to 100. It also shows good scalability with the increase in dimensionality.

Arumugam, Kamesh↗

Three-dimensional simulation of underexpanded plumes using upwind algorithms

Different numerical techniques have been examined for simulating the underexpanded plumes in supersonic flows. The results revealed that the monotone differentiable limiter is superior to the TVD (total variation diminishing) minmod limiter when the MUSCL (monotonic upstream schemes for conservation laws) approach is used for Roe's upwind scheme. Roe's upwind scheme is found to be superior to the central difference scheme not only for capturing shock waves, but also for capturing shear flows.

Obayashi, Shigeru↗

Numerical stability of relativistic beam multidimensional PIC simulations employing the Esirkepov algorithm

Rapidly growing numerical instabilities routinely occur in multidimensional particle-in-cell computer simulations of plasma-based particle accelerators, astrophysical phenomena, and relativistic charged particle beams. Reducing instability growth to acceptable levels has necessitated higher resolution grids, high-order field solvers, current filtering, etc. except for certain ratios of the time step to the axial cell size, for which numerical growth rates and saturation levels are reduced substantially. This paper derives and solves the cold beam dispersion relation for numerical instabilities in multidimensional, relativistic, electromagnetic particle-in-cell programs employing either the standard or the Cole–Karkkainnen finite difference field solver on a staggered mesh and the common Esirkepov current-gathering algorithm. Good overall agreement is achieved with previously reported results of the WARP code. In particular, the existence of select time steps for which instabilities are minimized is explained. Additionally, an alternative field interpolation algorithm is proposed for which instabilities are almost completely eliminated for a particular time step in ultra-relativistic simulations.

43 PARTICLE ACCELERATORS↗