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 343 records · Page 19

Investigation of Xenon Oscillations via Point Kinetics

We all appreciate the special role Xenon-135 plays in reactor transients. Unless there is sufficient reactivity override, on shutdown a conventional reactor cannot immediately restart because of the buildup of strongly absorbing Xenon from Iodine decay and the absence of neutron flux to continue its elimination. We are also aware of how the flux imbalance in a large reactor core gives rise to Xenon induced power precession around the core in unpredictable ways. In addition, with regard to computational methods, we lack readily accessible numerical algorithms enabling reliable characterization of Xenon oscillations with simple models to explain this fundamentally important phenomenon. Nowhere is this more apparent than in the classroom. In this presentation, we first consider a new 12-element comprehensive decay model to Xenon and its corresponding numerical implementation and verification to establish a predictive model of Xenon buildup in a constant flux. We then follow with a reduced self-consistent flux model in an infinite reactor- a model not found in textbooks. This presentation should appeal to those interested in developing high order numerical methods for reactor transients.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Hybrid reduced order modeling for assembly calculations

While the accuracy of assembly calculations has greatly improved due to the increase in computer power enabling more refined description of the phase space and use of more sophisticated numerical algorithms, the computational cost continues to increase which limits the full utilization of their effectiveness for routine engineering analysis. Reduced order modeling is a mathematical vehicle that scales down the dimensionality of large-scale numerical problems to enable their repeated executions on small computing environment, often available to end users. This is done by capturing the most dominant underlying relationships between the model's inputs and outputs. Previous works demonstrated the use of the reduced order modeling for a single physics code, such as a radiation transport calculation. This paper extends those works to coupled code systems as currently employed in assembly calculations. Finally, numerical tests are conducted using realistic SCALE assembly models with resonance self-shielding, neutron transport, and nuclides transmutation/depletion models representing the components of the coupled code system.

97 MATHEMATICS AND COMPUTING↗

Advanced Dynamically Adaptive Algorithms for Stochastic Simulations on Extreme Scales

The focus of the project is the development of mathematical methods and high-performance computational tools for stochastic simulations, with a particular emphasis on computations on extreme scales. The core of the project revolves around the design of highly efficient and scalable numerical algorithms that can adaptively and accurately, in high dimensional spaces, resolve stochastic problems with limited smoothness, even containing discontinuities.

97 MATHEMATICS AND COMPUTING↗

Numerical simulation of viscous-inviscid interactions on indented nose tips

An implicit numerical algorithm to solve the unsteady thin-layer Navier-Stokes equations in a strong conservative form has been used to compute the viscous flow over indented nose tips placed in a supersonic free stream. Numerical solutions are presented for axisymmetric and three-dimensional indented configurations for laminar flow conditions. Results demonstrate the capability of the present numerical procedure to predict flow fields that contain strong viscous-inviscid interactions, including boundary-layer separation, reattachment, and embedded discontinuities. Comparisons with available experimental data for the shock shape and surface pressure are also given.

Rizk, Y. M.↗

A Parallel Incompressible Navier-Stokes Solver With a Parallel Multigrid Elliptic Kernal

The paper describes numerical algorithms and parallel implementations of a time-dependent, incompressible Navier-Stokes flow solver and a multigrid elliptic solver, which is also used as a computation kernal in the flow solver. The implemented solvers are numerically stable and computationally efficient, and they scale well to a large number of processors for problems with moderate granularity.

solver Navier-Stokes solver multigrid elliptic sol↗

Phase-space dynamics of runaway electrons in tokamaks

The phase-space dynamics of runaway electrons is studied, including the influence of loop voltage, radiation damping, and collisions. A theoretical model and a numerical algorithm for the runaway dynamics in phase space are developed. Instead of standard integrators, such as the Runge-Kutta method, a variational symplectic integrator is applied to simulate the long-term dynamics of a runaway electron. The variational symplectic integrator is able to globally bound the numerical error for arbitrary number of time-steps, and thus accurately track the runaway trajectory in phase space. Simulation results show that the circulating orbits of runaway electrons drift outward toward the wall, which is consistent with experimental observations. The physics of the outward drift is analyzed. It is found that the outward drift is caused by the imbalance between the increase of mechanical angular momentum and the input of toroidal angular momentum due to the parallel acceleration. An analytical expression of the outward drift velocity is derived. The knowledge of trajectory of runaway electrons in configuration space sheds light on how the electrons hit the first wall, and thus provides clues for possible remedies.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Neutron noise calculations in a hexagonal geometry and comparison with analytical solutions

