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 451 records · Page 25
All sourcesNASA NTRSDOE OSTI
NASA NTRSDate not supplied

Application of the BSRN Data in Validating the GEWEX SRB Data: Quality-Control and Resulting Available Monthly Means

The BSRN data have been used in validation of the satellite-based GEWEX SRB data, and the recent Release 4.0-IP data cover the 34-year period from July 1983 to June 2017. Here we focus on the validation of the shortwave monthly means from 1992 to 2017 against the BSRN Global 1. We first perform the BSRN-recommended quality-control on the original data. We then calculate the monthly-hourly means from which we calculate the monthly means. Twenty-four (24) monthly-hourly means are required to calculate a monthly mean. To guarantee the quality of the monthly mean, we also require that 95% or more hourly means be available in order for a monthly-hourly mean to be calculated. Since the above quality-control significantly reduces the number of available monthly means, we are curious how many monthly means we would get if we relax the quality-control, and how the resulting monthly means would compare with the GEWEX SRB data. In a version we experimented, only constant upper and lower bounds are imposed on various fluxes, and the original data are largely retained. We found that many more monthly means would be available, and the overall bias and RMS would not be significantly different from that of the strict quality-control. With the strict quality-control, if we let Avail (minimum percentage of available hourly means required for a monthly-hourly mean to be computed) change from 3.2% to 95%, the Bias/RMS/N change from -2.77/20.56/9756 to -0.35/13.41/4581, where N is the number of available monthly means, and Bias and RMS are in the unit of W/sq. m. On the other hand, with the lax quality-control, when Avail changes from 3.2% to 95%, the Bias/RMS/N change from -0.82/19.53/9819 to -0.21/14.41/5875. South Pole (SPO) is one of the sites we are particularly interested in. With the strict quality-control, and when Avail changes from 3.2% to 95%, the Bias/RMS/N change from 5.89/15.85/283 to 1.23/5.52/133; with the lax quality-control, the Bias/RMS/N change from 1.17/11.21/284 to 1.88/7.9/177.

Taiping Zhang↗
DOE OSTI2021

Machine Learning Assisted Safety Modeling and Analysis of Advanced Reactors

With the advances in computational power and numerical methods, analysts can now rely on first-principle simulations to predict ultra-fine details in a variety of applications. Advances in machine learning (ML) have produced algorithms that can now learn high-level abstractions via hierarchical models. This project aims to leverage advances in ML techniques and the available high-resolution simulation data to develop a novel modeling and simulation (M\&S) methodology for reactor safety analysis. While application-agnostic ML techniques are available, complex physics constraints need to be incorporated into ML techniques to build ML-based closures for computationally efficient predictive simulations. This project intends to develop a physics-guided data-driven multi-scale methodology for M\&S of advanced reactors. The project focuses on thermal fluid (T/F) phenomena, which play major roles in advanced reactor safety. Specifically, we propose a data-driven coarse-mesh turbulence model based on local flow features for the transient analysis of thermal mixing and stratification in a sodium-cooled fast reactor (SFR). The model has a coarse-mesh setup to ensure computational efficiency, while it is trained by fine-mesh computational fluid dynamics (CFD) data with Reynolds-averaged Navier-Stokes (RANS) turbulence model to ensure accuracy. Three different neural networks are developed and tested for loss-of-flow transients in the hot pool of SFR, i.e. the densely connected convolutional neural network (DCNN), long-short-term-memory network based on proper orthogonal decomposition (POD-LSTM), and the DCNN informed by LSTM (DCNN-LSTM). The performances of these three neural networks are evaluated based on baseline models. The DCNN-LSTM model has been chosen for further hyperparameter optimization. Furthermore, based on a simplified two-dimensional case, uncertainty quantification (UQ) of the developed ML-based closure are investigated with three methods, i.e. Monte Carlo dropout, deep ensemble, and Bayesian neural network. The developed ML-based turbulent viscosity closure relation based on deep ensemble is then integrated into the system analysis module SAM and serves as a term in the conservation equations. Such a SAM-ML based procedure guarantees that the obtained results are consistent with the physical constraints of the thermal-fluid system. The SAM-ML simulation on the same loss-of-flow transient showed comparable accuracy with the CFD simulation but with a much coarser mesh setup. Last but not least, the ML-based closure improvement with the support of higher-fidelity data from large eddy simulation (LES) is discussed. As a first step towards this direction, a baseline LES simulation is performed to obtain comparable data with RANS results. Based on the early results, future investigation on further improving the ML-based closure is discussed. We believe the developed approach that combines scientific machine learning with nuclear system analysis code can benefit the advanced reactor community as more accurate safety analyses will better characterize reactor safety margins and reduce licensing efforts.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2023

