Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “POLYNOMIAL”

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,423 records · Page 79

A modular methodology for time-domain stochastic seismic wave propagation

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.

58 GEOSCIENCES↗

Computing the QRPA level density with the finite amplitude method

Here, we describe a new algorithm to calculate the vibrational nuclear level density of an atomic nucleus. Fictitious perturbation operators that probe the response of the system are generated by drawing their matrix elements from some probability distribution function. We use the Finite Amplitude Method to explicitly compute the response for each such sample. With the help of the Kernel Polynomial Method, we build an estimator of the vibrational level density and provide the upper bound of the relative error in the limit of infinitely many random samples. The new algorithm can give accurate estimates of the vibrational level density. Since it is based on drawing multiple samples of perturbation operators, its computational implementation is naturally parallel and scales like the number of available processing units.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Bayesian model updating with finite element vs surrogate models: Application to a miter gate structural system

Bayesian finite element (FE) model updating using direct model evaluations of large-scale high-fidelity FE models is extremely computationally expensive. Surrogate models can be used as fast emulators of FE models to accelerate the model calibration process. The physics/mechanics-based FE models are still the underpinning behind the surrogate models. Here, this paper evaluates the loss in accuracy and the gain in computational time while performing Bayesian model updating by using surrogate model evaluations compared to using direct FE model evaluations. This evaluation is crucial before entirely relying on surrogate models in model updating for structural health monitoring (SHM) and damage prognosis (DP) purposes. This paper also demonstrates Bayesian updating and surrogate model construction of large-scale high-fidelity FE models of infrastructure systems. In this regard, the miter gate structural system is considered as the testbed structure. Three predominant damage modes (loss of contact between gate and wall, loss of thickness due to corrosion, and loss of tension in the diagonal rods) are considered for model updating purposes. Bayesian model updating is performed using direct FE evaluations by leveraging parallel computing. Two types of surrogates, namely polynomial chaos expansion (PCE) and Gaussian process regression (GPR), are developed for the miter gate. Model updating is performed again using the trained surrogate models, and the updating results are compared with their counterparts obtained using the direct FE evaluation results. The posterior distribution of the FE model parameters obtained using the trained surrogates are sufficiently accurate with respect to the posterior obtained utilizing the direct FE evaluations. In addition, an approximate 4-fold decrease in the computational time was observed when using surrogate model evaluations instead of direct FE evaluations for model updating.

42 ENGINEERING↗

Turbine adapted maps for turbocharger engine matching

This paper presents a new representation of the turbine performance maps oriented for turbocharger characterization. The aim of this plot is to provide a more compact and suited form to implement in engine simulation models and to interpolate data from turbocharger test bench. The new map is based on the use of conservative parameters as turbocharger power and turbine mass flow to describe the turbine performance in all VGT positions. The curves obtained are accurately fitted with quadratic polynomials and simple interpolation techniques give reliable results. Two turbochargers characterized in an steady flow rig were used for illustrating the representation. After being implemented in a turbocharger submodel, the results obtained with the model have been compared with success against turbine performance evaluated in engine tests cells. A practical application in turbocharger matching is also provided to show how this new map can be directly employed in engine design. (author)

33 ADVANCED PROPULSION SYSTEMS↗

Generalized spectral decomposition for stochastic nonlinear problems

We present an extension of the generalized spectral decomposition method for the resolution of nonlinear stochastic problems. The method consists in the construction of a reduced basis approximation of the Galerkin solution and is independent of the stochastic discretization selected (polynomial chaos, stochastic multi-element or multi-wavelets). Two algorithms are proposed for the sequential construction of the successive generalized spectral modes. They involve decoupled resolutions of a series of deterministic and low-dimensional stochastic problems. Compared to the classical Galerkin method, the algorithms allow for significant computational savings and require minor adaptations of the deterministic codes. The methodology is detailed and tested on two model problems, the one-dimensional steady viscous Burgers equation and a two-dimensional nonlinear diffusion problem. These examples demonstrate the effectiveness of the proposed algorithms which exhibit convergence rates with the number of modes essentially dependent on the spectrum of the stochastic solution but independent of the dimension of the stochastic approximation space.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A spectral Galerkin method for the coupled Orr-Sommerfeld and induction equations for free-surface MHD.

