Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “deterministic method”

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 199 records · Page 11

Dynamic Probabilistic Instability of Composite Structures

A computationally effective method is described to evaluate the non-deterministic dynamic instability (probabilistic dynamic buckling) of thin composite shells. The method is a judicious combination of available computer codes for finite element, composite mechanics and probabilistic structural analysis. The solution method is incrementally updated Lagrangian. It is illustrated by applying it to thin composite cylindrical shell subjected to dynamic loads. Both deterministic and probabilistic buckling loads are evaluated to demonstrate the effectiveness of the method. A universal plot is obtained for the specific shell that can be used to approximate buckling loads for different load rates and different probability levels. Results from this plot show that the faster the rate, the higher the buckling load and the shorter the time. The lower the probability, the lower is the buckling load for a specific time. Probabilistic sensitivity results show that the ply thickness, the fiber volume ratio and the fiber longitudinal modulus, dynamic load and loading rate are the dominant uncertainties in that order.

Chamis, Christos C.↗

Investigation of computational and spectral analysis methods for aeroacoustic wave propagation

Most computational fluid dynamics (CFD) schemes are not adequately accurate for solving aeroacoustics problems, which have wave amplitudes several orders of magnitude smaller yet with frequencies larger than the flow field variations generating the sound. Hence, a computational aeroacoustics (CAA) algorithm should have minimal dispersion and dissipation features. A dispersion relation preserving (DRP) scheme is, therefore, applied to solve the linearized Euler equations in order to simulate the propagation of three types of waves, namely: acoustic, vorticity, and entropy waves. The scheme is derived using an optimization procedure to ensure that the numerical derivatives preserve the wave number and angular frequency of the partial differential equations being discretized. Consequently, simulated waves propagate with the correct wave speeds and exhibit their appropriate properties. A set of radiation and outflow boundary conditions, compatible with the DRP scheme and derived from the asymptotic solutions of the governing equations, are also implemented. Numerical simulations are performed to test the effectiveness of the DRP scheme and its boundary conditions. The computed solutions are shown to agree favorably with the exact solutions. The major restriction appears to be that the dispersion relations can be preserved only for waves with wave lengths longer than four or five spacings. The boundary conditions are found to be transparent to the outgoing disturbances. However, when the disturbance source is placed closer to a boundary, small acoustic reflections start appearing. CAA generates enormous amounts of temporal data which needs to be reduced to understand the physical problem being simulated. Spectral analysis is one approach that helps us in extracting information which often can not be easily interpreted in the time domain. Thus, three different methods for the spectral analysis of numerically generated aeroacoustic data are studied. First, the capabilities of two traditional methods for spectral analysis, namely, the Blackman-Tukey method and periodogram method, are compared in estimating the spectra of a simple-periodic process. The periodogram is then applied to analyze transitory-deterministic processes. Finally, these two methods are compared with a more recent method, referred as the Weighted-Overlapped-Segment-Averaging (WOSA) method, in estimating the spectra of a chaotic (random-like) process. From the demonstrative case for the spectral analyses of data generated by simple-periodic process, the periodogram method is found to give a better estimate of the steep-sloped spectra than the Blackman-Tukey method. Also, for this problem, the Hanning window is found to perform better with the periodogram method than with the Blackman-Tukey method. Finally, for the spectral analysis of data generated by the chaotic process, the periodogram method does not perform well, whereas, the WOSA and Blackman-Tukey methods give equivalently good results.

Vanel, Florence O.↗

Diffusion Synthetic Acceleration for Heterogeneous Domains, Compatible with Voids

