Search NASA⌕ Search

SEARCH · Search NASA

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 919 records · Page 51

A fast reduced model for a shell-and-tube based latent heat thermal energy storage heat exchanger and its application for cost optimal design by nonlinear programming

Numerical simulation of latent heat thermal energy storage (LHTES) systems plays a fundamental role in studying the physical process and guiding the engineering design. Discretization of the PDEs describing the nonlinear solidification/melting process of phase change materials (PCMs) leads to a large-scale complex dynamics system, where the system behavior depends on a set of parameters. In a design setting, repeated model evaluations are required over the set of parameters results in significant computational burden. In this paper, an explicit analytic solution was built for the propagation of the solidification front in a cylindrical coordinate. The analytic solution approach is further employed to develop a low computational reduced model (RM) as a module for a shell-and-tube based LHTES heat exchanger. The levelized Cost of Energy (LCOE) is used as a design metric and the RM model is used to apply system-level constraints in the nonlinear programming formulation that facilitates efficient global optimal design of the PCM properties, flow conditions and tube geometries. The use of LCOE as the design metric prevents over design of the heat transfer rate and also establishes a fair ground for evaluation of different thermal storage technologies and their integrated applications with other systems. Optimal results showed that a higher effectiveness results in a higher LCOE; the velocity of the HTF and the length of the channel are highly correlated with each other; both larger PCM latent energy and conductivity result in lower LCOE.

25 ENERGY STORAGE↗

Optimal 1D Ly α forest power spectrum estimation – I. DESI-lite spectra

ABSTRACT The 1D Ly α forest flux power spectrum P1D is sensitive to scales smaller than a typical galaxy survey, and hence ties to the intergalactic medium’s thermal state, suppression from neutrino masses, and new dark matter models. It has emerged as a competitive framework to study new physics, but also has come with various challenges and systematic errors in analysis. In this work, we revisit the optimal quadratic estimator for P1D, which is robust against the relevant problems such as pixel masking, time evolution within spectrum, and quasar continuum errors. We further improve the estimator by introducing a fiducial power spectrum, which enables us to extract more information by alleviating the discreteness of band powers. We meticulously apply our method to synthetic Dark Energy Spectroscopic Instrument (DESI) spectra and demonstrate how the estimator overcomes each challenge. We further apply an optimization scheme that approximates the Fisher matrix to three elements per row and reduces computation time by 60 per cent. We show that we can achieve per cent precision in P1D with 5-yr DESI data in the absence of systematics and provide forecasts for different spectral qualities.

79 ASTRONOMY AND ASTROPHYSICS↗

Path optimization by a variational reaction coordinate method. I. Development of formalism and algorithms

The development of algorithms to optimize reaction pathways between reactants and products is an active area of study. Existing algorithms typically describe the path as a discrete series of images (chain of states) which are moved downhill toward the path, using various reparameterization schemes, constraints, or fictitious forces to maintain a uniform description of the reaction path. The Variational Reaction Coordinate (VRC) method is a novel approach that finds the reaction path by minimizing the variational reaction energy (VRE) of Quapp and Bofill. The VRE is the line integral of the gradient norm along a path between reactants and products and minimization of VRE has been shown to yield the steepest descent reaction path. In the VRC method, we represent the reaction path by a linear expansion in a set of continuous basis functions and find the optimized path by minimizing the VRE with respect to the linear expansion coefficients. Improved convergence is obtained by applying constraints to the spacing of the basis functions and coupling the minimization of the VRE to the minimization of one or more points along the path that correspond to intermediates and transition states. The VRC method is demonstrated by optimizing the reaction path for the Müller-Brown surface and by finding a reaction path passing through 5 transition states and 4 intermediates for a 10 atom Lennard-Jones cluster.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Inverse point source location with the Helmholtz equation on a bounded domain

The problem of recovering acoustic sources, more specifically monopoles, from point-wise measurements of the corresponding acoustic pressure at a limited number of frequencies is addressed. To this purpose, a family of sparse optimization problems in measure space in combination with the Helmholtz equation on a bounded domain is considered in this study. A weighted norm with unbounded weight near the observation points is incorporated into the formulation. Optimality conditions and conditions for recovery in the small noise case are discussed, which motivates concrete choices of the weight. The numerical realization is based on an accelerated conditional gradient method in measure space and a finite element discretization.

97 MATHEMATICS AND COMPUTING↗

Optimal net-load balancing in smart grids with high PV penetration

