Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Polynomial models”

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 145 records · Page 8

Sampling Low-Dimensional Markovian Dynamics for Preasymptotically Recovering Reduced Models from Data with Operator Inference

This work introduces a method for learning low-dimensional models from data of high-dimensional black-box dynamical systems. The novelty is that the learned models are exactly the reduced models that are traditionally constructed with classical projection-based model reduction techniques. Thus, the proposed approach learns models that are guaranteed to have the well-studied properties of reduced models known from model reduction, without requiring full knowledge of the governing equations and without requiring the operators of the high-dimensional systems. The key ingredient is a new data sampling scheme to obtain re-projected trajectories of high-dimensional systems that correspond to Markovian dynamics in low-dimensional subspaces. The exact recovery of reduced models from these re-projected trajectories is guaranteed pre-asymptotically under certain conditions for finite amounts of data and for a large class of systems with polynomial nonlinear terms. Numerical results demonstrate that the low-dimensional models learned with the proposed approach match reduced models from traditional model reduction up to numerical errors in practice. In conclusion, the numerical results further indicate that low-dimensional models fitted to re-projected trajectories are predictive even in situations where models fitted to trajectories without re-projection are inaccurate and unstable.

97 MATHEMATICS AND COMPUTING↗

Jordan–Wigner Transformation for the Description of Strong Correlation in Fermionic Systems

Seniority is a useful way of organizing Hilbert space for strongly correlated systems. The exact zero-seniority wave function, doubly occupied configuration interaction (DOCI), provides accurate results (given the right orbitals) for many strongly correlated electronic systems but has a combinatorial computational cost. In many cases, pair coupled cluster doubles provide a polynomial-cost approximation that closely reproduces the energies of DOCI, but it breaks down in some cases and, as shown herein, it does not provide particularly good density matrices. In this article, we demonstrate that by using the Jordan–Wigner transformation to turn the seniority zero problem back into a Fermionic one, we can provide mean-field variational results of DOCI quality for the Hubbard model and a few small molecular dissociation examples, with polynomial cost, both for the energies and for density matrices, all while being protected from collapse. This success is rooted in the proof we provide, showing that the Hartree–Fock wave function on the Jordan–Wigner-transformed Hamiltonian transforms back to variational coupled cluster doubles in the seniority zero representation, but restricted to have determinant rather than permanent amplitude coefficients, without compromising its overall accuracy.

74 ATOMIC AND MOLECULAR PHYSICS↗

Time domain probabilistic seismic risk analysis using ground motion prediction equations of Fourier amplitude spectra

Modeling of Fourier amplitude spectra (FAS) of seismic motions has gained much attention in engineering seismology. In the past few years, several ground motion prediction equations (GMPEs) and inter-frequency correlation structure of FAS have been established. Due to many preferable characteristics of FAS, probabilistic seismic hazard/risk analysis is rapidly changing from ergodic, spectrum acceleration Sa(T 0 )-based approach to non-ergodic, site-specific, FAS-based approach. This paper presents time domain intrusive framework for probabilistic seismic risk analysis using GMPE of FAS. Herein, methodology for time domain stochastic ground motion modeling based on GMPEs of FAS is presented in some detail. The simulated uncertain motions are modeled as a random process and represented by polynomial chaos Karhunen-Loève expansion. The random process excitations are further propagated into the uncertain structural system using Galerkin stochastic finite element method (SFEM). Probabilistic evolution of structural response is solved, and such solution is used to develop seismic risk for any damage state. The presented framework is illustrated through seismic risk analysis of a four-story building subjected to possible earthquakes from two strike slip faults. The influences of the epistemic uncertainties in source stress drop Δσ and site attenuation κ0 on seismic risk are investigated. The need for non-ergodic seismic risk analysis with source-specific and site specific characterizations is emphasized.

58 GEOSCIENCES↗

Quantum Algorithm for High Energy Physics Simulations

