Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “discrete optimization”

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,081 records · Page 60

Compiler-based code generation and autotuning for geometric multigrid on GPU-accelerated supercomputers

GPUs, with their high bandwidths and computational capabilities are an increasingly popular target for scientific computing. Unfortunately, to date, harnessing the power of the GPU has required use of a GPU-specific programming model like CUDA, OpenCL, or OpenACC. Thus, in order to deliver portability across CPU-based and GPU-accelerated supercomputers, programmers are forced to write and maintain two versions of their applications or frameworks. In this paper, we explore the use of a compiler-based autotuning framework based on CUDA-CHiLL to deliver not only portability, but also performance portability across CPU- and GPU-accelerated platforms for the geometric multigrid linear solvers found in many scientific applications. We also show that with autotuning we can attain near Roofline (a performance bound for a computation and target architecture) performance across the key operations in the miniGMG benchmark for both CPU- and GPU-based architectures as well as for a multiple stencil discretizations and smoothers. We show that our technology is readily interoperable with MPI resulting in performance at scale equal to that obtained via hand-optimized MPI+CUDA implementation.

97 MATHEMATICS AND COMPUTING↗

A Fast All-sky Radiation Model for Solar applications with Narrowband Irradiances on Tilted surfaces (FARMS-NIT): Part II. The cloudy-sky model

The Fast All-sky Radiation Model for Solar applications with Narrowband Irradiances on Tilted surfaces (FARMS-NIT) reported in Part I of this report is enhanced to include the requirements for cloudy-sky conditions. Surface radiances in 2002 narrow-wavelength bands from 0.28 to 4.0 um are analytically computed by solving the radiative transfer equation for five independent photon paths accounting for clear-sky absorption, Rayleigh scattering, and cloud absorption and scattering. The Simple Model of the Atmospheric Radiative Transfer of Sunshine (SMARTS) is used to show the optical thickness of the clear-sky atmosphere. Unlike Part I, which approximates the computation of aerosol scattering using the single-scattering phase function, the cloud transmittance and reflectance are efficiently retrieved from a comprehensive look-up table pre-computed by a 32-stream DIScrete Ordinates Radiative Transfer (DISORT) model for possible cloud conditions as well as solar and viewing geometries. A resolution assessment is performed to observe the optimal balance between the computational efficiency and accuracy in the development of the look-up table. Model simulations by DISORT and TMYSPEC are used to evaluate the performance of FARMS-NIT under cloudy-sky conditions. Compared to DISORT, FARMS-NIT yields 2-3% uncertainties on average, but it substantially reduces the computational time because of the independent computation of cloud properties and the implementation of the look-up table. In contrast to TMYSPEC, which uses successive steps to empirically compute plane-of-array (POA) irradiances and spectral irradiances, FARMS-NIT directly solves spectral radiances from the radiative transfer equation, which profoundly increases the accuracy in surface irradiances, especially over inclined photovoltaics (PV) panels.

14 SOLAR ENERGY↗

An application of different dioids in public key cryptography

Dioids provide a natural framework for analyzing a broad class of discrete event dynamical systems such as the design and analysis of bus and railway timetables, scheduling of high-throughput industrial processes, solution of combinatorial optimization problems, the analysis and improvement of flow systems in communication networks. They have appeared in several branches of mathematics such as functional analysis, optimization, stochastic systems and dynamic programming, tropical geometry, fuzzy logic. In this paper we show how to involve dioids in public key cryptography. The main goal is to create key – exchange protocols based on dioids. Additionally the digital signature scheme is presented.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Further improvements in the understanding of isotropic loop quantum cosmology

