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

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↗

An Adaptive Numeric Predictor-corrector Guidance Algorithm for Atmospheric Entry Vehicles

An adaptive numeric predictor-corrector guidance is developed for atmospheric entry vehicles which utilize lift to achieve maximum footprint capability. Applicability of the guidance design to vehicles with a wide range of performance capabilities is desired so as to reduce the need for algorithm redesign with each new vehicle. Adaptability is desired to minimize mission-specific analysis and planning. The guidance algorithm motivation and design are presented. Performance is assessed for application of the algorithm to the NASA Entry Research Vehicle (ERV). The dispersions the guidance must be designed to handle are presented. The achievable operational footprint for expected worst-case dispersions is presented. The algorithm performs excellently for the expected dispersions and captures most of the achievable footprint.

Spratlin, Kenneth Milton↗

Faster and More Accurate Transport Procedures for HZETRN

Several aspects of code verification are examined for HZETRN. First, a detailed derivation of the numerical marching algorithms is given. Next, a new numerical method for light particle transport is presented, and improvements to the heavy ion transport algorithm are discussed. A summary of various coding errors is also given, and the impact of these errors on exposure quantities is shown. Finally, a coupled convergence study is conducted. From this study, it is shown that past efforts in quantifying the numerical error in HZETRN were hindered by single precision calculations and computational resources. It is also determined that almost all of the discretization error in HZETRN is caused by charged target fragments below 50 AMeV. Total discretization errors are given for the old and new algorithms, and the improved accuracy of the new numerical methods is demonstrated. Run time comparisons are given for three applications in which HZETRN is commonly used. The new algorithms are found to be almost 100 times faster for solar particle event simulations and almost 10 times faster for galactic cosmic ray simulations.

Slaba, Tony C.↗

Proton pinhole imaging on the National Ignition Facility

Pinhole imaging of large (mm scale) carbon-deuterium (CD) plasmas by proton self-emission has been used for the first time to study the microphysics of shock formation, which is of astrophysical relevance. The 3 MeV deuterium-deuterium (DD) fusion proton self-emission from these plasmas is imaged using a novel pinhole imaging system, with up to five different 1 mm diameter pinholes positioned 25 cm from target-chamber center. CR39 is used as the detector medium, positioned at 100 cm distance from the pinhole for a magnification of 4 ×. A Wiener deconvolution algorithm is numerically demonstrated and used to interpret the images. When the spatial morphology is known, this algorithm accurately reproduces the size of features larger than about half the pinhole diameter. For these astrophysical plasma experiments on the National Ignition Facility, this provides a strong constraint on simulation modeling of the experiment.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Computing an Optimal Entanglement Path with Throughput and Fidelity Considerations

Entanglement distribution is a core function of quantum networks essential for operations including teleportation, distributed quantum sensing, and multisite computation. Entanglement throughput and fidelity are two critical performance measures that depend on the quantum transmission along the links and swapping operations at the repeaters along the path. We study the problem of computing a end-to-end entanglement path that satisfies both fidelity and throughput requirements, leveraging qubit buffers at the nodes and considering the sequential swapping order. We show that the general problem of simultaneously satisfying both metrics to be NP-hard, and develop an algorithm to maximize throughput subject to a given fidelity threshold. We introduce the concepts of entanglement probability distribution and path domination and exploit them in the design of our algorithm. Extensive numerical results show that our algorithm can find optimal solutions in networks with thousands of nodes in less than a second. We also describe practical and possible implementation aspects of this algorithm in terms of devices and architecture support.

Xue, Guoliang [Arizona State University]↗

Comparison Of Two Viscous-Flow Computer Codes

Two viscous-flow computer codes compared by applying them to five test cases of steady-state transonic viscous flows about transonic airfoils. Two codes were: FLOMG, which solves Navier-Stokes differential equations of flow by implementing explicit, Runge-Kutta, finite-volume, multigrid numerical-integration algorithm; and ARC2D, which implements implicit, finite-difference, approximate-factorization, eigenvector-diagonalization numerical-integration algorithm.

Maksymiuk, C. M.↗

Application of a Fully Numerical Guidance to Mars Aerocapture

