Search NASA⌕ Search

SEARCH · Search NASA

Results for “discretization methods”

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 1,729 records · Page 96
All sourcesNASA NTRSDOE OSTI
DOE OSTI2016

Accelerated Monte Carlo Fission Source Convergence with Fission Matrix and Kernel Density Estimators

Accurate solution of the k-eigenvalue form of the Boltzmann radiation transport equation is required in many application areas, including nuclear reactor analysis and criticality safety. Monte Carlo calculations are free of the discretization errors inherent to deterministic methods and therefore offer the most accurate solutions. However, converging the fission source can be difficult for many problems, resulting in either a substantial computational overhead or potential inaccuracies that negate many of the benefits of using Monte Carlo methods. Difficulty in converging the fission source occurs for two distinct reasons. The first is the existence of a high dominance ratio in the problem (i.e. the largest and second largest eigenvalues have approximately the same magnitude). The second difficulty arises due to undersampling of the fission source because an insufficient number of particle histories are simulated. The first difficulty is shared by deterministic solvers when using power iteration, while the second difficulty is unique to Monte Carlo solvers. In practice, both difficulties may be present in the same problem, compounding the difficulty in achieving a converged distribution. In this paper, we consider a new approach to accelerate the convergence of the fission source based on combining the use of fission matrix methods with kernel density estimators (KDEs). It has been observed that deterministic fission matrix methods show the potential to accelerate the convergence of the fission source in Monte Carlo criticality calculations but may introduce significant additional noise for difficult problems. In this paper, we have demonstrated the use of a KDE approach in combination with the fission matrix acceleration. Although the addition of the KDE initially slows the convergence of the fission matrix acceleration, it decreases the magnitude of the noise while still offering significantly improved convergence relative to analog Monte Carlo. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2016

GPU Acceleration of History-Based Multigroup Monte Carlo

Accurate solutions of the radiation transport equation play an important role in the analysis of many nuclear systems. Because there is no need to discretize the problem, Monte Carlo methods offer the most accurate possible solutions to the transport equation. However, significant computational effort is required to reduce the stochastic noise inherent to Monte Carlo methods. Current trends in high performance computing are moving towards vectorized, single instruction multiple data (SIMD), architectures such as Intel Xeon Phis and graphics processing units (GPUs) due to their favorable ratio of performance to power consumption. The challenge of adapting Monte Carlo transport to vectorized computing architectures was first addressed by Brown with an algorithm known as event-based Monte Carlo. In this approach, rather than simulating individual particle histories from birth to death, groups of particles are processed one event at a time. This allows each event batch to perform the same operations in lockstep, enabling use of the vector hardware. Although modern vectorized hardware is more versatile than the early vector machines, reducing so-called thread divergence is nonetheless still an important consideration for algorithm design. Many of the algorithms proposed so far for Monte Carlo transport on advanced architectures have focused on variants of event-based transport. Some evidence, however, suggests that low-level thread divergence, resulting from short-lived branching statements, may not be detrimental to overall performance on GPUs as long as the effect on achievable memory bandwidth is considered. This paper characterizes the performance of a traditional history-based Monte Carlo algorithm on GPUs. We show that with only minor modifications to traditional algorithms, significant performance gains relative to CPUs are possible. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
NASA NTRS1993

Computational analysis of methods for reduction of induced drag

The purpose of this effort was to perform a computational flow analysis of a design concept centered around induced drag reduction and tip-vortex energy recovery. The flow model solves the unsteady three-dimensional Euler equations, discretized as a finite-volume method, utilizing a high-resolution approximate Riemann solver for cell interface flux definitions. The numerical scheme is an approximately-factored block LU implicit Newton iterative-refinement method. Multiblock domain decomposition is used to partition the field into an ordered arrangement of blocks. Three configurations are analyzed: a baseline fuselage-wing, a fuselage-wing-nacelle, and a fuselage-wing-nacelle-propfan. Aerodynamic force coefficients, propfan performance coefficients, and flowfield maps are used to qualitatively access design efficacy. Where appropriate, comparisons are made with available experimental data.

Janus, J. M.↗
DOE OSTI2018

Scalable hierarchical PDE sampler for generating spatially correlated random fields using nonmatching meshes: Scalable hierarchical PDE sampler using nonmatching meshes