This paper presents the development of a neutronic and kinetic solver for hexagonal geometries. The tool is developed based on the diffusion theory with multi-energy groups and multi-groups of delayed neutron precursors allowing the solutions of forward and adjoint problems of static and dynamic states, and is applicable to both thermal and fast systems with hexagonal geometries. In the dynamic problems, the small stationary fluctuations of macroscopic cross sections are considered as noise sources, and then the induced first order noise is calculated fully in the frequency domain. Numerical algorithms for solving the static and noise equations are implemented with a spatial discretization based on finite differences and a power iterative solution. A coarse mesh finite difference method has been adopted for speeding up the convergence. Since no other numerical tool could calculate frequency-dependent noise in hexagonal geometry, validation calculations have been performed and benchmarked to analytical solutions based on a 2-D homogeneous system with two-energy groups and one-group of delayed neutron precursor, in which point-like perturbations of thermal absorption cross section at central and non-central positions are considered as noise sources. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Minimum jerk trajectory planning for robotic manipulators

It has been experimentally verified that the jerk of the desired trajectory adversely affects the performance of the tracking control algorithms for robotic manipulators. In this paper, the reasons behind this effect are investigated, and an optimization problem that minimizes joint jerk over a prespecified Cartesian space trajectory is stated. The necessary conditions are derived, and a numerical algorithm is presented.

Kyriakopoulos, K. J.↗

Extending HPF for advanced data parallel applications

The stated goal of High Performance Fortran (HPF) was to 'address the problems of writing data parallel programs where the distribution of data affects performance'. After examining the current version of the language we are led to the conclusion that HPF has not fully achieved this goal. While the basic distribution functions offered by the language - regular block, cyclic, and block cyclic distributions - can support regular numerical algorithms, advanced applications such as particle-in-cell codes or unstructured mesh solvers cannot be expressed adequately. We believe that this is a major weakness of HPF, significantly reducing its chances of becoming accepted in the numeric community. The paper discusses the data distribution and alignment issues in detail, points out some flaws in the basic language, and outlines possible future paths of development. Furthermore, we briefly deal with the issue of task parallelism and its integration with the data parallel paradigm of HPF.

Chapman, Barbara↗

Simulation of three-dimensional compressible viscous flow on the Illiac IV computer

Complicated three-dimensional viscous transonic flows about bodies at high angles of attack are solved on the Illiac IV computer. It is shown that certain approximate forms of the compressible Reynolds-averaged Navier-Stokes equations can be computed about realistic three-dimensional geometries with relative ease on the Illiac IV. The ease and efficiency with which this can be done depend on the approximations made in the basic equations, the choice of the numerical algorithm used for the solution, and the data-base system that controls the data management and identifies and manipulates the vectors. A pencil data-base system is found to be particularly suitable for the approximations and numerical method chosen to produce the results presented. In addition, some comparisons are made of computer predictions with experimental results for various lows about hemisphere-cylinders in both subsonic and supersonic free streams. The same viscous model and numerical model are used, showing good qualitative agreement in the location of separation lines and pressure distributions.

Pulliam, T. H.↗

Numerical method for predicting flow characteristics and performance of nonaxisymmetric nozzles. Part 2: Applications

A computer implemented numerical method for predicting the flow in and about an isolated three dimensional jet exhaust nozzle is summarized. The approach is based on an implicit numerical method to solve the unsteady Navier-Stokes equations in a boundary conforming curvilinear coordinate system. Recent improvements to the original numerical algorithm are summarized. Equations are given for evaluating nozzle thrust and discharge coefficient in terms of computed flowfield data. The final formulation of models that are used to simulate flow turbulence effect is presented. Results are presented from numerical experiments to explore the effect of various quantities on the rate of convergence to steady state and on the final flowfield solution. Detailed flowfield predictions for several two and three dimensional nozzle configurations are presented and compared with wind tunnel experimental data.

Thomas, P. D.↗

Application of a finite element algorithm for high speed viscous flows using structured and unstructured meshes

A higher-order streamline upwinding Petrov-Galerkin finite element method is employed for high speed viscous flow analysis using structured and unstructured meshes. For a Mach 8.03 shock interference problem, successive mesh adaptation was performed using an adaptive remeshing method. Results from the finite element algorithm compare well with both experimental data and results from an upwind cell-centered method. Finite element results for a Mach 14.1 flow over a 24 degree compression corner compare well with experimental data and two other numerical algorithms for both structured and unstructured meshes.

Vemaganti, Gururaja R.↗

A PANSONIC Navier-Stokes solver

