Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “CANONICAL PROBLEM”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Excited-state downfolding using ground-state formalisms

Downfolding coupled cluster (CC) techniques are powerful tools for reducing the dimensionality of many-body quantum problems. This work investigates how ground-state downfolding formalisms can target excited states using non-Aufbau reference determinants, paving the way for applications of quantum computing in excited-state chemistry. This study focuses on doubly excited states for which canonical equation-of-motion CC approaches struggle to describe unless one includes higher-than-double excitations. The downfolding technique results in state-specific effective Hamiltonians that, when diagonalized in their respective active spaces, provide ground- and excited-state total energies (and therefore excitation energies) comparable to high-level CC methods. The performance of this procedure is examined with doubly excited states of H 2 , Methylene, Formaldehyde, and Nitroxyl.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Anti-symmetric and positivity preserving formulation of a spectral method for Vlasov-Poisson equations

We analyze the anti-symmetric properties of a spectral discretization for the one-dimensional Vlasov-Poisson equations. The discretization is based on a spectral expansion in velocity with the symmetrically weighted Hermite basis functions, central finite differencing in space, and an implicit Runge Kutta integrator in time. The proposed discretization preserves the anti-symmetric structure of the advection operator in the Vlasov equation, resulting in a stable numerical method. We apply such discretization to two formulations: the canonical Vlasov-Poisson equations and their continuously transformed square-root representation. The latter preserves the positivity of the particle distribution function. We derive analytically the conservation properties of both formulations, including particle number, momentum, and energy, which are verified numerically on the following benchmark problems: manufactured solution, linear and nonlinear Landau damping, two-stream instability, bump-on-tail instability, and ion-acoustic wave.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Hierarchical-embedding autoencoder with a predictor as efficient architecture for learning time-evolution in multi-scale turbulent flows

We introduce a scale-aware, data-driven deep learning modeling framework for accurately predicting the time evolution of multi-scale turbulent plasma and liquid flows. The approach is motivated by the idea of scale separation. Structures of vastly different length scales emerge in these systems, and interactions between these structures occur only locally. To exploit this structure, the flow state is transformed by a hierarchical, fully convolutional autoencoder, not into a single embedding layer as in conventional convolutional surrogate models, but into a series of embedding layers. A stepwise training strategy ensures that fine-scale features are encoded on a high-resolution grid, while larger structures are represented on progressively coarser layers. The time evolution predictor advances all embedding layers in sync, capturing local interactions between features at the same scale as well as between all scales. This approach enables efficient modeling of multi-scale systems since negligible interactions between distant, small-scale structures do not need to be directly modeled. Our hierarchical-embedding autoencoder with a predictor framework is evaluated on canonical examples of multi-scale turbulence: two-dimensional Kolmogorov flow and Hasegawa–Wakatani plasma turbulence. In both cases, the proposed framework significantly improves predictive accuracy relative to conventional convolutional network architectures. A significant improvement in prediction accuracy was observed for crucial statistical characteristics of the Hasegawa–Wakatani plasma as well as for individual trajectories of the Kolmogorov flow turbulence. Importantly, the model's rollout for the Hasegawa–Wakatani problem demonstrates a four-order-of-magnitude speedup compared to traditional numerical solvers.

