Search NASA⌕ Search

SEARCH · Search NASA

Results for “Kernel”

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.

371 records · Page 21

Physics and Components syntax to enable a systems-based approach to multiphysics

Simulations in MOOSE have traditionally used kernel and boundary condition classes to describe the equations. Downstream applications leveraged a system called Actions to define a pre-packaged discretization of the equations they solve. Unfortunately, the Action base class was very limited, and most applications implemented the same concepts in their Actions. This led to an increased maintenance burden and a reduction in coupling opportunities, save for the use of MultiApps which renders each input mostly independent. With the introduction of multi-system capabilities in MOOSE, there is growing interest in defining entire simulations of complex multiphysics systems in a single input file. By introducing a new Physics system, with its dedicated syntax and a new base class providing wide-ranging capabilities, we are now able to define multiple equations in a single input file in a compact and user-friendly way. With new interactions between Physics and the Component system, these equations can be defined on each component of a complex system. In this talk, we will present the capabilities of these new systems, their interactions, and how to define complex systems multiphysics simulations with Physics and Components.

22 - GENERAL STUDIES OF NUCLEAR REACTORS↗

Advanced Cross Section Library Generation using Reduced Order Models

Deterministic neutronics calculations rely on multigroup neutron cross section libraries, which consist of databases of tabulated values, used to calculate the neutron cross sections through multivariate linear interpolation. However, interpolation of the multidimensional cross section data becomes memory inefficient and time consuming as the number of tabulations increases, significantly slowing down the neutronics calculation, especially in the case of microscopic cross section libraries where every isotope (on the order of hundreds) has its own set of specific reactions and cross sections. In order to address this challenge, this work constructs efficient and robust reduced-order models (ROMs) of the multi-group cross sections to support the Griffin simulation of high-temperature gas-cooled reactors (HTGRs). The first part of the study investigates the linearity of the multigroup cross section data across isotopes, reaction types, and energy groups on pre-generated datasets for the purpose of dimensionality reduction. Secondly, a down-selection of ROM techniques is presented on representative classical machine learning (ML) techniques, including variants of linear regression, kernel-based methods, tree-based algorithms, and artificial neural networks. The selection criteria jointly consider the memory efficiency, predictive accuracy, prediction speed, and scalability in comparison to the multidimensional interpolation. Among all the ML techniques, deep neural networks (DNNs) have proven to be the best selection with sufficient accuracy, high robustness, good memory efficiency, great scalability, and superior flexibility. DNNs have been trained for all isotopes in this work and systematic Griffin testing is ongoing to ensure the feasibility of this ROM technique for predicting cross section and reducing memory requirements without a significant sacrifice in computational performance.

42 - ENGINEERING↗

Microstructural Topology as a Prescriptor for Quantum Coherence: Towards A Unified Framework for Decoherence in Superconducting Qubits

In superconducting quantum circuits, decoherence improvements are frequently obtained through process interventions that simultaneously modify surface chemistry, microstructural topology, and device geometry, leaving mechanistic attribution structurally underdetermined. Predictive materials engineering requires measurable structural statistics to be separated from geometry-dependent coupling coefficients into independently testable factors. We introduce the concept of classical and quantum microstructure. In that context, we formulate a channel-wise separable framework for decoherence in superconducting transmon qubits in which each loss channel is described by a reduced prescriptor. Here, a channel-specific microstructural state variable is determined independently of device geometry, and a geometry-dependent coupling functional is computable from field solutions without reference to surface chemistry. We derive this product form from a spatially resolved kernel representation and establish a perturbative separability criterion that defines the regime where independent variation of the variables is valid. The framework specifies five prescriptor classes for dominant loss pathways in transmon-class devices. Falsifiability is operationalized through a pre-committed 2x2 experimental protocol in which the variables must satisfy independent ratio checks within propagated uncertainty. A Minimum-Dataset Specification standardizes reporting for cross-laboratory inference. Part I establishes the conceptual and mathematical architecture; coordinated experimental validation is reserved for Part II.

Dravid, Vinayak P. [Northwestern U.]↗

Assessment of Buffer-IPyC Thermomechanical Debonding Behavior Using New Experiment Strength Data in BISON