Simulating quantum field theories is a flagship application of quantum computing. However, calculating experimentally relevant high energy scattering amplitudes entirely on a quantum computer is prohibitively difficult. It is well known that such high energy scattering processes can be factored into pieces that can be computed using well established perturbative techniques, and pieces which currently have to be simulated using classical Markov chain algorithms. These classical Markov chain simulation approaches work well to capture many of the salient features, but cannot capture all quantum effects. To exploit quantum resources in the most efficient way, we introduce a new paradigm for quantum algorithms in field theories. This approach uses quantum computers only for those parts of the problem which are not computable using existing techniques. In particular, we develop a polynomial time quantum final state shower that accurately models the effects of intermediate spin states similar to those present in high energy electroweak showers with a global evolution variable. The algorithm is explicitly demonstrated for a simplified quantum field theory on a quantum computer.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Exponential Improvements in the Simulation of Lattice Gauge Theories Using Near-Optimal Techniques

We report a first-of-its-kind analysis on post-Trotter simulation of U(1), SU(2), and SU(3) lattice gauge theories including fermions in arbitrary spatial dimension. We provide explicit circuit constructions as well as T-gate counts and logical qubit counts for Hamiltonian simulation. We find a reduction of up to 25 orders of magnitude in space-time volume over Trotter methods for simulations of non-Abelian lattice gauge theories relevant to the standard model. This improvement results from our algorithm having polynomial scaling with the number of colors in the gauge theory, achieved by utilizing oracle constructions relying on the sparsity of physical operators, in contrast to the exponential scaling seen in state-of-the-art Trotter methods, which employ explicit mappings onto Pauli operators. Our work demonstrates that the use of advanced algorithmic techniques leads to dramatic reductions in the cost of simulating fundamental interactions, bringing it in step with resources required for first-principles quantum simulation of chemistry.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Calorimetric study of skutterudite (CoAs2.92) and heazlewoodite (Ni3S2)

Abstract Nickel and cobalt arsenides, sulfarsenides, and sulfides occur in many hydrothermal ore deposits, but their thermodynamic properties are not well known, in some cases not known at all. In this work, we determined a full set of thermodynamic properties for heazlewoodite and skutterudite. Both phases were synthesized in evacuated silica tubes at elevated temperatures, and electron microprobe analyses gave their compositions as Ni3S2 and CoAs2.92, respectively. Enthalpies of formation were measured by high-temperature oxide-melt solution calorimetry. The reference phases were pure elements, thus eliminating any systematic errors related to such phases. The enthalpies of formation at T = 298.15 K and P = 105 Pa are –216.0 ± 8.4(2σ) and –88.2 ± 6.1 kJ·mol−1 for Ni3S2 and CoAs2.92, respectively. Entropies were calculated from low-temperature heat capacity (CP) data from relaxation (PPMS) calorimetry and are 133.8 ± 1.6 and 106.4 ± 1.3 J·mol–1·K–1, respectively. The calculated Gibbs free energies of formation are –210.0 ± 8.4 and –79.9 ± 6.2 kJ·mol−1 for Ni3S2 and CoAs2.92, respectively. The PPMS CP data, together with a set of differential scanning calorimetry measurements, were used to derive CP polynomials up to 700 K with the Kieffer model based on previously published frequencies of acoustic and optic modes. Equilibrium constants for selected reactions with an aqueous phase were calculated up to 700 K. Geochemical modeling in these systems, however, should await until more reliable data for other phases from the system Co-Ni-As-S are available.

Geochemistry & Geophysics↗

Exponential concentration in quantum kernel methods