We develop and test spectral Galerkin schemes to solve the coupled Orr-Sommerfeld and induction equations for parallel, incompressible MHD in free-surface and fixed-boundary geometries. The schemes discrete bases consist of Legendre internal shape functions, supplemented with nodal shape functions for the weak imposition of the stress and insulating boundary conditions. The orthogonality properties of the basis polynomials solve the matrix-coefficient growth problem, and eigenvalue-eigenfunction pairs can be computed stably at spectral orders at least as large as p=3000 with p-independent roundoff error. Accuracy is limited instead by roundoff sensitivity due to non-normality of the stability operators at large hydrodynamic and/or magnetic Reynolds numbers (Re,Rm {ge} 4 x 10{sup 4}). In problems with Hartmann velocity and magnetic-field profiles we employ suitable Gauss quadrature rules to evaluate the associated exponentially weighted sesquilinear forms without error. An alternative approach, which involves approximating the forms by means of Legendre-Gauss-Lobatto quadrature at the 2p?1 precision level, is found to yield equal eigenvalues within roundoff error. As a consistency check, we compare modal growth rates to energy growth rates in nonlinear simulations and record relative discrepancy smaller than 10{sup -5} for the least stable mode in free-surface flow at Re = 3 x 10{sup 4}. Moreover, we confirm that the computed normal modes satisfy an energy conservation law for free-surface MHD with error smaller than 10{sup -6}. The critical Reynolds number in free-surface MHD is found to be sensitive to the magnetic Prandtl number Pm, even at the Pm=O(10{sup -5}) regime of liquid metals.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Second-order time evolution of P{sub N} equations for radiation transport

Using polynomials to represent the angular variation of the radiation intensity is usually referred to as the P{sub N} or spherical harmonics method. For infinite order, the representation is an exact solution of the radiation transport solution. For finite N, in some physical situations there are oscillations in the solution that can make the radiation energy density be negative. For small N, the oscillations may be large enough to force the material temperature to numerically have non-physical negative values. The second-order time evolution algorithm presented here allows for more accurate solutions with larger time steps; however, it also can resolve the negativities that first-order time solutions smear out. Therefore, artificial scattering is studied to see how it can be used to decrease the oscillations in low-order solutions and prevent negativities. Small amounts of arbitrary, non-physical scattering can significantly improve the accuracy of the solution to test problems. Flux-limited diffusion solutions can also be improved by including artificial scattering. One- and two-dimensional test results are presented.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Numerical solution of the linearized Boltzmann equation for an arbitrary intermolecular potential

A numerical procedure to solve the linearized Boltzmann equation with an arbitrary intermolecular potential by the discrete velocity method is elaborated. The equation is written in terms of the kernel, which contains the differential cross section and represents a singularity. As an example, the Lennard-Jones potential is used and the corresponding differential cross section is calculated and tabulated. Then, the kernel is calculated so that to overcome its singularity. Once, the kernel is known and stored it can be used for many kinds of gas flows. In order to test the method, the transport coefficients, i.e. thermal conductivity and viscosity for all noble gases, are calculated and compared with those obtained by the variational method using the Sonine polynomials expansion. The fine agreement between the results obtained by the two different methods shows the feasibility of application of the proposed technique to calculate rarefied gas flows over the whole range of the Knudsen number.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Fast transform from an adaptive multi-wavelet representation to a partial Fourier representation

We present a fast algorithm to compute the partial transformation of a function represented in an adaptive pseudo-spectral multi-wavelet representation to a partial Fourier representation. Such fast transformations are useful in many contexts in physics and engineering, where changes of representation from a piece wise polynomial basis to a Fourier basis. The algorithm is demonstrated for a Gaussian in one and in three dimensions. For 2D, we apply this approach to a Gaussian in a periodic domain. The accuracy and the performance of this method is compared with direct summation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Stochastic finite difference lattice Boltzmann method for steady incompressible viscous flows

