Search NASA⌕ Search

SEARCH · Search NASA

Results for “deterministic”

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,315 records · Page 73

Intrusive Galerkin methods with upwinding for uncertain nonlinear hyperbolic systems

This paper deals with stochastic spectral methods for uncertainty propagation and quantification in nonlinear hyperbolic systems of conservation laws. We consider problems with parametric uncertainty in initial conditions and model coefficients, whose solutions exhibit discontinuities in the spatial as well as in the stochastic variables. The stochastic spectral method relies on multi-resolution schemes where the stochastic domain is discretized using tensor-product stochastic elements supporting local polynomial bases. A Galerkin projection is used to derive a system of deterministic equations for the stochastic modes of the solution. Hyperbolicity of the resulting Galerkin system is analyzed. A finite volume scheme with a Roe-type solver is used for discretization of the spatial and time variables. An original technique is introduced for the fast evaluation of approximate upwind matrices, which is particularly well adapted to local polynomial bases. Efficiency and robustness of the overall method are assessed on the Burgers and Euler equations with shocks.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Faster and more accurate transport procedures for HZETRN

The deterministic transport code HZETRN was developed for research scientists and design engineers studying the effects of space radiation on astronauts and instrumentation protected by various shielding materials and structures. In this work, several aspects of code verification are examined. First, a detailed derivation of the light particle (A {<=} 4) and heavy ion (A > 4) numerical marching algorithms used in HZETRN is given. References are given for components of the derivation that already exist in the literature, and discussions are given for details that may have been absent in the past. The present paper provides a complete description of the numerical methods currently used in the code and is identified as a key component of the verification process. Next, a new numerical method for light particle transport is presented, and improvements to the heavy ion transport algorithm are discussed. A summary of round-off error is also given, and the impact of this error on previously predicted exposure quantities is shown. Finally, a coupled convergence study is conducted by refining the discretization parameters (step-size and energy grid-size). 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 determined that almost all of the discretization error in HZETRN is caused by the use of discretization parameters that violate a numerical convergence criterion related to charged target fragments below 50 AMeV. Total discretization errors are given for the old and new algorithms to 100 g/cm{sup 2} in aluminum and water, and the improved accuracy of the new numerical methods is demonstrated. Run time comparisons between the old and new algorithms are given for one, two, and three layer slabs of 100 g/cm{sup 2} of aluminum, polyethylene, and water. 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.

79 ASTRONOMY AND ASTROPHYSICS↗

Adaptive sparse polynomial chaos expansion based on least angle regression

Polynomial chaos (PC) expansions are used in stochastic finite element analysis to represent the random model response by a set of coefficients in a suitable (so-called polynomial chaos) basis. The number of terms to be computed grows dramatically with the size of the input random vector, which makes the computational cost of classical solution schemes (may it be intrusive (i.e. of Galerkin type) or non intrusive) unaffordable when the deterministic finite element model is expensive to evaluate. To address such problems, the paper describes a non intrusive method that builds a sparse PC expansion. First, an original strategy for truncating the PC expansions, based on hyperbolic index sets, is proposed. Then an adaptive algorithm based on least angle regression (LAR) is devised for automatically detecting the significant coefficients of the PC expansion. Beside the sparsity of the basis, the experimental design used at each step of the algorithm is systematically complemented in order to avoid the overfitting phenomenon. The accuracy of the PC metamodel is checked using an estimate inspired by statistical learning theory, namely the corrected leave-one-out error. As a consequence, a rather small number of PC terms are eventually retained (sparse representation), which may be obtained at a reduced computational cost compared to the classical 'full' PC approximation. The convergence of the algorithm is shown on an analytical function. Then the method is illustrated on three stochastic finite element problems. The first model features 10 input random variables, whereas the two others involve an input random field, which is discretized into 38 and 30 - 500 random variables, respectively.

97 MATHEMATICS AND COMPUTING↗

A non-adapted sparse approximation of PDEs with stochastic inputs

We propose a method for the approximation of solutions of PDEs with stochastic coefficients based on the direct, i.e., non-adapted, sampling of solutions. This sampling can be done by using any legacy code for the deterministic problem as a black box. The method converges in probability (with probabilistic error bounds) as a consequence of sparsity and a concentration of measure phenomenon on the empirical correlation between samples. We show that the method is well suited for truly high-dimensional problems.