Mitigating mismatches in supply demand curve is critical for smooth power grid operation. Traditionally, load curtailment techniques such as Demand Response (DR) have been used for this purpose. However, smart grids with high PV penetration sometimes exhibit supply surplus causing over-voltages. Thus, load curtailment techniques cannot be the only component of a net-load balancing framework. Supply curtailment techniques such as Volt-Var Optimizations are complex and computationally expensive. This increases the complexity of net-load balancing systems used by the grid operator and limits their scalability. Recently, new technologies have been developed that enable the rapid and selective connection of PV modules of an installation to the grid. Taking advantage of these advancements, we develop a unified optimal net-load balancing framework which performs both load and solar curtailment. We show that when the available curtailment values are discrete, this problem is NP-hard and develop bounded approximation algorithms for minimizing the curtailment cost. Our algorithms produce fast solutions, given the tight timing constraints required for grid operation. We also incorporate the notion of fairness to ensure that curtailment is evenly distributed among all the nodes. Finally, we develop an online algorithm which performs net-load balancing using only data available for the current interval. Using both theoretical analysis and practical evaluations, we show that our net-load balancing algorithms provide solutions which are close to optimal in a small amount of time.

14 SOLAR ENERGY↗

Optimal constraints on local primordial non-Gaussianity from the two-point statistics of large-scale structure

One of the main signatures of primordial non-Gaussianity of the local type is a scale-dependent correction to the bias of large-scale structure tracers such as galaxies or clusters, whose amplitude depends on the bias of the tracers itself. The dominant source of noise in the power spectrum of the tracers is caused by sampling variance on large scales (where the non-Gaussian signal is strongest) and shot noise arising from their discrete nature. Recent work has argued that one can avoid sampling variance by comparing multiple tracers of different bias, and suppress shot noise by optimally weighting halos of different mass. Here we combine these ideas and investigate how well the signatures of non-Gaussian fluctuations in the primordial potential can be extracted from the two-point correlations of halos and dark matter. On the basis of large N-body simulations with local non-Gaussian initial conditions and their halo catalogs we perform a Fisher matrix analysis of the two-point statistics. Compared to the standard analysis, optimal weighting and multiple-tracer techniques applied to halos can yield up to 1 order of magnitude improvements in f{sub NL}-constraints, even if the underlying dark matter density field is not known. In this case one needs to resolve all halos down to 10{sup 10}h{sup -1}M{sub sun} at z=0, while with the dark matter this is already achieved at a mass threshold of 10{sup 12}h{sup -1}M{sub sun}. We compare our numerical results to the halo model and find satisfactory agreement. Forecasting the optimal f{sub NL}-constraints that can be achieved with our methods when applied to existing and future survey data, we find that a survey of 50h{sup -3} Gpc{sup 3} volume resolving all halos down to 10{sup 11}h{sup -1}M{sub sun} at z=1 will be able to obtain {sigma}{sub f{sub N{sub L}}}{approx}1 (68% cl), a factor of {approx}20 improvement over the current limits. Decreasing the minimum mass of resolved halos, increasing the survey volume or obtaining the dark matter maps can further improve these limits, potentially reaching the level of {sigma}{sub f{sub N{sub L}}}{approx}0.1. This precision opens up the possibility to distinguish different types of primordial non-Gaussianity and to probe inflationary physics of the very early Universe.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Enhancement of flow measurements using fluid-dynamic constraints

Novel experimental modalities acquire spatially resolved velocity measurements for steady state and transient flows which are of interest for engineering and biological applications. One of the drawbacks of such high resolution velocity data is their susceptibility to measurement errors. In this paper, we propose a novel filtering strategy that allows enhancement of the noisy measurements to obtain reconstruction of smooth divergence free velocity and corresponding pressure fields which together approximately comply to a prescribed flow model. The main step in our approach consists of the appropriate use of the velocity measurements in the design of a linearized flow model which can be shown to be well-posed and consistent with the true velocity and pressure fields up to measurement and modeling errors. The reconstruction procedure is then formulated as an optimal control problem for this linearized flow model. The resulting filter has analyzable smoothing and approximation properties. We briefly discuss the discretization of the approach by finite element methods and comment on the efficient solution by iterative methods. The capability of the proposed filter to significantly reduce data noise is demonstrated by numerical tests including the application to experimental data. In addition, we compare with other methods like smoothing and solenoidal filtering.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Applying Squeaky-Wheel Optimization Schedule Airborne Astronomy Observations

