Search NASA⌕ Search

SEARCH · Search NASA

Results for “generalized algorithm”

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 325 records · Page 18

VALIDATION AND RESULTS OF A PSEUDO-MULTI-ZONE COMBUSTION TRAJECTORY PREDICTION MODEL FOR CAPTURING SOOT AND NOX FORMATION ON A MEDIUM DUTY DIESEL ENGINE

A pseudo-multi-zone phenomenological model has been created with the ultimate goal of supporting efforts to enable broader commercialization of low temperature combustion modes in diesel engines. The benefits of low temperature combustion are the simultaneous reduction in soot and nitric oxide emissions and increased engine efficiency if combustion is properly controlled. Determining what qualifies as low temperature combustion for any given engine can be difficult without expensive emissions analysis equipment. This determination can be made off-line using computer models or through factory calibration procedures. This process could potentially be simplified if a real-time prediction model could be implemented to run for any engine platform this is the motivation for this study. The major benefit of this model is the ability for it to predict the combustion trajectory, i.e. local temperature and equivalence ratio in the burning zones. The model successfully captures all the expected trends based on the experimental data and even highlights an opportunity for simply using the average reaction temperature and equivalence ratio as an indicator of emissions levels alone - without solving formation sub-models. This general type of modeling effort is not new, but a major effort was made to minimize the calculation duration to enable implementation as an input to real-time next-cycle engine controller Instead of simply using the predicted engine out soot and NOx levels, control decisions could be made based on the trajectory. This has the potential to save large amounts of calibration time because with minor tuning (the model has only one automatically determined constant) it is hoped that the control algorithm would be generally applicable.

Bittle, Joshua A.↗

Krylov Subspace Methods for Quantum Dynamics with Time-Dependent Generators

Krylov subspace methods in quantum dynamics identify the minimal subspace in which a process unfolds. To date, their use is restricted to time evolutions governed by time-independent generators. Here, we introduce a generalization valid for driven quantum systems governed by a time-dependent Hamiltonian that maps the evolution to a diffusion problem in a one-dimensional lattice with nearest-neighbor hopping probabilities that are inhomogeneous and time dependent. This representation is used to establish a novel class of fundamental limits to the quantum speed of evolution and operator growth. We also discuss generalizations of the algorithm, adapted to discretized time evolutions and periodic Hamiltonians, with applications to many-body systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Hierarchical Distributed Optimal Power Flow of HV and MV Distribution Networks With Continuous and Discrete Devices

With large-scale distributed photovoltaics (PVs) being integrated into distribution networks (DNs), coordinated optimal power flow (OPF) of high voltage (HV) and medium voltage (MV) DNs should be investigated to optimally dispatch the distributed PVs and other network devices. Here, this paper presents a hierarchical distributed OPF method for HV and MV DNs with on-load tap changers, reactive power compensators, feeder switches and distributed PVs. A hierarchical master-slave control architecture is applied to implement coordinated OPF of two-layer DNs. The HV master problem and MV subproblems are transformed into mixed-integer convex problems respectively with second order cone programming and LinDistFlow approximation. Since there is no efficient distributed algorithm to solve such OPF models with integer subproblems, a novel distributed algorithm is proposed in this paper to efficiently solve the hierarchical coordinated OPF model with integer subproblems in a distributed manner. In the proposed algorithm, the coordinated OPF model is solved in a branch-and-bound framework, where in each branch node generalized Benders decomposition (GBD) algorithm is applied to decompose the coordinated OPF model into a master problem and relaxed subproblems and solves them iteratively to get optimal solution. The GBD optimal and feasible cutting planes generated in a branch node are proved to be valid for its descendants. Moreover, three acceleration techniques are introduced into the proposed algorithm to improve computational efficiency. Finally, the effectiveness and accuracy of the proposed method are verified via simulation tests in Jinzhai DNs of China.

42 ENGINEERING↗

SU-F-T-342: Dosimetric Constraint Prediction Guided Automatic Mulit-Objective Optimization for Intensity Modulated Radiotherapy