97 MATHEMATICS AND COMPUTING↗

A hybrid method for hydrodynamic-kinetic flow Part I: A particle-grid method for reducing stochastic noise in kinetic regimes

In this work we present a hybrid particle-grid Monte Carlo method for the Boltzmann equation, which is characterized by a significant reduction of the stochastic noise in the kinetic regime. The hybrid method is based on a first order splitting in time to separate the transport from the relaxation step. The transport step is solved by a deterministic scheme, while a hybrid DSMC-based method is used to solve the collision step. Such a hybrid scheme is based on splitting the solution in a collisional and a non-collisional part at the beginning of the collision step, and the DSMC method is used to solve the relaxation step for the collisional part of the solution only. This is accomplished by sampling only the fraction of particles candidate for collisions from the collisional part of the solution, performing collisions as in a standard DSMC method, and then projecting the particles back onto a velocity grid to compute a piecewise constant reconstruction for the collisional part of the solution. The latter is added to a piecewise constant reconstruction of the non-collisional part of the solution, which in fact remains unchanged during the relaxation step. Numerical results show that the stochastic noise is significantly reduced at large Knudsen numbers with respect to the standard DSMC method. Indeed in this algorithm, the particle scheme is applied only on the collisional part of the solution, so only this fraction of the solution is affected by stochastic fluctuations. But since the collisional part of the solution reduces as the Knudsen number increases, stochastic noise reduces as well at large Knudsen numbers.

97 MATHEMATICS AND COMPUTING↗

Uncertainty quantification in kinematic wave models

We developed a probabilistic approach to quantify parametric uncertainty in first-order hyperbolic conservation laws (kinematic wave equations). The approach relies on the derivation of a deterministic equation for the cumulative density function (CDF) of the system state, in which probabilistic descriptions (probability density functions or PDFs) of the system parameters and/or initial and boundary conditions serve as inputs. In contrast to PDF equations, which are often used in other contexts, CDF equations allow for straightforward and unambiguous determination of boundary conditions with respect to sample variables.The accuracy and robustness of solutions of the CDF equation for one such system, the Saint-Venant equations of river flows, were investigated via comparison with Monte Carlo simulations.

UQ, CDF methods, surface flow, kinematic wave, hyp↗

Numerical schemes for dynamically orthogonal equations of stochastic fluid and ocean flows

The quantification of uncertainties is critical when systems are nonlinear and have uncertain terms in their governing equations or are constrained by limited knowledge of initial and boundary conditions. Such situations are common in multiscale, intermittent and non-homogeneous fluid and ocean flows. The dynamically orthogonal (DO) field equations provide an adaptive methodology to predict the probability density functions of such flows. The present work derives efficient computational schemes for the DO methodology applied to unsteady stochastic Navier-Stokes and Boussinesq equations, and illustrates and studies the numerical aspects of these schemes. Semi-implicit projection methods are developed for the mean and for the DO modes, and time-marching schemes of first to fourth order are used for the stochastic coefficients. Conservative second-order finite-volumes are employed in physical space with new advection schemes based on total variation diminishing methods. Other results include: (i) the definition of pseudo-stochastic pressures to obtain a number of pressure equations that is linear in the subspace size instead of quadratic; (ii) symmetric advection schemes for the stochastic velocities; (iii) the use of generalized inversion to deal with singular subspace covariances or deterministic modes; and (iv) schemes to maintain orthonormal modes at the numerical level. To verify our implementation and study the properties of our schemes and their variations, a set of stochastic flow benchmarks are defined including asymmetric Dirac and symmetric lock-exchange flows, lid-driven cavity flows, and flows past objects in a confined channel. Different Reynolds number and Grashof number regimes are employed to illustrate robustness. Optimal convergence under both time and space refinements is shown as well as the convergence of the probability density functions with the number of stochastic realizations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Reduced discretization error in HZETRN