The flat, homogeneous, and isotropic universe with a massless scalar field is a paradigmatic model in loop quantum cosmology. In spite of the prominent role that the model has played in the development of this branch of physics, there still remain some aspects of its quantization which deserve a more detailed discussion. These aspects include the kinematical resolution of the cosmological singularity, the precise relation between the solutions of the densitized and nondensitized versions of the quantum Hamiltonian constraint, the possibility of identifying superselection sectors which are as simple as possible, and a clear comprehension of the Wheeler-DeWitt (WDW) limit associated with the theory in those sectors. We propose an alternative operator to represent the Hamiltonian constraint which is specially suitable to deal with all these issues in a detailed and satisfactory way. In particular, with our constraint operator, the singularity decouples in the kinematical Hilbert space and can be removed already at this level. Thanks to this fact, we can densitize the quantum Hamiltonian constraint in a well-controlled manner. Additionally, together with the physical observables, this constraint superselects simple sectors for the universe volume, with a discrete support contained in a single semiaxis of the real line and for which the basic functions that encode the information about the geometry possess optimal physical properties. Namely, they provide a no-boundary description around the cosmological singularity and admit a well-defined WDW limit in terms of standing waves. Both properties explain the presence of a generic quantum bounce replacing the classical singularity at a fundamental level, in contrast with previous studies where the bounce was proved in concrete regimes - focusing on states with a marked semiclassical behavior - or for a simplified model.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Synchronous and Concurrent Multidomain Computing Method for Cloud Computing Platforms

We present a numerical method for synchronous and concurrent solution of transient elastodynamics problem where the computational domain is divided into subdomains that may reside on separate computational platforms. Here, this work employs the variational multiscale discontinuous Galerkin (VMDG) method to develop interdomain transmission conditions for transient problems. The fine-scale modeling concept leads to variationally consistent coupling terms at the common interfaces. The method admits a large class of time discretization schemes, and decoupling of the solution for each subdomain is achieved by selecting any explicit algorithm. Numerical tests with a manufactured solution problem show optimal convergence rates. The energy history in a free vibration problem is in agreement with that of the solution from a monolithic computational domain.

97 MATHEMATICS AND COMPUTING↗

Automated vehicle guidance using discrete reference markers

Techniques for providing steering control for an automated vehicle using discrete reference markers fixed to the road surface are investigated analytically. Either optical or magnetic approaches can be used for the sensor, which generates a measurement of the lateral offset of the vehicle path at each marker to form the basic data for steering control. Possible mechanizations of sensor and controller are outlined. Techniques for handling certain anomalous conditions, such as a missing marker, or loss of acquisition, and special maneuvers, such as u-turns and switching, are briefly discussed. A general analysis of the vehicle dynamics and the discrete control system is presented using the state variable formulation. Noise in both the sensor measurement and in the steering servo are accounted for. An optimal controller is simulated on a general purpose computer, and the resulting plots of vehicle path are presented. Parameters representing a small multipassenger tram were selected, and the simulation runs show response to an erroneous sensor measurement and acquisition following large initial path errors.

Johnston, A. R.↗

Multi-Parent Clustering Algorithms from Stochastic Grammar Data Models

We introduce a statistical data model and an associated optimization-based clustering algorithm which allows data vectors to belong to zero, one or several "parent" clusters. For each data vector the algorithm makes a discrete decision among these alternatives. Thus, a recursive version of this algorithm would place data clusters in a Directed Acyclic Graph rather than a tree. We test the algorithm with synthetic data generated according to the statistical data model. We also illustrate the algorithm using real data from large-scale gene expression assays.

Mjoisness, Eric↗

Merging Intelligent Systems Technologies with CFD Analysis Strategies: Prototype Development at NASA Ames

A collaborative team of researchers from fields of Computational Fluid Dynamics (CFD), fluid physics, computer architectures, and computer science and knowledge engineering have begun work on a prototype system that addresses several of industry's concerns in using NASA-developed CFD codes as part of the design cycle. A major problem exists in the application of CFD technologies within the aeronautics design cycle due primarily to misunderstandings in the ranges of applicability of the various solver codes or turbulence models. Features that arise during the CFD solution process need to be discriminated and recognized as actual flow features with physical support in the geometry and flow conditions of the problem being solved, or as numerical or non-physical errors arising from mis-application of solver code and its parameters, gridding strategies, or discretization. interpolations. The fundamental concept is to develop an intelligent computational system that can accept the engineer's definition of the problem and construct an optimal CFD solution. To do this requires capturing both the knowledge of how to apply the various CFD tools and how to adapt the application of those tools to flow structures as they evolve during the flow simulation. Embedded within this adaptive system approach is the additional desire to automatically identify and quantify the quality of resolution of the pertinent flow structures, be they genuine or error-induced, and then to adjust the solution strategy accordingly. This paper discusses the status of that prototyping effort.