Out-of-distribution generalization for learning quantum dynamics

Abstract Generalization bounds are a critical tool to assess the training data requirements of Quantum Machine Learning (QML). Recent work has established guarantees for in-distribution generalization of quantum neural networks (QNNs), where training and testing data are drawn from the same data distribution. However, there are currently no results on out-of-distribution generalization in QML, where we require a trained model to perform well even on data drawn from a different distribution to the training distribution. Here, we prove out-of-distribution generalization for the task of learning an unknown unitary. In particular, we show that one can learn the action of a unitary on entangled states having trained only product states. Since product states can be prepared using only single-qubit gates, this advances the prospects of learning quantum dynamics on near term quantum hardware, and further opens up new methods for both the classical and quantum compilation of quantum circuits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Out-of-distribution generalization for learning quantum dynamics

Generalization bounds are a critical tool to assess the training data requirements of Quantum Machine Learning (QML). Recent work has established guarantees for in-distribution generalization of quantum neural networks (QNNs), where training and testing data are drawn from the same data distribution. However, there are currently no results on out-of-distribution generalization in QML, where we require a trained model to perform well even on data drawn from a different distribution to the training distribution. Here, we prove out-of-distribution generalization for the task of learning an unknown unitary. In particular, we show that one can learn the action of a unitary on entangled states having trained only product states. Since product states can be prepared using only single-qubit gates, this advances the prospects of learning quantum dynamics on near term quantum hardware, and further opens up new methods for both the classical and quantum compilation of quantum circuits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1983

Effect of oxygen concentration in ZDP containing oils on surface composition and wear

A pin-on-disk wear study was performed with the lubricants dibutyl sebacate (DBS) and mineral oil (MO) with and without 1 weight percent zinc-dialkyl-dithiophospatee (ZDP) as an additive. The pin was annealed pure iron and the disk was M-2 tool steel. The selected load and speed guaranteed boundary lubrication. The ambient atmospheric oxygen concentration in an oxygen-nitrogen mixture was varied from 0 percent to 20 percent in order to examine its relationship to ZDP effectiveness. Auger electron spectroscopy combined with argon ion bombardment (depth profiling) was used to determine surface elemental composition on the pin when tested in DBS with and without ZDP. The ambient atmosphere was found to cause large variations in wear rate and surface composition. With MO, ZDP reduced wear under all conditions, but had little advantage over oxides formed at 20 percent oxygen atmosphere. With DBS, ZDP reduced wear at 0 percent oxygen, but gave varied results at other oxygen concentrations. Depth profiling revealed sulfuide formation at 0 percent oxygen and probably sulfates at 20 percent oxygen. The results are significant because varied oxygen concentrations can occur under actual lubricating conditions in practical machinery.

Brainard, W. A.↗
NASA NTRS2008

Automated Assume-Guarantee Reasoning by Abstraction Refinement

Current automated approaches for compositional model checking in the assume-guarantee style are based on learning of assumptions as deterministic automata. We propose an alternative approach based on abstraction refinement. Our new method computes the assumptions for the assume-guarantee rules as conservative and not necessarily deterministic abstractions of some of the components, and refines those abstractions using counter-examples obtained from model checking them together with the other components. Our approach also exploits the alphabets of the interfaces between components and performs iterative refinement of those alphabets as well as of the abstractions. We show experimentally that our preliminary implementation of the proposed alternative achieves similar or better performance than a previous learning-based implementation.

Pasareanu, Corina S.↗
NASA NTRS2010

Automatic Review of Abstract State Machines by Meta Property Verification