We apply the Squeaky Wheel Optimization (SWO) algorithm to the problem of scheduling astronomy observations for the Stratospheric Observatory for Infrared Astronomy, an airborne observatory. The problem contains complex constraints relating the feasibility of an astronomical observation to the position and time at which the observation begins, telescope elevation limits, special use airspace, and available fuel. Solving the problem requires making discrete choices (e.g. selection and sequencing of observations) and continuous ones (e.g. takeoff time and setting up observations by repositioning the aircraft). The problem also includes optimization criteria such as maximizing observing time while simultaneously minimizing total flight time. Previous approaches to the problem fail to scale when accounting for all constraints. We describe how to customize SWO to solve this problem, and show that it finds better flight plans, often with less computation time, than previous approaches.

Frank, Jeremy↗

SU-E-T-626: Practical Method to Implement Arc Therapy Using Scanned Particle Beams

Purpose: The purpose of this study was to propose a method to implement arc therapy that is compatible with existing particle therapy systems having gantries and pencil-beam scanning capacities. Furthermore, we sought to demonstrate expected benefits of this method for selected clival chordoma patients. Methods: We propose that a desired particle arc treatment plan can be discretized into a finite number of fixed beams and that only one (or a subset) of these beams be delivered in any single treatment fraction; the target should receive uniform dose during each fraction. For 3 clival-chordoma patients, robust-optimized, scanned proton beams were simulated to deliver 78 Gy (RBE) to clinical target volumes (CTVs), using either a single-field plan with a posterior-anterior (PA) beam or a discrete-arc plan with 16 beams that were equally spaced throughout a 360-degree axial arc. Dose-volume metrics were compared with emphasis on the brainstem, since risk of radiation necrosis there can often restrict application of tumoricidal doses for chordomas. Results: The mean volume of brainstem receiving a dose of 60 Gy (RBE) or higher (V60Gy) was 10.3±0.9 cm{sup 3} for the single-field plan and 4.7±1.8 cm{sup 3} for the discrete-arc plan, a reduction of 55% in favor of arcs. The mean dose to the brainstem was also reduced using arcs, by 18%, while the maximum dose was nearly identical for both methods. For the whole brain, V60Gy was reduced by 23%, in favor of arcs. Mean dose to the CTVs were nearly identical for both strategies, within 0.3%. Conclusion: Discrete arc treatments can be implemented using existing scanned particle-beam facilities. Aside from the physical advantages, the biological uncertainties of particle therapy, particularly high in the distal edge, can be reduced by arc therapy via rotational smearing, which may be of benefit for tumors near the brainstem.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Reinforcement learning in discrete action space applied to inverse defect design

Abstract Reinforcement learning (RL) algorithms that include Monte Carlo Tree Search (MCTS) have found tremendous success in computer games such as Go, Shiga and Chess. Such learning algorithms have demonstrated super-human capabilities in navigating through an exhaustive discrete action search space. Motivated by their success in computer games, we demonstrate that RL can be applied to inverse materials design problems. We deploy RL for a representative case of the optimal atomic scale inverse design of extended defects via rearrangement of chalcogen (e.g. S) vacancies in 2D transition metal dichalcogenides (e.g. MoS 2 ). These defect rearrangements and their dynamics are important from the perspective of tunable phase transition in 2D materials i.e. 2H (semi-conducting) to 1T (metallic) in MoS 2 . We demonstrate the ability of MCTS interfaced with a reactive molecular dynamics simulator to efficiently sample the defect phase space and perform inverse design—starting from randomly distributed S vacancies, the optimal defect rearrangement of defects corresponds a line defect of S vacancies. We compare MCTS performance with evolutionary optimization i.e. genetic algorithms and show that MCTS converges to a better optimal solution (lower objective) and in fewer evaluations compared to GA. We also comprehensively evaluate and discuss the effect of MCTS hyperparameters on the convergence to solution. Overall, our study demonstrates the effectives of using RL approaches that operate in discrete action space for inverse defect design problems.

42 ENGINEERING↗

Memristor design rules for dynamic learning and edge processing applications

