Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Guaranteed performance”

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 649 records · Page 36

Microbial community diversity changes during voltage reversal repair in a 12-unit microbial fuel cell

Microbial fuel cell stacks (MFC-Stack) are often confronted with voltage reversals, likely due to an interplay between microbial community dynamics and insufficient electric circuit balancing. Herein, we provide new insight into voltage reversals by examining the microbiomes of twelve MFC units of a 12-liter Pilot-MFC-Stack during repair. Different biofilm repair methods (self-healing, electrostimulation, and re-acclimatization upon cross-inoculation) were used to evaluate the microbial community response. In addition, MFC-Stack simulation was performed based on Kirchhoff’s Second Law to predict values for source potentials and post-evaluate internal resistances. Analysis of the 16S rRNA amplicon sequencing data suggests that the biofilm repair methods could slowly heal damaged biofilms. Notably, severely voltage reversed MFC units had low electrogen relative abundances (18%) and positive anode potentials, while strong bioanodes and contained more than 50% electrogens and had negative anode potentials. Between-community analyses (beta diversity ordination and multinomial regression) of the voltage reversed MFC units revealed differences among biofilms in contrast to healthy/strong MFC units. Permutational multivariate analysis of variance (PERMANOVA) confirmed that reversed biofilms were, indeed, significantly (p < 0.05) different from stronger ones. Overall, these analyses demonstrated the utility of combining electrotechnical and microbial community analyses, especially beta diversity ordination and multinomial regression, to understand problematic MFC units and the potential success of a biofilm repair method. Finally, thicker biofilms were usually healthier and stronger, although thickness was no guarantee for proper structure and power function as all factors were interdependent. There was an evolutionary trend that strong anodes became stronger/healthier and others weaker. This spontaneous trend has to be considered to avoid irreversible voltage reversals and to repair electrogenic biofilms in an MFC-Stack.

59 BASIC BIOLOGICAL SCIENCES↗

Trajectory Specification for Terminal Air Traffic: Pairwise Conflict Detection and Resolution

Trajectory specification is the explicit bounding and control of aircraft trajectories such that the position at each point in time is constrained to a precisely defined volume of space. The bounding space is defined by cross-track, along-track, and vertical tolerances relative to a reference trajectory that specifies position as a function of time. The tolerances are dynamic and will be based on the aircraft navigation capabilities and the current traffic situation. A standard language will be developed to represent these specifications and to communicate them by datalink. Assuming conformance, trajectory specification can guarantee safe separation for an arbitrary period of time even in the event of an air traffic control (ATC) system or datalink failure, hence it can help to achieve the high level of safety and reliability needed for ATC automation. As a more proactive form of ATC, it can also maximize airspace capacity and reduce the reliance on tactical backup systems during normal operation. It applies to both enroute airspace and the terminal area around airports, but this paper focuses on the terminal area and presents algorithms and software for spacing arrivals and deconflicting both arrivals and departures.

air traffic control↗

ICED: An Integrated CGRA Framework Enabling DFVS-Aware Acceleration

oarse-grained reconfigurable arrays (CGRAs) are a promising solution to enable energy-efficient acceleration of applications from different domains. By leveraging reconfiguration at the functional level, they can adapt to significantly different computational patterns. Existing CGRA mapping approaches extract instruction-level parallelism, exploit loop-pipelining opportunities, guarantee the data dependency, and target high throughput of a given loop. However, the recurrence data-dependency in the DFG and the mismatch between required and available computing/communication resources complicate the mapping, and might lead to significant unbalances in the utilization of the CGRA's tiles. This results in wasted power for tiles with low utilization. Applying dynamic voltage and frequency scaling (DVFS) can potentially solve this challenge and improve energy efficiency by adjusting voltage and frequency of different tiles independently. CGRAs have also been successful in accelerating data-dependent streaming applications. However, in these applications, the execution time of each kernel in the pipeline might dynamically vary depending on the characteristics of the input. This also leads to under-utilization of resources for the dynamically changing kernels that do not limit the application throughput. DVFS can also improve energy efficiency for these applications by dynamically changing the voltage and frequency levels of tiles that host non performance-constraining kernels. This paper proposes ICEDTEA -- an integrated DVFS-aware framework to map applications on CGRAs that support power islands. ICEDTEA proposes a CGRA architecture supporting DVFS islands at varying granularity (from a single tile to a group of tiles) and the related DVFS-aware compilation and mapping toolchain. ICEDTEA is the first work that introduces DVFS support for spatio-temporal CGRAs at power-island levels. The experimental evaluation shows that ICEDTEA improves average utilization by 2.3$\times$ and energy-efficiency by 1.32$\times$ over a conventional CGRA. With streaming applications, ICEDTEA improves energy efficiency by 1.12$\times$ over a state-of-the-art CGRA that introduces partial dynamic reconfiguration to adapt to variations in kernels' throughput.