A model review is a validation technique aimed at determining if a model is of sufficient quality and allows defects to be identified early in the system development, reducing the cost of fixing them. In this paper we propose a technique to perform automatic review of Abstract State Machine (ASM) formal specifications. We first detect a family of typical vulnerabilities and defects a developer can introduce during the modeling activity using the ASMs and we express such faults as the violation of meta-properties that guarantee certain quality attributes of the specification. These meta-properties are then mapped to temporal logic formulas and model checked for their violation. As a proof of concept, we also report the result of applying this ASM review process to several specifications.

Arcaini, Paolo↗
DOE OSTI2023

Evaluation of Thermal Neutron Scattering Cross Section of Uranium Silicide with Ab Initio Lattice Dynamics

Uranium silicide (U 3 Si 2 ) is a candidate material for the high-density nuclear fuel in commercial light water reactors [1], [2]. Its higher uranium density, 11.3 g-U/cm3, compared to that of uranium dioxide (UO 2 ), 9.7 g-U/cm3, can improve the performance of a nuclear reactor while using low enriched uranium (LEU) and diversify the choice of cladding materials [1]–[3]. It also has a higher thermal conductivity than UO 2 , which can reduce the thermal stress on the material caused by a temperature gradient across the fuel pellet and provide a larger margin for some postulated accidents [1], [2], [4]. Furthermore, compared to U3Si, another high-density fuel candidate, it has better resistance to in-pile swelling due to less irradiation-induced rapid amorphization [1], [3]. Corresponding to its importance in nuclear engineering, many previous studies have reported the properties of U3Si2. Experiments showed that U 3 Si 2 is a paramagnetic (PM) metal, where a slight linear increase in magnetic susceptibility was measured with increasing temperature [5], [6]. In addition, thermodynamic quantities such as thermal expansion coefficient, heat capacity, and thermal conductivity were experimentally determined over a wide temperature range [1], [7], [8]. In several computational studies, ab initio atomistic simulations based on density functional theory (DFT) were performed to calculate various properties including elastic constants, electronic density of states (DOS), and phonon dispersion curves [9]–[12]. Nevertheless, thermal neutron scattering cross sections, which are critical to the prediction of the parameters in reactor physics that are ultimately related to reactor criticality, have not yet been evaluated for U3Si2. The scattering cross section can be calculated from the phonon DOS, or the energy spectrum of lattice vibrations, of the crystalline system [13], [14]. However, there is also no experimental data available for the phonon DOS of U 3 Si 2 . While some computational studies reported the phonon DOS and/or dispersion curves from ab initio simulations [9]–[12], the accuracy cannot be guaranteed because it is unclear whether the spin-polarization behavior of PM U 3 Si 2 was properly described. In the present study, the thermal neutron scattering cross section for U 3 Si 2 is evaluated for the first time by calculating the phonon DOS for U3Si2 from ab initio lattice dynamics (AILD) simulations based on DFT. First, U 3 Si 2 is modeled based on the experimental structure, and AILD simulations are performed on the modeled U3Si2 to optimize the structure. Next, AILD simulations are performed for supercells with atomic displacement to calculate Hellmann-Feynman forces. Based on the calculated forces, partial phonon DOSs for U and Si are obtained, and the thermal neutron scattering law (TSL) for U 3 Si 2 is finally evaluated. To verify the accuracy of the calculations in the present study, the calculation results are compared with experimental data on the structure and heat capacity of U3Si2 [1], [7], [8], [15].

Geometry Optimization↗
DOE OSTI2020

Numerical relativity in spherical coordinates: A new dynamical spacetime and general relativistic MHD evolution framework for the Einstein Toolkit

We present SphericalNR, a new framework for the publicly available Einstein Toolkit that numerically solves the Einstein field equations coupled to the equations of general relativistic magnetohydrodynamic (GRMHD) in a 3+1 split of spacetime in spherical coordinates without symmetry assumptions. The spacetime evolution is performed using reference-metric versions of either the Baumgarte-Shapiro-Shibata-Nakamura equations or the fully covariant and conformal Z4 system with constraint damping. We have developed a reference-metric version of the Valencia formulation of GRMHD with a vector potential method, guaranteeing the absence of magnetic monopoles during the evolution. In our framework, every dynamical field (both spacetime and matter) is evolved using its components in an orthonormal basis with respect to the spherical reference metric. Furthermore, all geometric information about the spherical coordinate system is encoded in source terms appearing in the evolution equations. This allows for the straightforward extension of Cartesian high-resolution shock-capturing finite volume codes to use spherical coordinates with our framework. To this end, we have adapted GRHydro, a Cartesian finite volume GRMHD code already available in the Einstein Toolkit, to use spherical coordinates. We present the full evolution equations of the framework, as well as details of its implementation in the Einstein Toolkit. Finally, we validate SphericalNR by demonstrating it passes a variety of challenging code tests in static and dynamical spacetimes.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2021