Khrabry, Alexander I. [Princeton Univ., NJ (United↗
DOE OSTI2024

SEAS Communication Engine: An Extensible, Flexible Wrapper for Co-Simulation Agents

When modeling and analyzing the power grid and other large scale systems, researchers often express scenarios as optimization problems and feed them into advanced software solvers. In order to allow multiple solvers to communicate with each other and share data from different domains, the National Renewable Energy Laboratory (NREL) and associated Department of Energy (DOE) labs have developed a software framework called the Hierarchical Engine for Large-scale Infrastructure Co-Simulation (HELICS). HELICS allows cosimulation via a collection of client libraries for different languages that can be called from the appropriate optimization software. However, these client libraries do not provide a higher level of abstraction beyond reading and writing data off of the shared HELICS bus. In this paper, we describe a new software library called the SEAS Communication Engine that exposes a higher-level API for running cosimulation problems. The SEAS Engine provides a class-based abstraction on top of the Python HELICS client, in order to allow users to implement their domain-specific cosimulations without needing to interact with core HELICS primitives. This will make adoption of HELICS and cosimulation in general easier, by exposing a simpler API. In the second part of the paper, we validate our library on a collection of different simulation examples, including the canonical IEEE 13 Bus Feeder. Lastly, we demonstrate using the SEAS Engine to directly call domain-specific code written in the Julia programming language. Our hope is that this will serve as a template for easily calling software in different programming languages via the SEAS Engine, thereby avoiding code duplication and complexity.

co-simulation↗
DOE OSTI2025

A Comparison of GPU-Accelerated Multiphase CFD Solvers on the Polaris Supercomputer: Part 1

This report is in support of the Innovative and Novel Computational Impact on Theory and Experiment (INCITE) program sponsored by the U.S. Department of Energy (USDOE). With INCITE-level resources, one project, titled BubblyFlow, was granted computational resources for the 2025 calendar year on the Polaris supercomputer at the Argonne Leadership Computing Facility (ALCF). The project aims to conduct simulations to understand the fundamental characteristics of turbulent bubbly flow phenomena in nature. Staff at the ALCF and Argonne’s Computational Science division, along with collaborators at the City College of New York and University of Illinois at Chicago, helped a summer student to assess the accuracy and performance of two high performance computing (HPC) codes. Both codes, ImExLBM and FluTAS, are fundamentally different in their mathematical and numerical modeling. However, both may be used to solve the same physical problem. The collaboration sought to better understand the differences between both codes in terms of accuracy and efficiency. This would ultimately help the BubblyFlow project better utilize resources and establish a knowledge-base of code capabilities in future simulation campaigns. We compare ImExLBM and FluTAS, two high-performance multiphase computational fluid dynamics (CFD) solvers, in terms of physical fidelity, time-to-solution, and parallel efficiency. We validate ImExLBM (Implicit-Explicit Lattice Boltzmann Method) against a canonical benchmark and assess it’s performance relative to FluTAS (Fluid Transport Accelerated Solver), a well-established open-source CFD code.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

A Scaling Study for Incompressible Multispecies Solver in Vertex-CFD

Multispecies incompressible flows occur widely in engineering and environmental applications, such as chemical reactors, fuel cells, ocean mixing, and biomedical systems. However, accurately resolving the complex transport and mixing phenomena associated with multiple interacting species remains computationally challenging, especially for large-scale problems. In this study, we present a robust, high-performance computing--enabled multispecies incompressible Navier–Stokes solver integrated within the Vertex-CFD framework. Our solver employs a fully coupled, implicit, finite element--based formulation that accurately captures the advection, diffusion, and interaction of multiple species in incompressible flows by leveraging the Kokkos library for parallel computing to achieve high computational efficiency. For pressure coupling, the entropically damped artificial compressibility method is utilized. We validated the solver against canonical test cases, including multispecies advection, diffusion, and Bateman systems; the results demonstrate second- and third-order spatial accuracy and consistent convergence. Additionally, we demonstrated the strong and weak scaling study results obtained on the leadership-class high-performance computing system, Frontier at Oak Ridge National Laboratory.

Oz, Furkan [ORNL] (ORCID:0000000265831724)↗
DOE OSTI2025

Reproducibility of fixed-node diffusion Monte Carlo across diverse community codes: The case of water–methane dimer

Fixed-node diffusion quantum Monte Carlo (FN-DMC) is a widely trusted many-body method for solving the Schrödinger equation, known for its reliable predictions of material and molecular properties. Furthermore, its excellent scalability with system complexity and near-perfect utilization of computational power make FN-DMC ideally positioned to leverage new advances in computing to address increasingly complex scientific problems. Even though the method is widely used as a computational gold standard, reproducibility across the numerous FN-DMC code implementations has yet to be demonstrated. This difficulty stems from the diverse array of DMC algorithms and trial wave functions, compounded by the method’s inherent stochastic nature. Here, this study represents a community-wide effort to assess the reproducibility of the method, affirming that yes, FN-DMC is reproducible (when handled with care). Using the water–methane dimer as the canonical test case, we compare results from eleven different FN-DMC codes and show that the approximations to treat the non-locality of pseudopotentials are the primary source of the discrepancies between them. In particular, we demonstrate that, for the same choice of determinantal component in the trial wave function, reliable and reproducible predictions can be achieved by employing the T-move, the determinant locality approximation, or the determinant T-move schemes, while the older locality approximation leads to considerable variability in results. These findings demonstrate that, with appropriate choices of algorithmic details, fixed-node DMC is reproducible across diverse community codes—highlighting the maturity and robustness of the method as a tool for open and reliable computational science.

Della Pia, Flaviano [Univ. of Cambridge (United Ki↗
DOE OSTI2026

From Quantum Time to Manifestly Covariant QFT: On the Need for a Quantum-Action-Based Quantization

In quantum time (QT) schemes, time is promoted to a degree of freedom, allowing Lorentz covariance to be made explicit for single particles. We ask whether this can be lifted to QFT so that Lorentz covariance becomes manifest at the Hilbert-space level, rather than being hidden as in the standard canonical formulation. We address this question by proposing a second-quantized approach in which the elementary particle is the QT particle itself, leading naturally to the notion of spacetime field algebras and of quantum action. We show, however, that a naive many-body construction runs into inconsistencies. To pinpoint their origin we introduce a classical counterpart of the second-quantized formalism, spacetime classical mechanics (SCM), and prove a no-go theorem: Dirac quantization of SCM collapses back to standard QFT and therefore hides covariance. We circumvent this problem by presenting a quantum-action-based quantization that yields a spacetime version of quantum mechanics (SQM), making covariance manifest for (interacting) QFTs. Finally, we show that this resolution is tied to a genuine spacetime generalization of the notion of a quantum state, required by causality and closely connected to recent “states over time” proposals and, in dS/CFT–motivated settings, to microscopic notions of timelike entanglement and emergent time.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Testing the scalar weak gravity conjecture in no-scale supergravity

We explore possible extensions of the Weak Gravity Conjecture (WGC) to scalar field theories. To avoid charged black hole remnants, the WGC requires the existence of a particle with a mass m ≤ gqM P , with charge q and U(1) gauge coupling g, allowing the decay to shed the black hole charge. Although there is no obvious problem that arises in the absence of a U(1) charge, it has been postulated that gravity must remain the weakest force even when extended to scalar interactions. Quantifying this conjecture may be done by comparing scalar and gravitational amplitudes, or as we advocate here by comparing scattering cross sections. In theories with non-trivial field space geometries, by working out examples with perturbation theory around arbitrary field values and performing tadpole resummations, we argue that the conjecture must be applied only at extrema of the scalar potential (when expressed in locally canonical coordinates). We consider several toy models in the context of no-scale supergravity and also consider examples of inflationary models.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

Integrated Molten Salt Reactor Modeling Capabilities in NEAMS Thermal Hydraulics Tools

The DOE neams program supports a full range of computational thermal fluids analysis capabilities and code developments for a broad range of advanced reactor concepts. The research and development approach under the thermal fluids technical area synergistically combines three length and time scales in a hierarchical multi-scale approach. To enable multi-scale thermal fluids capability using these codes, a key joint effort has been underway to develop an integrated system- and engineering-scale thermal fluids analysis capability, through integration of SAM and Pronghorn codes, both based on the MOOSE framework. This report summarizes recent advances in developing an integrated system- and engineering-scale modeling capability for the msr concept, which has gained significant interest in recent years. A consistent framework was established by coupling Pronghorn and SAM through the Saline interface, with thermophysical properties provided by the Molten Salt Thermal Property Database (MSTDB-TP). Further improvements were made to the coupling schemes and domain-overlapping strategies, enhancing the stability and robustness of multi-code simulations. Verification and validation efforts demonstrate the accuracy of this integration across a range of benchmark problems, including one-dimensional heated pipe flows, three-dimensional natural convection loops with evolving isotopic compositions, and \gls{msre} demonstration cases. Within Pronghorn, new capabilities were introduced to model corrosion and noble-metal plating phenomena, supported by an extended thermal-hydraulics framework and refined turbulence treatments. To capture two-phase flow behavior, a multiphase Euler–Euler model was implemented in Pronghorn, including advanced closure relations, high-resolution advection techniques, and capillary force reconstruction. Preliminary verification cases confirm the fidelity of the approach, while planned validation efforts target canonical multiphase benchmarks and application to msr components such as the msre pump bowl. Finally, updates to SAM’s msr mass transfer modeling were extended to consider noble gas migration into porous structures like graphite. The point kinetics model was updated to include reactivity feedback contributions from any defined species, such as xenon. The gas transport model was expanded for applicability to gas mixtures, bubble efflux phenomena, and species transport between liquid and gas phases. A selection of multi-scale Sherwood number correlations from MOSCATO/NekRS and multi-phase correlations from literature have been added for improved accuracy in calculating mass transfer coefficients. A companion effort on developing system-level redox corrosion has also been incorporated into SAM. Collectively, these enhancements strengthen the predictive capability of SAM and Pronghorn for simulating MSR thermal-hydraulics, corrosion, multiphase behavior, and fission-product transport, providing a more complete toolset for design, safety analysis, and licensing support of next-generation \gls{msr}s.

42 - ENGINEERING↗
DOE OSTI2026

Efficient CP Rounding Using Alternating Least Squares with QR Decomposition

The CANDECOMP/PARAFAC (CP) decomposition is widely used for analyzing multidimensional data, and the alternating least squares (CP-ALS) algorithm is a common method for its computation. CP rounding is the problem of computing a lower-rank CP decomposition of an input already in a higher-rank CP format. While the normal equations (NE) approach in CP-ALS is efficient for the CP rounding problem and frequently used, it becomes unstable in the presence of ill-conditioned subproblems. This paper presents a new QR-based CP-ALS method for CP rounding that preserves both numerical stability and computational efficiency. Here, our experiments show that the proposed method offers significant speedup over a previous QR-based approach and the Tensor Toolbox's NE-based implementation, particularly for higher-order tensors. Furthermore, our approach demonstrates a marked reduction in error for ill-conditioned problems, with error reductions several orders of magnitude smaller compared to the NE-based method, while achieving faster convergence and more accurate solutions. By using a more numerically stable approach, we can solve more problems in reduced working precision, which enables further reduction in time to solution.

CANDECOMP/PARAFAC↗
DOE OSTI2025

Nonenzymatic RNA copying with a potentially primordial genetic alphabet

Nonenzymatic RNA copying is thought to have been responsible for the replication of genetic information during the origin of life. However, chemical copying with the canonical nucleotides (A, U, G, and C) strongly favors the incorporation of G and C and disfavors the incorporation of A and especially U because of the stronger G:C vs. A:U base pair and the weaker stacking interactions of U. Recent advances in prebiotic chemistry suggest that the 2-thiopyrimidines were precursors to the canonical pyrimidines, raising the possibility that they may have played an important early role in RNA copying chemistry. Furthermore, 2-thiouridine (s 2 U) and inosine (I) form by deamination of 2-thiocytidine (s 2 C) and A, respectively. We used thermodynamic and crystallographic analyses to compare the I:s 2 C and A:s 2 U base pairs. We find that the I:s 2 C base pair is isomorphic and isoenergetic with the A:s 2 U base pair. The I:s 2 C base pair is weaker than a canonical G:C base pair, while the A:s 2 U base pair is stronger than the canonical A:U base pair, so that a genetic alphabet consisting of s 2 U, s 2 C, I, and A generates RNA duplexes with uniform base pairing energies. Consistent with these results, kinetic analysis of nonenzymatic template-directed primer extension reactions reveals that s 2 C and s 2 U substrates bind similarly to I and A in the template, and vice versa. Our work supports the plausibility of a potentially primordial genetic alphabet consisting of s 2 U, s 2 C, I, and A and offers a potential solution to the long-standing problem of biased nucleotide incorporation during nonenzymatic template copying.

Science & Technology - Other Topics↗
DOE OSTI2025

Scalar flux transport models for self-similar turbulent mixing

A common approach to closing turbulent species flux in multicomponent Reynolds-averaged Navier-Stokes models is to use the standard gradient diffusion approximation. While such an approach has been shown to work well when applied to many canonical turbulent mixing configurations, a gradient diffusion approach is fundamentally limited in its ability to capture complex phenomena such as countergradient transport. For this reason, complicated mixing applications may benefit by treating the turbulent diffusivity with a model transport equation in a manner analogous to second-moment momentum closure in Reynolds-stress transport models. Here, the present work explores the development and application of two different scalar flux transport (SFT) models. Self-similarity constraints are derived for these models, and they are evaluated against gradient-diffusion-based models in several one- and two-dimensional problems of turbulent mixing. It is found that the new SFT models out-perform gradient diffusion models in problems involving rapid acceleration reversal and in problems involving anisotropic transport of materials. In addition, it is found that even a hybrid-SFT approach, in which an SFT equation is utilized along with a gradient diffusion closure, provides some measure of improvement over models that transport the mass flux rather than the scalar flux.

Reynolds-averaged Navier Stokes↗
DOE OSTI2024

The Average Spectrum Norm and Near-Optimal Tensor Completion

We propose the average spectrum norm to study the minimum number of measurements required to approximate a multidimensional array (i.e., sample complexity) via low-rank tensor recovery. Our focus is on the tensor completion problem, where the aim is to estimate a multiway array using a subset of tensor entries corrupted by noise. Our average spectrum norm-based analysis provides near-optimal sample complexities, exhibiting dependence on the ambient dimensions and rank that do not suffer from exponential scaling as the order increases.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Shock tube simulations for the three-layer Richtmyer–Meshkov instability with single-mode and multimode perturbations

While the canonical two-component, single-mode Richtmyer–Meshkov instability (RMI) has been extensively studied, relatively less work has focused on the effects of an additional intermediate-density middle layer. This work investigates such three-material RMI configurations at two Atwood number scenarios using the ARES hydrodynamics code. After validation against previous experimental and computational studies, setups corresponding to recent three-layer shock tube experiments are simulated. Cases with both single-mode and multimode perturbations are studied to quantify mixing across the interface between the materials with highest and intermediate density. In particular, this work is able to comprehensibly examine differences between two- and three-dimensional setups for the single-mode and multimode problems. Observations from previous two-layer investigations still apply in the three-layer setup, but over the time horizons considered, there appears to be insufficient nonlinear mode coupling to create significant differences between two- and three-dimensional simulations following the first passage of a shock. Finally, additional reshock simulations have additional nonlinear growth that does result in expected differences between two- and three-dimensional cases in this three-layer setup, but significant differences do not manifest during the time horizon studied.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Cosmohedra

It has been a long-standing challenge to find a geometric object underlying the cosmological wavefunction for Tr(ϕ 3 ) theory, generalizing associahedra and surfacehedra for scattering amplitudes. In this note, we describe a new class of polytopes — “cosmohedra” — that provide a natural solution to this problem. The faces of associahedra capture the combinatorics of non-overlapping chords of the momentum polygon, reflecting all partial factorizations of amplitudes. Cosmohedra are far richer — instead of non-overlapping chords, their faces capture the “russian doll” structure of non-overlapping subpolygons that determine the wavefunction. We show that cosmohedra are intimately related to associahedra, obtained by “blowing up” faces of the associahedron in a simple way. We give a full combinatorial description of cosmohedron faces and their factorization properties, and provide an explicit realization in terms of facet inequalities that further “shave” the facet inequalities of the associahedron. We also discuss a novel way for computing the wavefunction from cosmohedron geometry that extends the usual connection with polytope canonical forms. We illustrate cosmohedra with examples at tree-level and one loop; the close connection to surfacehedra suggests the generalization to all loop orders. Moving beyond the wavefunction, we briefly describe “cosmological correlahedra” for full correlators, which are one higher-dimensional polytopes, interpolating between associahedra and cosmohedra on opposite facets in an extra direction associated with the total energy. We speculate on how the existence of cosmohedra might suggest a “stringy” formulation for the cosmological wavefunction/correlators, generalizing the way in which the Minkowski sum decomposition of associahedra naturally extend particle to string amplitudes.

Scattering Amplitudes↗
DOE OSTI2025

A hybrid neural architecture: Online attosecond x-ray characterization

The emergence of high-repetition-rate x-ray free-electron lasers (XFELs), such as SLAC’s LCLS-II, serves as our canonical example for autonomous controls that necessitate high-throughput diagnostics paired with streaming computational pipelines capable of single-shot analysis with extremely low latency. We present the deterministic characterization with an integrated parallelizable hybrid resolver architecture, a hybrid machine learning framework designed for fast, accurate analysis of XFEL diagnostics using angular streaking-based sinogram images. This architecture integrates convolutional neural networks and bidirectional long short-term memory models to denoise input, identify x-ray sub-spike features, and extract sub-spike relative delays with sub-30 attosecond temporal resolution. Deployed on low-latency hardware, it achieves over 10 kHz throughput with 168.3 μs inference latency, indicating scalability to 14 kHz with field-programmable gate array integration. By transforming regression tasks into classification problems and leveraging optimized error encoding, we achieve high precision with low-latency performance that is critical for real-time streaming event selection and experimental control feedback signals. This represents a key development in real-time control pipelines for next-generation autonomous science, generally, and high repetition-rate x-ray experiments in particular.

Accelerator Physics (physics.acc-ph)↗
DOE OSTI2026

Latent Twins

Over the past decade, scientific machine learning has transformed the development of mathematical and computational frameworks for analyzing, modeling, and predicting complex systems. From inverse problems to numerical partial differential equations (PDEs), dynamical systems, and model reduction, these advances have pushed the boundaries of what can be simulated. Yet they have often progressed in parallel, with representation learning and algorithmic solution methods evolving largely as separate pipelines. With Latent Twins, we propose a unifying mathematical framework that creates a hidden surrogate in latent space for the underlying equations. Whereas digital twins mirror physical systems in the digital world, Latent Twins mirror mathematical systems in a learned latent space governed by operators. Through this lens, classical modeling, inversion, model reduction, and operator approximation all emerge as special cases of a single principle. We establish the fundamental approximation properties of Latent Twins for both ordinary differential equations (ODEs) and PDEs and demonstrate the framework across three representative settings: (i) canonical ODEs, capturing diverse dynamical regimes; (ii) a PDE benchmark using the shallow-water equations, contrasting Latent Twin simulations with deep operator network and forecasts with a four-dimensional variational method baseline; and (iii) a challenging real-data geopotential reanalysis dataset, reconstructing and forecasting from sparse, noisy observations. Latent Twins provide a compact, interpretable surrogate for solution operators that evaluate across arbitrary time gaps in a single-shot, while remaining compatible with scientific pipelines such as assimilation, control, and uncertainty quantification. Looking forward, this framework offers scalable, theory-grounded surrogates that bridge data-driven representation learning and classical scientific modeling across disciplines.

Latent Twins↗