Thompson, David E.↗

Wavelet Approximation in Data Assimilation

Estimation of the state of the atmosphere with the Kalman filter remains a distant goal because of high computational cost of evolving the error covariance for both linear and nonlinear systems. Wavelet approximation is presented here as a possible solution that efficiently compresses both global and local covariance information. We demonstrate the compression characteristics on the the error correlation field from a global two-dimensional chemical constituent assimilation, and implement an adaptive wavelet approximation scheme on the assimilation of the one-dimensional Burger's equation. In the former problem, we show that 99%, of the error correlation can be represented by just 3% of the wavelet coefficients, with good representation of localized features. In the Burger's equation assimilation, the discrete linearized equations (tangent linear model) and analysis covariance are projected onto a wavelet basis and truncated to just 6%, of the coefficients. A nearly optimal forecast is achieved and we show that errors due to truncation of the dynamics are no greater than the errors due to covariance truncation.

Tangborn, Andrew↗

A Fast All-Sky Radiation Model for Solar Applications with Narrowband Irradiances on Tilted Surfaces (FARMS-NIT): Part II. The Cloudy-Sky Model

The Fast All-sky Radiation Model for Solar applications with Narrowband Irradiances on Tilted surfaces (FARMSNIT) reported in Part I of this study is enhanced to include the requirements for cloudy-sky conditions. Surface radiances in 2002 narrow-wavelength bands from 0.28 to 4.0 μm are analytically computed by solving the radiative transfer equation for five independent photon paths accounting for clear-sky absorption, Rayleigh scattering, and cloud absorption and scattering. The Simple Model of the Atmospheric Radiative Transfer of Sunshine (SMARTS) is used to provide the optical thickness of the clear-sky atmosphere. Unlike Part I, which approximates the computation of aerosol scattering using the single-scattering phase function, the cloud transmittance and reflectance are efficiently retrieved from a comprehensive look-up table pre-computed by a 32-stream DIScrete Ordinates Radiative Transfer (DISORT) model for possible cloud conditions as well as solar and viewing geometries. A resolution analysis is performed to assess the optimal balance between the computational efficiency and accuracy in the development of the look-up table. Model simulations by DISORT and TMYSPEC are used to evaluate the performance of FARMS-NIT under cloudy-sky conditions. Compared to DISORT, FARMS-NIT yields 2–3% uncertainties on average, but it substantially reduces the computational time because of the independent computation of cloud properties and the implementation of the look-up table. In contrast to TMYSPEC, which uses successive steps to empirically compute plane-of-array (POA) irradiances and spectral irradiances, FARMS-NIT directly solves spectral radiances from the radiative transfer equation, which profoundly increases the accuracy in surface irradiances, especially over inclined photovoltaics (PV) panels.

Xie, Yu↗

Area Coverage Planning with 3-axis Steerable, 2D Framing Sensors

Existing algorithms for Agile Earth Observing Satellites((Lemaitre et al. 2002)) were largely created for 1D line sensors that acquire images in linear swaths. However, imaging satellites increasingly use 2D framing sensors (cameras) that capture discrete rectangular images. We describe tiling step-stare approaches that are more suited to rectangular image footprints than are 1D swath-based algorithms. Optimal area planning for these 2D framing instruments is an NPcomplete problem and intractable for large areas, so we present four approximation algorithms. Strategies are compared against a prior 2D framing instrument algorithm (Knight 2014) in three computational experiments. The impact of observer agility on schedule makespan is examined. Makespans vary more as observer agility decreases toward a critical point, then vary less after the critical point, suggesting a possible problem phase transition.

Chien, Steve↗

Deep Reinforcement Learning for Microgrid Cost Optimization Considering Load Flexibility

This paper proposes a novel Soft-Actor-Critic (SAC) based Deep Reinforcement Learning (DRL) method for optimizing the cost of microgrid operation by leveraging load flexibility. The proposed SAC-DRL method is designed to coordinate the control of distributed energy resources (DERs) and flexible load, addressing practical energy billing formation by power distribution utilities. Key contributions include an innovative reward function to mitigate sparse reward challenges and a mixed control strategy for discrete and continuous variables, ensuring radial network topology and minimizing power loss. We evaluate the proposed method on the model of a real microgrid located in Southern California, U.S.. The SAC-DRL model is tested to demonstrate its efficacy in reducing grid dependence, optimizing resource use, and minimizing costs. The results highlight the potential of DRL in modern energy systems, offering a sustainable and economically efficient solution for energy management in microgrids.

