Search NASA⌕ Search

SEARCH · Search NASA

Results for “Variable Grid 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 361 records · Page 20

Finite-Difference Algorithms For Computing Sound Waves

Governing equations considered as matrix system. Method variant of method described in "Scheme for Finite-Difference Computations of Waves" (ARC-12970). Present method begins with matrix-vector formulation of fundamental equations, involving first-order partial derivatives of primitive variables with respect to space and time. Particular matrix formulation places time and spatial coordinates on equal footing, so governing equations considered as matrix system and treated as unit. Spatial and temporal discretizations not treated separately as in other finite-difference methods, instead treated together by linking spatial-grid interval and time step via common scale factor related to speed of sound.

Davis, Sanford↗

Aerodynamic shape optimization via sensitivity analysis on decomposed computational domains

Direct and iterative method considered to be most applicable to large systems of linear equations arising in discrete sensitivity analysis are assessed. Based on a single-domain grid, computations are performed using a banded matrix solver and an iterative solver, the generalized minimum residual (GMRES) method. The banded matrix solver is found to be generally the most economical method for those applications where the number of right-hand sides is large (i.e., a large number of design variables or a large number of adjoint vectors). For systems of equations that are too large to be solved by direct methods, an approach is proposed whereby the computational domain is divided into small subdomains, and each subdomain is solved separately.

Eleshaky, Mohamed E.↗

Demonstration of Automatically-Generated Adjoint Code for Use in Aerodynamic Shape Optimization

Gradient-based optimization requires accurate derivatives of the objective function and constraints. These gradients may have previously been obtained by manual differentiation of analysis codes, symbolic manipulators, finite-difference approximations, or existing automatic differentiation (AD) tools such as ADIFOR (Automatic Differentiation in FORTRAN). Each of these methods has certain deficiencies, particularly when applied to complex, coupled analyses with many design variables. Recently, a new AD tool called ADJIFOR (Automatic Adjoint Generation in FORTRAN), based upon ADIFOR, was developed and demonstrated. Whereas ADIFOR implements forward-mode (direct) differentiation throughout an analysis program to obtain exact derivatives via the chain rule of calculus, ADJIFOR implements the reverse-mode counterpart of the chain rule to obtain exact adjoint form derivatives from FORTRAN code. Automatically-generated adjoint versions of the widely-used CFL3D computational fluid dynamics (CFD) code and an algebraic wing grid generation code were obtained with just a few hours processing time using the ADJIFOR tool. The codes were verified for accuracy and were shown to compute the exact gradient of the wing lift-to-drag ratio, with respect to any number of shape parameters, in about the time required for 7 to 20 function evaluations. The codes have now been executed on various computers with typical memory and disk space for problems with up to 129 x 65 x 33 grid points, and for hundreds to thousands of independent variables. These adjoint codes are now used in a gradient-based aerodynamic shape optimization problem for a swept, tapered wing. For each design iteration, the optimization package constructs an approximate, linear optimization problem, based upon the current objective function, constraints, and gradient values. The optimizer subroutines are called within a design loop employing the approximate linear problem until an optimum shape is found, the design loop limit is reached, or no further design improvement is possible due to active design variable bounds and/or constraints. The resulting shape parameters are then used by the grid generation code to define a new wing surface and computational grid. The lift-to-drag ratio and its gradient are computed for the new design by the automatically-generated adjoint codes. Several optimization iterations may be required to find an optimum wing shape. Results from two sample cases will be discussed. The reader should note that this work primarily represents a demonstration of use of automatically- generated adjoint code within an aerodynamic shape optimization. As such, little significance is placed upon the actual optimization results, relative to the method for obtaining the results.

Green, Lawrence↗

A linearized Euler analysis of unsteady flows in turbomachinery

A method for calculating unsteady flows in cascades is presented. The model, which is based on the linearized unsteady Euler equations, accounts for blade loading shock motion, wake motion, and blade geometry. The mean flow through the cascade is determined by solving the full nonlinear Euler equations. Assuming the unsteadiness in the flow is small, then the Euler equations are linearized about the mean flow to obtain a set of linear variable coefficient equations which describe the small amplitude, harmonic motion of the flow. These equations are discretized on a computational grid via a finite volume operator and solved directly subject to an appropriate set of linearized boundary conditions. The steady flow, which is calculated prior to the unsteady flow, is found via a Newton iteration procedure. An important feature of the analysis is the use of shock fitting to model steady and unsteady shocks. Use of the Euler equations with the unsteady Rankine-Hugoniot shock jump conditions correctly models the generation of steady and unsteady entropy and vorticity at shocks. In particular, the low frequency shock displacement is correctly predicted. Results of this method are presented for a variety of test cases. Predicted unsteady transonic flows in channels are compared to full nonlinear Euler solutions obtained using time-accurate, time-marching methods. The agreement between the two methods is excellent for small to moderate levels of flow unsteadiness. The method is also used to predict unsteady flows in cascades due to blade motion (flutter problem) and incoming disturbances (gust response problem).

