SEARCH · Engineering Papers
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.
Here, in this paper, we develop a new block triangular preconditioner for solving partial differential equations with random coefficients. We prove spectral bounds for the preconditioned system. Several numerical examples are provided to demonstrate the efficiency of this preconditioner, especially for stochastic problems with large variance.
Not provided.
Modeling of Fourier amplitude spectra (FAS) of seismic motions has gained much attention in engineering seismology. In the past few years, several ground motion prediction equations (GMPEs) and inter-frequency correlation structure of FAS have been established. Due to many preferable characteristics of FAS, probabilistic seismic hazard/risk analysis is rapidly changing from ergodic, spectrum acceleration Sa(T 0 )-based approach to non-ergodic, site-specific, FAS-based approach. This paper presents time domain intrusive framework for probabilistic seismic risk analysis using GMPE of FAS. Herein, methodology for time domain stochastic ground motion modeling based on GMPEs of FAS is presented in some detail. The simulated uncertain motions are modeled as a random process and represented by polynomial chaos Karhunen-Loève expansion. The random process excitations are further propagated into the uncertain structural system using Galerkin stochastic finite element method (SFEM). Probabilistic evolution of structural response is solved, and such solution is used to develop seismic risk for any damage state. The presented framework is illustrated through seismic risk analysis of a four-story building subjected to possible earthquakes from two strike slip faults. The influences of the epistemic uncertainties in source stress drop Δσ and site attenuation κ0 on seismic risk are investigated. The need for non-ergodic seismic risk analysis with source-specific and site specific characterizations is emphasized.
This work focuses on the space-time reduced-order modeling (ROM) method for solving large-scale uncertainty quantification (UQ) problems with multiple random coefficients. In contrast with the traditional space ROM approach, which performs dimension reduction in the spatial dimension, the space-time ROM approach performs dimension reduction on both the spatial and temporal domains, and thus enables accurate approximate solutions at a low cost. We incorporate the space-time ROM strategy with various classical stochastic UQ propagation methods such as stochastic Galerkin and Monte Carlo. Numerical results demonstrate that our methodology has significant computational advantages compared to state-of-the-art ROM approaches. By testing the approximation errors, we show that there is no obvious loss of simulation accuracy for space-time ROM given its high computational efficiency.
Presented here is a modular methodology for time-domain stochastic seismic wave propagation analysis. Presented methodology is designed to analyse uncertain seismic motions as an input, propagating through uncertain material. Traditional approach for uncertain wave propagation relies on models that include deep bedrock, local soil site, and their random process and random field information. Such models can become quite large and computationally intractable. The modular approach proposed herein features two step approach that allows separate consideration of the deep bedrock and local site along with corresponding random field information. In this work, the first step considers an auxiliary stochastic motions problem in the bedrock. Stochastic local site response can then be simulated in a reduced domain within certain depth from the surface. Application of uncertain seismic motions at depth, for local uncertain site response is done using stochastic effective forces developed through the Domain Reduction Method. By using Hermite polynomial chaos expansion to represent the non-Gaussian random field of material parameters and non-stationary random process of seismic motion, the proposed modular methodology is formulated using intrusive stochastic Galerkin approach, as seen in the Stochastic Elastic–Plastic Finite Element Method (SEPFEM). Developed modular methodology is illustrated using a 1-D stochastic seismic wave propagation analysis with three cases, and simulation results are also verified with results from conventional approach.
This report describes a stochastic collocation method to adequately handle a physically intrinsic uncertainty in the variables of a numerical simulation. For instance, while the standard Galerkin approach to Polynomial Chaos requires multi-dimensional summations over the stochastic basis functions, the stochastic collocation method enables to collapse those summations to a one-dimensional summation only. This report furnishes the essential algorithmic details of the new stochastic collocation method and provides as a numerical example the solution of the Riemann problem with the stochastic collocation method used for the discretization of the stochastic parameters.
This paper describes a fully spectral, Polynomial Chaos method for the propagation of uncertainty in numerical simulations of compressible, turbulent flow, as well as a novel stochastic collocation algorithm for the same application. The stochastic collocation method is key to the efficient use of stochastic methods on problems with complex nonlinearities, such as those associated with the turbulence model equations in compressible flow and for CFD schemes requiring solution of a Riemann problem. Both methods are applied to compressible flow in a quasi-one-dimensional nozzle. The stochastic collocation method is roughly an order of magnitude faster than the fully Galerkin Polynomial Chaos method on the inviscid problem.
Here, in this paper, we present a predictor-corrector strategy for constructing rank-adaptive, dynamical low-rank approximations (DLRAs) of matrix-valued ODE systems. The strategy is a compromise between (i) low-rank step-truncation approaches that alternately evolve and compress solutions and (ii) strict DLRA approaches that augment the low-rank manifold using subspaces generated locally in time by the DLRA integrator. The strategy is based on an analysis of the error between a forward temporal update into the ambient full-rank space, which is typically computed in a step-truncation approach before recompressing, and the standard DLRA update, which is forced to live in a low-rank manifold. We use this error, without requiring its full-rank representation, to correct the DLRA solution. A key ingredient for maintaining a low-rank representation of the error is a randomized SVD, which introduces some degree of stochastic variability into the implementation. The strategy is formulated and implemented in the context of discontinuous Galerkin spatial discretizations of PDEs and applied to several versions of DLRA methods found in the literature as well as a new variant. Numerical experiments comparing the predictor-corrector strategy to other methods demonstrate robustness to overcome shortcomings of step truncation or strict DLRA approaches: The former may require more memory than is strictly needed, while the latter may miss transients solution features that cannot be recovered. The effect of randomization, tolerances, and other implementation parameters is also explored.
Here we present a hybrid method for time-dependent particle transport problems that combines Monte Carlo (MC) estimation with deterministic solutions based on discrete ordinates. For spatial discretizations, the MC algorithm computes a piecewise constant solution and the discrete ordinates use bilinear discontinuous finite elements. From the hybridization of the problem, the resulting problem solved by Monte Carlo is scattering free, resulting in a simple, efficient solution procedure. Between time steps, we use a projection approach to “relabel” collided particles as uncollided particles. In conclusion, from a series of standard 2-D Cartesian test problems we observe that our hybrid method has improved accuracy and reduction in computational complexity of approximately an order of magnitude relative to standard discrete ordinates solutions.
While projection-based reduced order models can reduce the dimension of full order solutions, the resulting reduced models may still contain terms that scale with the full order dimension. Hyper-reduction techniques are sampling-based methods that further reduce this computational complexity by approximating such terms with a much smaller dimension. The goal of this work is to introduce the points selection algorithm developed by Shin and Xiu as a hyper-reduction method. The selection algorithm was originally proposed as a stochastic collocation method for uncertainty quantification. Since the algorithm aims at maximizing a quantity $\mathcal{S}$ that measures both the column orthogonality and the determinant, we refer to the algorithm as S-OPT. Numerical examples are provided to demonstrate the performance of S-OPT and to compare its performance with a gappy proper orthogonal decomposition (POD) algorithm. Here, we found that using the S-OPT algorithm is shown to predict the full order solutions with higher accuracy than gappy POD especially when the number of sampling points is small, although we note that S-OPT shows slow asymptotic convergence with respect to the number of samples for some applications, e.g., Lagrangian hydrodynamics.