A standard approach to solving the S N transport equations is to use source iteration with diffusion synthetic acceleration (DSA). Although this approach is widely used and effective on many problems, there remain some practical issues with DSA preconditioning, particularly on highly heterogeneous domains. For large-scale parallel simulation, it is critical that both (a) preconditioned source iteration converges rapidly and (b) the action of the DSA preconditioner can be applied using fast, scalable solvers, such as algebraic multigrid (AMG). For heterogeneous domains, these two interests can be at odds. In particular, there exist DSA diffusion discretizations that can be solved rapidly using AMG, but they do not always yield robust/fast convergence of the larger source iteration. Conversely, there exist robust DSA discretizations where source iteration converges rapidly on difficult heterogeneous problems, but fast parallel solvers like AMG tend to struggle applying the action of such operators. Moreover, very few current methods for the solution of deterministic transport are compatible with voids. This paper develops a new heterogeneous DSA preconditioner based on only preconditioning the optically thick subdomains. The resulting method proves robust on a variety of heterogeneous transport problems, including a linearized hohlraum mesh related to inertial confinement fusion. Moreover, the action of the preconditioner is easily computed using O(1) AMG iterations, convergence of the transport iteration typically requires 2 to 5× fewer iterations than current state-of-the-art “full” DSA, and the proposed method is trivially compatible with voids. On the hohlraum problem, rapid convergence is obtained by preconditioning less than 3% of the mesh elements with five to ten AMG iterations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Projective Hedging Algorithms for Multistage Stochastic Programming, Supporting Distributed and Asynchronous Implementation

Here we propose a decomposition algorithm for multistage stochastic programming that resembles the progressive hedging method of Rockafellar and Wets but is provably capable of several forms of asynchronous operation. We derive the method from a class of projective operator splitting methods fairly recently proposed by Combettes and Eckstein, significantly expanding the known applications of those methods. Our derivation assures convergence for convex problems whose feasible set is compact, subject to some standard regularity conditions and a mild “fairness” condition on subproblem selection. The method’s convergence guarantees are deterministic and do not require randomization, in contrast to other proposed asynchronous variations of progressive hedging. Computational experiments described in an online appendix show the method to outperform progressive hedging on large-scale problems in a highly parallel computing environment.

97 MATHEMATICS AND COMPUTING↗

Concepts for a theoretical and experimental study of lifting rotor random loads and vibrations, Phase 2

A comparison with NASA conducted simulator studies has shown that the approximate digital method for computing rotor blade flapping responses to random inputs, tentatively suggested in Phase I Report, gives with increasing rotor advance ratio the wrong trend. Consequently, three alternative methods of solution have been considered and are described: (1) an approximate method based on the functional relation between input and output double frequency spectra, (2) a numerical method based on the system responses to deterministic inputs and (3) a perturbation approach. Among these the perturbation method requires the least amount of computation and has been developed in two forms - the first form to obtain the response correlation function and the second for the time averaged spectra of flapping oscillations.

Hohenemser, K. H.↗

Integrated adaptive filtering and design for control experiments of flexible structures

A novel method is presented of identifying a state space model and a state estimator for linear stochastic systems from input and output data. The method is primarily based on the relations between the state space model and the finite difference model for linear stochastic systems derived through projection filters. It is proven that least squares identification of a finite difference model converges to the model derived from the projection filters. System pulse response samples are computed from the coefficients of the finite difference model. In estimating the corresponding state estimator gain, a z-domain method is used. First the deterministic component of the output is subtracted out, and then the state estimator gain is obtained by whitening the remaining signal. Experimental example is used to illustrate the feasibility of the method.

Huang, Jen-Kuang↗

Intelligent multi-zone residential HVAC control strategy based on deep reinforcement learning

Residential heating, ventilation, and air conditioning (HVAC) has been considered as an important demand response resource. However, the optimization of residential HVAC control is no trivial task due to the complexity of the thermal dynamic models of buildings and uncertainty associated with both occupant-driven heat loads and weather forecasts. In this paper, we apply a novel model-free deep reinforcement learning (RL) method, known as the deep deterministic policy gradient (DDPG), to generate an optimal control strategy for a multi-zone residential HVAC system with the goal of minimizing energy consumption cost while maintaining the users’ comfort. Here, the applied deep RL-based method learns through continuous interaction with a simulated building environment and without referring to any prior model knowledge. Simulation results show that compared with the state-of-art deep Q network (DQN), the DDPG-based HVAC control strategy can reduce the energy consumption cost by 15% and reduce the comfort violation by 79%; and when compared with a rule-based HVAC control strategy, the comfort violation can be reduced by 98%. In addition, experiments with different building models and retail price models demonstrate that the well-trained DDPG-based HVAC control strategy has high generalization and adaptability to unseen environments, which indicates its practicability for real-world implementation.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