Hall, Kenneth C.↗

Calculation of unsteady flows in turbomachinery using the linearized Euler equations

A method for calculating unsteady flows in cascades is presented. The model, which is based on the linearized unsteady Euler equations, accounts for blade loading shock motion, wake motion, and blade geometry. The mean flow through the cascade is determined by solving the full nonlinear Euler equations. Assuming the unsteadiness in the flow is small, then the Euler equations are linearized about the mean flow to obtain a set of linear variable coefficient equations which describe the small amplitude, harmonic motion of the flow. These equations are discretized on a computational grid via a finite volume operator and solved directly subject to an appropriate set of linearized boundary conditions. The steady flow, which is calculated prior to the unsteady flow, is found via a Newton iteration procedure. An important feature of the analysis is the use of shock fitting to model steady and unsteady shocks. Use of the Euler equations with the unsteady Rankine-Hugoniot shock jump conditions correctly models the generation of steady and unsteady entropy and vorticity at shocks. In particular, the low frequency shock displacement is correctly predicted. Results of this method are presented for a variety of test cases. Predicted unsteady transonic flows in channels are compared to full nonlinear Euler solutions obtained using time-accurate, time-marching methods. The agreement between the two methods is excellent for small to moderate levels of flow unsteadiness. The method is also used to predict unsteady flows in cascades due to blade motion (flutter problem) and incoming disturbances (gust response problem).

Hall, Kenneth C.↗

On recontamination and directional-bias problems in Monte Carlo simulation of PDF turbulence models

Turbulent combustion can not be simulated adequately by conventional moment closure turbulence models. The difficulty lies in the fact that the reaction rate is in general an exponential function of the temperature, and the higher order correlations in the conventional moment closure models of the chemical source term can not be neglected, making the applications of such models impractical. The probability density function (pdf) method offers an attractive alternative: in a pdf model, the chemical source terms are closed and do not require additional models. A grid dependent Monte Carlo scheme was studied, since it is a logical alternative, wherein the number of computer operations increases only linearly with the increase of number of independent variables, as compared to the exponential increase in a conventional finite difference scheme. A new algorithm was devised that satisfies a restriction in the case of pure diffusion or uniform flow problems. Although for nonuniform flows absolute conservation seems impossible, the present scheme has reduced the error considerably.

Hsu, Andrew T.↗

Efficient Construction of Discrete Adjoint Operators on Unstructured Grids Using Complex Variables

A methodology is developed and implemented to mitigate the lengthy software development cycle typically associated with constructing a discrete adjoint solver for aerodynamic simulations. The approach is based on a complex-variable formulation that enables straightforward differentiation of complicated real-valued functions. An automated scripting process is used to create the complex-variable form of the set of discrete equations. An efficient method for assembling the residual and cost function linearizations is developed. The accuracy of the implementation is verified through comparisons with a discrete direct method as well as a previously developed handcoded discrete adjoint approach. Comparisons are also shown for a large-scale configuration to establish the computational efficiency of the present scheme. To ultimately demonstrate the power of the approach, the implementation is extended to high temperature gas flows in chemical nonequilibrium. Finally, several fruitful research and development avenues enabled by the current work are suggested.

Nielsen, Eric J.↗

Efficient Construction of Discrete Adjoint Operators on Unstructured Grids by Using Complex Variables

A methodology is developed and implemented to mitigate the lengthy software development cycle typically associated with constructing a discrete adjoint solver for aerodynamic simulations. The approach is based on a complex-variable formulation that enables straightforward differentiation of complicated real-valued functions. An automated scripting process is used to create the complex-variable form of the set of discrete equations. An efficient method for assembling the residual and cost function linearizations is developed. The accuracy of the implementation is verified through comparisons with a discrete direct method as well as a previously developed handcoded discrete adjoint approach. Comparisons are also shown for a large-scale configuration to establish the computational efficiency of the present scheme. To ultimately demonstrate the power of the approach, the implementation is extended to high temperature gas flows in chemical nonequilibrium. Finally, several fruitful research and development avenues enabled by the current work are suggested.