An advanced guidance algorithm, Fully Numerical Predictor-corrector Aerocapture Guidance (FNPAG), has been developed to perform aerocapture maneuvers in an optimal manner. It is a model-based, numerical guidance that benefits from requiring few adjustments across a variety of different hypersonic vehicle lift-to-drag ratios, ballistic co-efficients, and atmospheric entry conditions. In this paper, FNPAG is first applied to the Mars Rigid Vehicle (MRV) mid lift-to-drag ratio concept. Then the study is generalized to a design map of potential Mars aerocapture missions and vehicles, ranging from the scale and requirements of recent robotic to potential human and precursor missions. The design map results show the versatility of FNPAG and provide insight for the design of Mars aerocapture vehicles and atmospheric entry conditions to achieve desired performance.

Matz, Daniel A.↗

Numerical study of a smoothing algorithm for the complementarity system over the second-order cone

This paper deals with the complementarity system over the second-order cone (denoted by CSSOC) which contains a wide class of problems. We extend a class of regularized Chen–Harker–Kanzow–Smale smoothing functions studied by Huang and Sun (Appl Math Optim 52:237–262, 2005) for the linear complementarity problem to the CSSOC. Based on this class of functions, we propose a smoothing algorithm for solving the CSSOC. Under weak assumptions, we prove that the proposed algorithm has global and local quadratic convergence. The proposed algorithm is different from existing smoothing algorithms for solving the CSSOC because it adopts a new nonmonotone line search rule. In addition, our algorithm solves a new equation reformulation of the CSSOC. Numerical experiments indicate that the proposed algorithm is quite effective.

97 MATHEMATICS AND COMPUTING↗

Fast model-based scenario optimization in NSTX-U enabled by analytic gradient computation

Model-based optimization offers a systematic approach to advanced scenario planning. In this case, the feedforward-control inputs (actuator trajectories) that are needed to attain and sustain a desired scenario are obtained by solving a nonlinear constrained optimization problem. This class of problems generally minimize a cost function that measures the difference between desired and actual plasma states. Several numerical optimization algorithms, such as sequential quadratic programming, require repeated calculation of the cost function gradients with respect to the input trajectories. Calculating these gradients numerically can be computationally intensive, increasing the time needed to solve the feedforward-control optimization problem. Here, this work introduces a method to analytically calculate these cost function gradients from the current profile evolution model. This can significantly reduce the computational time and allow for fast feedforward-control optimization, which would eventually enable optimal scenario planning between discharges. The performance of the feedforward optimizer with analytical gradients is compared to a traditional optimization algorithm based on numerical gradients for different NSTX-U scenarios. The plasma dynamics in the optimization algorithm are simulated using the Control Oriented Transport SIMulator (COTSIM). Results of the work show that analytical gradients consistently reduce the computation time while achieving trajectories that are comparable to those obtained by traditional optimization algorithms based on numerical gradients.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Electromagnetic Transient (EMT) Simulation Algorithms for Evaluation of Large-Scale Extreme Fast Charging Systems (T&D Models)

Simulation of high-fidelity models of extreme fast charging (XFC) systems and large-area power grids with many XFCs can be time consuming in traditional simulators. Traditional simulators use a single method of discretization for all the components that results in imposing a large computational burden of inverting a large matrix as well as increased computations related to single method of discretization (that is typically a trapezoidal method). To overcome the problem of simulating large-area power grids with many XFCs, in this paper, advanced numerical simulation algorithms are applied for the first time together to reduce the dimension of matrix inversion. Here, the algorithms include numerical stiffness-based segregation, time constant-based segregation, clustering and aggregation on differential algebraic equations (DAEs), and multi-order integration approaches. These algorithms apply multiple discretization algorithms rather than a single discretization algorithm that further reduces the computational burden. The approaches mentioned here have resulted in speed-up of up to 18x in the simulation of a single distribution system with 15 XFCs and of up to 271x in the simulation of a transmission-distribution system with 300 XFCs in multiple distribution feeders with respect to conventional simulators (like power systems computer aided design [PSCAD]).

42 ENGINEERING↗