Purpose: For intensity modulated radiotherapy, the plan optimization is time consuming with difficulties of selecting objectives and constraints, and their relative weights. A fast and automatic multi-objective optimization algorithm with abilities to predict optimal constraints and manager their trade-offs can help to solve this problem. Our purpose is to develop such a framework and algorithm for a general inverse planning. Methods: There are three main components contained in this proposed multi-objective optimization framework: prediction of initial dosimetric constraints, further adjustment of constraints and plan optimization. We firstly use our previously developed in-house geometry-dosimetry correlation model to predict the optimal patient-specific dosimetric endpoints, and treat them as initial dosimetric constraints. Secondly, we build an endpoint(organ) priority list and a constraint adjustment rule to repeatedly tune these constraints from their initial values, until every single endpoint has no room for further improvement. Lastly, we implement a voxel-independent based FMO algorithm for optimization. During the optimization, a model for tuning these voxel weighting factors respecting to constraints is created. For framework and algorithm evaluation, we randomly selected 20 IMRT prostate cases from the clinic and compared them with our automatic generated plans, in both the efficiency and plan quality. Results: For each evaluated plan, the proposed multi-objective framework could run fluently and automatically. The voxel weighting factor iteration time varied from 10 to 30 under an updated constraint, and the constraint tuning time varied from 20 to 30 for every case until no more stricter constraint is allowed. The average total costing time for the whole optimization procedure is ∼30mins. By comparing the DVHs, better OAR dose sparing could be observed in automatic generated plan, for 13 out of the 20 cases, while others are with competitive results. Conclusion: We have successfully developed a fast and automatic multi-objective optimization for intensity modulated radiotherapy. This work is supported by the National Natural Science Foundation of China (No: 81571771)

60 APPLIED LIFE SCIENCES↗

Covariance Modifications to Subspace Bases

Adaptive signal processing algorithms that rely upon representations of signal and noise subspaces often require updates to those representations when new data become available. Subspace representations frequently are estimated from available data with singular value (SVD) decompositions. Subspace updates require modifications to these decompositions. Updates can be performed inexpensively provided they are low-rank. A substantial literature on SVD updates exists, frequently focusing on rank-1 updates (see e.g. [Karasalo, 1986; Comon and Golub, 1990, Badeau, 2004]). In these methods, data matrices are modified by addition or deletion of a row or column, or data covariance matrices are modified by addition of the outer product of a new vector. A recent paper by Brand [2006] provides a general and efficient method for arbitrary rank updates to an SVD. The purpose of this note is to describe a closely-related method for applications where right singular vectors are not required. This note also describes the SVD updates to a particular scenario of interest in seismic array signal processing. The particular application involve updating the wideband subspace representation used in seismic subspace detectors [Harris, 2006]. These subspace detectors generalize waveform correlation algorithms to detect signals that lie in a subspace of waveforms of dimension d {ge} 1. They potentially are of interest because they extend the range of waveform variation over which these sensitive detectors apply. Subspace detectors operate by projecting waveform data from a detection window into a subspace specified by a collection of orthonormal waveform basis vectors (referred to as the template). Subspace templates are constructed from a suite of normalized, aligned master event waveforms that may be acquired by a single sensor, a three-component sensor, an array of such sensors or a sensor network. The template design process entails constructing a data matrix whose columns contain the master event waveform data, then performing a singular value decomposition on the data matrix to extract an orthonormal basis for the waveform suite. The template typically is comprised of a subset of the left singular vectors corresponding to the larger singular values. The application involves updating a subspace template when new data become available, i.e. when new defining events are detected for a particular source. It often is the case that the waveforms corresponding to a particular source drift over time [Harris, 2001]. The Green's functions describing propagation can be altered because of changes in the source region. For example, if the source is a mine, signals from explosions may change gradually as a pit is extended (the source moves) or the scattering topography is altered by excavation. This motivates a tracking adjustment to a subspace representation. This note also comments on SVD updates for a related problem. In realistic pipeline operations it often is the case that data from one or more channels of an array are unusable (dead channels, channels with prolific dropouts, etc.). In such cases it is desirable to modify an array subspace template to operate on data only from the remaining usable channels. Furthermore, it is desirable to modify the templates directly without recourse to the original data matrix. Usually the template design process is separate from the application of the template in a detector to a continuous data stream. Consequently, the original data matrix may not be available for template modification at detector run time.

58 GEOSCIENCES↗

The WACMOS-ET project – Part 1: Tower-scale evaluation of four remote-sensing-based evapotranspiration algorithms

