Search NASA⌕ Search

SEARCH · Search NASA

Results for “C&CG 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.

15 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Arbitrage and Capacity Firming in Coordination with Day-Ahead Bidding of a Hybrid PV Plant

A hybrid PV plant (HPP) combines a photovoltaic (PV) plant with a battery energy storage system (BESS), which is considered a promising step towards the future of renewable power plants by the U.S. Department of Energy. When the renewable penetration reaches a significant level, a hybrid PV plant can bid in as a controllable thermal plant in the future electricity market. In this study, a bidding and BESS scheduling model is proposed for the HPP. The robust optimization (RO) technique has been utilized to identify the worst-case scenario of uncertainties during the bidding process. To address the overly conservative issue of the single-stage RO, we have decoupled the BESS schedule for arbitrage and PV capacity firming by a two-stage RO formulation. By comparing the output of single-stage RO and two-stage RO, the two-stage RO bids and schedules in a more aggressive manner, which increases the income of HPP. Also, the penalty of under-generation is considered in our model so that the day-ahead bidding decision and arbitrage schedules can be adjusted based on the potential UNDER-GENERATION penalty. Because the proposed model is non-convex and contains multi-stages, the Column-and-Constraint Generation (C&CG) algorithm is applied to the model as the solution. The proposed model has shown better economic performance compared to a state-of-art single-stage bidding method in case studies.

BESS scheduling↗
DOE OSTI2020

A trilevel model against false gas-supply information attacks in electricity systems

The interdependence between natural gas and electricity systems is increasing rapidly due to the growing reliance on natural gas-fired generating units. Availability of natural gas for gas-fired generating units can impact the secure operation of electricity systems. Fuel supply shortage for gas-fired units can be caused by uncertain interruptible supply contracts and incorrect supply information. This article proposes a trilevel min-max-min defender-attacker-operator optimization problem to provide the power system operator a screening methodology that allocates a limited budget for best protecting critical fuel supply information, and also the strategies to sign firm supply contract to reduce natural gas supply uncertainties. We utilize a column and constraint generation (C&CG) algorithm to solve the proposed problem. We illustrate the effectiveness of this trilevel formulation using a case study based on IEEE 24-node test system.

42 ENGINEERING↗
DOE OSTI2022

Arbitrage and Capacity Firming in Coordination with Day-Ahead Bidding of a Hybrid PV Plant: Preprint

A hybrid PV plant (HPP) combines a photovoltaic (PV) plant with a battery energy storage system (BESS), which is considered a promising step towards the future of renewable power plants by the U.S. Department of Energy. When the renewable penetration reaches a significant level, a hybrid PV plant can bid in as a controllable thermal plant in the future electricity market. In this study, a bidding and BESS scheduling model is proposed for the HPP. The robust optimization (RO) technique has been utilized to identify the worst-case scenario of uncertainties during the bidding process. To address the overly conservative issue of the single-stage RO, we have decoupled the BESS schedule for arbitrage and PV capacity firming by a two-stage RO formulation. By comparing the output of single-stage RO and two-stage RO, the two-stage RO bids and schedules in a more aggressive manner, which increases the income of HPP. Also, the penalty of under-generation is considered in our model so that the day-ahead bidding decision and arbitrage schedules can be adjusted based on the potential UNDER-GENERATION penalty. Because the proposed model is non-convex and contains multi-stages, the Column-and-Constraint Generation (C&CG) algorithm is applied to the model as the solution. The proposed model has shown better economic performance compared to a state-of-art single-stage bidding method in case studies.

BESS scheduling↗
DOE OSTI2023

Multistage robust optimization for the day-ahead scheduling of hybrid thermal-hydro-wind-solar systems

The integration of large-scale uncertain and uncontrollable wind and solar power generation has brought new challenges to the operations of modern power systems. In a power system with abundant water resources, hydroelectric generation with high operational flexibility is a powerful tool to promote a higher penetration of wind and solar power generation. In this paper, we study the day-ahead scheduling of a thermal-hydro-wind-solar power system. The uncertainties of renewable energy generation, including uncertain natural water inflow and wind/solar power output, are taken into consideration. We explore how the operational flexibility of hydroelectric generation and the coordination of thermal-hydro power can be utilized to hedge against uncertain wind/solar power under a multistage robust optimization (MRO) framework. To address the computational issue, mixed decision rules are employed to reformulate the original MRO model with a multi-level structure into a bi-level one. Column-and-constraint generation (C &CG) algorithm is extended into the MRO case to solve the bi-level model. The proposed optimization approach is tested in three real-world cases. Furthermore, the computational results demonstrate the capability of hydroelectric generation to promote the accommodation of uncertain wind and solar power.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2020

