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 811 records · Page 45

Comparison of the generalized Riemann solver and the gas-kinetic scheme for inviscid compressible flow simulations

The generalized Riemann problem (GRP) scheme for the Euler equations and gas-kinetic scheme (GKS) for the Boltzmann equation are two high resolution shock capturing schemes for fluid simulations. The difference is that one is based on the characteristics of the inviscid Euler equations and their wave interactions, and the other is based on the particle transport and collisions. The similarity between them is that both methods can use identical MUSCL-type initial reconstructions around a cell interface, and the spatial slopes on both sides of a cell interface involve in the gas evolution process and the construction of a time-dependent flux function. Although both methods have been applied successfully to the inviscid compressible flow computations, their performances have never been compared. Since both methods use the same initial reconstruction, any difference is solely coming from different underlying mechanism in their flux evaluation. Therefore, such a comparison is important to help us to understand the correspondence between physical modeling and numerical performances. Since GRP is so faithfully solving the inviscid Euler equations, the comparison can be also used to show the validity of solving the Euler equations itself. The numerical comparison shows that the GRP exhibits a slightly better computational efficiency, and has comparable accuracy with GKS for the Euler solutions in 1D case, but the GKS is more robust than GRP. For the 2D high Mach number flow simulations, the GKS is absent from the shock instability and converges to the steady state solutions faster than the GRP. The GRP has carbuncle phenomena, likes a cloud hanging over exact Riemann solvers. The GRP and GKS use different physical processes to describe the flow motion starting from a discontinuity. One is based on the assumption of equilibrium state with infinite number of particle collisions, and the other starts from the non-equilibrium free transport process to evolve into an equilibrium one through particle collisions. The different mechanism in the flux evaluation deviates their numerical performance. Through this study, we may conclude scientifically that it may NOT be valid to use the Euler equations as governing equations to construct numerical fluxes in a discretized space with limited cell resolution. To adapt the Navier-Stokes (NS) equations is NOT valid either because the NS equations describe the flow behavior on the hydrodynamic scale and have no any corresponding physics starting from a discontinuity. This fact alludes to the consistency of the Euler and Navier-Stokes equations with the continuum assumption and the necessity of a direct modeling of the physical process in the discretized space in the construction of numerical scheme when modeling very high Mach number flows. The development of numerical algorithm is similar to the modeling process in deriving the governing equations, but the control volume here cannot be shrunk to zero.

97 MATHEMATICS AND COMPUTING↗

First and second order approximations to stage numbers in multicomponent enrichment cascades

This paper describes closed form, Taylor series approximations to the number product stages in a multicomponent enrichment cascade. Such closed form approximations are required when a symbolic, rather than a numeric, algorithm is used to compute the optimal cascade state. Both first and second order approximations were implemented. The first order solution was found to be grossly incorrect, having the wrong functional form over the entire domain. On the other hand, the second order solution shows excellent agreement with the 'true' solution over the domain of interest. An implementation of the symbolic, second order solver is available in the free and open source PyNE library. (authors)

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Higher order treatment on temporal derivative of angular flux for time-dependent MOC

A new kinetic analysis method, whose angular dependence of temporal derivative for angular flux is accurately treated within practical memory requirement, is proposed. The method of characteristics (MOC) is being widely used for reactor analysis thanks to the advances of numerical algorithms and computer hardware. However, the computational resources, i.e., the memory capacity, can be still a crucial problem for rigorous kinetic calculations using MOC. In the straightforward approach for kinetic calculation using MOC, the segment-averaged angular fluxes should be stored on the memory in order to explicitly calculate the temporal derivative of the angular flux, which would require huge memory. Thus, in the conventional kinetic calculation code using MOC, the temporal derivative of the angular flux has been approximated as angularly isotropic in order to reduce the memory requirement (isotropic assumption). However, the approximation error caused by the conventional isotropic assumption has not been thoroughly and quantitatively investigated so far and an accurate kinetic calculation method, which can quantitatively estimate the above approximation error within practical memory storage, has not been developed. The present study tries to address this issue with a newly developed approach. Effect of the approximate treatment for the temporal derivative of angular flux is evaluated through benchmark calculations. (authors)

97 MATHEMATICS AND COMPUTING↗

The development and testing of the HELIOS-2 lattice code for use in online cross section generation

This work presents the implementation and testing of the fixed k{sub eff} calculation, with a fixed incoming current boundary condition (fixed k{sub eff} calculation) in the HELIOS-2 lattice physics code. The fixed k{sub eff} numerical algorithm and its implementation in HELIOS-2 are described. The newly implemented feature in the code was tested on a range of test problems that were based on the 2D C5G7 benchmark. Good results were obtained and showed that the implementation performed consistently across the series of test problems. (authors)

