Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Operator approximation”

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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Covariance operator estimation: Sparsity, lengthscale, and ensemble Kalman filters

This paper investigates covariance operator estimation via thresholding. For Gaussian random fields with approximately sparse covariance operators, we establish non-asymptotic bounds on the estimation error in terms of the sparsity level of the covariance and the expected supremum of the field. We prove that thresholded estimators enjoy an exponential improvement in sample complexity compared with the standard sample covariance estimator if the field has a small correlation lengthscale. As an application of the theory, we study thresholded estimation of covariance operators within ensemble Kalman filters.

Covariance operator estimation↗
DOE OSTI2023

Fast Multigrid Reduction-in-Time for Advection via Modified Semi-Lagrangian Coarse-Grid Operators

Many iterative parallel-in-time algorithms have been shown to be highly efficient for diffusion-dominated partial differential equations (PDEs) but are inefficient or even divergent when applied to advection-dominated PDEs. We consider the application of the multigrid reduction-in-time (MGRIT) algorithm to linear advection PDEs. Here, the key to efficient time integration with this method is using a coarse-grid operator that provides a sufficiently accurate approximation to the so-called ideal coarse-grid operator. For certain classes of semi-Lagrangian discretizations, we present a novel semi-Lagrangian-based coarse-grid operator that leads to fast and scalable multilevel time integration of linear advection PDEs. The coarse-grid operator is composed of a semi-Lagrangian discretization followed by a correction term, with the correction designed so that the leading-order truncation error of the composite operator is approximately equal to that of the ideal coarse-grid operator. Parallel results show substantial speed-ups over sequential time integration for variable-wave-speed advection problems in one and two spatial dimensions, and using high-order discretizations up to order five. The proposed approach establishes the first practical method that provides small and scalable MGRIT iteration counts for advection problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

High-performance and high-fidelity Monte Carlo solutions to the BEAVRS benchmark

The BEAVRS (Benchmark for Evaluation and Validation of Reactor Simulation) benchmark is solved by PRAGMA, the GPU-based continuous energy Monte Carlo code. The resulting solutions are comprised of the detailed simulation results of two cycles, each of which consists of the zero power physics test (ZPPT) and the core depletion calculations. The ZPPT consists of characteristic parameters, such as critical boron concentration (CBC), control rod bank worth, isothermal temperature coefficients, and assembly-wise detector signal, which are compared with measured data provided by the benchmark administration. The core depletion calculations were performed for both the hot full power and the load follow modes, and the comparison was made with the measured or deduced CBCs and assembly-wise detector signals. In the load follow calculations, the operating power history was approximately applied to simulate the real operation as closely as possible. PRAGMA performed the various calculations with a tremendous number of histories ranging up to hundreds of millions per cycle, exploiting GPUs' massively parallel performance. The load follow run time was shorter than 16 hours on a single rack of computing nodes mounded with 24 gaming GPUs with a remarkable agreement with the measurements for most comparisons. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2025

Enhanced Collisional Losses from a Magnetic Mirror Using the Lenard-Bernstein Collision Operator

Collisions are crucial in governing particle and energy transport in plasmas confined in a magnetic mirror trap. Modern gyrokinetic codes model transport in magnetic mirrors, but some utilize approximate model collision operators. This study focuses on a Pastukhov-style method of images calculation of particle and energy confinement times using a Lenard-Bernstein model collision operator. Prior work on parallel particle and energy balances used a different Fokker-Planck plasma collision operator. The method must be extended in non-trivial ways to study the Lenard-Bernstein operator. To assess the effectiveness of our approach, we compare our results with a modern finite element solver. Our findings reveal that the particle confinement time scales like a exp( a 2 ) using the Lenard-Bernstein operator, in contrast to the more accurate scaling that the Coulomb collision operator would yield a 2 exp( a 2 ), where a 2 is approximately proportional to the ambipolar potential. We propose that codes solving for collisional losses in magnetic mirrors utilizing the Lenard-Bernstein or Dougherty collision operator scale their collision frequency of any electrostatically confined species. This study illuminates the collision operator’s intricate role in the Pastukhov-style method of images calculation of collisional confinement.

fusion plasma↗
DOE OSTI2026

Modeling a generic TRISO-fueled heat pipe microreactor using SCALE: Depletion, transportation criticality, and shielding