deep reinforcement learning↗

Hyper-fidelity depletion coupled with discrete pebble motion in pebble bed reactors

Pebble bed reactors have raised new interest during the past decade due to their attractive characteristics. Therefore, accurate simulations must be performed to better understand these systems and ensure optimal and safe designs. Most current methods use lower fidelity approaches with representative unit-cells or macro-zones with uniform fluxes, which have accuracy and flexibility limitations. A novel hyper-fidelity method for pebble bed reactors depletion is presented and internally couples Serpent 2 and a pseudo-motion routine. Pseudo-motion is applied handling vertical shifts of compositions in a static pebble bed, random reinsertion of used pebbles, insertion of fresh pebbles and used pebbles discarding. Associated with individual depletion to correctly determine the flux spectrum and composition in each pebble, this hyper-fidelity approach paves the way towards more accurate depletion calculation in pebble bed reactors. Using this method, a demonstration is completed on a small-scale reactor. In this application, the core reaches equilibrium, and the following data is extracted: core-wise parameters evolution, pebble-wise spatial and statistical distribution. Discarded pebbles are analyzed, and relevant information is shown. This work proves the feasibility of hyper fidelity depletion with Serpent 2, and the range of use for this method: reactor design and analysis for equilibrium and slow transients, lower fidelity methods validation and feeding fuel performance, thermal-hydraulics, or waste management models. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Investigation of Navier-Stokes Code Verification and Design Optimization

With rapid progress made in employing computational techniques for various complex Navier-Stokes fluid flow problems, design optimization problems traditionally based on empirical formulations and experiments are now being addressed with the aid of computational fluid dynamics (CFD). To be able to carry out an effective CFD-based optimization study, it is essential that the uncertainty and appropriate confidence limits of the CFD solutions be quantified over the chosen design space. The present dissertation investigates the issues related to code verification, surrogate model-based optimization and sensitivity evaluation. For Navier-Stokes (NS) CFD code verification a least square extrapolation (LSE) method is assessed. This method projects numerically computed NS solutions from multiple, coarser base grids onto a freer grid and improves solution accuracy by minimizing the residual of the discretized NS equations over the projected grid. In this dissertation, the finite volume (FV) formulation is focused on. The interplay between the xi concepts and the outcome of LSE, and the effects of solution gradients and singularities, nonlinear physics, and coupling of flow variables on the effectiveness of LSE are investigated. A CFD-based design optimization of a single element liquid rocket injector is conducted with surrogate models developed using response surface methodology (RSM) based on CFD solutions. The computational model consists of the NS equations, finite rate chemistry, and the k-6 turbulence closure. With the aid of these surrogate models, sensitivity and trade-off analyses are carried out for the injector design whose geometry (hydrogen flow angle, hydrogen and oxygen flow areas and oxygen post tip thickness) is optimized to attain desirable goals in performance (combustion length) and life/survivability (the maximum temperatures on the oxidizer post tip and injector face and a combustion chamber wall temperature). A preliminary multi-objective optimization study is carried out using a geometric mean approach. Following this, sensitivity analyses with the aid of variance-based non-parametric approach and partial correlation coefficients are conducted using data available from surrogate models of the objectives and the multi-objective optima to identify the contribution of the design variables to the objective variability and to analyze the variability of the design variables and the objectives. In summary the present dissertation offers insight into an improved coarse to fine grid extrapolation technique for Navier-Stokes computations and also suggests tools for a designer to conduct design optimization study and related sensitivity analyses for a given design problem.

Vaidyanathan, Rajkumar↗

Computational fluid dynamics simulations of a binary particle bed in a riser-based carbon stripper for chemical looping combustion