Data-Based Resilience Enhancement Strategies for Electric-Gas Systems Against Sequential Extreme Weather Events

Some extreme weather events, such as the hurricane, pass through an area sequentially and thus are called sequential extreme weather events (SEWEs). This paper proposes a data-based robust optimization (RO) model to enhance the resilience of the integrated electricity and gas system (IEGS) against SEWEs. Specifically, the SEWE strikes the IEGS sequentially. After each attack, the system state is adjusted immediately to minimize the maximized expected system cost caused by the SEWE. The attack-defense procedures are repeated alternatively during the SEWE. Preventive measures, hardening, are made in advance to reduce the impact of sequential attacks. The entire process is formulated as a multi-period RO model. Furthermore, it is proved that the most effective resilience enhancement strategies for this model are the same as those for a two-stage RO model, which can be solved by the nested column-and-constraint generation (C&CG) algorithm. In addition, the property of SEWEs, sequentially endangering limited regions of the IEGS, is incorporated to build a data-based uncertainty set and reduce its conservativeness. Simulation results on two IEGSs validate the effectiveness of the proposed model.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2023

A Distributionally Robust Resilience Enhancement Strategy for Distribution Networks Considering Decision-Dependent Contingencies

When performing the resilience enhancement for distribution networks, there are two obstacles to reliably model the uncertain contingencies: 1) decision-dependent uncertainty (DDU) due to various line hardening decisions, and 2) distributional ambiguity due to limited outage information during extreme weather events (EWEs). Here, to address these two challenges, this paper develops scenario-wise decision-dependent ambiguity sets (SWDD-ASs), where the DDU and distributional ambiguity inherent in EWE-induced contingencies are simultaneously captured for each possible EWE scenario. Then, a two-stage tri-level decision-dependent distributionally robust resilient enhancement (DD-DRRE) model is formulated, whose outputs include the optimal line hardening, distributed generation (DG) allocation, and proactive network reconfiguration strategy under the worst-case distributions in SWDD-ASs. Subsequently, the DD-DRRE model is equivalently recast to a mixed-integer linear programming (MILP)-based master problem and multiple scenario-wise subproblems, facilitating the adoption of a customized column-and-constraint generation (C&CG) algorithm. Finally, case studies demonstrate a remarkable improvement in the out-of-sample performance of our model, compared to its prevailing stochastic and robust counterparts. Moreover, the potential values of incorporating the ambiguity and distributional information are quantitatively estimated, providing a useful reference for planners with different budgets and risk-aversion levels.

decision-dependent uncertainty↗
DOE OSTI2022

Robust Scheduling of Networked Microgrids for Economics and Resilience Improvement

The benefits of networked microgrids in terms of economics and resilience are investigated and validated in this work. Considering the stochastic unintentional islanding conditions and conventional forecast errors of both renewable generation and loads, a two-stage adaptive robust optimization is proposed to minimize the total operating cost of networked microgrids in the worst scenario of the modeled uncertainties. By coordinating the dispatch of distributed energy resources (DERs) and responsive demand among networked microgrids, the total operating cost is minimized, which includes the start-up and shut-down cost of distributed generators (DGs), the operation and maintenance (O&M) cost of DGs, the cost of buying/selling power from/to the utility grid, the degradation cost of energy storage systems (ESSs), and the cost associated with load shedding. The proposed optimization is solved with the column and constraint generation (C&CG) algorithm. The results of case studies demonstrate the advantages of networked microgrids over independent microgrids in terms of reducing total operating cost and improving the resilience of power supply.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2022

Inexact Newton-CG algorithms with complexity guarantees