This paper demonstrates the applicability of the SCALE code system to tristructural-isotropic (TRISO)-fueled heat pipe microreactors through depletion, transportation criticality, and shielding analyses of a generic reference design. The study conducted supports US Nuclear Regulatory Commission code readiness efforts for advanced non–light-water reactor technologies and is intended as a code capability demonstration rather than as an optimization of a specific microreactor design. The modeled reactor employs high-assay low-enriched uranium (HALEU) uranium oxycarbide (UCO) TRISO fuel and beryllium oxide (BeO) reflectors and operates at 7.5 MWth with a nominal lifetime of about 3 effective full power years. Representative cases for fresh and irradiated cores were selected to exercise SCALE methods relevant to reactor operation and post-irradiation transport. The discharged-core decay heat is approximately 6% of operating power immediately after shutdown. Transportation criticality calculations show that internal water ingress is the dominant reactivity effect, with fully flooded fresh core and irradiated core configurations remain above the subcriticality criterion, even with the available control mechanisms. Shielding calculations for a simplified transportation package indicate that normal-condition dose rates are governed mainly by shielding thickness and cooling time, whereas the breached hypothetical accident case is governed primarily by cooling time. Overall, the study shows that SCALE supports depletion, transportation criticality, and shielding evaluations efficiently for TRISO-fueled heat pipe microreactors within a single code system.

Criticality↗
DOE OSTI2025

Valuing the Future Electric Grid: A Bid-Based Approach

Energy storage resources (ESRs) and other zero marginal cost (ZMC) resources have unique characteristics that are not fully captured in today’s electricity planning and operations modeling tools. Because the modeling assumptions used in these tools are simplified approximations of how operations and investment decisions occur in the real-world, accurately representing cost and operational characteristics are key for determining how these resources impact price formation. Questions such as—Where should we build new transmission? Will a small modular reactor earn enough revenue to participate in the future electric grid? Is retrofitting a coal plant with carbon capture technology economically feasible?—all require accurate electricity prices, which aren’t available from today’s electricity planning and operations modeling tools. As an example, production cost models (PCMs) are heavily utilized tools that determine the cost and reliability of the electric system. However, as PCMs were developed to help thermal generators manage their fuel inventories, production cost modeling is largely based on fuel prices. Because ESRs do not incur fuel costs, they are often modeled as ZMC resources. In reality, ESRs incur opportunity costs as well as technology-specific (degradation) costs that are non-trivial to calculate but are important for price formation. In this research, we identify options to incorporate more realistic opportunity and degradation costs in ESR bidding algorithms. Expanding available bidding assumptions allows energy system modelers to develop more accurate economic valuations for ESRs, leading to more accurate price formation from leading energy system modeling tools.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

Learning nonlinear operators in latent spaces for real-time predictions of complex dynamics in physical systems

Abstract Predicting complex dynamics in physical applications governed by partial differential equations in real-time is nearly impossible with traditional numerical simulations due to high computational cost. Neural operators offer a solution by approximating mappings between infinite-dimensional Banach spaces, yet their performance degrades with system size and complexity. We propose an approach for learning neural operators in latent spaces, facilitating real-time predictions for highly nonlinear and multiscale systems on high-dimensional domains. Our method utilizes the deep operator network architecture on a low-dimensional latent space to efficiently approximate underlying operators. Demonstrations on material fracture, fluid flow prediction, and climate modeling highlight superior prediction accuracy and computational efficiency compared to existing methods. Notably, our approach enables approximating large-scale atmospheric flows with millions of degrees, enhancing weather and climate forecasts. Here we show that the proposed approach enables real-time predictions that can facilitate decision-making for a wide range of applications in science and engineering.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Weighted Composition Operators for Learning Nonlinear Dynamics

Operator theoretic methods in dynamical system have been dominated by the use of Koopman operators and their continuous time counterparts, such as Koopman Generators and Liouville Operators. The advantage gained from their use primarily stems from the ability to extract subspaces and eigenfunctions within a space of observables that are invariant with respect to the Koopman operator over that space. When this occurs, a dynamic mode decomposition of the systems state provides a linear model for the dynamical system. Not all Koopman operators have eigenfunctions that may be exploited in this manner. However, the framework can still be leveraged for approximations using other operators. In this setting, we present a different operator for the study of dynamical systems, the weighted composition operator. These operators are compact for a wide range of dynamics and spaces, and through their interactions with occupation kernels and vector valued kernels, they admit an estimation of the underlying dynamics. Here, this manuscript presents a new algorithm for the data driven study of dynamical systems from data, and also provides two numerical experiments where convergence is achieved as a proof of concept.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Biased degenerate ground-state sampling of small Ising models with converged quantum approximate optimization algorithm