Kernel methods in Quantum Machine Learning (QML) have recently gained significant attention as a potential candidate for achieving a quantum advantage in data analysis. Among other attractive properties, when training a kernel-based model one is guaranteed to find the optimal model’s parameters due to the convexity of the training landscape. However, this is based on the assumption that the quantum kernel can be efficiently obtained from quantum hardware. In this work we study the performance of quantum kernel models from the perspective of the resources needed to accurately estimate kernel values. We show that, under certain conditions, values of quantum kernels over different input data can be exponentially concentrated (in the number of qubits) towards some fixed value. Thus on training with a polynomial number of measurements, one ends up with a trivial model where the predictions on unseen inputs are independent of the input data. We identify four sources that can lead to concentration including expressivity of data embedding, global measurements, entanglement and noise. For each source, an associated concentration bound of quantum kernels is analytically derived. Lastly, we show that when dealing with classical data, training a parametrized data embedding with a kernel alignment method is also susceptible to exponential concentration. Our results are verified through numerical simulations for several QML tasks. Altogether, we provide guidelines indicating that certain features should be avoided to ensure the efficient evaluation of quantum kernels and so the performance of quantum kernel methods.

97 MATHEMATICS AND COMPUTING↗

Analytic error analysis of cross section interpolation methods in nodal diffusion codes - I : Theory

This paper discusses two cross section interpolation methods commonly found in popular nodal codes; the partial derivatives and multiple tables models. The motivation for choosing a model, and thus a case matrix structure, is a trade off between accuracy and computational cost. Due to decades of experience, there are default structures that are sufficient for current light water reactor analysis. However, this is not necessarily the case for advanced reactor designs. Therefore, it is advantageous to understand the sources of error in cross section interpolation models so that the quality of a case matrix may be improved. A mathematical framework for these models is presented in this work that provides a more rigorous connection between the nuclear engineering field's cross section interpolation methods and the broader mathematical field of function approximation. The two cross section models examined in this paper were found to utilize Lagrange interpolation and are a subset of Lagrange tensor products. Classical results of Lagrange polynomial error analysis were then applied to the partial derivative and multiple tables models to derive expressions for the total point-wise error. The analytical results classify the total error into two parts: the model form error and interpolation error. Finally, based on our observations, a better foundation for improving the quality of a case matrix is proposed. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Peridynamics and surrogate modeling of pressure-driven well stimulation

In this work we use the peridynamics theory of solid mechanics to simulate fracture in an annular rock domain subject to an in-situ stress and create surrogate models that predict the area of the resulting cracks. Peridynamics is a non-local formulation of continuum mechanics that naturally accommodates material discontinuities. Furthermore, unlike other fracture modeling techniques there is no need to provide information about the crack path. We utilize the peridynamics code Peridigm and take a two-stage approach to fracture modeling. First an implicit solve is performed to compute the in-situ stress state. We then execute an explicit solve where a pressure loading designed to emulate fluid-driven hydraulic fracture is applied at the borehole and transmitted to the pre-stressed rock. We present results from polynomial and single and multi-level Gaussian process surrogate models constructed from a sampling study of the peridynamics model. The surrogates predict crack area given a measure of the in-situ stress anisotropy and rise time and amplitude of the pressure loading. These surrogates take a minuscule fraction of peridynamics model's running time to evaluate and are a step towards enabling advanced optimization and uncertainty quantification workflows that require many model evaluations.

42 ENGINEERING↗

GenMod: A generative modeling approach for spectral representation of PDEs with random inputs