TRIstructural ISOtropic (TRISO) single sub-millimeter-diameter nuclear fuel particle consists of a spherical fuel kernel surrounded by four coating layers. During reactor operation, the TRISO coating layers are subjected to irradiation-induced dimensional changes and the associated thermomechanical behavior of each layer. One of the observed behaviors is gap formation between the buffer and IPyC layer due to the porous buffer’s irradiation-induced shrinkage exceeding that of the IPyC layer. To predict TRISO thermomechanical performance, multi-physics models have been built that are continually updated and refined. The BISON code is a finite element-based nuclear fuel performance code that may be used for TRISO particle simulations. One of the recent additions to the BISON code is the ability to model the process of layer debonding. This paper will focus on the simulation results of the improved BISON debonding model that will utilize updated strengths measured from irradiated TRISO fuel particles. The new experimental strength data from micromechanical tests of irradiated TRISO fuel samples were exercised in the BISON simulations and compared to baseline strength data to assess their applicability in the models. This also includes updated buffer-IPyC bond strengths to simulate layer delamination. Based on current experimental observations it is noted that the buffer-IPyC separation occurs not exactly at the junction of these two layers, but more on the side of the buffer layer. This improved modeling approach using experimental strength data to characterize buffer-IPyC debonding and its potential subsequent cracking will be presented in the paper along with comparisons to available experimental observations.

11 - NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Working with Bézier Curves as bases for Functional Expansion Tallies

Functional expansion tallies (FETs) are powerful tools for getting more information per history from Monte Carlo simulations, but in the past they have been constrained to orthogonal bases. Bézier curves are used widely in computer aided design (CAD) geometry kernels and could be well-suited for FETs due to their ability to assume many arbitrary shapes, but they use nonorthogonal bases. Recent developments in 2021 have made nonorthogonal FETs possible. The convergence of Bézier curve FETs in both polynomial order and number of samples is explored in this work. It is shown that these bases are well-suited for representing normal distributions and this opens the door to the possibility of other CAD-derived FET bases.

97 - MATHEMATICS AND COMPUTING↗

Measurement of the muon anomalous precession frequency in Runs 4, 5, and 6 of the Muon g-2 experiment at Fermilab

The Fermilab E989 Muon g − 2 experiment measures the muon’s anomalous magnetic moment to a precision of 127 parts per billion, as reported in June 2025. The value is proportional to the difference between the muon’s cyclotron frequency and the spin precession frequency in the presence of a uniform magnetic field, for muons contained within the g − 2 storage ring. Spin precession frequency is extracted from the time distribution of the muon’s decay positrons recorded by 24 electromagnetic calorimeters positioned around the inner circumference of the storage ring. The anomalous precession frequency is one of the primary experimental inputs necessary to estimate the anomalous magnetic moment, the other being the measurement of the magnetic field. This dissertation details the anomalous precession frequency extraction, including reconstruction, time-distribution fitting, and treatment of systematic uncertainties for the final three data-collection runs: Run-4, Run-5, and Run-6. This data represents a fourfold increase in statistics over the previous analysis release, halving the statistical uncertainty. The residual slow term from previous analyses is now well understood and documented in a systematic treatment. As of the writing of this dissertation, the theoretical prediction for the SM estimate of the muon’s anomalous magnetic moment is under debate, with two competing prediction methods, so a definitive comparison with theory is not available. The results submitted for experimental release use the kernel-ratio asymmetry method, contributing 115 parts per billion to the statistical uncertainty and 34 parts per billion to the systematic uncertainty. When combined with the previous analyses in earlier data runs, this thereby improves the measurement beyond the experimental goal and sets the world’s most precise measurement of the muon’s anomalous magnetic moment.

Israel, Scott Nathan [Boston U.]↗

Two-Tower Quantum Matrix Chain Multiplication: Trading Qubits for Depth