The quantum alternating operator ansatz, a generalization of the quantum approximate optimization algorithm (QAOA), is a quantum algorithm used for approximately solving combinatorial optimization problems. QAOA typically uses the transverse field mixer as the driving Hamiltonian. One of the interesting properties of the transverse field driving Hamiltonian is that it results in nonuniform sampling of degenerate ground states of optimization problems. In this study, we numerically examine the fair sampling properties of the transverse field mixer QAOA, and Grover mixer QAOA (GM-QAOA), which provides theoretical guarantees of fair sampling of degenerate optimal solutions, up to a large enough p such that the mean expectation value converges to an optimal approximation ratio of 1. This comparison is performed with high-quality heuristically computed, but not necessarily optimal, QAOA angles, which give strictly monotonically improving solution quality as p increases. These angles are computed using the Julia based numerical simulation software JuliQAOA. Fair sampling of degenerate ground states is quantified using the Shannon entropy of the ground-state amplitudes distribution. The fair sampling properties are reported on several quantum signature Hamiltonians from previous quantum annealing fair sampling studies. Small random fully connected spin glasses are shown, which exhibit exponential suppression of some degenerate ground states with transverse field mixer QAOA. The transverse field mixer QAOA simulations show that some problem instances clearly saturate the Shannon entropy of 0 with a maximally biased distribution that occurs when the learning converges to an approximation ratio of 1 while other problem instances never deviate from a maximum Shannon entropy (uniform distribution) at any p step. Published by the American Physical Society 2025

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Data-driven Distributed Learning of Multi-agent Systems: A Koopman Operator Approach

Koopman operator theory provides a model-free technique for studying nonlinear dynamical systems purely from data. Since the Koopman operator is infinite-dimensional, researchers have developed several methods that provide a finite-dimensional approximation of the Koopman operator so that it can be applied for practical use cases. One common thing with most of the methods is that their solutions are obtained by solving a centralized minimization problem. In this work, we treat the dynamical system to be a multi-agent system and propose an algorithm to compute the finite-dimensional approximation of the Koopman operator in a distributed manner using the knowledge of the topology of the underlying multi-agent system. The proposed distributed approach is shown to be equivalent to the centralized learning problem and results in a sparse Koopman whose block structure mimics the Laplacian of the multi-agent system. Extensive simulation studies illustrate the proposed framework on the network of oscillators and the IEEE 68 bus system.

Nandanoori, Sai Pushpak↗
DOE OSTI2024

Data-driven models of nonautonomous systems

Nonautonomous dynamical systems are characterized by time-dependent inputs, which complicates the discovery of predictive models describing the spatiotemporal evolution of the state variables of quantities of interest from their temporal snapshots. When dynamic mode decomposition (DMD) is used to infer a linear model, this difficulty manifests itself in the need to approximate the time-dependent Koopman operators. Our approach is to approximate the original nonautonomous system with a modified system derived via a local parameterization of the time-dependent inputs. The modified system comprises a sequence of local parametric systems, which are subsequently approximated by a parametric surrogate model using the DRIPS (dimension reduction and interpolation in parameter space) framework. The offline step of DRIPS relies on DMD to build a linear surrogate model, endowed with reduced-order bases for the observables mapped from training data. The online step interpolates on suitable manifolds to construct a sequence of iterative parametric surrogate models; the target/test parameter points on these manifolds are specified by a local parameterization of the test time-dependent inputs. Here, we use numerical experimentation to demonstrate the robustness of our method and compare its performance with that of deep neural networks.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Watertight Tensor-Product Spline Reconstruction (KCNSC PDRD Technical Report)

The standard for representing geometric models in Computer Aided Design (CAD) systems is boundary representation with trimmed surfaces. However, the approximate nature of surface-surface intersections in CAD systems leaves many small gaps between mating surfaces. These gaps lead to problems for downstream analysis and manufacturing applications, requiring time consuming repair operations and further approximation of the geometry as polygonal meshes, which do not support design iteration. In this study, nVariate, Inc. evaluated its watertight reconstruction technology on a test part. The resulting watertight model has the same absolute model accuracy of the original model zero gaps, providing a representation that requires no repair and supports further design iterations in the CAD system.

42 ENGINEERING↗
DOE OSTI2022