Here, we propose a method for quantifying uncertainty in high-dimensional PDE systems with random parameters, where the number of solution evaluations is small. Parametric PDE solutions are often approximated using a spectral decomposition based on polynomial chaos expansions. For the class of systems we consider (i.e., high dimensional with limited solution evaluations) the coefficients are given by an underdetermined linear system in a regression formulation. This implies additional assumptions, such as sparsity of the coefficient vector, are needed to approximate the solution. Here, we present an approach where we assume the coefficients are close to the range of a generative model that maps from a low to a high dimensional space of coefficients. Our approach is inspired be recent work examining how generative models can be used for compressed sensing in systems with random Gaussian measurement matrices. Using results from PDE theory on coefficient decay rates, we construct an explicit generative model that predicts the polynomial chaos coefficient magnitudes. The algorithm we developed to find the coefficients, which we call GenMod, is composed of two main steps. First, we predict the coefficient signs using Orthogonal Matching Pursuit. Then, we assume the coefficients are within a sparse deviation from the range of a sign-adjusted generative model. This allows us to find the coefficients by solving a nonconvex optimization problem, over the input space of the generative model and the space of sparse vectors. We obtain theoretical recovery results for a Lipschitz continuous generative model and for a more specific generative model, based on coefficient decay rate bounds. We examine three high-dimensional problems and show that, for all three examples, the generative model approach outperforms sparsity promoting methods at small sample sizes.

97 MATHEMATICS AND COMPUTING↗

Moltensaltpropnet

MoltenSaltPropnet is a physics-informed machine learning framework that aims to predict the thermophysical properties of molten fluoride and chloride salt mixtures, which are crucial for the design and safety of Generation IV molten salt reactors. The code processes data from the Molten-Salt Thermal Properties Database (MSTDB-TP) and the Janz compendium, converting critically evaluated correlations into fast, differentiable surrogate models for density, viscosity, thermal conductivity, and heat capacity across 448 distinct salt systems. The implementation consists of several key components: 1. Data Curation: The code parses and cleans the raw data, normalizing elemental mole fractions and extracting relevant regression coefficients for various thermophysical properties. 2. Feature Engineering: It generates fixed-length numerical descriptors that encapsulate the composition and temperature, incorporating polynomial interaction terms and dimensionality-reduction techniques to optimize model performance. 3. Coefficient Learning: Four different machine learning architectures are employed: a deep residual network (ResNet), a Kolmogorov–Arnold network (KAN), a sparsity-inducing neural network (SNN), and classical regression models. Each model learns to predict coefficients that define the temperature-dependent correlations for the thermophysical properties. 4. Property Reconstruction: The predicted coefficients are used to compute temperature-dependent property values, ensuring positivity and monotonic trends through a composite loss function that enforces physical constraints. 5. User Interface: An open-source web application enables users to filter the database, train task-specific models, and visualize the results, allowing for rapid exploration of candidate salt mixtures. MoltenSaltPropnet bridges the gap between limited experimental data and high-fidelity reactor simulations, providing a powerful tool for researchers in the field of molten salt reactors and advanced nuclear energy systems.