Tan, Cheng↗

Provably accurate simulation of gauge theories and bosonic systems

Quantum many-body systems involving bosonic modes or gauge fields have infinite-dimensional local Hilbert spaces which must be truncated to perform simulations of real-time dynamics on classical or quantum computers. To analyze the truncation error, we develop methods for bounding the rate of growth of local quantum numbers such as the occupation number of a mode at a lattice site, or the electric field at a lattice link. Our approach applies to various models of bosons interacting with spins or fermions, and also to both abelian and non-abelian gauge theories. We show that if states in these models are truncated by imposing an upper limit &#x039B; on each local quantum number, and if the initial state has low local quantum numbers, then an error at most &#x03F5; can be achieved by choosing &#x039B; to scale polylogarithmically with &#x03F5; &#x2212; 1 , an exponential improvement over previous bounds based on energy conservation. For the Hubbard-Holstein model, we numerically compute a bound on &#x039B; that achieves accuracy &#x03F5; , obtaining significantly improved estimates in various parameter regimes. We also establish a criterion for truncating the Hamiltonian with a provable guarantee on the accuracy of time evolution. Building on that result, we formulate quantum algorithms for dynamical simulation of lattice gauge theories and of models with bosonic modes; the gate complexity depends almost linearly on spacetime volume in the former case, and almost quadratically on time in the latter case. We establish a lower bound showing that there are systems involving bosons for which this quadratic scaling with time cannot be improved. By applying our result on the truncation error in time evolution, we also prove that spectrally isolated energy eigenstates can be approximated with accuracy &#x03F5; by truncating local quantum numbers at &#x039B; = polylog ( &#x03F5; &#x2212; 1 ) .

Tong, Yu↗

A Privacy Preserving Model-Free Optimization and Control Framework for Demand Response from Residential Thermal Loads

We consider the problem of optimizing the cost of procuring electricity for a large collection of homes managed by a load serving entity, by pre-cooling or pre-heating the thermal inertial loads in the homes to avoid procuring power during periods of peak electricity pricing. We would like to accomplish this objective in a completely privacy-preserving and model-free manner, that is, without direct access to the state variables (temperatures or power consumption) or the dynamical models (thermal characteristics) of individual homes, while guaranteeing personal comfort constraints of the consumers. We propose a two-stage optimization and control framework to address this problem. In the first stage, we use a long short-term memory (LSTM) network to predict hourly electricity prices, based on historical pricing data and weather forecasts. Given the hourly price forecast and thermal models of the homes, the problem of designing an optimal power consumption trajectory that minimizes the total electricity procurement cost for the collection of thermal loads can be formulated as a large-scale integer program (with millions of variables) due to the on-off cyclical dynamics of such loads. We provide a simple heuristic relaxation to make this large-scale optimization problem model-free and computationally tractable. In the second stage, we translate the results of this optimization problem into distributed open-loop control laws that can be implemented at individual homes without measuring or estimating their state variables, while simultaneously ensuring consumer comfort constraints. We demonstrate the performance of this approach on a large-scale test case comprising of 500 homes in the Houston area and benchmark its performance against a direct model-based optimization and control solution.