Nielsen, Eric J.↗

Ten questions concerning reinforcement learning for building energy management

As buildings account for approximately 40% of global energy consumption and associated greenhouse gas emissions, their role in decarbonizing the power grid is crucial. The increased integration of variable energy sources, such as renewables, introduces uncertainties and unprecedented flexibilities, necessitating buildings to adapt their energy demand to enhance grid resiliency. Consequently, buildings must transition from passive energy consumers to active grid assets, providing demand flexibility and energy elasticity while maintaining occupant comfort and health. This fundamental shift demands advanced optimal control methods to manage escalating energy demand and avert power outages. Reinforcement learning (RL) emerges as a promising method to address these challenges. Here, in this paper, we explore ten questions related to the application of RL in buildings, specifically targeting flexible energy management. We consider the growing availability of data, advancements in machine learning algorithms, open-source tools, and the practical deployment aspects associated with software and hardware requirements. Our objective is to deliver a comprehensive introduction to RL, present an overview of existing research and accomplishments, underscore the challenges and opportunities, and propose potential future research directions to expedite the adoption of RL for building energy management.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Grid sensitivity capability for large scale structures

The considerations and the resultant approach used to implement design sensitivity capability for grids into a large scale, general purpose finite element system (MSC/NASTRAN) are presented. The design variables are grid perturbations with a rather general linking capability. Moreover, shape and sizing variables may be linked together. The design is general enough to facilitate geometric modeling techniques for generating design variable linking schemes in an easy and straightforward manner. Test cases have been run and validated by comparison with the overall finite difference method. The linking of a design sensitivity capability for shape variables in MSC/NASTRAN with an optimizer would give designers a powerful, automated tool to carry out practical optimization design of real life, complicated structures.

Nagendra, Gopal K.↗

File Specification for GEOS-5 FP (Forward Processing)

The GEOS-5 FP Atmospheric Data Assimilation System (GEOS-5 ADAS) uses an analysis developed jointly with NOAA's National Centers for Environmental Prediction (NCEP), which allows the Global Modeling and Assimilation Office (GMAO) to take advantage of the developments at NCEP and the Joint Center for Satellite Data Assimilation (JCSDA). The GEOS-5 AGCM uses the finite-volume dynamics (Lin, 2004) integrated with various physics packages (e.g, Bacmeister et al., 2006), under the Earth System Modeling Framework (ESMF) including the Catchment Land Surface Model (CLSM) (e.g., Koster et al., 2000). The GSI analysis is a three-dimensional variational (3DVar) analysis applied in grid-point space to facilitate the implementation of anisotropic, inhomogeneous covariances (e.g., Wu et al., 2002; Derber et al., 2003). The GSI implementation for GEOS-5 FP incorporates a set of recursive filters that produce approximately Gaussian smoothing kernels and isotropic correlation functions. The GEOS-5 ADAS is documented in Rienecker et al. (2008). More recent updates to the model are presented in Molod et al. (2011). The GEOS-5 system actively assimilates roughly 2 × 10(exp 6) observations for each analysis, including about 7.5 × 10(exp 5) AIRS radiance data. The input stream is roughly twice this volume, but because of the large volume, the data are thinned commensurate with the analysis grid to reduce the computational burden. Data are also rejected from the analysis through quality control procedures designed to detect, for example, the presence of cloud. To minimize the spurious periodic perturbations of the analysis, GEOS-5 FP uses the Incremental Analysis Update (IAU) technique developed by Bloom et al. (1996). More details of this procedure are given in Appendix A. The assimilation is performed at a horizontal resolution of 0.3125-degree longitude by 0.25- degree latitude and at 72 levels, extending to 0.01 hPa. All products are generated at the native resolution of the horizontal grid. The majority of data products are time-averaged, but four instantaneous products are also available. Hourly data intervals are used for two-dimensional products, while 3-hourly intervals are used for three-dimensional products. These may be on the model's native 72-layer vertical grid or at 42 pressure surfaces extending to 0.1 hPa. This document describes the gridded output files produced by the GMAO near real-time operational FP, using the most recent version of the GEOS-5 assimilation system. Additional details about variables listed in this file specification can be found in a separate document, the GEOS-5 File Specification Variable Definition Glossary. Documentation about the current access methods for products described in this document can be found on the GMAO products page: http://gmao.gsfc.nasa.gov/products/.