Matrix chain multiplication -- computing $\mathcal{W} = M^{(0)}\cdots M^{(K-1)}$ where $M^{(k)} \in \mathbb{R}^{P_k \times P_{k+1}}$-- arises in scientific computing, machine learning, and graph analysis. Despite the importance of this problem, for chains of distinct matrices, the classical number of operations grows linearly with the chain length $K$ and polynomially in the matrix dimensions. We present \emph{Two-Tower Matrix Multiplication}, a quantum subroutine that encodes the product $\mathcal{W}$ of the $K$ matrices into a quantum state in circuit depth $\mathcal{O}(\max_{k} \mathrm{polylog} (P_k P_{k+1}))$, which is independent of~$K$ within the QRAM-based state-preparation model, whereas the qubit count is $\mathcal{O}\bigl(\sum_{k} \log P_k \bigr)$; the total gate count remains linear in $K$, so the gain is in the circuit depth. The construction interleaves state-preparation operators across two layers; within each layer, all operators act on disjoint registers and execute in parallel. This subroutine can be specialized for the chain-vector case, which computes the product of $K-1$ matrices applied to a vector. We prove the correctness of the subroutine for all $K$ and provide two implementations using the Qiskit and QCLAB frameworks. The subroutine is applicable to any downstream quantum algorithm that operates on a matrix encoded in the statevector, including norm estimation, graph-matrix powers, linear system solving, and quantum machine learning kernels.

Antonioli, Giacomo [Pisa U.] (ORCID:00090000668703↗

Minimum entropy filtering for a single output non-Gaussian stochastic system using state transformation

This paper presents a novel filter design for the single-output stochastic non-linear systems subjected to non-Gaussian noises and the proposed assumptions. Based on a state transformation, the unmeasurable states of the systems can be estimated where non-linear terms in the systems have been eliminated. It has been shown that the estimation error is linearly dynamical regarding to the presented vector-valued filter gain which can be optimised by minimising the entropy-based performance criterion. In addition, the convergence of the presented algorithm is analysed in mean-square sense and a numerical example is given to verify the effectiveness of the presented filtering algorithm. Meanwhile, the extended Kalman filter, unscented particle filter and minimum entropy filter are given for the comparisons of the filtering performance. Following the presented framework, some extensions of the presented filtering algorithm are discussed to indicate the flexibility of the filter design. The contribution of this paper can be summarised as establishing a novel minimum entropy filtering framework which consists of model transformation, entropy optimisation and convergence analysis.

42 ENGINEERING↗

Quantum mechanical closure of partial differential equations with symmetries

We develop a statistical framework for the dynamical closure of spatiotemporal dynamics governed by partial differential equations. Employing the mathematical framework of quantum mechanics to embed the original classical dynamics into a quantum mechanical representation, we use the space of quantum density operators to model the unresolved degrees of freedom of the original dynamics in a statistical sense, and the framework of quantum measurement to predict their contributions to the resolved dynamics. The embedded dynamics is discretized by a positivity preserving process, leading to a compressed representation that is invariant under the dynamical symmetries of the resolved dynamics. We present a data based formulation of the closure scheme and apply it to a closure problem for the shallow water equations. The numerical results demonstrate that our closure model can accurately predict the main features of the true dynamics, including for out of sample initial conditions.

Delay embedding↗

Model Residuals as Shields: A Two-Level Formulation to Defend Smart Grids From Poisoning Attacks

The advancement of smart grids presents both vast opportunities and heightened cybersecurity risks. Data-driven defense mechanisms, though designed as a shield against these threats, can fall prey to poisoning attacks. We delve into regression settings, underscoring the imperative to fortify defenses against a spectrum of poison ratios, notably those above 0.5—an issue scarcely addressed in prior studies. Recognizing the susceptibilities of smart grids and their manipulable sensors, we exploit the very intent of poisoning attacks, compromising model accuracy, as our defense mechanism. Our proposed two-level optimization framework discerns between poisoned and authentic data based on model residuals, outperforming or matching existing methods in 72% to 77% of precision and 75% to 80% of recalls across various poisoning attacks, poison ratios, and datasets. Once the authentic data are identified, the trained model is adaptable for a variety of applications. Comprehensive evaluations on different smart grid datasets, pitted against myriad poisoning schemes, validate our methodology’s edge over existing methods. Here, we also shed light on the implications of model misspecification originating from temporal auto-correlation, a common feature in Internet of Things and smart grid data.

Adversarial machine learning (ML)↗