This work describes a domain embedding technique between two nonmatching meshes used for generating realizations of spatially correlated random fields with applications to large-scale sampling-based uncertainty quantification. The goal is to apply the multilevel Monte Carlo (MLMC) method for the quantification of output uncertainties of PDEs with random input coefficients on general and unstructured computational domains. We propose a highly scalable, hierarchical sampling method to generate realizations of a Gaussian random field on a given unstructured mesh by solving a reaction–diffusion PDE with a stochastic right-hand side. The stochastic PDE is discretized using the mixed finite element method on an embedded domain with a structured mesh, and then, the solution is projected onto the unstructured mesh. This work describes implementation details on how to efficiently transfer data from the structured and unstructured meshes at coarse levels, assuming that this can be done efficiently on the finest level. We investigate the efficiency and parallel scalability of the technique for the scalable generation of Gaussian random fields in three dimensions. An application of the MLMC method is presented for quantifying uncertainties of subsurface flow problems. Here, we demonstrate the scalability of the sampling method with nonmatching mesh embedding, coupled with a parallel forward model problem solver, for large-scale 3D MLMC simulations with up to 1.9·109 unknowns.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Role of momentum in the generator-coordinate method applied to barrier penetration

Nuclear fission at barrier-top energies is conventionally modeled by a one-dimensional Schrödinger equation applied to internal fission channels, but that treatment is hard to justify in the configuration-interaction approach to nuclear Hamiltonians. Here we show that inclusion of states of finite momentum by the generator coordinate method (GCM) considerably extends the range of energies at which GCM-based Hamiltonians could reproduce the Schrödinger treatment. Furthermore, the transmission probabilities for crossing the barrier are calculated by a discrete version of Kohn's variational method, which may also be useful for other systems of interacting fermions.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
NASA NTRS1996

Algebraic Multigrid by Smoothed Aggregation for Second and Fourth Order Elliptic Problems

Multigrid methods are very efficient iterative solvers for system of algebraic equations arising from finite element and finite difference discretization of elliptic boundary value problems. The main principle of multigrid methods is to complement the local exchange of information in point-wise iterative methods by a global one utilizing several related systems, called coarse levels, with a smaller number of variables. The coarse levels are often obtained as a hierarchy of discretizations with different characteristic meshsizes, but this requires that the discretization is controlled by the iterative method. To solve linear systems produced by existing finite element software, one needs to create an artificial hierarchy of coarse problems. The principal issue is then to obtain computational complexity and approximation properties similar to those for nested meshes, using only information in the matrix of the system and as little extra information as possible. Such algebraic multigrid method that uses the system matrix only was developed by Ruge. The prolongations were based on the matrix of the system by partial solution from given values at selected coarse points. The coarse grid points were selected so that each point would be interpolated to via so-called strong connections. Our approach is based on smoothed aggregation introduced recently by Vanek. First the set of nodes is decomposed into small mutually disjoint subsets. A tentative piecewise constant interpolation (in the discrete sense) is then defined on those subsets as piecewise constant for second order problems, and piecewise linear for fourth order problems. The prolongation operator is then obtained by smoothing the output of the tentative prolongation and coarse level operators are defined variationally.

Vanek, Petr↗
DOE OSTI2014

Accelerated weight histogram method for exploring free energy landscapes

Calculating free energies is an important and notoriously difficult task for molecular simulations. The rapid increase in computational power has made it possible to probe increasingly complex systems, yet extracting accurate free energies from these simulations remains a major challenge. Fully exploring the free energy landscape of, say, a biological macromolecule typically requires sampling large conformational changes and slow transitions. Often, the only feasible way to study such a system is to simulate it using an enhanced sampling method. The accelerated weight histogram (AWH) method is a new, efficient extended ensemble sampling technique which adaptively biases the simulation to promote exploration of the free energy landscape. The AWH method uses a probability weight histogram which allows for efficient free energy updates and results in an easy discretization procedure. A major advantage of the method is its general formulation, making it a powerful platform for developing further extensions and analyzing its relation to already existing methods. Here, we demonstrate its efficiency and general applicability by calculating the potential of mean force along a reaction coordinate for both a single dimension and multiple dimensions. We make use of a non-uniform, free energy dependent target distribution in reaction coordinate space so that computational efforts are not wasted on physically irrelevant regions. We present numerical results for molecular dynamics simulations of lithium acetate in solution and chignolin, a 10-residue long peptide that folds into a β-hairpin. We further present practical guidelines for setting up and running an AWH simulation.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2022

Revisiting the Hail Radar Reflectivity–Kinetic Energy Flux Relation by Combining T-Matrix and Discrete Dipole Approximation Calculations to Size Distribution Observations