GSI↗

Scalable Predictive Control and Optimization for Grid Integration of Large-Scale Distributed Energy Resources

Integrating a large number of distributed energy resources (DERs) into the power grid needs a scalable power balancing method. We formulate the power balancing problem as a look-ahead optimization problem to be solved sequentially by a power distribution system aggregator based on a model predictive control (MPC) framework. Solving large-scale look-ahead control problems requires proper configuration of the control steps. In this paper, to solve large-scale control problems, we propose a variable time granularity where control time steps nearby the current control step have finer resolutions. The aggregator objective includes maximization of power production revenue and minimization of power purchasing expense, renewable power curtailment, and mileage costs for energy storage and electric vehicle (EV) charging stations while satisfying system capacity and operational constraints. The control problem is formulated as a mixed-integer linear program (MILP) and solved using the XpressMP solver. We perform simulations considering a copper plate representation of a large distribution network consisting of 2507 devices (controllable DERs), including curtailable photovoltaics (PVs), energy storage batteries, EV charging stations, and buildings with heating, ventilation, and air conditioning units (HVACs). We show the effectiveness of the proposed approach in managing DERs interactively for maximum energy trading profit and local supply-demand power balancing. Finally, we demonstrate that the proposed method outperforms other benchmark controllers regarding computation time without compromising operational performance.

DER↗

Risk-Constrained Reinforcement Learning for Inverter-Dominated Power System Controls

Here, this paper develops a risk-aware controller for grid-forming inverters (GFMs) to minimize large frequency oscillations in GFM inverter-dominated power systems. To tackle the high variability from loads/renewables, we incorporate a mean-variance risk constraint into the classical linear quadratic regulator (LQR) formulation for this problem. The risk constraint aims to bound the time-averaged cost of state variability and thus can improve the worst-case performance for large disturbances. The resulting risk-constrained LQR problem is solved through the dual reformulation to a minimax problem, by using a reinforcement learning (RL) method termed as stochastic gradient-descent with max-oracle (SGDmax). In particular, the zero-order policy gradient (ZOPG) approach is used to simplify the gradient estimation using simulated system trajectories. Numerical tests conducted on the IEEE 68-bus system have validated the convergence of our proposed SGDmax for GFM model and corroborate the effectiveness of the risk constraint in improving the worst-case performance while reducing the variability of the overall control cost.

Frequency control↗

Scalable Predictive Control and Optimization for Grid Integration of Large-Scale Distributed Energy Resources

Integrating a large number of distributed energy resources (DERs) into the power grid needs a scalable power balancing method. We formulate the power balancing problem as a look-ahead optimization problem to be solved sequentially by a power distribution system aggregator based on a model predictive control (MPC) framework. Solving large-scale look-ahead control problems requires proper configuration of the control steps. In this paper, to solve large-scale control problems, we propose a variable time granularity where control time steps nearby the current control step have finer resolutions. The aggregator objective includes maximization of power production revenue and minimization of power purchasing expense, renewable power curtailment, and mileage costs for energy storage and electric vehicle (EV) charging stations while satisfying system capacity and operational constraints. The control problem is formulated as a mixed-integer linear program (MILP) and solved using the XpressMP solver. We perform simulations considering a copper plate representation of a large distribution network consisting of 2507 devices (control-lable DERs), including curtailable photovoltaics (PVs), energy storage batteries, EV charging stations, and buildings with heating, ventilation, and air conditioning units (HVACs). We show the effectiveness of the proposed approach in managing DERs interactively for maximum energy trading profit and local supply-demand power balancing. Finally, we demonstrate that the proposed method outperforms other benchmark controllers regarding computation time without compromising operational performance.

DER↗

Scalable Predictive Control and Optimization for Grid Integration of Large-Scale Distributed Energy Resources: Preprint