The collisional particle-in-cell method for the Vlasov–Maxwell–Landau equations

We introduce an extension of the particle-in-cell method that captures the Landau collisional effects in the Vlasov–Maxwell–Landau equations. The method arises from a regularisation of the variational formulation of the Landau equation, leading to a discretisation of the collision operator that conserves mass, charge, momentum and energy, while increasing the (regularised) entropy. The collisional effects appear as a fully deterministic effective force, thus the method does not require any transport–collision splitting. The scheme can be used in arbitrary dimension, and for a general interaction, including the Coulomb case. We validate the scheme on scenarios such as the Landau damping, the two-stream instability and the Weibel instability, demonstrating its effectiveness in the numerical simulation of plasma.

Bailo, Rafael (ORCID:0000000180183799)↗

An adaptive stochastic sequential quadratic programming with differentiable exact augmented lagrangians

In this study, we consider solving nonlinear optimization problems with a stochastic objective and deterministic equality constraints. We assume for the objective that its evaluation, gradient, and Hessian are inaccessible, while one can compute their stochastic estimates by, for example, subsampling. We propose a stochastic algorithm based on sequential quadratic programming (SQP) that uses a differentiable exact augmented Lagrangian as the merit function. To motivate our algorithm design, we first revisit and simplify an old SQP method Lucidi developed for solving deterministic problems, which serves as the skeleton of our stochastic algorithm. Based on the simplified deterministic algorithm, we then propose a non-adaptive SQP for dealing with stochastic objective, where the gradient and Hessian are replaced by stochastic estimates but the stepsizes are deterministic and prespecified. Finally, we incorporate a recent stochastic line search procedure Paquette and Scheinberg into the non-adaptive stochastic SQP to adaptively select the random stepsizes, which leads to an adaptive stochastic SQP. The global "almost sure" convergence for both non-adaptive and adaptive SQP methods is established. Numerical experiments on nonlinear problems in CUTEst test set demonstrate the superiority of the adaptive algorithm.

97 MATHEMATICS AND COMPUTING↗

Development and Application of a Risk Analysis Toolkit for Plant Resources Optimization

This report summarizes the R&D activities of the Risk Informed Asset Management (RIAM) project during fiscal year 2020 (FY20). This project focuses on the development of methods designed to optimize plant operations (e.g., maintenance/replacement schedule, optimal maintenance posture) provided system/component health/cost data. This project development lives in cooperation with the Plant Health Management (PHM) project which focuses on the development of methods that integrate component health data and propagate such information at the system level to evaluate most relevant sources of risk. This year’s activities for the RIAM project focused on the continuation of schedule optimization algorithms developed in FY19. While in FY19 we focused on both deterministic and stochastic capital budgeting methods, in FY20 we moved forward by implementing two versions of schedule optimization methods. The first one reformulates the capital budgeting problem in a distributionally robust form which allows the user to rely on data directly rather than proposing a distribution from the data itself. The second version reformulates the capital budgeting explicitly using risk measures as variables to maximize/minimize. Lastly, we focused on the development of methods designed to identify the optimal maintenance posture based on the Pareto Frontier analysis. Rather than performing a tradeoff analysis (i.e., identify the absolute best posture), the Pareto Frontier analysis performs a trade space exploration approach (i.e., identify value and costs of several postures and have the analyst perform the task of imposing desired value and cost constraints). This is performed by identifying maintenance postures that maximize value (e.g., system availability) and minimize operational costs, i.e., the Pareto frontier in a value-cost trade space.

97 MATHEMATICS AND COMPUTING↗

An Examination of the Impact of Grid Spacing on WRF Simulations of Wintertime Precipitation in the Mid-Atlantic United States