Sivaranjani, S.↗

Global tuning of hadronic interaction models with accelerator-based and astroparticle data

In high-energy and astroparticle physics, event generators play an essential role, even in the simplest data analyses. As analysis techniques become more sophisticated, e.g. based on deep neural networks, their correct description of the observed event characteristics becomes even more important. Physical processes occurring in hadronic collisions are simulated within a Monte Carlo framework. A major challenge is the modeling of hadron dynamics at low momentum transfer, which includes the initial and final phases of every hadronic collision. QCD-inspired phenomenological models used for these phases cannot guarantee completeness or correctness over the full phase space. These models usually include parameters which must be tuned to suitable experimental data. Until now, event generators have been developed and tuned mainly on the basis of data from high-energy physics experiments at accelerators. The wealth of data available from the latest generation of astroparticle experiments has not yet been fully exploited, and in many cases is not satisfactorily described. Both kinds of data sets are complementary as astroparticle experiments provide sensitivity especially to hadrons produced nearly parallel to the collision axis and cover center-of-mass energies up to several hundred TeV, well beyond those reached at colliders so far. In this report, we provide an overview of state-of-the-art event generators and their tuning, including the most relevant inputs from high-energy accelerator and astroparticle experiments. We present a road map that shows, for the first time, how the unified tuning of event generators with accelerator-based and astroparticle data can be performed.