The WAter Cycle Multi-mission Observation Strategy – EvapoTranspiration (WACMOS-ET) project has compiled a forcing data set covering the period 2005–2007 that aims to maximize the exploitation of European Earth Observations data sets for evapotranspiration (ET) estimation. The data set was used to run four established ET algorithms: the Priestley–Taylor Jet Propulsion Laboratory model (PT-JPL), the Penman–Monteith algorithm from the MODerate resolution Imaging Spectroradiometer (MODIS) evaporation product (PM-MOD), the Surface Energy Balance System (SEBS) and the Global Land Evaporation Amsterdam Model (GLEAM). In addition, in situ meteorological data from 24 FLUXNET towers were used to force the models, with results from both forcing sets compared to tower-based flux observations. Model performance was assessed on several timescales using both sub-daily and daily forcings. The PT-JPL model and GLEAM provide the best performance for both satellite- and tower-based forcing as well as for the considered temporal resolutions. Simulations using the PM-MOD were mostly underestimated, while the SEBS performance was characterized by a systematic overestimation. In general, all four algorithms produce the best results in wet and moderately wet climate regimes. In dry regimes, the correlation and the absolute agreement with the reference tower ET observations were consistently lower. While ET derived with in situ forcing data agrees best with the tower measurements ( R 2 = 0.67), the agreement of the satellite-based ET estimates is only marginally lower ( R 2 = 0.58). Results also show similar model performance at daily and sub-daily (3-hourly) resolutions. Overall, our validation experiments against in situ measurements indicate that there is no single best-performing algorithm across all biome and forcing types. In conclusion, an extension of the evaluation to a larger selection of 85 towers (model inputs resampled to a common grid to facilitate global estimates) confirmed the original findings.

54 ENVIRONMENTAL SCIENCES↗

Localized Evaluation for Constructing Discrete Vector Fields

Topological abstractions offer a method to summarize the behavior of vector fields, but computing them robustly can be challenging due to numerical precision issues. One alternative is to represent the vector field using a discrete approach, which constructs a collection of pairs of simplices in the input mesh that satisfies criteria introduced by Forman's discrete Morse theory. While numerous approaches exist to compute pairs in the restricted case of the gradient of a scalar field, state-of-the-art algorithms for the general case of vector fields require expensive optimization procedures. This paper introduces a fast, novel approach for pairing simplices of two-dimensional, triangulated vector fields that do not vary in time. The key insight of our approach is that we can employ a local evaluation, inspired by the approach used to construct a discrete gradient field, where every simplex in a mesh is considered by no more than one of its vertices. Specifically, we observe that for any edge in the input mesh, we can uniquely assign an outward direction of flow. We can further expand this consistent notion of outward flow at each vertex, which corresponds to the concept of a downhill flow in the case of scalar fields. Working with outward flow enables a linear-time algorithm that processes the (outward) neighborhoods of each vertex one-by-one, similar to the approach used for scalar fields. Here, we couple our approach to constructing discrete vector fields with a method to extract, simplify, and visualize topological features. Empirical results on analytic and simulation data demonstrate drastic improvements in running time, produce features similar to the current state-of-the-art, and show the application of simplification to large, complex flows.

97 MATHEMATICS AND COMPUTING↗

Communication: Fully coherent quantum state hopping

In this paper, we describe a new and fully coherent stochastic surface hopping method for simulating mixed quantum-classical systems. We illustrate the approach on the simple but unforgiving problem of quantum evolution of a two-state quantum system in the limit of unperturbed pure state dynamics and for dissipative evolution in the presence of both stationary and nonstationary random environments. We formulate our approach in the Liouville representation and describe the density matrix elements by ensembles of trajectories. Population dynamics are represented by stochastic surface hops for trajectories representing diagonal density matrix elements. These are combined with an unconventional coherent stochastic hopping algorithm for trajectories representing off-diagonal quantum coherences. The latter generalizes the binary (0,1) “probability” of a trajectory to be associated with a given state to allow integers that can be negative or greater than unity in magnitude. Unlike existing surface hopping methods, the dynamics of the ensembles are fully entangled, correctly capturing the coherent and nonlocal structure of quantum mechanics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Efficient quantum circuits for Szegedy quantum walks