Retamales, Mauricio Eduardo Tano [Idaho National L↗

Accurate calculation of many-body energies in water clusters using a classical geometry-dependent induction model

We incorporate geometry-dependent distributed multipole and polarizability surfaces into an induction model that is used to describe the 3- and 4-body terms of the interaction between water molecules. The expansion is carried out up to hexadecapole with the multipoles distributed on the atom sites. Dipole-dipole, dipole-quadrupole, and quadrupole-quadrupole distributed polarizabilities are used to represent the response of the multipoles to an electric field. We compare the model against two large databases consisting of 43,844 3-body terms and 3,603 4-body terms obtained from high level ab initio calculations previously used to fit the MB-pol and q-AQUA interaction potentials. The classical induction model with no adjustable parameters reproduces the ab-initio 3- and 4-body terms contained in these teo Databases with a Root-Mean-Square-Error (RMSE) of 0.104/0.058 and a Mean-Absolute-Error (MAE) of 0.054/0.026 kcal/mol, respectively, results that are on a par with those obtained 1 by fitting the same data using tens of thousands of Permutationally Invariant Polynomials (PIPs). This demonstrates the accuracy of this physically motivated model in describing the 3- and 4-body terms in the interactions between water molecules with no adjustable parameters. The triple-dipole-dispersion energy was included in the 3-body energy and was found to be small but not quite negligible. The model represents a practical, efficient and transferable approach for obtaining accurate non-additive interactions for multi-component systems without the need of performing tens of thousands of high level electronic structure calculations and fitting them with tens of thousands of PIPs.

molecular analysis water, aqueous↗

Kernel polynomial method for linear spin wave theory

Calculating dynamical spin correlations is essential for matching model magnetic exchange Hamiltonians to momentum-resolved spectroscopic measurements. A major numerical bottleneck is the diagonalization of the dynamical matrix, especially in systems with large magnetic unit cells, such as those with incommensurate magnetic structures or quenched disorder. In this paper, we demonstrate an efficient scheme based on the kernel polynomial method for calculating dynamical correlations of relevance to inelastic neutron scattering experiments. This method reduces the scaling of numerical cost from cubic to linear in the magnetic unit cell size.

97 MATHEMATICS AND COMPUTING↗

A methodology for decay heat characterization in molten salt reactors

Accurate decay heat prediction in molten salt reactors (MSRs) faces dual challenges: complex operational uncertainties and the need for interpretable models compatible with engineering workflows. This work presents a hybrid machine learning and segmented polynomial methodology that addresses both requirements through three key innovations. First, a modular data architecture encodes MSR-specific operational parameters (power density: 1-100 W cm -3 , humidity: 0-0.1 wt %, air ingress: 0-0.1 mol %) with uncertainty-aware temporal discretization spanning 15 orders of magnitude. Second, region-optimized machine learning models achieve 92.3 % root mean square error (RMSE) reduction over conventional polynomials while maintaining physical interpretability through automated piecewise equation generation. Third, dual front-end interfaces accelerate safety analyses — a Jupyter environment enables researchers to explore 10,000+ parameter combinations via interactive widgets, while a Streamlit web application reduces design iteration cycles through production-grade visualization tools. Operational deployment demonstrates prediction times of only a couple hundred milliseconds for 10 4 years decay profiles, enabling real-time optimization of spent fuel container designs.

42 - ENGINEERING↗

Creation of an Fe 3 P Schreibersite Density Functional Tight Binding Model for Astrobiological Simulations

The mineral schreibersite, e.g., Fe 3 P, is commonly found in iron-rich meteorites and could have served as an abiotic phosphorus source for prebiotic chemistry. However, atomistic calculations of its degradation chemistry generally require quantum simulation approaches, which can be too computationally cumbersome to study sufficient time and length scales for this process. In this regard, we have created a computationally efficient semiempirical quantum density functional tight binding (DFTB) model for iron and phosphorus-containing materials by adopting an existing semiautomated workflow that represents many-body interactions by linear combinations of Chebyshev polynomials. Here, we have utilized a relatively small training set to optimize a DFTB model that is accurate for schreibersite physical and chemical properties, including its bulk properties, surface energies, and water absorption. We then show that our model shows strong transferability to several iron phosphide solids as well as multiple allotropes of iron metal. Our resulting DFTB parametrization will allow us to interrogate schreibersite aqueous decomposition at longer time and length scales than standard quantum approaches, providing for more detailed investigations of its role in prebiotic chemistry on early Earth.

36 MATERIALS SCIENCE↗

Tensorized Feature Spaces for Feature Explosion

In this paper 1 1 This manuscript has been authored by UT-Battelle, LLC under Contract No. DE-AC05-000R22725 with the U.S. Department of Energy. The United States Government retains and the publisher, by accepting the article for publication, acknowledges that the United States Government retains a nonexclusive, paid-up, irrevocable, worldwide license to publish or reproduce the published form of this manuscript, or allow others to do so, for United States Government purposes. The Department of Energy will provide public access to these results of federally sponsored research in accordance with the DOE Public Access Plan (http://energy.gov/downloads/doe-public-access-plan) This research used resources of the Oak Ridge Leadership Computing Facility, which is a DOE Office of Science User Facility supported under Contract DE-AC05-000R22725., we present a novel framework that uses tensor factorization to generate richer feature spaces for pixel classification in hyperspectral images. In particular, we assess the performance of different tensor rank decomposition methods as compared to the traditional kernel-based approaches for the hyperspectral image classification problem. We propose Orion, which takes as input a hyperspectral image tensor and a rank and outputs an enhanced feature space from the factor matrices of the decomposed tensor. Our method is a feature explosion technique that inherently maps low dimensional input space in $\mathbb{R}^{K}$ to high dimensional space in $\mathbb{R}^{R}$ , where $R\gg K$ , say in the order of 1000x, like a kernel. We show how the proposed method exploits the multi-linear structure of hyperspectral three dimensional tensor. We demonstrate the effectiveness of our method with experiments on three publicly available hyperspectral datasets with labeled pixels and compare their classification performance against traditional linear and non-linear supervised learning methods such as SVM with Linear, Polynomial, RBF kernels, and the Multi-Layer Perceptron model. Finally, we explore the relationship between the rank of the tensor decomposition and the classification accuracy using several hyperspectral datasets with ground truth.

Pasricha, Ravdeep Singh↗

RISE: robust iterative surface extension for sub-nanometer X-ray mirror fabrication

Precision optics have been widely required in many advanced technological applications. X-ray mirrors, as an example, serve as the key optical components at synchrotron radiation and free electron laser facilities. They are rectangular silicon or glass substrates where a rectangular Clear Aperture (CA) needs to be polished to sub-nanometer Root Mean Squared (RMS) to keep the imaging capability of the incoming X-ray wavefront at the diffraction limit. The convolutional polishing model requires a CA to be extended with extra data, from which the dwell time is calculated via deconvolution. However, since deconvolution is very sensitive to boundary errors and noise, the existing surface extension methods can hardly fulfill the sub-nanometer requirement. On one hand, the figure errors in a CA were improperly modeled during the extension, leading to continuity issues along the boundary. On the other hand, uncorrectable high-frequency errors and noise were also extended. In this study, we propose a novel Robust Iterative Surface Extension (RISE) method that resolves these problems with a data fitting strategy. RISE models the figure errors in a CA with orthogonal polynomials and ensures that only correctable errors are fit and extended. Combined with boundary conditions, an iterative refinement of dwell time is then proposed to compensate the errors brought by the extension and deconvolution, which drastically reduces the estimated figure error residuals in a CA while the increase of total dwell time is negligible. To our best knowledge, RISE is the first data fitting-based surface extension method and is the first to optimize dwell time based on iterative extension. An experimental verification of RISE is given by fabricating two elliptic cylinders (10 mm × 80 mm CAs) starting from a sphere with a radius of curvature around 173 m using ion beam figuring. The figure errors in the two CAs greatly improved from 204.96 nm RMS and 190.28 nm RMS to 0.62 nm RMS and 0.71 nm RMS, respectively, which proves that RISE is an effective method for sub-nanometer level X-ray mirror fabrication.

36 MATERIALS SCIENCE↗

Random matrix model of the Virasoro minimal string

The model of two dimensional quantum gravity defining the Virasoro minimal string, presented recently by Collier, Eberhardt, Mühlmann, and Rodriguez, was also shown to be perturbatively (in topology) equivalent to a random matrix model. An alternative definition is presented here, in terms of double-scaled orthogonal polynomials, thereby allowing direct access to nonperturbative physics. Already at leading order, the defining string equation’s properties yield valuable information about the nonperturbative fate of the model, confirming that the case ( c = 25 , c ^ = 1 ) (central charges of spacelike and timelike Liouville sectors) is special, by virtue of sharing certain key features of the N = 1 supersymmetric JT gravity string equation. Solutions of the full string equation are constructed using a special limit, and the (Cardy) spectral density is completed to all genus and beyond. The distributions of the underlying discrete spectra are readily accessible too, as is the spectral form factor. Some examples of these are exhibited. Published by the American Physical Society 2024

Astronomy & Astrophysics↗