97 MATHEMATICS AND COMPUTING↗

The additive volume density law implemented in the Latec workbench to deal with fissile media that contain moderator elements - 14342

The moderation ratio is one of the key parameters for safety assessment in criticality-safety studies. It can be expressed as a moderator to fissile atoms ratio and is related to the concentration of fissile isotopes. The relationship linking these parameters illustrates a physical behaviour of the mixture, which could be very complex depending on the different kinds of media and their associated physical states encountered in the nuclear fuel cycle. To guarantee the safety when modelling a given mixture, criticality-safety practitioners consider either a best estimate approach by fitting experimental data, or, a bounding approach with a fictitious fissile mixture. This theoretical model is generally more penalizing in terms of k{sub eff} and does not involve numeric algorithms for the resolution reducing the overall uncertainty. This is the case for the additive volume density law, which is based on the assumption that the volume of a mixture is the sum of the volumes of all its compounds. This naturally leads to differentiate all the compounds in the mixture and, in particular, the fissile compound and the moderator. A first algorithm has been derived from this approach and implemented in the LATEC criticality workbench developed at IRSN, but a second assumption is required to solve the problem encountered when moderator's elements have also to be used to define the fissile compound. A typical example of this major issue is an UZrH fissile compound moderated by water. The reference moderator element of the water is obviously hydrogen that belongs to the fissile compound. This paper is dedicated to the implementation in the LATEC criticality workbench of an algorithm based on the additive volume density law that is able to deal with such a configuration. The major advantage of this new algorithm is the versatility in terms of input data. The mixture compounds and the moderation can be expressed in multiple ways still using the same algorithm. A validation work has been performed on different UZrH compounds and for different expressions of moderation. The calculated isotopic concentrations have been compared to theoretical calculations using a more straightforward algorithm but that should be adapted for every change in terms of moderation expression. The results obtained are in good agreement with validation results. (authors)

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Simulation Studies of the X-Ray Free-Electron Laser Oscillator

Simulations of the x-ray free-electron laser (FEL) oscillator are presented that include transverse effects and realistic Bragg crystal properties with the two-dimensional code GINGER. In the present cases considered the radiation divergence is much narrower than the crystal acceptance, and the numerical algorithm can be simplified by ignoring the finite angular bandwidth of the crystal. In this regime GINGER shows that the saturated x-ray pulses have 109 photons and are nearly Fourier-limited with peak powers in excess of 1 MW. Wealso include preliminary results for a four-mirror cavity that can be tuned in wavelength over a few percent, with future plans to incorporate the full transverse response of the Bragg crystals into GINGER to more accurately model this tunable source.

43 PARTICLE ACCELERATORS↗

Numerical arc segmentation algorithm for a radio conference - A software tool for communication satellite systems planning

A detailed description of a Numerical Arc Segmentation Algorithm for a Radio Conference (NASARC) software package for communication satellite systems planning is presented. This software provides a method of generating predetermined arc segments for use in the development of an allotment planning procedure to be carried out at the 1988 World Administrative Radio Conference (WARC - 88) on the use of the GEO and the planning of space services utilizing GEO. The features of the NASARC software package are described, and detailed information is given about the function of each of the four NASARC program modules. The results of a sample world scenario are presented and discussed.

Whyte, W. A.↗

Predictive Lateral Logic for Numerical Entry Guidance Algorithms

Recent entry guidance algorithm development123 has tended to focus on numerical integration of trajectories onboard in order to evaluate candidate bank profiles. Such methods enjoy benefits such as flexibility to varying mission profiles and improved robustness to large dispersions. A common element across many of these modern entry guidance algorithms is a reliance upon the concept of Apollo heritage lateral error (or azimuth error) deadbands in which the number of bank reversals to be performed is non-deterministic. This paper presents a closed-loop bank reversal method that operates with a fixed number of bank reversals defined prior to flight. However, this number of bank reversals can be modified at any point, including in flight, based on contingencies such as fuel leaks where propellant usage must be minimized.

Smith, Kelly M.↗

Numerical Arc Segmentation Algorithm for a Radio Conference-NASARC (version 4.0) technical manual

The information contained in the NASARC (Version 4.0) Technical Manual and NASARC (Version 4.0) User's Manual relates to the Numerical Arc Segmentation Algorithm for a Radio Conference (NASARC) software development through November 1, 1988. The Technical Manual describes the NASARC concept and the algorithms used to implement the concept. The User's Manual provides information on computer system considerations, installation instructions, description of input files, and program operation instructions. Significant revisions were incorporated in the Version 4.0 software over prior versions. These revisions have further enhanced the modeling capabilities of the NASARC procedure and provide improved arrangements of predetermined arcs within the geostationary orbits. Array dimensions within the software were structured to fit within the currently available 12 megabyte memory capacity of the International Frequency Registration Board (IFRB) computer facility. A piecewise approach to predetermined arc generation in NASARC (Version 4.0) allows worldwide planning problem scenarios to be accommodated within computer run time and memory constraints with enhanced likelihood and ease of solution.