With the advent of state-of-the-art computers and their rapid availability, the time is ripe for the development of efficient uncertainty quantification (UQ) methods to reduce the complexity of numerical models used to simulate complicated systems with incomplete knowledge and data. The spectral stochastic finite element method (SSFEM) which is one of the widely used UQ methods, regards uncertainty as generating a new dimension and the solution as dependent on this dimension. A convergent expansion along the new dimension is then sought in terms of the polynomial chaos system, and the coefficients in this representation are determined through a Galerkin approach. This approach provides an accurate representation even when only a small number of terms are used in the spectral expansion; consequently, saving in computational resource can be realized compared to the Monte Carlo (MC) scheme. Recent development of a finite difference lattice Boltzmann method (FDLBM) that provides a convenient algorithm for setting the boundary condition allows the flow of Newtonian and non-Newtonian fluids, with and without external body forces to be simulated with ease. Also, the inherent compressibility effect in the conventional lattice Boltzmann method, which might produce significant errors in some incompressible flow simulations, is eliminated. As such, the FDLBM together with an efficient UQ method can be used to treat incompressible flows with built in uncertainty, such as blood flow in stenosed arteries. The objective of this paper is to develop a stochastic numerical solver for steady incompressible viscous flows by combining the FDLBM with a SSFEM. Validation against MC solutions of channel/Couette, driven cavity, and sudden expansion flows are carried out.

97 MATHEMATICS AND COMPUTING↗

A spectral-element discontinuous Galerkin lattice Boltzmann method for incompressible flows.

We present a spectral-element discontinuous Galerkin lattice Boltzmann method for solving nearly incompressible flows. Decoupling the collision step from the streaming step offers numerical stability at high Reynolds numbers. In the streaming step, we employ high-order spectral-element discontinuous Galerkin discretizations using a tensor product basis of one-dimensional Lagrange interpolation polynomials based on Gauss-Lobatto-Legendre grids. Our scheme is cost-effective with a fully diagonal mass matrix, advancing time integration with the fourth-order Runge-Kutta method. We present a consistent treatment for imposing boundary conditions with a numerical flux in the discontinuous Galerkin approach. We show convergence studies for Couette flows and demonstrate two benchmark cases with lid-driven cavity flows for Re = 400-5000 and flows around an impulsively started cylinder for Re = 550-9500. Computational results are compared with those of other theoretical and computational work that used a multigrid method, a vortex method, and a spectral element model.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

CHARACTERIZATION OF DISCONTINUITIES IN HIGH-DIMENSIONAL STOCHASTIC PROBLEMS ON ADAPTIVE SPARSE GRIDS

In this paper we present a set of efficient algorithms for detection and identification of discontinuities in high dimensional space. The method is based on extension of polynomial annihilation for edge detection in low dimensions. Compared to the earlier work, the present method poses significant improvements for high dimensional problems. The core of the algorithms relies on adaptive refinement of sparse grids. It is demonstrated that in the commonly encountered cases where a discontinuity resides on a small subset of the dimensions, the present method becomes optimal , in the sense that the total number of points required for function evaluations depends linearly on the dimensionality of the space. The details of the algorithms will be presented and various numerical examples are utilized to demonstrate the efficacy of the method.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Simulation-based optimal Bayesian experimental design for nonlinear systems

The optimal selection of experimental conditions is essential to maximizing the value of data for inference and prediction, particularly in situations where experiments are time-consuming and expensive to conduct. We propose a general mathematical framework and an algorithmic approach for optimal experimental design with nonlinear simulation-based models; in particular, we focus on finding sets of experiments that provide the most information about targeted sets of parameters. Our framework employs a Bayesian statistical setting, which provides a foundation for inference from noisy, indirect, and incomplete data, and a natural mechanism for incorporating heterogeneous sources of information. An objective function is constructed from information theoretic measures, reflecting expected information gain from proposed combinations of experiments. Polynomial chaos approximations and a two-stage Monte Carlo sampling method are used to evaluate the expected information gain. Stochastic approximation algorithms are then used to make optimization feasible in computationally intensive and high-dimensional settings. These algorithms are demonstrated on model problems and on nonlinear parameter inference problems arising in detailed combustion kinetics.