The retrieval of hail kinetic energy with weather radars or its simulation in numerical models is challenging because of the shape complexity and variable density of hailstones. We combine 3D scans of individual hailstones with measurements of the particle size distributions (PSD) and T-matrix calculations to understand how hail reflectivity Z changes when approximating hailstones as spheroids, as compared to the realistic shapes obtained by 3D scanning technology. Additionally, recent terminal velocity relations are used to compare Z to the hail kinetic energy flux E ˙ . We parameterize the hail backscattering cross sections at L, S, C, and X bands as a function of size between 0.5 and 5.0 cm, matching the range of the observed PSDs. The scattering calculations use the T-matrix method for size parameters below 1.0 and the discrete dipole approximation (DDA) method otherwise. The DDA calculations are done for 48 digital models of realistic hailstones of sizes between 1 and 5 cm. The DDA cross sections are calculated for multiple orientations and averaged assuming a fully random orientation distribution to provide a single value per hailstone. The T-matrix reflectivity assuming solid ice spheres presents negligible differences to DDA results for size parameters below 1.0. Therefore, T matrix was used to fill in the gaps left by the DDA calculations. The results are mapped to the same size bins of the observed PSDs, allowing the calculation of the radar reflectivity. This is then correlated to E ˙ , allowing a potential improvement of past retrieval methods of E ˙ from Z in multiple wavelengths.

54 ENVIRONMENTAL SCIENCES↗
NASA NTRS1979

Comparison of atmospheric density data from mass spectrometers and atmospheric drag on the Aeros satellites

The comparison of perigee density data near 230 km for satellite Aeros-A has been extended to the complete mission time. The average ratio between orbital drag derived density and mass spectrometer measurements is very near to 1 with a large scatter reflected by a standard deviation of the order of 20%. A method of comparison was developed and tested which uses the observed rate of change of orbital period in comparison with the orbital decay computed from the actual mass spectrometer data measured at discrete positions along the orbit. This method proves that deviations from the average ratio of 1 between perigee densities from drag and mass spectrometers are due to the smoothing and poor resolution of the orbital drag technique.

Roemer, M.↗
DOE OSTI2019

A Strong Stability Preserving Analysis for Explicit Multistage Two-Derivative Time-Stepping Schemes Based on Taylor Series Conditions

High-order strong stability preserving (SSP) time discretizations are usually needed to ensure the nonlinear (and sometimes non-inner-product) strong stability properties of spatial discretizations specially designed for the solution of hyperbolic PDEs. Multi-derivative time-stepping methods have recently been increasingly used for evolving hyperbolic PDEs, and the strong stability properties of these methods are of interest. In our prior work we explored time discretizations that preserve the strong stability properties of spatial discretizations coupled with forward Euler and a second-derivative formulation. Yet, many spatial discretizations do not satisfy strong stability properties when coupled with this second-derivative formulation, but rather with a more natural Taylor series formulation. Here, we demonstrate sufficient conditions for an explicit two-derivative multistage method to preserve the strong stability properties of spatial discretizations in a forward Euler and Taylor series formulation. We call these strong stability preserving Taylor series (SSP-TS) methods. We also prove that the maximal order of SSP-TS methods is p=6, and define an optimization procedure that allows us to find such SSP methods. Several types of these methods are presented and their efficiency compared. Finally, these methods are tested on several PDEs to demonstrate the benefit of SSP-TS methods, the need for the SSP property, and the sharpness of the SSP time-step in many cases.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

A Hybrid Finite-Volume, Discontinuous Galerkin Discretization for the Radiative Transport Equation

In this report we propose a hybrid spatial discretization for the radiative transport equation that combines a second-order discontinuous Galerkin (DG) method and a second-order finite-volume (FV) method. The strategy relies on a simple operator splitting that has been used previously to combine different angular discretizations. Unlike standard FV methods with upwind fluxes, the hybrid approach is able to accurately simulate problems in scattering dominated regimes. However, it requires less memory and yields a faster computational time than a uniform DG discretization. In addition, the underlying splitting allows naturally for hybridization in both space and angle. Numerical results are given to demonstrate the efficiency of the hybrid approach in the context of discrete ordinate angular discretizations and Cartesian spatial grids.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

Spatially adaptive stochastic methods for fluid–structure interactions subject to thermal fluctuations in domains with complex geometries

We develop stochastic mixed finite element methods for spatially adaptive simulations of fluid–structure interactions when subject to thermal fluctuations. To account for thermal fluctuations, we introduce a discrete fluctuation–dissipation balance condition to develop compatible stochastic driving fields for our discretization. We perform analysis that shows our condition is sufficient to ensure results consistent with statistical mechanics. We show the Gibbs–Boltzmann distribution is invariant under the stochastic dynamics of the semi-discretization. To generate efficiently the required stochastic driving fields, we develop a Gibbs sampler based on iterative methods and multigrid to generate fields with O(N) computational complexity. Our stochastic methods provide an alternative to uniform discretizations on periodic domains that rely on Fast Fourier Transforms. To demonstrate in practice our stochastic computational methods, we investigate within channel geometries having internal obstacles and no-slip walls how the mobility/diffusivity of particles depends on location. Our methods extend the applicability of fluctuating hydrodynamic approaches by allowing for spatially adaptive resolution of the mechanics and for domains that have complex geometries relevant in many applications.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2015