Abstract We consider variants of a recently developed Newton-CG algorithm for nonconvex problems (Royer, C. W. & Wright, S. J. (2018) Complexity analysis of second-order line-search algorithms for smooth nonconvex optimization. SIAM J. Optim., 28, 1448–1477) in which inexact estimates of the gradient and the Hessian information are used for various steps. Under certain conditions on the inexactness measures, we derive iteration complexity bounds for achieving $\epsilon $-approximate second-order optimality that match best-known lower bounds. Our inexactness condition on the gradient is adaptive, allowing for crude accuracy in regions with large gradients. We describe two variants of our approach, one in which the step size along the computed search direction is chosen adaptively, and another in which the step size is pre-defined. To obtain second-order optimality, our algorithms will make use of a negative curvature direction on some steps. These directions can be obtained, with high probability, using the randomized Lanczos algorithm. In this sense, all of our results hold with high probability over the run of the algorithm. We evaluate the performance of our proposed algorithms empirically on several machine learning models. Our approach is a first attempt to introduce inexact Hessian and/or gradient information into the Newton-CG algorithm of Royer & Wright (2018, Complexity analysis of second-order line-search algorithms for smooth nonconvex optimization. SIAM J. Optim., 28, 1448–1477).

Mathematics↗
NASA NTRS1994

Automated Instrumentation, Monitoring and Visualization of PVM Programs Using AIMS