A large set of deterministic and ensemble forecasts was produced to identify the optimal spacing for forecasting U.S. East Coast snowstorms. WRF forecasts were produced on cloud-allowing (~1-km grid spacing) and convection-allowing (3–4 km) grids, and compared against forecasts with parameterized convection (>~10 km). Performance diagrams were used to evaluate 19 deterministic forecasts from the winter of 2013–14. Ensemble forecasts of five disruptive snowstorms spanning the years 2015–18 were evaluated using various methods to evaluate probabilistic forecasts. While deterministic forecasts using cloud-allowing grids were not better than convection-allowing forecasts, both had lower bias and higher success ratios than forecasts with parameterized convection. All forecasts were underdispersive. Nevertheless, forecasts on the higher-resolution grids were more reliable than those with parameterized convection. Forecasts on the cloud-allowing grid were best able to discriminate areas that received heavy snow and those that did not, while the forecasts with parameterized convection were least able to do so. It is recommended to use convection-resolving and (if computationally possible) to use cloud-allowing forecast grids when predicting East Coast winter storms.

Snowstorms↗

A hybrid Monte Carlo, discontinuous Galerkin method for linear kinetic transport equations

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.

97 MATHEMATICS AND COMPUTING↗

On-the-fly response function generation method for composite coarse mesh

The hybrid stochastic deterministic transport code COMET, based on the incident response expansion theory, is used to model reactor cores with high fidelity and formidable computational speed. COMET models a reactor core using a library of incident flux response expansion coefficients that are pre computed for all the unique lattice cells (e.g., fuel assemblies, reflector blocks, etc.) in the core. In order to further improve its computational efficiency in pre-calculating the response library a new response function generation method is developed to compute the response functions for the composite coarse meshes made of a smaller set of unique lattices on the fly within the COMET's deterministic transport core sweep. The efficiency is achieved by eliminating a number of unique lattices that can be made up from the reduced set of unique meshes on the fly. The numerical process consists of the following steps. First, the boundary condition on composite coarse mesh boundaries is projected onto the expansion basis to compute the incident flux moments on external surfaces of all the basic (reduced set of unique) coarse meshes. Secondly, the deterministic sweeping solver in COMET is used to converge on the outgoing/incoming flux expansion moments crossing interfaces between the basic coarse meshes. Thirdly, the response functions for the composite coarse meshes are constructed as a superposition on the fly. The new response function generation method was tested on 88 composite coarse meshes consisting of CANDU fuel bundles and moderator blocks. It was found that response functions generated by the new method agree very well with those generated by direct Monte Carlo calculations. The average and maximum relative differences in the surface-to-surface response coefficients computed by the two methods are 0.10% and 0.20%, respectively. Similarly, the average and maximum relative differences in the response fission densities are 0.13% and 0.43%, respectively. These discrepancies are within one standard deviation of the stochastic uncertainties. The new method is five times faster than the original direct Monte Carlo method. The size of the response function library for the new method is five times smaller than that for the original method, leading to significantly less requirement for the computer hard drive space and memory. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Neutronics and Thermo-Fluids Simulation of Generic Pebble-Bed Fluoride-Salt-Cooled High-Temperature Reactor

The fluoride-salt-cooled high-temperature reactor (FHR) is one of the advanced reactors that has been attracting considerable interest from both the research community and the nuclear industry. To help facilitate the nuclear community's familiarity with the FHR, Kairos Power has developed a generic FHR (gFHR) benchmark. In the research performed here, this benchmark was used to assess innovative modeling methods that combine stochastic and deterministic computer codes to perform the design and analysis of the gFHR. Further, the Monte Carlo code Serpent 2 was used to generate few-group cross sections that were then used in the neutron diffusion and thermal-fluids code AGREE to perform full-core neutronics and thermal-fluids steady-state and transient core analysis. The Argonne National Laboratory code SAM was then used to model the gFHR system and to simulate the load-follow operation of the gFHR.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Hierarchical porous metals with deterministic 3D morphology and shape via de-alloying of 3D printed alloys

The present disclosure relates to a method for forming a three dimensional, hierarchical, porous metal structure with deterministically controlled 3D multiscale pore architectures. The method may involve providing a feedstock able to be applied in an additive manufacturing process, and using an additive manufacturing process to produce a three dimensional (3D) structure using the feedstock. The method may involve further processing the 3D structure through at least a de-alloying operation to form a metallic 3D structure having an engineered, digitally controlled macropore morphology with integrated nanoporosity.

Qi, Zhen↗