Chemical-looping combustion (CLC) is a next generation combustion technology that shows great promise as a solution for the need of high-efficiency low-cost carbon capture from fossil fueled power plants. In this paper, numerical simulations are conducted of a binary particle bed associated with a coal-direct CLC system consisting of coal (represented by plastic beads) and oxygen carrier particles and validated against an experimental riser-based carbon stripper. The detailed particle dynamics and solid-gas and solid-solid interactions are investigated using the Lagrangian particle-tracking approach known as the discrete element method coupled with the computational fluid dynamics solution for the flow field. The simulation results of the fluidization behavior and the separation ratio of the particles are in excellent agreement with the experiment. In conclusion, a credible simulation of a binary particle bed is of particular importance for understanding the details of the fluidization behavior; the baseline simulation established in this work can be used as a tool for designing and optimizing the performance of such systems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Optimized Uncertainty Quantification Algorithm Within a Dynamic Event Tree Framework

Methods for developing Phenomenological Identification and Ranking Tables (PIRT) for nuclear power plants have been a useful tool in providing insight into modelling aspects that are important to safety. These methods have involved expert knowledge with regards to reactor plant transients and thermal-hydraulic codes to identify are of highest importance. Quantified PIRT provides for rigorous method for quantifying the phenomena that can have the greatest impact. The transients that are evaluated and the timing of those events are typically developed in collaboration with the Probabilistic Risk Analysis. Though quite effective in evaluating risk, traditional PRA methods lack the capability to evaluate complex dynamic systems where end states may vary as a function of transition time from physical state to physical state . Dynamic PRA (DPRA) methods provide a more rigorous analysis of complex dynamic systems. A limitation of DPRA is its potential for state or combinatorial explosion that grows as a function of the number of components; as well as, the sampling of transition times from state-to-state of the entire system. This paper presents a method for performing QPIRT within a dynamic event tree framework such that timing events which result in the highest probabilities of failure are captured and a QPIRT is performed simultaneously while performing a discrete dynamic event tree evaluation. The resulting simulation results in a formal QPIRT for each end state. The use of dynamic event trees results in state explosion as the number of possible component states increases. This paper utilizes a branch and bound algorithm to optimize the solution of the dynamic event trees. The paper summarizes the methods used to implement the branch-and-bound algorithm in solving the discrete dynamic event trees.

42 ENGINEERING↗

A hybridized discontinuous Galerkin method on mapped deforming domains

Here in this paper we present a hybridized discontinuous Galerkin (HDG) discretization for unsteady simulations of convection-dominated flows on mapped deforming domains. Mesh deformation is achieved through an arbitrary Lagrangian-Eulerian transformation with an analytical mapping. We present details of this transformation applied to the HDG system of equations, with focus on the auxiliary gradient equation, viscous stabilization, and output calculation. We discuss conditions under which optimal unsteady output convergence rates can be attained, and we show that both HDG and discontinuous Galerkin (DG) achieve these rates in advection-dominated flows. Results for scalar advection-diffusion and the Euler equations verify the implementation of the mesh motion mapping for both discretizations, show that HDG and DG yield similar results on a given mesh, and demonstrate differences in output convergence rates depending on the choice of HDG viscous stabilization. We note that such similar results bode well for HDG, which has fewer globally-coupled degrees of freedom compared to DG. A simulation of the unsteady compressible Navier-Stokes equations demonstrates again very similar results for HDG and DG and illustrates a pitfall of using steady-state adapted meshes for accurate unsteady simulations.

42 ENGINEERING↗

Computing the Feasible Spaces of Optimal Power Flow Problems

The solution to an optimal power flow (OPF) problem provides a minimum cost operating point for an electric power system. The performance of OPF solution techniques strongly depends on the problem’s feasible space. This paper presents an algorithm that is guaranteed to compute the entire feasible spaces of small OPF problems to within a specified discretization tolerance. Specifically, the feasible space is computed by discretizing certain of the OPF problem’s inequality constraints to obtain a set of power flow equations. All solutions to the power flow equations at each discretization point are obtained using the Numerical Polynomial Homotopy Continuation (NPHC) algorithm. To improve computational tractability, “bound tightening” and “grid pruning” algorithms use convex relaxations to preclude consideration of many discretization points that are infeasible for the OPF problem. Here, the proposed algorithm is used to generate the feasible spaces of two small test cases.

24 POWER TRANSMISSION AND DISTRIBUTION↗