We present views and analysis of the execution of several PVM codes for Computational Fluid Dynamics on a network of Sparcstations, including (a) NAS Parallel benchmarks CG and MG (White, Alund and Sunderam 1993); (b) a multi-partitioning algorithm for NAS Parallel Benchmark SP (Wijngaart 1993); and (c) an overset grid flowsolver (Smith 1993). These views and analysis were obtained using our Automated Instrumentation and Monitoring System (AIMS) version 3.0, a toolkit for debugging the performance of PVM programs. We will describe the architecture, operation and application of AIMS. The AIMS toolkit contains (a) Xinstrument, which can automatically instrument various computational and communication constructs in message-passing parallel programs; (b) Monitor, a library of run-time trace-collection routines; (c) VK (Visual Kernel), an execution-animation tool with source-code clickback; and (d) Tally, a tool for statistical analysis of execution profiles. Currently, Xinstrument can handle C and Fortran77 programs using PVM 3.2.x; Monitor has been implemented and tested on Sun 4 systems running SunOS 4.1.2; and VK uses X11R5 and Motif 1.2. Data and views obtained using AIMS clearly illustrate several characteristic features of executing parallel programs on networked workstations: (a) the impact of long message latencies; (b) the impact of multiprogramming overheads and associated load imbalance; (c) cache and virtual-memory effects; and (4significant skews between workstation clocks. Interestingly, AIMS can compensate for constant skew (zero drift) by calibrating the skew between a parent and its spawned children. In addition, AIMS' skew-compensation algorithm can adjust timestamps in a way that eliminates physically impossible communications (e.g., messages going backwards in time). Our current efforts are directed toward creating new views to explain the observed performance of PVM programs. Some of the features planned for the near future include: (a) ConfigView, showing the physical topology of the virtual machine, inferred using specially formatted IP (Internet Protocol) packets; and (b) LoadView, synchronous animation of PVM-program execution and resource-utilization patterns.

Mehra, Pankaj↗
NASA NTRS1996

Preserving Symmetry in Preconditioned Krylov Subspace Methods

We consider the problem of solving a linear system Ax = b when A is nearly symmetric and when the system is preconditioned by a symmetric positive definite matrix M. In the symmetric case, one can recover symmetry by using M-inner products in the conjugate gradient (CG) algorithm. This idea can also be used in the nonsymmetric case, and near symmetry can be preserved similarly. Like CG, the new algorithms are mathematically equivalent to split preconditioning, but do not require M to be factored. Better robustness in a specific sense can also be observed. When combined with truncated versions of iterative methods, tests show that this is more effective than the common practice of forfeiting near-symmetry altogether.

Chan, Tony F.↗
NASA NTRS1999

Scaling features of noncoding DNA

We review evidence supporting the idea that the DNA sequence in genes containing noncoding regions is correlated, and that the correlation is remarkably long range--indeed, base pairs thousands of base pairs distant are correlated. We do not find such a long-range correlation in the coding regions of the gene, and utilize this fact to build a Coding Sequence Finder Algorithm, which uses statistical ideas to locate the coding regions of an unknown DNA sequence. Finally, we describe briefly some recent work adapting to DNA the Zipf approach to analyzing linguistic texts, and the Shannon approach to quantifying the "redundancy" of a linguistic text in terms of a measurable entropy function, and reporting that noncoding regions in eukaryotes display a larger redundancy than coding regions. Specifically, we consider the possibility that this result is solely a consequence of nucleotide concentration differences as first noted by Bonhoeffer and his collaborators. We find that cytosine-guanine (CG) concentration does have a strong "background" effect on redundancy. However, we find that for the purine-pyrimidine binary mapping rule, which is not affected by the difference in CG concentration, the Shannon redundancy for the set of analyzed sequences is larger for noncoding regions compared to coding regions.

Non-NASA Center↗
NASA NTRS1994

Automated Instrumentation, Monitoring and Visualization of PVM Programs Using AIMS

We present views and analysis of the execution of several PVM (Parallel Virtual Machine) codes for Computational Fluid Dynamics on a networks of Sparcstations, including: (1) NAS Parallel Benchmarks CG and MG; (2) a multi-partitioning algorithm for NAS Parallel Benchmark SP; and (3) an overset grid flowsolver. These views and analysis were obtained using our Automated Instrumentation and Monitoring System (AIMS) version 3.0, a toolkit for debugging the performance of PVM programs. We will describe the architecture, operation and application of AIMS. The AIMS toolkit contains: (1) Xinstrument, which can automatically instrument various computational and communication constructs in message-passing parallel programs; (2) Monitor, a library of runtime trace-collection routines; (3) VK (Visual Kernel), an execution-animation tool with source-code clickback; and (4) Tally, a tool for statistical analysis of execution profiles. Currently, Xinstrument can handle C and Fortran 77 programs using PVM 3.2.x; Monitor has been implemented and tested on Sun 4 systems running SunOS 4.1.2; and VK uses XIIR5 and Motif 1.2. Data and views obtained using AIMS clearly illustrate several characteristic features of executing parallel programs on networked workstations: (1) the impact of long message latencies; (2) the impact of multiprogramming overheads and associated load imbalance; (3) cache and virtual-memory effects; and (4) significant skews between workstation clocks. Interestingly, AIMS can compensate for constant skew (zero drift) by calibrating the skew between a parent and its spawned children. In addition, AIMS' skew-compensation algorithm can adjust timestamps in a way that eliminates physically impossible communications (e.g., messages going backwards in time). Our current efforts are directed toward creating new views to explain the observed performance of PVM programs. Some of the features planned for the near future include: (1) ConfigView, showing the physical topology of the virtual machine, inferred using specially formatted IP (Internet Protocol) packets: and (2) LoadView, synchronous animation of PVM-program execution and resource-utilization patterns.

Mehra, Pankaj↗
DOE OSTI2022

Krylov subspace recycling for evolving structures

Krylov subspace recycling is a powerful tool when solving a long series of large, sparse linear systems that change only slowly over time. In PDE constrained shape optimization, these series appear naturally, as typically hundreds or thousands of optimization steps are needed with only small changes in the geometry. In this setting, however, applying Krylov subspace recycling can be a difficult task. As the geometry evolves, in general, so does the finite element mesh defined on or representing this geometry, including the numbers of nodes and elements and element connectivity. This is especially the case if re-meshing techniques are used. As a result, the number of algebraic degrees of freedom in the system changes, and in general the linear system matrices resulting from the finite element discretization change size from one optimization step to the next. Changes in the mesh connectivity also lead to structural changes in the matrices. In the case of re-meshing, even if the geometry changes only a little, the corresponding mesh might differ substantially from the previous one. Obviously, this prevents any straightforward mapping of the approximate invariant subspace of the linear system matrix (the focus of recycling in this work) from one optimization step to the next; similar problems arise for other selected subspaces. In this paper, we present an algorithm to map an approximate invariant subspace of the linear system matrix for the previous optimization step to an approximate invariant subspace of the linear system matrix for the current optimization step, for general meshes. This is achieved by exploiting the map from coefficient vectors to finite element functions on the mesh, combined with interpolation or approximation of functions on the finite element mesh. We demonstrate the effectiveness of our approach numerically with several proof of concept studies for a specific meshing technique.

42 ENGINEERING↗
NASA NTRS2015

An Integrated 0-1 Hour First-Flash Lightning Nowcasting, Lightning Amount and Lightning Jump Warning Capability

Lightning one of the most dangerous weather-related phenomena, especially as many jobs and activities occur outdoors, presenting risk from a lightning strike. Cloud-to-ground (CG) lightning represents a considerable safety threat to people at airfields, marinas, and outdoor facilities-from airfield personnel, to people attending outdoor stadium events, on beaches and golf courses, to mariners, as well as emergency personnel. Holle et al. (2005) show that 90% of lightning deaths occurred outdoors, while 10% occurred indoors despite the perception of safety when inside buildings. Curran et al. (2000) found that nearly half of fatalities due to weather were related to convective weather in the 1992-1994 timeframe, with lightning causing a large component of the fatalities, in addition to tornadoes and flash flooding. Related to the aviation industry, CG lightning represents a considerable hazard to baggage-handlers, aircraft refuelers, food caterers, and emergency personnel, who all become exposed to the risk of being struck within short time periods while convective storm clouds develop. Airport safety protocols require that ramp operations be modified or discontinued when lightning is in the vicinity (typically 16 km), which becomes very costly and disruptive to flight operations. Therefore, much focus has been paid to nowcasting the first-time initiation and extent of lightning, both of CG and of any lightning (e.g, in-cloud, cloud-to-cloud). For this project three lightning nowcasting methodologies will be combined: (1) a GOESbased 0-1 hour lightning initiation (LI) product (Harris et al. 2010; Iskenderian et al. 2012), (2) a High Resolution Rapid Refresh (HRRR) lightning probability and forecasted lightning flash density product, such that a quantitative amount of lightning (QL) can be assigned to a location of expected LI, and (3) an algorithm that relates Pseudo-GLM data (Stano et al. 2012, 2014) to the so-called "lightning jump" (LJ) methodology (Shultz et al. 2011) to monitor lightning trends and to anticipate/forecast severe weather (hail > or =2.5 cm, winds > or =25 m/s, tornadoes). The result will be a time-continuous algorithm that uses GOES satellite, radar fields, and HRRR model fields to nowcast first-flash LI and QL, and subsequently monitors lightning trends on a perstorm basis within the LJ algorithm for possible severe weather occurrence out to > or =3 hours. The LI-QL-LJ product will also help prepare the operational forecast community for Geostationary Lightning Mapper (GLM) data expected in late 2015, as these data are monitored for ongoing convective storms. The LI-QL-LJ product will first predict where new lightning is highly probable using GOES imagery of developing cumulus clouds, followed by n analysis of NWS (dual-polarization) radar indicators (reflectivity at the -10 C altitude) of lightning occurrence, to increase confidence that LI is immanent. Once lightning is observed, time-continuous lightning mapping array and Pseudo-GLM observations will be analyzed to assess trends and the severe weather threat as identified by trends in lightning (i.e. LJs). Additionally, 5- and 15-min GOES imagery will then be evaluated on a per-storm basis for overshooting and other cloud-top features known to be associated with severe storms. For the processing framework, the GOES-R 0-1 hour convective initiation algorithm's output will be developed within the Warning Decision Support System - Integrated Information (WDSS-II) tracking tool, and merged with radar and lightning (LMA/Psuedo-GLM) datasets for active storms. The initial focus of system development will be over North Alabama for select lightning-active days in summer 2014, yet will be formed in an expandable manner. The lightning alert tool will also be developed in concert with National Weather Service (NWS) forecasters to meet their needs for real-time, accurate first-flash LI and timing, as well as anticipated lightning trends, amounts, continuation and cessation, so to provide key situational awareness and decision support information. The NASA Short-term Prediction Research and Transition (SPoRT) Center will provide important logistical and collaborative support and training, involving interactions with the NWS and broader user community.

Mecikalski, John↗
DOE OSTI2020

A linearity preserving nodal variation limiting algorithm for continuous Galerkin discretization of ideal MHD equations

A stabilized continuous Galerkin (CG) method for magnetohydrodynamics (MHD) is presented herein. Ideal, compressible inviscid MHD equations are discretized in space on unstructured meshes using piecewise linear or bilinear finite element bases to get a semi-discrete scheme. Stabilization is then introduced to the semi-discrete method in a strategy that follows the algebraic flux correction paradigm. This involves adding some artificial diffusion to the high order, semi-discrete method and mass lumping in the time derivative term. The result is a low order method that provides local extremum diminishing properties for hyperbolic systems. The difference between the low order method and the high order method is scaled element-wise using a limiter and added to the low order scheme. The limiter is solution dependent and computed via an iterative linearity preserving nodal variation limiting strategy. The stabilization also involves an optional consistent background high order dissipation that reduces phase errors. The resulting stabilized scheme is a semi-discrete method that can be applied to inviscid shock MHD problems and may be even extended to resistive and viscous MHD problems. To satisfy the divergence free constraint of the MHD equations, we add parabolic divergence cleaning to the system. Various time integration methods can be used to discretize the scheme in time. We demonstrate the robustness of the scheme by solving several shock MHD problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