Uncertainty quantification methodology for hyperbolic systems with application to blood flow in arteries

We present a Stochastic Finite Volume - ADER (SFV-ADER) methodology for Uncertainty Quantification (UQ) in the general framework of systems of hyperbolic balance laws with uncertainty in parameters. The resulting method is weakly intrusive, meaning that deterministic solvers need minor modifications to include random contributions, and has no theoretical accuracy barrier. An illustration of the second-order version for the viscous Burgers equation with uncertain viscosity coefficient is first given in detail, under different deterministic initial conditions; the attainment of the theoretically expected convergence rate is demonstrated empirically; results and features of our scheme are discussed. We then extend the SFV-ADER method to a non-linear hyperbolic system with source terms that models one-dimensional blood flow in arteries, assuming uncertainties in a set of parameters of the problem. Results are then compared with measurements in a well-defined 1:1 experimental replica of the network of largest arteries in the human systemic circulation. For a 99%-confidence level, severe influence of parameter fluctuations is seen in pressure profiles, while secondary effects on flow rate profiles become visible, particularly in terminal branches. In conclusion, results suggest that the proposed methodology could successfully be applied to other physical problems involving hyperbolic balance laws.

60 APPLIED LIFE SCIENCES↗

Application of Genetic Algorithm (GA) Assisted Partial Least Square (PLS) Analysis on Trilinear and Non-trilinear Fluorescence Data Sets to Quantify the Fluorophores in Multifluorophoric Mixtures: Improving Quantification Accuracy of Fluorimetric Estimations of Dilute Aqueous Mixtures

Excitation-emission matrix fluorescence (EEMF) and total synchronous fluorescence spectroscopy (TSFS) are the 2 fluorescence techniques that are commonly used for the analysis of multifluorophoric mixtures. These 2 fluorescence techniques are conceptually different and provide certain advantages over each other. The manual analysis of such highly correlated large volume of EEMF and TSFS towards developing a calibration model is difficult. Partial least square (PLS) analysis can analyze the large volume of EEMF and TSFS data sets by finding important factors that maximize the correlation between the spectral and concentration information for each fluorophore. However, often the application of PLS analysis on entire data sets does not provide a robust calibration model and requires application of suitable pre-processing step. The present work evaluates the application of genetic algorithm (GA) analysis prior to PLS analysis on EEMF and TSFS data sets towards improving the precision and accuracy of the calibration model. The GA algorithm essentially combines the advantages provided by stochastic methods with those provided by deterministic approaches and can find the set of EEMF and TSFS variables that perfectly correlate well with the concentration of each of the fluorophores present in the multifluorophoric mixtures. The utility of the GA assisted PLS analysis is successfully validated using (i) EEMF data sets acquired for dilute aqueous mixture of four biomolecules and (ii) TSFS data sets acquired for dilute aqueous mixtures of four carcinogenic polycyclic aromatic hydrocarbons (PAHs) mixtures. In the present work, it is shown that by using the GA it is possible to significantly improve the accuracy and precision of the PLS calibration model developed for both EEMF and TSFS data set. Hence, GA must be considered as a useful pre-processing technique while developing an EEMF and TSFS calibration model.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Predicting the impact of particle-particle collisions on turbophoresis with a reduced number of computational particles

A common feature of wall-bounded turbulent particle-laden flows is enhanced particle concentrations in a thin layer near the wall due to a phenomenon known as turbophoresis. Even at relatively low bulk volume fractions, particle-particle collisions regulate turbophoresis in a critical way, making simulations sensitive to collisional effects. Lagrangian tracking of every particle in the flow can become computationally expensive when the physical number of particles in the system is large. Artificially reducing the number of particles in the simulation can mitigate the computational cost. When particle-particle collisions are an important aspect determining the simulation outcome, as in the case when turbophoresis plays an active role, simply reducing the number of particles in the simulation significantly alters the computed particle statistics. This paper introduces a computational particle treatment for particle-particle collisions which reproduces the results of a full simulation with a reduced number of particles. This is accomplished by artificially enhancing the particle collision radius based on scaling laws for the collision rates. The proposed method retains the use of deterministic collision models and is applicable for both low and high Stokes number regimes.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