A Bimodal Diagnostic Cloud Fraction Parameterization. Part II: Evaluation and Resolution Sensitivity

A wide range of approaches exists to account for subgrid cloud variability in regional simulations of the atmosphere. This paper addresses the following questions: 1) Is there still benefit in representing subgrid variability of cloud in convection-permitting simulations? 2) What is the sensitivity to the cloud fraction parameterization complexity? 3) Are current cloud fraction parameterizations scale-aware across convection-permitting resolutions? These questions are addressed for regional simulations of a 6-week observation campaign in the U.S. southern Great Plains. Particular attention is given to a new diagnostic cloud fraction scheme with a bimodal subgrid saturation-departure PDF, described in Part I. The model evaluation is performed using ground-based remote sensing synergies, satellite-based retrievals, and surface observations. It is shown that not using a cloud fraction parameterization results in underestimated cloud frequency and water content, even for stratocumulus. The use of a cloud fraction parameterization does not guarantee improved cloud property simulations, however. Diagnostic and prognostic cloud schemes with a symmetric subgrid saturation-departure PDF underestimate cloud fraction and cloud optical thickness, and hence overestimate surface shortwave radiation. These schemes require empirical bias-correction techniques to improve the cloud cover. The new cloud fraction parameterization, introduced in Part I, improves cloud cover, liquid water content, cloud-base height, optical thickness, and surface radiation compared to schemes reliant on a symmetric PDF. Furthermore, cloud parameterizations using turbulence-based, rather than prescribed constant subgrid variances, are shown to be more scale-aware across convection-permitting resolutions.

54 ENVIRONMENTAL SCIENCES↗
NASA NTRS1996

Petabyte Class Storage at Jefferson Lab (CEBAF)

By 1997, the Thomas Jefferson National Accelerator Facility will collect over one Terabyte of raw information per day of Accelerator operation from three concurrently operating Experimental Halls. When post-processing is included, roughly 250 TB of raw and formatted experimental data will be generated each year. By the year 2000, a total of one Petabyte will be stored on-line. Critical to the experimental program at Jefferson Lab (JLab) is the networking and computational capability to collect, store, retrieve, and reconstruct data on this scale. The design criteria include support of a raw data stream of 10-12 MB/second from Experimental Hall B, which will operate the CEBAF (Continuous Electron Beam Accelerator Facility) Large Acceptance Spectrometer (CLAS). Keeping up with this data stream implies design strategies that provide storage guarantees during accelerator operation, minimize the number of times data is buffered allow seamless access to specific data sets for the researcher, synchronize data retrievals with the scheduling of postprocessing calculations on the data reconstruction CPU farms, as well as support the site capability to perform data reconstruction and reduction at the same overall rate at which new data is being collected. The current implementation employs state-of-the-art StorageTek Redwood tape drives and robotics library integrated with the Open Storage Manager (OSM) Hierarchical Storage Management software (Computer Associates, International), the use of Fibre Channel RAID disks dual-ported between Sun Microsystems SMP servers, and a network-based interface to a 10,000 SPECint92 data processing CPU farm. Issues of efficiency, scalability, and manageability will become critical to meet the year 2000 requirements for a Petabyte of near-line storage interfaced to over 30,000 SPECint92 of data processing power.

Chambers, Rita↗
DOE OSTI2022

Code Verification and Solution Verification framework in pin-resolved neutron transport code MPACT