A major advantage in using Szegedy’s formalism over discrete-time and continuous-time quantum walks lies in its ability to define a unitary quantum walk by quantizing a Markov chain on a directed or weighted graph. In this paper, we present a general scheme to construct efficient quantum circuits for Szegedy quantum walks that correspond to classical Markov chains possessing transformational symmetry in the columns of the transition matrix. In particular, the transformational symmetry criteria do not necessarily depend on the sparsity of the transition matrix, so this scheme can be applied to non-sparse Markov chains. Two classes of Markov chains that are amenable to this construction are cyclic permutations and complete bipartite graphs, for which we provide explicit efficient quantum circuit implementations. We also prove that our scheme can be applied to Markov chains formed by a tensor product. We also briefly discuss the implementation of Markov chains based on weighted interdependent networks. In addition, we apply this scheme to construct efficient quantum circuits simulating the Szegedy walks used in the quantum Pagerank algorithm for some classes of non-trivial graphs, providing a necessary tool for experimental demonstration of the quantum Pagerank algorithm. - Highlights: • A general theoretical framework for implementing Szegedy walks using quantum circuits. • Explicit efficient quantum circuit implementation of the Szegedy walk for several classes of graphs. • Efficient implementation of Szegedy walks for quantum page-ranking of a certain class of graphs.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Multiplets of superconformal symmetry in diverse dimensions

We systematically analyze the operator content of unitary superconformal multiplets in d ≥ 3 spacetime dimensions. We present a simple, general, and efficient algorithm that generates all of these multiplets by correctly eliminating possible null states. The algorithm is conjectural, but passes a vast web of consistency checks. We apply it to tabulate a large variety of superconformal multiplets. In particular, we classify and construct all multiplets that contain conserved currents or free fields, which play an important role in superconformal field theories (SCFTs). Some currents that are allowed in conformal field theories cannot be embedded in superconformal multiplets, and hence they are absent in SCFTs. We use the structure of superconformal stress tensor multiplets to show that SCFTs with more than 16 Poincaré supercharges cannot arise in d ≥ 4, even when the corresponding superconformal algebras exist. We also show that such theories do arise in d = 3, but are necessarily free.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

THREE NEW ECLIPSING WHITE-DWARF-M-DWARF BINARIES DISCOVERED IN A SEARCH FOR TRANSITING PLANETS AROUND M-DWARFS

We present three new eclipsing white-dwarf/M-dwarf binary systems discovered during a search for transiting planets around M-dwarfs. Unlike most known eclipsing systems of this type, the optical and infrared emission is dominated by the M-dwarf components, and the systems have optical colors and discovery light curves consistent with being Jupiter-radius transiting planets around early M-dwarfs. We detail the PTF/M-dwarf transiting planet survey, part of the Palomar Transient Factory (PTF). We present a graphics processing unit (GPU)-based box-least-squares search for transits that runs approximately 8 Multiplication-Sign faster than similar algorithms implemented on general purpose systems. For the discovered systems, we decompose low-resolution spectra of the systems into white-dwarf and M-dwarf components, and use radial velocity measurements and cooling models to estimate masses and radii for the white dwarfs. The systems are compact, with periods between 0.35 and 0.45 days and semimajor axes of approximately 2 R{sub Sun} (0.01 AU). The M-dwarfs have masses of approximately 0.35 M{sub Sun }, and the white dwarfs have hydrogen-rich atmospheres with temperatures of around 8000 K and have masses of approximately 0.5 M{sub Sun }. We use the Robo-AO laser guide star adaptive optics system to tentatively identify one of the objects as a triple system. We also use high-cadence photometry to put an upper limit on the white-dwarf radius of 0.025 R{sub Sun} (95% confidence) in one of the systems. Accounting for our detection efficiency and geometric factors, we estimate that 0.08%{sub -0.05%}{sup +0.10%} (90% confidence) of M-dwarfs are in these short-period, post-common-envelope white-dwarf/M-dwarf binaries where the optical light is dominated by the M-dwarf. The lack of detections at shorter periods, despite near-100% detection efficiency for such systems, suggests that binaries including these relatively low-temperature white dwarfs are preferentially found at relatively large orbital radii. Similar eclipsing binary systems can have arbitrarily small eclipse depths in red bands and generate plausible small-planet-transit light curves. As such, these systems are a source of false positives for M-dwarf transiting planet searches. We present several ways to rapidly distinguish these binaries from transiting planet systems.