Whyte, Wayne A., Jr.↗

Future Response of Coastal Wetlands to Environmental Stresses: Algorithm Comparison of Numerical Models

Coastal wetlands are a critical component of the earth system that strongly influence the global water and biogeochemical cycles. They are also likely important sentinel of climate change. Because eco-geomorphological processes have long been recognized to be important for coastal wetland survival under accelerated sea-level rise (SLR), many eco-geomorphology models have been developed to assess the impact of climate change on coastal wetlands. Although these models differ substantially in complexity and numerical methods, few studies have investigated the algorithm-level uncertainties in these models. In this study, we developed a multiple-algorithm model framework of coastal wetlands that represents coastal hydrodynamics (such as water level, significant wave height and bottom shear stress) and four eco-geomorphological processes: mineral accretion, organic matter accretion, storm surge erosion and landward migration. We validated the model at three representative coastal wetland sites (Venice Lagoon, Plum Island Estuary and Hunter Estuary) for hydrodynamics, mineral accretion and organic matter accretion. Through model-data comparison, we showed that the model can well capture the dynamics of hydrodynamical and eco-geomorphological conditions in the study sites. Importantly, analysis of the multiple-algorithm simulations suggests that differences in the process representation of mineral and organic matter accretion may contribute to the recent contradicting predictions of coastal wetland evolution under accelerated SLR.

54 ENVIRONMENTAL SCIENCES↗

Numerical Arc Segmentation Algorithm for a Radio Conference (NASARC), version 4.0: User's manual

The information in the NASARC (Version 4.0) Technical Manual (NASA-TM-101453) and NASARC (Version 4.0) User's Manual (NASA-TM-101454) relates to the state of Numerical Arc Segmentation Algorithm for a Radio Conference (NASARC) software development through November 1, 1988. The Technical Manual describes the NASARC concept and the algorithms used to implement the concept. The User's Manual provides information on computer system considerations, installation instructions, description of input files, and program operation instructions. Significant revisions were incorporated in the Version 4.0 software over prior versions. These revisions have further enhanced the modeling capabilities of the NASARC procedure and provide improved arrangements of predetermined arcs within the geostationary orbit. Array dimensions within the software were structured to fit within the currently available 12-megabyte memory capacity of the International Frequency Registration Board (IFRB) computer facility. A piecewise approach to predetermined arc generation in NASARC (Version 4.) allows worldwide planning problem scenarios to be accommodated within computer run time and memory constraints with enhanced likelihood and ease of solution.

Whyte, Wayne A., Jr.↗

Numerical Arc Segmentation Algorithm for a Radio Conference-NASARC, Version 2.0: User's Manual

The information contained in the NASARC (Version 2.0) Technical Manual (NASA TM-100160) and the NASARC (Version 2.0) User's Manual (NASA TM-100161) relates to the state of the Numerical Arc Segmentation Algorithm for a Radio Conference (NASARC) software development through October 16, 1987. The technical manual describes the NASARC concept and the algorithms which are used to implement it. The User's Manual provides information on computer system considerations, installation instructions, description of input files, and program operation instructions. Significant revisions have been incorporated in the Version 2.0 software over prior versions. These revisions have enhanced the modeling capabilities of the NASARC procedure while greatly reducing the computer run time and memory requirements. Array dimensions within the software have been structured to fit into the currently available 6-megabyte memory capacity of the International Frequency Registration Board (IFRB) computer facility. A piecewise approach to predetermined arc generation in NASARC (Version 2.0) allows worldwide scenarios to be accommodated within these memory constraints while at the same time reducing computer run time.

Whyte, Wayne A., Jr.↗

Numerical arc segmentation algorithm for a radio conference-NASARC (version 2.0) technical manual

The information contained in the NASARC (Version 2.0) Technical Manual (NASA TM-100160) and NASARC (Version 2.0) User's Manual (NASA TM-100161) relates to the state of NASARC software development through October 16, 1987. The Technical Manual describes the Numerical Arc Segmentation Algorithm for a Radio Conference (NASARC) concept and the algorithms used to implement the concept. The User's Manual provides information on computer system considerations, installation instructions, description of input files, and program operating instructions. Significant revisions have been incorporated in the Version 2.0 software. These revisions have enhanced the modeling capabilities of the NASARC procedure while greatly reducing the computer run time and memory requirements. Array dimensions within the software have been structured to fit within the currently available 6-megabyte memory capacity of the International Frequency Registration Board (IFRB) computer facility. A piecewise approach to predetermined arc generation in NASARC (Version 2.0) allows worldwide scenarios to be accommodated within these memory constraints while at the same time effecting an overall reduction in computer run time.