Program verification in scientific computing encompasses the application of formal and mathematical techniques to a scientific computing code for its credibility, accuracy, and validity. Code Verification identifies bugs and performance issues in the software development stage. Solution Verification assesses the applicability of the code and the accuracy of the solution to problems of interest. Both activities utilize application cases and quantify the error against prescribed acceptance criteria. However, simply executing more application cases does not guarantee stronger or more comprehensive credibility. Here, we establish a verification framework that involves Code Verification and Solution Verification, both of which work together such that the overarching goal of “converge to the correct answer for the intended application” can be reasonably inferred. The application of such a verification framework is demonstrated using the pin-resolved neutron transport code MPACT, where standard unit tests and regression tests are covered, and where the Method of Exact Solutions and the Method of Manufactured Solutions are successfully used. Additionally, the applicability of Method of Manufactured Solutions is extended to the OECD/NEA C5G7 benchmark problems of practical material and geometric configurations. Solution Verification activities are demonstrated on a practical hierarchy of application models of increasing complexity ranging from 2D pin cell problems to 3D assembly problems. The convergence behavior and rate of convergence with respect to each individual variable are studied and provided. This framework can be adapted broadly to other fields involving scientific computing codes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Coefficient-to-Basis Network: a fine-tunable operator learning framework for inverse problems with adaptive discretizations and theoretical guarantees

We propose a Coefficient-to-Basis Network (C2BNet), a novel framework for solving inverse problems within the operator learning paradigm. C2BNet efficiently adapts to different discretizations through fine-tuning, using a pre-trained model to significantly reduce computational cost while maintaining high accuracy. Unlike traditional approaches that require retraining from scratch for new discretizations, our method enables seamless adaptation without sacrificing predictive performance. Furthermore, we establish theoretical approximation and generalization error bounds for C2BNet by exploiting low-dimensional structures in the underlying datasets. Our analysis demonstrates that C2BNet adapts to low-dimensional structures without relying on explicit encoding mechanisms, highlighting its robustness and efficiency. To validate our theoretical findings, we conducted extensive numerical experiments that showcase the superior performance of C2BNet on several inverse problems. The results confirm that C2BNet effectively balances computational efficiency and accuracy, making it a promising tool to solve inverse problems in scientific computing and engineering applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

DP-TwoLevel: two-stage gradient subspace learning for differentially private federated learning

Federated learning (FL) enables collaborative model training across distributed data sources without sharing raw data, but faces fundamental challenges in communication efficiency and privacy. Differentially private (DP) training mitigates information leakage but introduces noise that degrades model performance, especially in high-dimensional settings. We propose DP-TwoLevel, a hierarchical gradient projection method that improves utility under fixed DP constraints by exploiting low-dimensional structure in model updates. Our approach learns a two-level PCA-based representation of gradients and applies DP noise in a reduced-dimensional subspace, thereby lowering the effective noise magnitude while preserving dominant signal components. We evaluate the method across three datasets (MNIST, Fashion-MNIST, CIFAR-10) and three privacy regimes (ϵ∈0.5, 1.0, 2.0). Across nine experimental settings, DP-TwoLevel consistently outperforms DP-FedAvg, achieving an average accuracy improvement of 9.44%, with larger gains observed in lower ϵ(higher-noise) regimes (up to +22.31%). We further analyze scalability across models ranging from 100K to 1.49M parameters and identify a variance-based success criterion: performance remains strong when the projection preserves more than 75% of gradient variance, degrades in a marginal regime (65–75%), and fails below this threshold. Our results demonstrate that structure-aware dimensionality reduction can significantly improve the privacy–utility tradeoff in FL without modifying formal privacy guarantees. We also provide empirical evidence of scaling limitations for global projections and motivate per-layer extensions for larger models.

Kotevska, Olivera [ORNL] (ORCID:0000000316772243)↗
NASA NTRS1999

Traffic Management in ATM Networks Over Satellite Links

This report presents a survey of the traffic management Issues in the design and implementation of satellite Asynchronous Transfer Mode (ATM) networks. The report focuses on the efficient transport of Transmission Control Protocol (TCP) traffic over satellite ATM. First, a reference satellite ATM network architecture is presented along with an overview of the service categories available in ATM networks. A delay model for satellite networks and the major components of delay and delay variation are described. A survey of design options for TCP over Unspecified Bit Rate (UBR), Guaranteed Frame Rate (GFR) and Available Bit Rate (ABR) services in ATM is presented. The main focus is on traffic management issues. Several recommendations on the design options for efficiently carrying data services over satellite ATM networks are presented. Most of the results are based on experiments performed on Geosynchronous (GEO) latencies. Some results for Low Earth Orbits (LEO) and Medium Earth Orbit (MEO) latencies are also provided.