79 ASTRONOMY AND ASTROPHYSICS↗

Evaluation of Hybrid FPOG Applications in Regulated and Deregulated Markets Using HERON

Recent changes in the U.S. energy market, such as low natural gas prices and increased electricity production for variable renewable energy (VRE) sources, have led to an economic crisis for existing light-water reactor (LWR) nuclear power plants (NPP). Many owners and operators of LWRs have elected to decommission these plants rather than continue using them as consistent sources of clean baseload power. This has led to exploration of various possibilities to increase the economic viability of these units, including market restructuring to monetize benefits LWRs already provide to the grid through ancillary markets, load following and economic dispatch, and possible integration of secondary systems directly to the NPP for production of additional products through technologies such as hydrogen electrolysis or water desalination. Previous studies have considered the technologies associated with these Integrated Energy Systems (IES) activities, and the analysis of markets for these secondary products. To analyze the economic viability of various system configurations including IES, especially given the uncertainty surrounding load demand, electricity prices, and the availability of VRE resources, the stochastic technoeconomic analysis package HERON (Heuristic Energy Resource Optimization Network) was released earlier this year as an extension of the risk analysis framework RAVEN (Risk Analysis Virtual Environment). HERON focuses foremost on making the complex uncertainty quantification analysis tools approachable for energy systems analysts, also providing general dispatch optimization algorithms for those workflows. HERON continues to be improved and tested as a significant part of the IES viability analyses performed in this work. HERON is not a capacity expansion model. To consider market and grid energy system development in a variety of scenarios, HERON is best used in coupling with modelling tools such as US-REGEN, which sacrifice some of the uncertainty analysis and resolution of HERON's modelling for the ability to efficiently predict the change in the grid energy system's profile due to economic drivers over decades. HERON can then use this information to explore the economic viability of introducing changes to the predicted outcomes, such as the introduction of an IES. In this work, experts at EPRI using US-REGEN provide six projection scenarios for use in HERON stochastic technoeconomic analysis (STEA) in considering the options available for increasing LWR economic viability through introduction of a hydrogen-centric IES using a high-temperature steam electrolysis plant (HTSE), hydrogen storage, and a constant-rate contracted hydrogen consumer. The results obtained are differential in nature; they do not report expected profits for any configuration, but rather report on the possible increase in the NPV of a configuration with respect to a baseline no-IES configuration. Due to the uncertainty captured in the variable net load of the systems, there is likewise uncertainty in the mean values reported. We consider this viability both in terms of a regulated market, where the energy producers and IES are owned and operated by single entity, as well as a deregulated market, where the IES chooses its bid for electricity generation and is then dispatched by the grid system operator. Results indicate that for deregulated markets, the inclusion of the IES is often statistically beneficial. This is especially true in policies that are not favorable towards nuclear, as nuclear is less often dispatched and is forced to deal with frequent idle capacity. In the nominal case as well as the case of carbon tax policies, inclusion of the IES clearly benefited the economic performance of the NPP. In the regulated case, however, there was a trend towards minimizing the IES, likely due to the optimal sizing performed by US-REGEN of the NPP within the system as well as the lack of penalty for idle capacity at the NPP in the regulated market analyses.

99 GENERAL AND MISCELLANEOUS↗

Identifying Optimal Measurement Subspace for the Ensemble Kalman Filter

To reduce the computational load of the ensemble Kalman filter while maintaining its efficacy, an optimization algorithm based on the generalized eigenvalue decomposition method is proposed for identifying the most informative measurement subspace. When the number of measurements is large, the proposed algorithm can be used to make an effective tradeoff between computational complexity and estimation accuracy. This algorithm also can be extended to other Kalman filters for measurement subspace selection.

99 GENERAL AND MISCELLANEOUS↗

An improved multilevel Monte Carlo method for estimating probability distribution functions in stochastic oil reservoir simulations