Integration of a large number of distributed energy resources (DERs) into the power grid needs a scalable power balancing method. We formulate the power balancing problem as a look-ahead optimization problem to be solved sequentially by a power distribution system aggregator based on a model predictive control (MPC) framework. Solving large-scale look-ahead control problem requires proper configuration of the control steps. In this paper, to solve large-scale control problems, we propose a variable time granularity where control time steps nearby the current control step have finer resolutions. The aggregator objective includes maximization of power production revenue and minimization of power purchasing expense, renewable power curtailment, and mileage costs for energy storage and electric vehicle (EV) charging stations while satisfying system capacity and operational constraints. The control problem is formulated as a mixed-integer linear program (MILP) and solved using the XpressMP solver. We perform simulations considering a copper plate representation of a large distribution network consisting of 2507 devices (controllable DERs) including curtailable photovoltaics (PVs), energy storage batteries, EV charging stations, and buildings with heating, ventilation, and air conditioning units (HVACs). We show the effectiveness of the proposed approach in managing DERs interactively for maximum energy trading profit and local supply-demand power balancing. Finally, we demonstrate that the proposed method outperformed other benchmark controllers regarding computation time without compromising operational performance.

DER↗

Quark and gluon two-loop beam functions for leading-jet p T and slicing at NNLO

We compute the complete set of two-loop beam functions for the transverse momentum distribution of the leading jet produced in association with an arbitrary colour-singlet system. Our results constitute the last missing ingredient for the calculation of the jet-vetoed cross section at small veto scales at the next-to-next-to-leading order, as well as an important ingredient for its resummation to next-to-next-to-next-to-leading logarithmic order. Our calculation is performed in the soft-collinear effective theory framework with a suitable regularisation of the rapidity divergences occurring in the phase-space integrals. We discuss the occurrence of soft-collinear mixing terms that might violate the factorisation theorem, and demonstrate that they are naturally absorbed into the beam functions at two loops in the exponential rapidity regularisation scheme when performing a multipole expansion of the measurement function. As in our recent computation of the two-loop soft function, we present the results as a Laurent expansion in the jet radius R. We provide analytic expressions for all flavour channels in x space with the exception of a set of R-independent non-logarithmic terms that are given as numerical grids. We also perform a fully numerical calculation with exact R dependence, and find that it agrees with our analytic expansion at the permyriad level or better. Our calculation allows us to define a next-to-next-to-leading order slicing method using the leading-jet p T as a slicing variable. As a check of our results, we carry out a calculation of the Higgs and Z boson total production cross sections at the next-to-next-to-leading order in QCD.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Quantification of Physical and Numerical Mixing in a Coastal Ocean Model Using Salinity Variance Budgets

Numerical mixing, the spurious mixing primarily generated by the discretization of advection, is often significant in estuarine and coastal models due to sharp, energetic fronts. In this study, we compare on- and offline estimates of numerical mixing in a submesoscale-resolving realistic simulation of the ocean state over the Texas-Louisiana continental shelf. While offline estimates of numerical mixing differ from online estimates, offline methods may be the only analysis available. This study offers insight into the differences between the on- and offline methods. We use two methods to estimate numerical mixing offline, based on salinity squared $s^2$ and volume-mean salinity variance $s^{\prime^2}$. Numerical mixing estimated from the $s^{\prime^2}$ budget is generally within 60\% of the magnitude for the online method but captures the temporal variability well. However, the $s^2$ budget compares poorly due to larger truncation errors associated with the tendency and advection terms, which can be reduced by increasing the model output frequency. We also investigate the effects of horizontal resolution on numerical mixing using a two-way nested grid. The volume-integrated numerical mixing constitutes 57\% of the bulk physical mixing -- the mixing prescribed by the turbulence closure scheme -- in the coarse model and may exceed the physical mixing by half an order of magnitude. We find that numerical mixing is reduced by 35\% on average in the nested model, less than expected based on scaling of the numerical mixing for an upwind advection scheme, likely due to new dynamical processes that emerge in the nested simulation.

54 ENVIRONMENTAL SCIENCES↗

Recent developments in FEM-CFD

The current status of CFD with regard to unstructured grids employing finite element methods and Eulerian frames is reviewed. Algorithms suitable for the computation of large three-dimensional problems involving flow past arbitrary geometries are developed. Adaptive mesh refinement strategy is reviewed, and domain splitting or local time-stepping are briefly addressed. The development of search algorithms of optimal order, variable time-stepping Jacobi smoothers for elliptic problems, and transport concepts for hyperbolics to help achieve good performance for unstructured multigrid processes is discussed. As examples, transient supersonic flow in a channel, regular shock reflection of a wall, viscous flow past a protruberance, potential flow past a cylinder, and Burgers equation are considered.

Loehner, R.↗