The ability to dynamically learn and adapt to changes in the environment is one of the hallmarks of biological systems. In this work, we identify the subset of the design space of memristive materials that is optimal for dynamic learning applications. Using an architecture inspired on the learning center of the insect brain, we implement a model system consisting of a discrete implementation of spiking neurons where dynamic learning takes place on a set of plastic synapses formed by memristor pairs in a crossbar array. Using two separate benchmarks, one comprising the dynamic learning of the Modified National Institute of Standards and Technology dataset and another one targeting one shot learning, we have identified the key properties that memristive materials should have to be optimal dynamic learners. The results obtained show that a fine degree of control of the memristor internal state is key to achieve high classification accuracy during dynamic learning but that within this optimal region learning is extremely robust both to device variability and to errors in the writing of the internal state, in all cases allowing for 2 sigma variations greater than 40% without significant loss of accuracy, hence overcoming two of the perceived limitations of memristors. By additionally requiring that learning takes place concurrently to information processing, we are able to derive a set constraints to the memristor dynamics.

36 MATERIALS SCIENCE↗

Edge‐Driven Fringe‐Field Effects, Reduced Screening, and Bandgap Widening in Graphene Nanoribbons Enable Single‑Molecule Sensitivity

Graphene nanoribbons (GNRs) offer promising platforms for single‐molecule sensing due to their quasi‐1D channels and discrete electronic states, providing superior sensitivity toward molecular perturbations. While prior studies emphasize smoother edges as essential for optimal performance, the potential benefits of controlled edge roughness remain largely unexplored. Additionally, most investigations focus on GNR arrays, leaving critical edge‐ and width‐dependent factors, including fringe fields, bandgap widening, interactions between adsorbing molecules and GNR atoms, density of states (DOS) suppression, and electrostatic screening lengths, and their collective impact on sensitivity, poorly understood. Here, in this work, we fabricated field‐effect transistors using individual GNRs (widths: 200–20 nm) and characterized their response to molecular adsorption with perfluorooctanoic acid as the model analyte. Narrower ribbons displayed significantly enhanced sensitivity, yielding a coverage‐normalized response of 116 ± 10 mV per molecule in 20 nm‐wide GNRs (from calibrated ensemble Dirac‐point shifts). Experimental and theoretical analyses reveal that this heightened sensitivity arises from stronger fringe fields, width‐dependent quantum confinement effects, reduced DOS, and increased edge roughness that facilitates molecular anchoring, enhanced orbital overlap, and improved charge transfer efficiency. Our findings challenge the conventional assumption that smoother edges inherently enhance sensor performance, demonstrating that controlled edge disorder substantially boosts molecular sensitivity in GNR sensors.

36 MATERIALS SCIENCE↗

GrainNN: A neighbor-aware long short-term memory network for predicting microstructure evolution during polycrystalline grain formation

High fidelity simulations of grain formation in alloys are an indispensable tool for process-to-mechanical-properties characterization. Such simulations, however, can be computationally expensive as they require fine spatial and temporal discretizations. Their cost becomes an obstacle to parametric studies and ensemble runs and ultimately makes downstream tasks like optimal control and uncertainty quantification challenging. To enable such downstream tasks, we introduce GrainNN, an efficient and accurate reduced-order model for epitaxial grain growth in additive manufacturing conditions. GrainNN is a sequence-to-sequence long-short-term-memory (LSTM) deep neural network that evolves the dynamics of manually crafted features. Its innovations are (1) an attention mechanism with grain-microstructure-specific transformer architecture; and (2) an overlapping combination of several clones of the network to generalize to grain configurations that are different from those used for training. This design enables GrainNN to predict grain formation for unseen physical parameters, grain number, domain size and geometry. Furthermore, GrainNN not only reconstructs the quantities of interest but also can be pointwise accurate. In our numerical experiments, we use a polycrystalline phase field method to both generate the training data and assess GrainNN. For multiparametric, ensemble simulations with many grains, GrainNN can be orders of magnitude faster than phase field simulations, while delivering 5%–15% pointwise error. Additionally, this speedup includes the cost of the phase field simulations for generating training data.

36 MATERIALS SCIENCE↗

The nonconforming Virtual Element Method for eigenvalue problems

In this work, we analyse the nonconforming Virtual Element Method (VEM) for the approximation of elliptic eigenvalue problems. The nonconforming VEM allows to treat in the same formulation the two- and three-dimensional case. We present two possible formulations of the discrete problem, derived respectively by the nonstabilized and stabilized approximation of the $L^2$-inner product, and we study the convergence properties of the corresponding discrete eigenvalue problem. The proposed schemes provide a correct approximation of the spectrum, in particular we prove optimal-order error estimates for the eigenfunctions and the usual double order of convergence of the eigenvalues. Finally we show a large set of numerical tests supporting the theoretical results, including a comparison with the conforming Virtual Element choice.