Albrecht, J. [Ruhr U., Bochum, RAPP Ctr.; Ruhr U.,↗

Percutaneous aspiration of fluid for management of peritonitis in space

BACKGROUND: As a medical emergency that can affect even well-screened, healthy individuals, peritonitis developing during a long-duration space exploration mission may dictate deviation from traditional clinical practice due to the absence of otherwise indicated surgical capabilities. Medical management can treat many intra-abdominal processes, but treatment failures are inevitable. In these circumstances, percutaneous aspiration under sonographic guidance could provide a "rescue" strategy. Hypothesis: Sonographically guided percutaneous aspiration of intra-peritoneal fluid can be performed in microgravity. METHODS: Investigations were conducted in the microgravity environment of NASA's KC-135 research aircraft (0 G). The subjects were anesthetized female Yorkshire pigs weighing 50 kg. The procedures were rehearsed in a terrestrial animal lab (1 G). Colored saline (500 mL) was introduced through an intra-peritoneal catheter during flight. A high-definition ultrasound system (HDI-5000, ATL, Bothell, WA) was used to guide a 16-gauge needle into the peritoneal cavity to aspirate fluid. RESULTS: Intra-peritoneal fluid collections were easily identified, distinct from surrounding viscera, and on occasion became more obvious during weightless conditions. Subjectively, with adequate restraint of the subject and operators, the procedure was no more demanding than during the 1-G rehearsals. CONCLUSIONS: Sonographically guided percutaneous aspiration of intra-peritoneal fluid collections is feasible in weightlessness. Treatment of intra-abdominal inflammatory conditions in spaceflight might rely on pharmacological options, backed by sonographically guided percutaneous aspiration for the "rescue" of treatment failures. While this risk mitigation strategy cannot guarantee success, it may be the most practical option given severe resource limitations.

Non-NASA Center↗

Trajectory Specification for Terminal Air Traffic: Pairwise Conflict Detection and Resolution

Trajectory Specification is the explicit bounding and control of aircraft trajectories such that the position at any point in time is constrained to a precisely defined volume of space. The bounding space is defined by cross-track, along-track, and vertical tolerances relative to a reference trajectory that specifies position as a function of time. The tolerances are dynamic and will be based on the aircraft navigation capabilities and the current traffic situation. Assuming conformance, Trajectory Specification can guarantee safe separation for an arbitrary period of time even in the event of an air traffic control (ATC) system or datalink failure; hence it can help to achieve the high level of safety and reliability needed for ATC automation. It can also reduce the reliance on tactical backup systems during normal operation. This paper applies it to the terminal area around a major airport and presents algorithms and software for detecting and resolving conflicts. A representative set of pairwise conflicts was generated, and a fast-time simulation was run on them. All conflicts were successfully resolved in real time, demonstrating the computational feasibility of the concept.

terminal area↗

Effectiveness of Loan Guarantees versus Tax Incentives for Space Launch Ventures

Over the course of the past few years, several new and innovative fully or partiailly reusable launch vehicle designs have been initiated with the objective of reducing the cost of space transportation. These new designs are in various stages hardware development for technology and system demonstrators. The larger vehicles include the Lockheed Martin X-33 technology demonstrator for VentureStar and the Space Access launcher. The smaller launcher ventures include Kelly Space and Technology and Rotary Rocket Company. A common denominator between the new large and small commercial launch systems is the ability to obtain project financing and at an affordable cost. Both are having or will have great difficulty in obtaining financing in the capital markets because of the dollar amounts and the risk involved. The large established companies are pursuing multi-billion dollar developments which are a major challenge to finance because of the size and risk of the projects. The smaller start-up companies require less capital for their smaller systems, however, their lack of corporate financial muscle and launch vehicle track record results in a major challenge to obtain financing also because of high risk. On Wall Street, new launch system financing is a question of market, technical, organizational, legal/regulatory and financial risk. The current limit of acceptable financial risk for Space businesses on Wall Street are the telecommunications and broadcast satellite projects, of which many in number are projected for the future. Tbc recent problems with Iridium market and financial performance are casting a long shadow over new satellite project financing, making it increasingly difficult for the new satellite projects to obtain needed financing.

Scottoline, S.↗

WOMBAT (Windfarm Operations and Maintenance cost-Benefit Analysis Tool) WISDEM® [SWR-21-68]

The windfarm operations and maintenance cost-benefit analysis tool (WOMBAT) is software to simulate the operations and maintenance phase of either onshore or offshore windfarms. WOMBAT is a medium-fidelity tool that is designed to model turbine, cable, and substation failures at the subassembly level, but is flexible enough that individual component or asset-level modeling can also be performed. WOMBAT enables users to model technological improvements, the use of a wide range of service equipment from drone repairs and remote resets to heavy lift vessels and crawler cranes, to analyze cost trends with varying trade-offs in conjunction with energy production, availability and a growing range of metrics. This library provides a tool to simulate the operation and maintenance phase (O&M) of distributed, land-based, and offshore windfarms using a discrete event simulation framework. WOMBAT is written around the SimPy discrete event simulation framework. Additionally, this is supported using a flexible and modular object-oriented code base, which enables the modeling of arbitrarily large (or small) windfarms with as many or as few failure and maintenance tasks that can be encoded. Please note that this is still heavily under development, so you may find some functionality to be incomplete at the current moment, but rest assured the functionality is expanding. With that said, it would be greatly appreciated for issues or PRs to be submitted for any improvements at all, from fixing typos (guaranteed to be a few) to features to testing. Also available at: https://pypi.org/project/wombat/

Cooperman, Aubryn↗

Advancements in Constitutive Model Calibration: Leveraging the Power of Full‐Field DIC Measurements and In Situ Load Path Selection for Reliable Parameter Inference

Accurate material characterization and model calibration are essential for computationally supported high-consequence engineering decisions. Historically, characterization and calibration methods (1) use simplified test specimen geometries and global data, (2) cannot guarantee that sufficient characterization data are collected for a specific model of interest, (3) use deterministic methods that provide best-fit parameter values with no uncertainty quantification, and (4) are sequential, inflexible, and time-consuming. This work brings together several recent advancements into an improved workflow called interlaced characterization and calibration (ICC) that advances the state-of-the-art in constitutive model calibration. The ICC paradigm (1) employs tools to efficiently use full-field data to calibrate high-fidelity material models, (2) aligns the data needed with the data collected by adopting an optimal experimental design protocol, (3) quantifies parameter uncertainty through Bayesian inference and (4) incorporates these advancements into a quasi real-time feedback loop. The ICC framework is demonstrated here on the calibration of a material model using simulated full-field data for an aluminium cruciform specimen being deformed biaxially. The cruciform is actively driven through the myopically preferred load path using Bayesian optimal experimental design, which selects load steps that yield the maximum expected information gain (EIG). Principal component analysis (PCA) is performed on the model predictions of full-field displacements, and fast surrogate models are built to approximate the input-output relationships of the expensive finite element model. Furthermore, the tools developed and demonstrated here show that high-fidelity constitutive models can be efficiently and reliably calibrated with quantified uncertainty, thus supporting credible decision-making and potentially increasing the agility of solid mechanics modelling by enabling utilization of computational simulations at earlier stages of the design cycle.

Bayesian optimal experimental design↗

Exploration of multifidelity UQ sampling strategies for computer network applications.

Network modeling is a powerful tool to enable rapid analysis of complex systems that can be challenging to study directly using physical testing. Here, two approaches are considered: emulation and simulation. The former runs real software on virtualized hardware, while the latter mimics the behavior of network components and their interactions in software. Although emulation provides an accurate representation of physical networks, this approach alone cannot guarantee the characterization of the system under realistic operative conditions. Operative conditions for physical networks are often characterized by intrinsic variability (payload size, packet latency, etc.) or a lack of precise knowledge regarding the network configuration (bandwidth, delays, etc.); therefore uncertainty quantification (UQ) strategies should be also employed. UQ strategies require multiple evaluations of the system with a number of evaluation instances that roughly increases with the problem dimensionality, i.e., the number of uncertain parameters. It follows that a typical UQ workflow for network modeling based on emulation can easily become unattainable due to its prohibitive computational cost. In this paper, a multifidelity sampling approach is discussed and applied to network modeling problems. The main idea is to optimally fuse information coming from simulations, which are a low-fidelity version of the emulation problem of interest, in order to decrease the estimator variance. By reducing the estimator variance in a sampling approach it is usually possible to obtain more reliable statistics and therefore a more reliable system characterization. Several network problems of increasing difficulty are presented. For each of them, the performance of the multifidelity estimator is compared with respect to the single fidelity counterpart, namely, Monte Carlo sampling. For all the test problems studied in this work, the multifidelity estimator demonstrated an increased efficiency with respect to MC.

97 MATHEMATICS AND COMPUTING↗

An Approach to Bayesian Optimization for Design Feasibility Check on Discontinuous Black-Box Functions

The paper presents a novel approach to applying Bayesian Optimization (BO) in predicting an unknown constraint boundary, also representing the discontinuity of an unknown function, for a feasibility check on the design space, thereby representing a classification tool to discern between a feasible and infeasible region. Bayesian optimization is a low-cost black-box global optimization tool in the Sequential Design Methods where one learns and updates knowledge from prior evaluated designs, and proceeds to the selection of new designs for future evaluation. However, BO is best suited to problems with the assumption of a continuous objective function and does not guarantee true convergence when having a discontinuous design space. This is because of the insufficient knowledge of the BO about the nature of the discontinuity of the unknown true function. In this paper, we have proposed to predict the location of the discontinuity using a BO algorithm on an artificially projected continuous design space from the original discontinuous design space. The proposed approach has been implemented in a thin tube design with the risk of creep-fatigue failure under constant loading of temperature and pressure. The stated risk depends on the location of the designs in terms of safe and unsafe regions, where the discontinuities lie at the transition between those regions; therefore, the discontinuity has also been treated as an unknown creep-fatigue failure constraint. The proposed BO algorithm has been trained to maximize sampling toward the unknown transition region, to act as a high accuracy classifier between safe and unsafe designs with minimal training cost. The converged solution has been validated for different design parameters with classification error rate and function evaluations at an average of <1% and ~150, respectively. Finally, the performance of our proposed approach in terms of training cost and classification accuracy of thin tube design is shown to be better than the existing machine learning (ML) algorithms such as Support Vector Machine (SVM), Random Forest (RF), and Boosting.

Engineering↗

Front-End Engineering Design (FEED) Study for a Carbon Capture Plant Retrofit to a Natural Gas-Fired Gas Turbine Combined Cycle Power Plant (2x2x1 Duct-Fired 758-MWe Facility with F Class Turbines)

A comprehensive front-end engineering design (FEED) study has been undertaken by Bechtel National Inc. (Bechtel) for locating a post-combustion capture and compression (PCC) unit at Panda’s Sherman natural gas–combined cycle (NGCC) power plant in Sherman, Texas. This is described in the unredacted FEED Study report (Attachment 1) with all supporting documents, numbering over 150. The Study Report is publicly available. Sizing of the PCC plant is based on treating an amount of flue gas equivalent to that produced when generating 420 MW, which is approximately 68% of the total flue gas emitted by the NGCC power plant operating at guarantee condition with duct burners off. A reduced power plant capacity factor was used for sizing the PCC plant because the gas turbines at the site often operate at reduced load due to the high penetration of renewable power in the ERCOT region. The cost of carbon capture is primarily driven by capital cost (and therefore is highly sensitive to capacity factor). Sizing the capture unit so that when used it is nearly always operating at full capacity is critical to the economic viability of the proposed investment.

03 NATURAL GAS↗

Beware of agents when flying aircraft: Basic principles behind a generic methodology for the evaluation and certification of advanced aviation systems

There is currently a growing interest in the aeronautical community to assess the effects of the increasing levels of automation on pilots' performance and overall safety. The first effect of automation is the change in the nature of the pilot's role on the flight deck. Pilots have become supervisors who monitor aircraft systems in usual situations and intervene only when unanticipated events occur. Instead of 'hand flying' the airplane, pilots contribute to the control of aircraft by acting as mediators, instructions given to the automation. By eliminating the need for manually controlling normal situations, such a role division has reduced the opportunities for the pilot to acquire experience and skills necessary to safely cope with abnormal events. Difficulties in assessing the state and behavior of automation arise mainly from four factors: (1) the complexity of current systems and consequence mode-related problems; (2) the intrinsic autonomy of automation which is able to fire mode transitions without explicit commands from the pilots; (3) the bad quality of feed-back from the control systems displays and interfaces to the pilots; and (4) the fact that the automation currently has no explicit representation of the current pilots' intentions and strategy. Assuming certification has among its major goals to guarantee the passengers' and pilots' safety and the airplane integrity under normal and abnormal operational conditions, the authors suggest it would be particularly fruitful to come up with a conceptual reference system providing the certification authorities both with a theoretical framework and a list of principles usable for assessing the quality of the equipment and designs under examination. This is precisely the scope of this paper. However, the authors recognize that the conceptual presented is still under development and would thus be best considered as a source of reflection for the design, evaluation and certification processes of advanced aviation technologies.

Javaux, Denis↗

Randomized Algorithms for Scientific Computing (RASC)

Randomized algorithms have propelled advances in artificial intelligence (AI) and represent a foundational research area in advancing AI for Science. Future advancements in DOE Office of Science priority areas such as climate science, astrophysics, fusion, advanced materials, combustion, and quantum computing all require randomized algorithms for surmounting challenges of complexity, robustness, and scalability. Advances in data collection and numerical simulation have changed the dynamics of scientific research and motivate the need for randomized algorithms. For instance, advances in imaging technologies such as X-ray ptychography, electron microscopy, electron energy loss spectroscopy, or adaptive optics lattice light-sheet microscopy collect hyperspectral imaging and scattering data in terabytes, at breakneck speed enabled by state-of-the-art detectors. The data collection is exceptionally fast compared with its analysis. Likewise, advances in high-performance architectures have made exascale computing a reality and changed the economies of scientific computing in the process. Floating-point operations that create data are essentially free in comparison with data movement. Thus far, most approaches have focused on creating faster hardware. Ironically, this faster hardware has exacerbated the problem by making data still easier to create. Under such an onslaught, scientists often resort to heuristic deterministic sampling schemes (e.g., low-precision arithmetic, sampling every nth element) and sacrifice potentially valuable accuracy. Dramatically better results can be achieved via randomized algorithms, reducing the data size as much as or more than naive deterministic subsampling can achieve, while retaining the high accuracy of computing on the full data set. By randomized algorithms we mean those algorithms that employ some form of randomness in internal algorithmic decisions to accelerate time to solution, increase scalability, or improve reliability. Examples include matrix sketching for solving large-scale least-squares problems (see Figure 1) and stochastic gradient descent for training machine learning models. We are not recommending heuristic methods but rather randomized algorithms that have certificates of correctness and probabilistic guarantees of optimality and near-optimality. Such approaches can be useful beyond acceleration, for example, in understanding how to avoid measure zero worst-case scenarios that plague methods such as QR matrix factorization.

97 MATHEMATICS AND COMPUTING↗

Advances in 3D transient plasma dynamics and control through MHD and hybrid fluid-kinetic simulations with JOREK

Transient phenomena and their control are of high relevance in magnetic confinement fusion plasmas to guarantee a stable and safe plasma operation. Interpretative simulations can maximize the insights gained from experiments on present machines and predictive simulations can help in the preparation of design, mitigation techniques and operational scenarios for future devices. In this article, we provide an overview of recent advances and novel scientific results obtained with the 3D non-linear hybrid fluid-kinetic code JOREK, covering physics of plasma transients from the core to the scrape-off layer (SOL) both for tokamak and stellarator devices. Substantial progress was made in the physics understanding, model validation with experiments and experiment interpretation, thus, giving confidence for predictions to devices like DTT, ITER and DEMO. The topics addressed comprise a wide range: the edge physics of new operation scenarios and edge localized mode suppression; major disruptions with a focus on runaway electrons and vertical displacement events as well as disruption mitigation by shattered pellet injection; the physics mechanisms and operational limits of the flux pumping regime for sawtooth control; MHD limits of stellarators and work towards incorporating advanced edge/SOL/exhaust dynamics; continuing improvements of the code for more efficient hybrid simulations on conventional and accelerated high performance computing architectures.

disruptions↗

Benders Decomposition Using Graph Modeling and Multi-Parametric Programming

Benders decomposition is a widely used method for solving large and structured optimization problems, but its performance is affected by the repeated solution of subproblems. We propose a flexible and modular algorithmic framework for accelerating Benders decomposition. Specifically, we express the problem structure by using a graph-theoretic modeling abstraction in which nodes represent optimization subproblems and edges represent connectivity between subproblems. A key innovation of our approach is that we embed multiparametric programming (mp) surrogates for node subproblems, which maps the exact analytical map of the subproblem solution space. The use of mp surrogates allows us to replace subproblem solves with fast look-ups and function evaluations for primal and dual variables during the iterative Benders process. We formally show the equivalence between classical Benders cuts and those derived from the mp solution. We implement our framework in the open-source PlasmoBenders.jl software package. To demonstrate the capabilities of the proposed framework, we apply it to a two-stage stochastic programming problem, which aims to make optimal capacity expansion decisions under market uncertainty. We evaluate both single-cut and multicut variants of Benders decomposition and show that the use of mp surrogates achieves substantial speedups in subproblem solve time, while preserving the convergence guarantees of Benders decomposition. We highlight advantages in solution analysis and interpretability that is enabled by mp critical region tracking; specifically, we show that these reveal how decisions evolve geometrically across the Benders search. Our results aim to demonstrate that combining surrogate modeling with graph modeling offers a promising and extensible foundation for structure-exploiting decomposition. In addition, by decomposing the problem into more tractable subproblems, the proposed approach also aims to overcome scalability issues of mp. Finally, the use of mp surrogates provides a unifying and modular optimization framework that enables the representation of heterogeneous node subproblems as modeling objects with a homogeneous structure.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