In this paper, we develop an improved multilevel Monte Carlo (MLMC) method for estimating cumulative distribution functions (CDFs) of a quantity of interest, coming from numerical approximation of large-scale stochastic subsurface simulations. Compared with Monte Carlo (MC) methods, that require a significantly large number of high-fidelity model executions to achieve a prescribed accuracy when computing statistical expectations, MLMC methods were originally proposed to significantly reduce the computational cost with the use of multifidelity approximations. The improved performance of the MLMC methods depends strongly on the decay of the variance of the integrand as the level increases. However, the main challenge in estimating CDFs is that the integrand is a discontinuous indicator function whose variance decays slowly. To address this difficult task, we approximate the integrand using a smoothing function that accelerates the decay of the variance. In addition, we design a novel a posteriori optimization strategy to calibrate the smoothing function, so as to balance the computational gain and the approximation error. The combined proposed techniques are integrated into a very general and practical algorithm that can be applied to a wide range of subsurface problems for high-dimensional uncertainty quantification, such as a fine-grid oil reservoir model considered in this effort. The numerical results reveal that with the use of the calibrated smoothing function, the improved MLMC technique significantly reduces the computational complexity compared to the standard MC approach. Finally, we discuss several factors that affect the performance of the MLMC method and provide guidance for effective and efficient usage in practice.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Evaluation of the Index and Singular Points of Linear Differential-Algebraic Equations of Higher Order

We study linear systems of ordinary differential equations of higher order with an identically singular matrix at the higher derivative of the required vector-valued function in the domain of definition. We give definitions of the index and singular points for these systems, formulate the conditions of solvability, and deduce a formula for the general solution. The algorithms for finding the index and singular points are presented.

97 MATHEMATICS AND COMPUTING↗

A sweeping positivity-preserving high-order finite difference WENO scheme for Euler equations

We develop a simple, high-order, conservative and robust positivity-preserving sweeping procedure for the density and the nonlinear pressure function in the compressible Euler equations. Using the scaling limiter in Zhang and Shu (J Comput Phys 229:3091–3120, 2010), we obtain a non-trivial extension of the scalar sweeping technique in Liu et al. (J Sci Comput 73:1028–1071, 2017) for the positivity of pressure. The sweeping procedure developed in this paper is a post-processing technique, which can be applied to any concave functions of the conserved variables in hyperbolic conservation law systems. Thus, it has applications beyond the Euler equations. This procedure preserves positivity and conservation of physical quantities without destroying the accuracy of the underlying scheme. The algorithm works for general schemes including finite difference, finite volume and discontinuous Galerkin methods; however, in this paper we focus on finite difference weighted essentially non-oscillatory (WENO) methods. As a result, we provide numerical tests of the fifth-order finite difference WENO scheme to demonstrate the accuracy and robustness of the technique.

Compressible Euler equations↗

The density-matrix renormalization group in the age of matrix product states

The density-matrix renormalization group method (DMRG) has established itself over the last decade as the leading method for the simulation of the statics and dynamics of one-dimensional strongly correlated quantum lattice systems. In the further development of the method, the realization that DMRG operates on a highly interesting class of quantum states, so-called matrix product states (MPS), has allowed a much deeper understanding of the inner structure of the DMRG method, its further potential and its limitations. In this paper, I want to give a detailed exposition of current DMRG thinking in the MPS language in order to make the advisable implementation of the family of DMRG algorithms in exclusively MPS terms transparent. I then move on to discuss some directions of potentially fruitful further algorithmic development: while DMRG is a very mature method by now, I still see potential for further improvements, as exemplified by a number of recently introduced algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Using hydrogen and ammonia for renewable energy storage: A geographically comprehensive techno-economic study

Hydrogen and, more recently, ammonia have received worldwide attention as energy storage media. In this work we investigate the economics of using each of these chemicals as well as the two in combination for islanded renewable energy supply systems in 15 American cities representing different climate regions throughout the country. We use an optimal combined capacity planning and scheduling model which minimizes the levelized cost of energy (LCOE) by determining optimal unit selection and size along with unit commitments, production rates, and storage inventories for each period of system operation. These periods are aggregated from full year hourly resolution data via a consecutive temporal clustering algorithm. Ammonia is generally more economical than hydrogen as a single method of energy storage. Additionally, systems which use both hydrogen and ammonia outperform those which use only one storage option and have LCOE between $\$ 0.17$/kWh and $\$ 0.28$/kWh, including full investment in renewable generation infrastructure.

25 ENERGY STORAGE↗