A model and variance reduction method for computing statistical outputs of stochastic elliptic partial differential equations

We present a model and variance reduction method for the fast and reliable computation of statistical outputs of stochastic elliptic partial differential equations. Our method consists of three main ingredients: (1) the hybridizable discontinuous Galerkin (HDG) discretization of elliptic partial differential equations (PDEs), which allows us to obtain high-order accurate solutions of the governing PDE; (2) the reduced basis method for a new HDG discretization of the underlying PDE to enable real-time solution of the parameterized PDE in the presence of stochastic parameters; and (3) a multilevel variance reduction method that exploits the statistical correlation among the different reduced basis approximations and the high-fidelity HDG discretization to accelerate the convergence of the Monte Carlo simulations. The multilevel variance reduction method provides efficient computation of the statistical outputs by shifting most of the computational burden from the high-fidelity HDG approximation to the reduced basis approximations. Furthermore, we develop a posteriori error estimates for our approximations of the statistical outputs. Based on these error estimates, we propose an algorithm for optimally choosing both the dimensions of the reduced basis approximations and the sizes of Monte Carlo samples to achieve a given error tolerance. We provide numerical examples to demonstrate the performance of the proposed method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2014

Inverse scattering theory: Inverse scattering series method for one dimensional non-compact support potential

The reversion of the Born-Neumann series of the Lippmann-Schwinger equation is one of the standard ways to solve the inverse acoustic scattering problem. One limitation of the current inversion methods based on the reversion of the Born-Neumann series is that the velocity potential should have compact support. However, this assumption cannot be satisfied in certain cases, especially in seismic inversion. Based on the idea of distorted wave scattering, we explore an inverse scattering method for velocity potentials without compact support. The strategy is to decompose the actual medium as a known single interface reference medium, which has the same asymptotic form as the actual medium and a perturbative scattering potential with compact support. After introducing the method to calculate the Green’s function for the known reference potential, the inverse scattering series and Volterra inverse scattering series are derived for the perturbative potential. Analytical and numerical examples demonstrate the feasibility and effectiveness of this method. Besides, to ensure stability of the numerical computation, the Lanczos averaging method is employed as a filter to reduce the Gibbs oscillations for the truncated discrete inverse Fourier transform of each order. Our method provides a rigorous mathematical framework for inverse acoustic scattering with a non-compact support velocity potential.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1988

Multigrid method for stability problems

The problem of calculating the stability of steady state solutions of differential equations is addressed. Leading eigenvalues of large matrices that arise from discretization are calculated, and an efficient multigrid method for solving these problems is presented. The resulting grid functions are used as initial approximations for appropriate eigenvalue problems. The method employs local relaxation on all levels together with a global change on the coarsest level only, which is designed to separate the different eigenfunctions as well as to update their corresponding eigenvalues. Coarsening is done using the FAS formulation in a nonstandard way in which the right-hand side of the coarse grid equations involves unknown parameters to be solved on the coarse grid. This leads to a new multigrid method for calculating the eigenvalues of symmetric problems. Numerical experiments with a model problem are presented which demonstrate the effectiveness of the method.

Ta'asan, Shlomo↗
DOE OSTI2013

Time dependent solution for acceleration of tau-leaping

The tau-leaping method is often effective for speeding up discrete stochastic simulation of chemically reacting systems. However, when fast reactions are involved, the speed-up for this method can be quite limited. One way to address this is to apply a stochastic quasi-steady state assumption. However we must be careful when using this assumption. If the fast subsystem cannot reach a steady distribution fast enough, the quasi-steady-state assumption will propagate error into the simulation. To avoid these errors, we propose to use the time dependent solution rather than the quasi-steady-state. Generally speaking, the time dependent solution is not easy to derive for an arbitrary network. However, for some common motifs we do have time dependent solutions. We derive the time dependent solutions for these motifs, and then show how they can be used with tau-leaping to achieve substantial speed-ups, including for a realistic model of blood coagulation. Although the method is complicated, we have automated it.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Automatic method of material identification for computed tomography

A method is provided for isolating and labeling discrete features in a spectral radiographic image recorded as a set of images in different energy channels. The disclosed method involves creating a profile for each of at least some pixels in the spectral radiographic image. The profiles are sequences of pixel values, in which each pixel value is a photon count or a similar radiographic exposure value indicative of the attenuation of a portion of the scanning beam in a respective energy channel. Iterative hierarchical clustering is used to cluster the pixels on the basis of their respective profiles. Labels are assigned to one or more of the resulting clusters. In implementations, each label can be associated with an inferred material composition or with an inference that the material composition is unknown.

Jimenez, Jr., Edward Steven↗