Goyal, Rohit↗
DOE OSTI2025

Automatic Generation of Algorithms for High-Speed Reliable Lossy Data Compression (Final Report)

Fast reliable data compression is urgently needed for many leading-edge scientific instruments and for exascale high-performance computing applications because they produce vast amounts of data at extremely high rates. The goal of this project has been to develop a framework named LC that is able to automatically generate high-speed lossless and reliable lossy compression and decompression algorithms that can be customized for different kinds of data. The resulting LC framework is freely available on GitHub. To achieve high-speed operation, LC outputs optimized and parallelized CPU and GPU implementations of the generated algorithms. To ensure the quality of lossily compressed data, LC guarantees the user-provided error bound. To be able to customize the compression algorithm to various use cases, LC can synthesize millions of different algorithms and automatically search for the one that works best for the given data. We have already employed LC to create state-of-the-art lossless and lossy compressors for scientific data as well as leading lossless compressors for images. We hope that LC and the customized, fast, reliable, and CPU/GPU-compatible compression algorithms that it can generate will greatly benefit the many scientific applications that need not only high trustworthiness but also high performance.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1991

Compression of digital images over local area networks. Appendix 1: Item 3

Differential Pulse Code Modulation (DPCM) has been used with speech for many years. It has not been as successful for images because of poor edge performance. The only corruption in DPC is quantizer error but this corruption becomes quite large in the region of an edge because of the abrupt changes in the statistics of the signal. We introduce two improved DPCM schemes; Edge correcting DPCM and Edge Preservation Differential Coding. These two coding schemes will detect the edges and take action to correct them. In an Edge Correcting scheme, the quantizer error for an edge is encoded using a recursive quantizer with entropy coding and sent to the receiver as side information. In an Edge Preserving scheme, when the quantizer input falls in the overload region, the quantizer error is encoded and sent to the receiver repeatedly until the quantizer input falls in the inner levels. Therefore these coding schemes increase the bit rate in the region of an edge and require variable rate channels. We implement these two variable rate coding schemes on a token wing network. Timed token protocol supports two classes of messages; asynchronous and synchronous. The synchronous class provides a pre-allocated bandwidth and guaranteed response time. The remaining bandwidth is dynamically allocated to the asynchronous class. The Edge Correcting DPCM is simulated by considering the edge information under the asynchronous class. For the simulation of the Edge Preserving scheme, the amount of information sent each time is fixed, but the length of the packet or the bit rate for that packet is chosen depending on the availability capacity. The performance of the network, and the performance of the image coding algorithms, is studied.

Gorjala, Bhargavi↗
DOE OSTI2025

Generative AI models for learning flow maps of stochastic dynamical systems in bounded domains

Simulating stochastic differential equations (SDEs) in bounded domains, presents significant computational challenges due to particle exit phenomena, which requires accurate modeling of interior stochastic dynamics and boundary interactions. Despite the success of machine learning-based methods in learning SDEs, existing learning methods are not applicable to SDEs in bounded domains because they cannot accurately capture the particle exit dynamics. We present a unified hybrid data-driven approach that combines a conditional diffusion model with an exit prediction neural network to capture both interior stochastic dynamics and boundary exit phenomena. Our ML model consists of two major components: a neural network that learns exit probabilities using binary cross-entropy loss with rigorous convergence guarantees, and a training-free diffusion model that generates state transitions for non-exiting particles using closed-form score functions. The two components are integrated through a probabilistic sampling algorithm that determines particle exit at each time step and generates appropriate state transitions. Here, the performance of the proposed approach is demonstrated via three test cases: a one-dimensional simplified problem for theoretical verification, a two-dimensional advection-diffusion problem in a bounded domain, and a three-dimensional problem of interest to magnetically confined fusion plasmas.

Bounded domains↗