A finite-difference formulation of the full Navier-Stokes equations which demonstrates a capability to economically solve two-dimensional problems has been developed. The basic algorithm was derived from the full, Reynolds-averaged, conservative, Navier-Stokes equations expressed in curvilinear coordinates. Eddy viscosity was determined by the Baldwin and Lomax algebraic turbulence model. This non-iterative, second-order accurate, implicit, numerical algorithm is based on the approximate factorization finite-difference scheme of Beam and Warming. Results indicate a facility for solving subsonic, transonic, and supersonic (hence PANSONIC) flows about arbitrary airfoils for a wide range of Reynolds numbers, Mach numbers, and angles of attack. Current computations demonstrate that vectorized implementations of this algorithm can solve steady-state, two-dimensional problems in five to ten minutes of computer time.

Cooper, G. K.↗

Algorithms and Libraries

This exploratory study initiated our inquiry into algorithms and applications that would benefit by latency tolerant approach to algorithm building, including the construction of new algorithms where appropriate. In a multithreaded execution, when a processor reaches a point where remote memory access is necessary, the request is sent out on the network and a context--switch occurs to a new thread of computation. This effectively masks a long and unpredictable latency due to remote loads, thereby providing tolerance to remote access latency. We began to develop standards to profile various algorithm and application parameters, such as the degree of parallelism, granularity, precision, instruction set mix, interprocessor communication, latency etc. These tools will continue to develop and evolve as the Information Power Grid environment matures. To provide a richer context for this research, the project also focused on issues of fault-tolerance and computation migration of numerical algorithms and software. During the initial phase we tried to increase our understanding of the bottlenecks in single processor performance. Our work began by developing an approach for the automatic generation and optimization of numerical software for processors with deep memory hierarchies and pipelined functional units. Based on the results we achieved in this study we are planning to study other architectures of interest, including development of cost models, and developing code generators appropriate to these architectures.

Dongarra, Jack↗

Algorithm Stability and the Long-Term Geospace Data Record from TIMED/SABER

The ability of satellite instruments to accurately observe long-term changes in atmospheric temperature depends on many factors including the absolute accuracy of the measurement, the stability of the calibration of the instrument, the stability of the satellite orbit, and the stability of the numerical algorithm that produces the temperature data. We present an example of algorithm instability recently discovered in the temperature dataset from the SABER instrument on the NASA TIMED satellite. The instability resulted in derived temperatures that were substantially colder than anticipated from mid-December 2019 to mid-2022. This algorithm-induced change in temperature over one to two years corresponded to the expected change over several decades from increasing anthropogenic CO2. This paper highlights the importance of algorithm stability in developing Geospace Data Records (GDRs) for Earth’s mesosphere and lower thermosphere. A corrected version (Version 2.08) of the temperatures from SABER is described.

M G Mlynczak↗

Optimal experiment design for quantum state tomography: Fair, precise, and minimal tomography

Given an experimental setup and a fixed number of measurements, how should one take data to optimally reconstruct the state of a quantum system? The problem of optimal experiment design (OED) for quantum state tomography was first broached by Kosut et al.[R. Kosut, I. Walmsley, and H. Rabitz, e-print arXiv:quant-ph/0411093 (2004)]. Here we provide efficient numerical algorithms for finding the optimal design, and analytic results for the case of 'minimal tomography'. We also introduce the average OED, which is independent of the state to be reconstructed, and the optimal design for tomography (ODT), which minimizes tomographic bias. Monte Carlo simulations confirm the utility of our results for qubits. Finally, we adapt our approach to deal with constrained techniques such as maximum-likelihood estimation. We find that these are less amenable to optimization than cruder reconstruction methods, such as linear inversion.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A 3D-PNS computer code for the calculation of supersonic combusting flows

A computer code has been developed based on the three-dimensional parabolized Navier-Stokes (PNS) equations which govern the supersonic combusting flow of the hydrogen-air system. The finite difference algorithm employed was a hybrid of the Schiff-Steger algorithm and the Vigneron, et al., algorithm which is fully implicit and fully coupled. The combustion of hydrogen and air was modeled by the finite-rate two-step combustion model of Rogers-Chinitz. A new dependent variable vector was introduced to simplify the numerical algorithm. Robustness of the algorithm was considerably enhanced by introducing an adjustable parameter. The computer code was used to solve a premixed shock-induced combustion problem and the results were compared with those of a full Navier-Stokes code. Reasonably good agreement was obtained at a fraction of the cost of the full Navier-Stokes procedure.

Chitsomboon, Tawit↗

Computation of Reacting Flows in Combustion Processes

The objective of this research is to develop an efficient numerical algorithm with unstructured grids for the computation of three-dimensional chemical reacting flows that are known to occur in combustion components of propulsion systems. During the grant period (1996 to 1999), two companion codes have been developed and various numerical and physical models were implemented into the two codes.

Keith, Theo G., Jr.↗