97 MATHEMATICS AND COMPUTING↗

Multi-element stochastic spectral projection for high quantile estimation

We investigate quantile estimation by multi-element generalized Polynomial Chaos (gPC) metamodel where the exact numerical model is approximated by complementary metamodels in overlapping domains that mimic the model’s exact response. The gPC metamodel is constructed by the non-intrusive stochastic spectral projection approach and function evaluation on the gPC metamodel can be considered as essentially free. Thus, large number of Monte Carlo samples from the metamodel can be used to estimate α-quantile, for moderate values of α. As the gPC metamodel is an expansion about the means of the inputs, its accuracy may worsen away from these mean values where the extreme events may occur. By increasing the approximation accuracy of the metamodel, we may eventually improve accuracy of quantile estimation but it is very expensive. A multi-element approach is therefore proposed by combining a global metamodel in the standard normal space with supplementary local metamodels constructed in bounded domains about the design points corresponding to the extreme events. To improve the accuracy and to minimize the sampling cost, sparse-tensor and anisotropic-tensor quadratures are tested in addition to the full-tensor Gauss quadrature in the construction of local metamodels; different bounds of the gPC expansion are also examined. The global and local metamodels are combined in the multi-element gPC (MEgPC) approach and it is shown that MEgPC can be more accurate than Monte Carlo or importance sampling methods for high quantile estimations for input dimensions roughly below N=8, a limit that is very much case- and α-dependent.

97 MATHEMATICS AND COMPUTING↗

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↗

All-electron Kohn–Sham density functional theory on hierarchic finite element spaces

In this work, a real space formulation of the Kohn–Sham equations is developed, making use of the hierarchy of finite element spaces from different polynomial order. The focus is laid on all-electron calculations, having the highest requirement onto the basis set, which must be able to represent the orthogonal eigenfunctions as well as the electrostatic potential. A careful numerical analysis is performed, which points out the numerical intricacies originating from the singularity of the nuclei and the necessity for approximations in the numerical setting, with the ambition to enable solutions within a predefined accuracy. In this context the influence of counter-charges in the Poisson equation, the requirement of a finite domain size, numerical quadratures and the mesh refinement are examined as well as the representation of the electrostatic potential in a high order finite element space. The performance and accuracy of the method is demonstrated in computations on noble gases. In addition the finite element basis proves its flexibility in the calculation of the bond-length as well as the dipole moment of the carbon monoxide molecule.

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↗

A two-parameter continuation method for computing numerical solutions of spin-1 Bose–Einstein condensates

We describe a novel two-parameter continuation method combined with a spectral-collocation method (SCM) for computing the ground state and excited-state solutions of spin-1 Bose–Einstein condensates (BEC), where the second kind Chebyshev polynomials are used as the basis functions for the trial function space. To compute the ground state solution of spin-1 BEC, we implement the single parameter continuation algorithm with the chemical potential μ as the continuation parameter, and trace the first solution branch of the Gross–Pitaevskii equations (GPEs). When the curve-tracing is close enough to the target point, where the normalization condition of the wave function is going to be satisfied, we add the magnetic potential λ as the second continuation parameter with the magnetization M as the additional constraint condition. Then we implement the two-parameter continuation algorithm until the target point is reached, and the ground state solution of the GPEs is obtained. The excited state solutions of the GPEs can be treated in a similar way. Some numerical experiments on {sup 23}Na and {sup 87}Rb are reported. The numerical results on the spin-1 BEC are the same as those reported in [10]. Further numerical experiments on excited-state solutions of spin-1 BEC suffice to show the robustness and efficiency of the proposed two-parameter continuation algorithm.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