Whyte, Wayne A., Jr.↗

A variant nonmonotone smoothing algorithm with improved numerical results for large-scale LWCPs

This paper considers the linear weighted complementarity problem (denoted by LWCP) introduced by Potra (SIAM J Optim 22:1634–1654, 2012). Based on two weighted smoothing functions, we propose a new nonmonotone smoothing algorithm for solving the LWCP and establish its global and local quadratic convergence without the strict complementarity assumption. Compared to existing nonmonotone smoothing algorithms, the proposed algorithm solves the linear system only approximately which can save the computation work when one solves large-scale LWCPs. Moreover, the nonmonotone line search technique adopted in this paper includes the usual monotone line search and some existing nonmonotone line searches as special cases. Numerical results show that our algorithm is considerably efficient for solving large-scale LWCPs.

97 MATHEMATICS AND COMPUTING↗

Analysis of the distribution of pitch angles in model galactic disks - Numerical methods and algorithms

An automated mathematical method capable of successfully isolating the many different features in prototype and observed spiral galaxies and of accurately measuring the pitch angles and lengths of these individual features is developed. The method is applied to analyze the evolution of specific features in a prototype galaxy exhibiting flocculent spiral structure. The mathematical-computational method was separated into two components. Initially, the galaxy was partitioned into dense regions constituting features using two different methods. The results obtained using these two partitioning algorithms were very similar, from which it is inferred that no numerical biasing was evident and that capturing of the features was consistent. Standard least-squares methods underestimated the true slope of the cloud distribution and were incapable of approximating an orientation of 45 deg. The problems were overcome by introducing a superior fit least-squares method, developed with the intention of calculating true orientation rather than a regression line.

Russell, William S.↗

A new numerically stable sequential algorithm for coupled finite-strain elastoplastic geomechanics and flow

In this work, we propose a new numerically stable sequential implicit method for coupled flow and finite-strain multiplicative elastoplastic geomechanics. We find from stability analysis that the sequential method that solves the flow problem first by fixing the first Piola-Kirchhoff total stress, solving the geomechanics (solid deformation) problem at the next step, is unconditionally stable (contractive and B-stable). In this sense, this method named the fixed first Piola-Kirchhoff stress method is an extension of the fixed stress method in coupled flow and infinitesimal geomechanics. We also study the fixed second Piola-Kirchhoff stress method, comparing it with the fixed first Piola-Kirchhoff stress method, because the constitutive relations are formulated by the second Piola-Kirchhoff total stress, although fixing the second Piola-Kirchhoff total stress field does not provide theoretical unconditional stability. In space discretization, we use the finite element method for the geomechanics problem with the total Lagrangian approach, while employing the finite volume method for the flow problem. Geometrical nonlinearity from the total Lagrangian approach results in full-tensor permeability even if the initial permeability is isotropic. To consider the full-tensor permeability accurately, we employ the multipoint flux approximation in solving the flow problem. In time discretization, the backward Euler method is used. Then, we perform numerical experiments of the two fixed-stress sequential methods with various scenarios, and find superiority of their numerical stability. Specifically, the two fixed-stress sequential methods provide almost identical results for elasticity. For J2 plasticity, the two sequential methods yield slightly different numerical results although the trends of the results are similar. For the Drucker-Prager plasticity, we find that the results from the two methods are almost identical. For all the test cases, the two sequential methods are numerically stable.

58 GEOSCIENCES↗

Bringing randomized algorithms to mainstream numerical linear algebra

Numerical linear algebra (NLA) underpins huge swaths of computational science and engineering. For scientists and engineers to make the most of the DOE’s computing resources, it is essential that they have access to high-performance implementations of algorithms with best-in-class scalability and reliability. Despite this, prevailing NLA libraries have little to no support for breakthrough algorithms from the field of randomized numerical linear algebra (RandNLA) that have been developed over the past twenty years. The goal of this LDRD was to break a log-jam that had prevented broad adoption of RandNLA. Our work had two thrusts. The first was to develop RandBLAS: a trustworthy and high-performance C++ library for randomized dimension reduction (an operation widely known as sketching). The second was the development of a novel randomized algorithm for computing a challenging type of matrix decomposition known as Householder QR with column pivoting (Householder QRCP). In this one-year late-start LDRD we successfully delivered RandBLAS 1.0 and new CPU and GPU codes for Householder QRCP. RandBLAS has extensive documentation at https://randblas.readthedocs.io/en/stable/. Papers on RandBLAS and and our high-performance QRCP codes are forthcoming.

97 MATHEMATICS AND COMPUTING↗