Operator inference for non-intrusive model reduction with quadratic manifolds

This paper proposes a novel approach for learning a data-driven quadratic manifold from high-dimensional data, then employing this quadratic manifold to derive efficient physics-based reduced-order models. The key ingredient of the approach is a polynomial mapping between high-dimensional states and a low-dimensional embedding. This mapping consists of two parts: a representation in a linear subspace (computed in this work using the proper orthogonal decomposition) and a quadratic component. The approach can be viewed as a form of data-driven closure modeling, since the quadratic component introduces directions into the approximation that lie in the orthogonal complement of the linear subspace, but without introducing any additional degrees of freedom to the low-dimensional representation. Combining the quadratic manifold approximation with the operator inference method for projection-based model reduction leads to a scalable non-intrusive approach for learning reduced-order models of dynamical systems. Further, applying the new approach to transport-dominated systems of partial differential equations illustrates the gains in efficiency that can be achieved over approximation in a linear subspace.

42 ENGINEERING↗
DOE OSTI2024

Progress towards the completion of the proton power upgrade project

The Proton Power Upgrade project at the Spallation Neutron Source at Oak Ridge National Laboratory will increase the proton beam power capability from 1.4 to 2.8 MW. Upon completion in early 2025, 2 MW of beam power will be available for neutron production at the existing first target station (FTS) with the remaining beam power available for the future second target station (STS). The project has installed seven superconducting radio-frequency (RF) cryomodules and supporting RF power systems to increase the beam energy by 30% to 1.3 GeV, and the beam current will be increased by 50%. The injection and extraction region of the accumulator ring are being upgraded, and a new 2 MW mercury target has been developed along with supporting equipment for high-flow gas injection to mitigate cavitation and fatigue stress. The first four cryomodules and supporting systems were commissioned in 2022-2023 and supported neutron production at 1.05 GeV, 1.7 MW with high reliability. The first-article 2 MW target was operated successfully for approximately 4400 MW-Hours over two run periods. The long outage began in August 2023 for installation of the remaining technical equipment and construction of the Ring-to-Target Beam Transport tunnel stub that will enable connection to the STS without interrupting operation of the FTS. The upgrade is proceeding on-schedule and on-budget, and resumption of neutron production for the user program is planned for July 2024.

43 PARTICLE ACCELERATORS↗
DOE OSTI2024

Progress towards the completion of the proton power upgrade project

The Proton Power Upgrade project at the Spallation Neutron Source at Oak Ridge National Laboratory will increase the proton beam power capability from 1.4 to 2.8 MW. Upon completion in early 2025, 2 MW of beam power will be available for neutron production at the existing first target station (FTS) with the remaining beam power available for the future second target station (STS). The project has installed seven superconducting radio-frequency (RF) cryomodules and supporting RF power systems to increase the beam energy by 30% to 1.3 GeV, and the beam current will be increased by 50%. The injection and extraction region of the accumulator ring are being upgraded, and a new 2 MW mercury target has been developed along with supporting equipment for high-flow gas injection to mitigate cavitation and fatigue stress. The first four cryomodules and supporting systems were commissioned in 2022-2023 and supported neutron production at 1.05 GeV, 1.7 MW with high reliability. The first-article 2 MW target was operated successfully for approximately 4400 MW-Hours over two run periods. The long outage began in August 2023 for installation of the remaining technical equipment and construction of the Ring-to-Target Beam Transport tunnel stub that will enable connection to the STS without interrupting operation of the FTS. The upgrade is proceeding on-schedule and on-budget, and resumption of neutron production for the user program is planned for July 2024.

Champion, Mark↗
DOE OSTI2021

Hamiltonian simulation in the low-energy subspace

Abstract We study the problem of simulating the dynamics of spin systems when the initial state is supported on a subspace of low energy of a Hamiltonian H . This is a central problem in physics with vast applications in many-body systems and beyond, where the interesting physics takes place in the low-energy sector. We analyze error bounds induced by product formulas that approximate the evolution operator and show that these bounds depend on an effective low-energy norm of H . We find improvements over the best previous complexities of product formulas that apply to the general case, and these improvements are more significant for long evolution times that scale with the system size and/or small approximation errors. To obtain these improvements, we prove exponentially decaying upper bounds on the leakage to high-energy subspaces due to the product formula. Our results provide a path to a systematic study of Hamiltonian simulation at low energies, which will be required to push quantum simulation closer to reality.

97 MATHEMATICS AND COMPUTING↗