The deterministic particle transport code HZETRN is an efficient analysis tool for studying the effects of space radiation on humans, electronics, and shielding materials. In a previous work, numerical methods in the code were reviewed, and new methods were developed that further improved efficiency and reduced overall discretization error. It was also shown that the remaining discretization error could be attributed to low energy light ions (A < 4) with residual ranges smaller than the physical step-size taken by the code. Accurately resolving the spectrum of low energy light particles is important in assessing risk associated with astronaut radiation exposure. In this work, modifications to the light particle transport formalism are presented that accurately resolve the spectrum of low energy light ion target fragments. The modified formalism is shown to significantly reduce overall discretization error and allows a physical approximation to be removed. For typical step-sizes and energy grids used in HZETRN, discretization errors for the revised light particle transport algorithms are shown to be less than 4% for aluminum and water shielding thicknesses as large as 100 g/cm{sup 2} exposed to both solar particle event and galactic cosmic ray environments.

61 RADIATION PROTECTION AND DOSIMETRY↗

Assimilating irregularly spaced sparsely observed turbulent signals with hierarchical Bayesian reduced stochastic filters

In this paper, we consider a practical filtering approach for assimilating irregularly spaced, sparsely observed turbulent signals through a hierarchical Bayesian reduced stochastic filtering framework. The proposed hierarchical Bayesian approach consists of two steps, blending a data-driven interpolation scheme and the Mean Stochastic Model (MSM) filter. We examine the potential of using the deterministic piecewise linear interpolation scheme and the ordinary kriging scheme in interpolating irregularly spaced raw data to regularly spaced processed data and the importance of dynamical constraint (through MSM) in filtering the processed data on a numerically stiff state estimation problem. In particular, we test this approach on a two-layer quasi-geostrophic model in a two-dimensional domain with a small radius of deformation to mimic ocean turbulence. Our numerical results suggest that the dynamical constraint becomes important when the observation noise variance is large. Second, we find that the filtered estimates with ordinary kriging are superior to those with linear interpolation when observation networks are not too sparse; such robust results are found from numerical simulations with many randomly simulated irregularly spaced observation networks, various observation time intervals, and observation error variances. Third, when the observation network is very sparse, we find that both the kriging and linear interpolations are comparable.

97 MATHEMATICS AND COMPUTING↗

Numerical solution of the Stratonovich- and Ito–Euler equations: Application to the stochastic piston problem

We consider a piston with a velocity perturbed by Brownian motion moving into a straight tube filled with a perfect gas at rest. The shock generated ahead of the piston can be located by solving the one-dimensional Euler equations driven by white noise using the Stratonovich or Ito formulations. We approximate the Brownian motion with its spectral truncation and subsequently apply stochastic collocation using either sparse grid or the quasi-Monte Carlo (QMC) method. In particular, we first transform the Euler equations with an unsteady stochastic boundary into stochastic Euler equations over a fixed domain with a time-dependent stochastic source term. We then solve the transformed equations by splitting them up into two parts, i.e., a ‘deterministic part’ and a ‘stochastic part’. Numerical results verify the Stratonovich–Euler and Ito–Euler models against stochastic perturbation results, and demonstrate the efficiency of sparse grid and QMC for small and large random piston motions, respectively. The variance of shock location of the piston grows cubically in the case of white noise in contrast to colored noise reported in [1], where the variance of shock location grows quadratically with time for short times and linearly for longer times.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Tau leaping of stiff stochastic chemical systems via local central limit approximation

Stiffness manifests in stochastic dynamic systems in a more complex manner than in deterministic systems; it is not only important for a time-stepping method to remain stable but it is also important for the method to capture the asymptotic variances accurately. In the context of stochastic chemical systems, time stepping methods are known as tau leaping. Well known existing tau leaping methods have shortcomings in this regard. The implicit tau method is far more stable than the trapezoidal tau method but underestimates the asymptotic variance. On the other hand, the trapezoidal tau method which estimates the asymptotic variance exactly for linear systems suffers from the fact that the transients of the method do not decay fast enough in the context of very stiff systems. We propose a tau leaping method that possesses the same stability properties as the implicit method while it also captures the asymptotic variance with reasonable accuracy at least for the test system S{sub 1}↔S{sub 2}. The proposed method uses a central limit approximation (CLA) locally over the tau leaping interval and is referred to as the LCLA-τ. The CLA predicts the mean and covariance as solutions of certain differential equations (ODEs) and for efficiency we solve these using a single time step of a suitable low order method. We perform a mean/covariance stability analysis of various possible low order schemes to determine the best scheme. Numerical experiments presented show that LCLA-τ performs favorably for stiff systems and that the LCLA-τ is also able to capture bimodal distributions unlike the CLA itself. The proposed LCLA-τ method uses a split implicit step to compute the mean update. We also prove that any tau leaping method employing a split implicit step converges in the fluid limit to the implicit Euler method as applied to the fluid limit differential equation.