97 MATHEMATICS AND COMPUTING↗

Performance of particle in cell methods on highly concurrent computational architectures

Particle in cell (PIC) methods are effective in computing Vlasov-Poisson system of equations used in simulations of magnetic fusion plasmas. PIC methods use grid based computations, for solving Poisson’s equation or more generally Maxwell’s equations, as well as Monte-Carlo type methods to sample the Vlasov equation. The presence of two types of discretizations, deterministic field solves and Monte-Carlo methods for the Vlasov equation, pose challenges in understanding and optimizing performance on today large scale computers which require high levels of concurrency. These challenges arises from the need to optimize two very different types of processes and the interactions between them. Modern cache based high-end computers have very deep memory hierarchies and high degrees of concurrency which must be utilized effectively to achieve good performance. The effective use of these machines requires maximizing concurrency by eliminating serial or redundant work and minimizing global communication. A related issue is minimizing the memory traffic between levels of the memory hierarchy because performance is often limited by the bandwidths and latencies of the memory system. This paper discusses some of the performance issues, particularly in regard to parallelism, of PIC methods. The gyrokinetic toroidal code (GTC) is used for these studies and a new radial grid decomposition is presented and evaluated. Scaling of the code is demonstrated on ITER sized plasmas with up to 16K Cray XT3/4 cores.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A Least-Squares-Based Weak Galerkin Finite Element Method for Second Order Elliptic Equations

Here, in this article, we introduce a least-squares-based weak Galerkin finite element method for the second order elliptic equation. This new method is shown to provide very accurate numerical approximations for both the primal and the flux variables. In contrast to other existing least-squares finite element methods, this new method allows us to use discontinuous approximating functions on finite element partitions consisting of arbitrary polygon/polyhedron shapes. We also develop a Schur complement algorithm for the resulting discretization problem by eliminating all the unknowns that represent the solution information in the interior of each element. Optimal order error estimates for both the primal and the flux variables are established. An extensive set of numerical experiments are conducted to demonstrate the robustness, reliability, flexibility, and accuracy of the least-squares-based weak Galerkin finite element method. Finally, the numerical examples cover a wide range of applied problems, including singularly perturbed reaction-diffusion equations and the flow of fluid in porous media with strong anisotropy and heterogeneity.

nite element methods↗

Performance of particle in cell methods on highly concurrent computational architectures

Particle in cell (PIC) methods are effective in computing Vlasov-Poisson system of equations used in simulations of magnetic fusion plasmas. PIC methods use grid based computations, for solving Poisson’s equation or more generally Maxwell’s equations, as well as Monte-Carlo type methods to sample the Vlasov equation. The presence of two types of discretizations, deterministic field solves and Monte-Carlo methods for the Vlasov equation, pose challenges in understanding and optimizing performance on today large scale computers which require high levels of concurrency. These challenges arises from the need to optimize two very different types of processes and the interactions between them. Modern cache based high-end computers have very deep memory hierarchies and high degrees of concurrency which must be utilized effectively to achieve good performance. The effective use of these machines requires maximizing concurrency by eliminating serial or redundant work and minimizing global communication. A related issue is minimizing the memory traffic between levels of the memory hierarchy because performance is often limited by the bandwidths and latencies of the memory system. This paper discusses some of the performance issues, particularly in regard to parallelism, of PIC methods. The gyrokinetic toroidal code (GTC) is used for these studies and a new radial grid decomposition is presented and evaluated. Scaling of the code is demonstrated on ITER sized plasmas with up to 16K Cray XT3/4 cores.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

PROBABILISTIC CROSS-IDENTIFICATION IN CROWDED FIELDS AS AN ASSIGNMENT PROBLEM

One of the outstanding challenges of cross-identification is multiplicity: detections in crowded regions of the sky are often linked to more than one candidate associations of similar likelihoods. We map the resulting maximum likelihood partitioning to the fundamental assignment problem of discrete mathematics and efficiently solve the two-way catalog-level matching in the realm of combinatorial optimization using the so-called Hungarian algorithm. We introduce the method, demonstrate its performance in a mock universe where the true associations are known, and discuss the applicability of the new procedure to large surveys.

79 ASTRONOMY AND ASTROPHYSICS↗