97 MATHEMATICS AND COMPUTING↗

A convergence study for SPDEs using combined Polynomial Chaos and Dynamically-Orthogonal schemes

We study the convergence properties of the recently developed Dynamically Orthogonal (DO) field equations [1] in comparison with the Polynomial Chaos (PC) method. To this end, we consider a series of one-dimensional prototype SPDEs, whose solution can be expressed analytically, and which are associated with both linear (advection equation) and nonlinear (Burgers equation) problems with excitations that lead to unimodal and strongly bi-modal distributions. We also propose a hybrid approach to tackle the singular limit of the DO equations for the case of deterministic initial conditions. The results reveal that the DO method converges exponentially fast with respect to the number of modes (for the problems considered) giving same levels of computational accuracy comparable with the PC method but (in many cases) with substantially smaller computational cost compared to stochastic collocation, especially when the involved parametric space is high-dimensional.

97 MATHEMATICS AND COMPUTING↗

Exact PDF equations and closure approximations for advective-reactive transport

Mathematical models of advection–reaction phenomena rely on advective flow velocity and (bio) chemical reaction rates that are notoriously random. By using functional integral methods, we derive exact evolution equations for the probability density function (PDF) of the state variables of the advection–reaction system in the presence of random transport velocity and random reaction rates with rather arbitrary distributions. These PDF equations are solved analytically for transport with deterministic flow velocity and a linear reaction rate represented mathematically by a heterog eneous and strongly-correlated random field. Our analytical solution is then used to investigate the accuracy and robustness of the recently proposed large-eddy diffusivity (LED) closure approximation [1]. We find that the solution to the LED-based PDF equation, which is exact for uncorrelated reaction rates, is accurate even in the presence of strong correlations and it provides an upper bound of predictive uncertainty.

PDF methods, Uncertainty quantification, Heterogen↗

Estimation of reactive fluxes in gradient stochastic systems using an analogy with electric circuits

Highlights: •The MaxFlux functional should be called the resistivity functional. •A Hamilton–Jacobi approach for computing transition paths in collective variables. •Conversion of the network of reactive channels into an electric circuit. •Test on the Alanine-Dipeptide. Perfect agreement. •Application to the problem of CO escape from Myoglobin. -- Abstract: We propose an approach for finding dominant reactive channels and calculating percentages of reactive flux through each channel in chemical systems driven by a deterministic potential force and a small thermal noise. We assume that the temperature is low enough so that the reactive flux focuses around a finite number of paths connecting the reactant and the product states. These paths can be found in a systematic way by solving a Hamilton–Jacobi equation for the so called MaxFlux functional. We argue that the name “MaxFlux” is misleading: it should be called the resistivity functional instead. Once the network of transition paths is found, one can define an equivalent electric circuit and find the currents through each of its wires. These currents give estimates of the reactive flux along the corresponding transition paths. We test our approach on the problem of finding transition paths in the Alanine-Dipeptide with two dihedral angles where the reactive current can be computed exactly. The percentages of the reactive flux through each reactive channel given by our approach turn out to be in remarkable agreement with the exact ones. We apply this approach to the problem of finding escape paths of a CO molecule from a Myoglobin protein. We find a collection of exit locations and establish percentages of the reactive flux through each of them.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Reweighted ℓ{sub 1} minimization method for stochastic elliptic differential equations

We consider elliptic stochastic partial differential equations (SPDEs) with random coefficients and solve them by expanding the solution using generalized polynomial chaos (gPC). Under some mild conditions on the coefficients, the solution is “sparse” in the random space, i.e., only a small number of gPC basis makes considerable contribution to the solution. To exploit this sparsity, we employ reweighted l{sub 1} minimization to recover the coefficients of the gPC expansion. We also combine this method with random sampling points based on the Chebyshev probability measure to further increase the accuracy of the recovery of the gPC coefficients. We first present a one-dimensional test to demonstrate the main idea, and then we consider 14 and 40 dimensional elliptic SPDEs to demonstrate the significant improvement of this method over the standard l{sub 1} minimization method. For moderately high dimensional (∼10) problems, the combination of Chebyshev measure with reweighted l{sub 1} minimization performs well while for higher dimensional problems, reweighted l{sub 1} only is sufficient. The proposed approach is especially suitable for problems for which the deterministic solver is very expensive since it reuses the sampling results and exploits all the information available from limited sources.

97 MATHEMATICS AND COMPUTING↗

A one-time truncate and encode multiresolution stochastic framework

In this work a novel adaptive strategy for stochastic problems, inspired from the classical Harten's framework, is presented. The proposed algorithm allows building, in a very general manner, stochastic numerical schemes starting from a whatever type of deterministic schemes and handling a large class of problems, from unsteady to discontinuous solutions. Its formulations permits to recover the same results concerning the interpolation theory of the classical multiresolution approach, but with an extension to uncertainty quantification problems. The present strategy permits to build numerical scheme with a higher accuracy with respect to other classical uncertainty quantification techniques, but with a strong reduction of the numerical cost and memory requirements. Moreover, the flexibility of the proposed approach allows to employ any kind of probability density function, even discontinuous and time varying, without introducing further complications in the algorithm. The advantages of the present strategy are demonstrated by performing several numerical problems where different forms of uncertainty distributions are taken into account, such as discontinuous and unsteady custom-defined probability density functions. In addition to algebraic and ordinary differential equations, numerical results for the challenging 1D Kraichnan–Orszag are reported in terms of accuracy and convergence. Finally, a two degree-of-freedom aeroelastic model for a subsonic case is presented. Though quite simple, the model allows recovering some physical key aspect, on the fluid/structure interaction, thanks to the quasi-steady aerodynamic approximation employed. The injection of an uncertainty is chosen in order to obtain a complete parameterization of the mass matrix. All the numerical results are compared with respect to classical Monte Carlo solution and with a non-intrusive Polynomial Chaos method.

97 MATHEMATICS AND COMPUTING↗

New perspectives on superparameterization for geophysical turbulence

This is a research expository paper regarding superparameterization, a class of multi-scale numerical methods designed to cope with the intermittent multi-scale effects of inhomogeneous geophysical turbulence where energy often inverse-cascades from the unresolved scales to the large scales through the effects of waves, jets, vortices, and latent heat release from moist processes. Original as well as sparse space–time superparameterization algorithms are discussed for the important case of moist atmospheric convection including the role of multi-scale asymptotic methods in providing self-consistent constraints on superparameterization algorithms and related deterministic and stochastic multi-cloud parameterizations. Test models for the statistical numerical analysis of superparameterization algorithms are discussed both to elucidate the performance of the basic algorithms and to test their potential role in efficient multi-scale data assimilation. The very recent development of grid-free seamless stochastic superparameterization methods for geophysical turbulence appropriate for “eddy-permitting” mesoscale ocean turbulence is presented here including a general formulation and illustrative applications to two-layer quasigeostrophic turbulence, and another difficult test case involving one-dimensional models of dispersive wave turbulence. This last test case has randomly generated solitons as coherent structures which collapse and radiate wave energy back to the larger scales, resulting in strong direct and inverse turbulent energy cascades.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Asymptotic diffusion limit of cell temperature discretisation schemes for thermal radiation transport

This paper attempts to unify the asymptotic diffusion limit analysis of thermal radiation transport schemes, for a linear-discontinuous representation of the material temperature reconstructed from cell centred temperature unknowns, in a process known as ‘source tilting’. The asymptotic limits of both Monte Carlo (continuous in space) and deterministic approaches (based on linear-discontinuous finite elements) for solving the transport equation are investigated in slab geometry. The resulting discrete diffusion equations are found to have nonphysical terms that are proportional to any cell-edge discontinuity in the temperature representation. Based on this analysis it is possible to design accurate schemes for representing the material temperature, for coupling thermal radiation transport codes to a cell centred representation of internal energy favoured by ALE (arbitrary Lagrange–Eulerian) hydrodynamics schemes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