Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “polynomial method”

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

Scalable quantum simulations of scattering in scalar field theory on 120 qubits

Simulations of collisions of fundamental particles on a quantum computer are expected to have an exponential advantage over classical methods and promise to enhance searches for new physics. Furthermore, scattering in scalar field theory has been shown to be bounded-error quantum polynomial time (BQP) complete, making it a representative problem for which quantum computation is efficient. As a step toward large-scale quantum simulations of collision processes, scattering of wave packets in one-dimensional scalar field theory is simulated using 120 qubits of IBM’s Heron superconducting quantum computer ibm_fez. Variational circuits compressing vacuum preparation, wave packet initialization, and time evolution are determined using classical resources. By leveraging physical properties of states in the theory, such as symmetries and locality, the variational quantum algorithm constructs scalable circuits that can be used to simulate arbitrarily large system sizes. A new strategy is introduced to mitigate errors in quantum simulations, which enables the extraction of meaningful results from circuits with up to 4924 two-qubit gates and two-qubit gate depths of 103. The effect of interactions is clearly seen, and is found to be in agreement with classical matrix product state simulations. Finally, the developments that will be necessary to simulate high-energy inelastic collisions on a quantum computer are discussed.

quantum circuits↗
DOE OSTI2026

ZTF-SEDm Type Ia supernova sample for Twins Embedding spectrophotometric standardization

Aims. This paper has two aims: the first aim is to build a large homogeneous spectrophotometric sample of Type Ia supernovae (SNe Ia) from the second data release of the Zwicky Transient Facility (ZTF DR2). We used the spectrum sample from the low-resolution ( R ∼ 100) SEDmachine (SEDm) Integral Field Spectrograph (IFS) that gathered 3069 spectra. This is one of the largest samples of such collections that can attempt to reproduce the Twins Embedding (TE) spectrophotometric standardization method. This is our second objective. The method was developed based on high-quality spectra from 200 SNe Ia of the Nearby Supernova factory (SNfactory) and led to an exceptionally low value of 0.073 mag for the intrinsic scatter. Methods. As the SEDm is not designed as a spectrophotometric instrument, we first improved the flux-calibration accuracy of the SN Ia spectrum sample using the ZTF photometric data, which were calibrated at the percent level. We corrected the spectra for second-order polynomials, fitted by comparing the synthetic photometry in the ZTF g , r , i filters with the light-curve (LC) data. We then applied the three steps of the TE parameterization to a subset of 783 ZTF SN spectra near maximum light while comparing results from SNfactory and ZTF. We finally analyzed the standardization methods based on the TE parameters. Results. The precision of the phase-correction model, which is the first step of the TE, is estimated at 0.01 mag in g band based on ZTF data. Despite the challenge posed by the spectrum-extraction pipeline associated with the SEDm (flux calibration, leftover host signal, low signal-to-noise ratio, and low resolution), we applied a first standardization in color based on the second step of the TE, called read between the lines (RBTL), to the ZTF sample. We reached a Hubble residual scatter of 0.153 mag, all in normalized median absolute deviation, which is to be compared to the ∼0.11 mag obtained with the SNfactory data. The SALT color and stretch standardization reaches a scatter of 0.164 mag for the same ZTF SN Ia sample, and its host steps are ∼0.1 mag and zero for RBTL. When considering the scatter due to the redshift error and flux calibration error, we estimated a RBTL scatter of ∼0.129 mag for this ZTF sample as an upper limit because we identified an additional contribution from a systematic error in color. We tested the standardization based on the nonlinear TE parameters, and, as expected from the low spectrum quality, it did not improve the overall dispersion. Conclusions. We release 1897 flux calibrated spectra of 1607 SNe Ia with an estimated photometric accuracy of 0.07 mag. We further demonstrate that some amount of spectrophotometric SN Ia standardization can be done with limited-quality spectra. The RBTL standardization is more efficient than that of SALT with one parameter less, and the resulting host steps are consistent with zero. This makes it less prone to astrophysical bias. For future spectroscopic surveys, targeting the extraction pipeline for a thorough flux calibration and good signal-to-noise ratio would enable us to compute the full TE standardization, which would further reduce the scatter in the distance estimate.

Ganot, C↗
DOE OSTI2025

Learning to classify quantum phases of matter with a few measurements

We study the identification of quantum phases of matter, at zero temperature, when only part of the phase diagram is known in advance. Following a supervised learning approach, we show how to use our previous knowledge to construct an observable capable of classifying the phase even in the unknown region. By using a combination of classical and quantum techniques, such as tensor networks, kernel methods, generalization bounds, quantum algorithms, and shadow estimators, we show that, in some cases, the certification of new ground states can be obtained with a polynomial number of measurements. An important application of our findings is the classification of the phases of matter obtained in quantum simulators, e.g. cold atom experiments, capable of efficiently preparing ground states of complex many-particle systems and applying simple measurements, e.g. single qubit measurements, but unable to perform a universal set of gates.

quantum machine learning↗
DOE OSTI2024

Extracting Topological Orders of Generalized Pauli Stabilizer Codes in Two Dimensions

In this paper, we introduce an algorithm for extracting topological data from translation invariant generalized Pauli stabilizer codes in two-dimensional systems, focusing on the analysis of anyon excitations and string operators. The algorithm applies to Z d qudits, including instances where d is a nonprime number. This capability allows the identification of topological orders that differ from the Z d toric codes. It extends our understanding beyond the established theorem that Pauli stabilizer codes for Z p qudits (with p being a prime) are equivalent to finite copies of Z p toric codes and trivial stabilizers. The algorithm is designed to determine all anyons and their string operators, enabling the computation of their fusion rules, topological spins, and braiding statistics. The method converts the identification of topological orders into computational tasks, including Gaussian elimination, the Hermite normal form, and the Smith normal form of truncated Laurent polynomials. Furthermore, the algorithm provides a systematic approach for studying quantum error-correcting codes. We apply it to various codes, such as self-dual CSS quantum codes modified from the two-dimensional honeycomb color code and non-CSS quantum codes that contain the double semion topological order or the six-semion topological order. Published by the American Physical Society 2024

Physics↗
DOE OSTI2025

Hybrid data-driven cement-stabilized soil design: An integration of machine learning, multi-objective optimization, and life cycle assessment

Soil stabilization is crucial in geotechnical engineering, yet conventional methods are often time-consuming, resource-intensive, and environmentally unsustainable. Despite growing interest in Machine Learning (ML) and optimization tools for mix design, few studies integrate these methods with decision-making techniques and environmental assessment to support practical implementation. This study proposes a hybrid data-driven framework for predicting strength, optimizing mix compositions, and evaluating environmental impacts via life cycle assessment of cement-stabilized soft soils. Six ML models were evaluated, and the top-performing eXtreme Gradient Boosting (XGB) model was further improved using the Grey Wolf Optimizer (GWO). The optimized XGB-GWO model, integrated with a polynomial cost function, served as the objective function in a multi-objective optimization problem solved via the Non-Dominated Sorting Genetic Algorithm II (NSGA-II), with final mix selection guided by the entropy-weighted TOPSIS method. Validation through a case study produced mix designs offering superior strength-cost trade-offs, with the optimal mix achieving 2243.2 kPa unconfined compressive strength and a 16.07 % reduction in carbon emissions compared to the highest-cost design. In conclusion, this study offers a sustainable, scalable approach to soil stabilization and supports informed decision-making in construction.

Life cycle assessment↗
DOE OSTI2025

LDRD Abbreviated report: High-Order General-Discrete-Ordinates Method Enabling Efficient Deterministic Transport in Hydrodynamic Simulations

Deterministic transport simulations for national-security and energy applications often operate in high-dimensional phase-space, where accuracy and cost both become major challenges. A common numerical artifact in such problems is the “ray-effect,” which appears as unphysical streaks. Beyond misinterpretation, these artifacts can contaminate tightly coupled physics, such as fluid dynamics, radiation-hydrodynamics, and laser-plasma interactions, eroding the predictive capability of entire multiphysics workflows. Our objective was to make high-dimension studies practical on modern hardware while mitigating the ray-effect without relying on prohibitively expensive sampling approaches such as Monte Carlo methods. We developed the Generic Discretization Library (GenDiL), a Graphics Processing Unit (GPU)-first framework that uses high-order Discontinuous Galerkin (DG) methods and matrix-free algorithms to reduce memory usage and improve computational efficiency, critical for phase-space simulations. GenDiL supports phase-space adaptivity in both mesh size and polynomial order (hp-adaptivity) to place resolution only where it is needed. A central capability is Local Dimensional Refinement (LDR), which couples lower-dimension continuum models to higher-dimension kinetic models through stable and conservative interfaces, so that high-fidelity physics is applied only in regions where it is essential. Building on the GenDiL framework, we developed the General SN (GSN) family of algorithms as a true generalization of the polar SN approach (discrete ordinates, often denoted SN). Rather than tying discrete ordinates to a specific polar change of coordinates, GSN formulates transport on an arbitrary change of coordinates chosen to reduce ray-effect. We studied two complementary variants: an analytic variant, where the coordinate map is prescribed in advance by a closed-form function; and a data-driven variant, where a quantity of interest, such as the net flux, guides the coordinate system. GenDiL provides the library infrastructure for efficient GPU execution, but the GSN concept is algorithmic and independent of any one library. Across representative high-dimension tests, including non-symmetric solutions, both variants delivered strong ray-effect mitigation at practical cost, moving four- to six-dimensional analysis toward repeatable, routine studies.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2024

Pseudospectral particle-in-cell formulation with arbitrary charge and current-density time dependencies for the modeling of relativistic plasmas

This paper introduces a formulation of the particle-in-cell (PIC) method for the modeling of relativistic plasmas, that leverages the ability of the pseudospectral analytical time-domain solver (PSATD) to handle arbitrary time dependencies of the charge and current densities during one PIC cycle (applied to second-order polynomial dependencies here). Here, the formulation is applied to a modified set of Maxwell's equations that was proposed earlier in the context of divergence cleaning, and to recently proposed extensions of the PSATD-PIC algorithm. Detailed analysis and testings revealed that, under some condition, the formulation can expand the range of numerical parameters under which PIC simulations are stable and accurate when modeling relativistic plasmas such as, e.g., plasma-based particle accelerators.

43 PARTICLE ACCELERATORS↗
DOE OSTI2026

MAPS: the MFEM Anisotropic Plasma Solver

Simulating magnetically confined fusion plasmas presents a uniquely challenging problem due to the nonlinear anisotropic heat conduction. We introduce the MAPS (MFEM Anisotropic Plasma Solver) tool, which uses a high-order finite element method to compute transport solutions on unstructured meshes. We show results for a set of three 2-D verification tests, two of which demonstrate the expected convergence properties for various mesh resolutions and polynomial degrees. We then discuss the convergence rate for the third test.

Barnett, Rhea [ORNL] (ORCID:0000000317527979)↗
DOE OSTI2024

A collinear perspective on the Regge limit

The high energy (Regge) limit provides a playground for understanding all loop structures of scattering amplitudes, and plays an important role in the description of many phenomenologically relevant cross-sections. While well understood in the planar limit, the structure of non-planar corrections introduces many fascinating complexities, for which a general organizing principle is still lacking. We study the structure of multi-reggeon exchanges in the context of the effective field theory for forward scattering, and derive their factorization into collinear operators (impact factors) and soft operators. We derive the structure of the renormalization group consistency equations in the effective theory, showing how the anomalous dimensions of the soft operators are related to those of the collinear operators, allowing us to derive renormalization group equations in the Regge limit purely from a collinear perspective. The rigidity of the consistency equations provides considerable insight into the all orders organization of Regge amplitudes in the effective theory, as well as its relation to other approaches. Along the way we derive a number of technical results that improve the understanding of the effective theory. We illustrate this collinear perspective by re-deriving all the standard BFKL equations for two-Glauber exchange from purely collinear calculations, and we show that this perspective provides a number of conceptual and computational advantages as compared to the standard view from soft or Glauber physics. We anticipate that this formulation in terms of collinear operators will enable a better understanding of the relation between BFKL and DGLAP in gauge theories, and facilitate the analysis of renormalization group evolution equations describing Reggeization beyond next-to-leading order.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Symbolic diagnostics to interpret and analyze neural network models

Embedded machine-learned models (EMLMs) have the promise to improve the predictive accuracy of engineering simulators in environments of national interest. EMLMs often comprise complex input-output maps (e.g., neural networks), which make them unamenable to rigorous analysis and generally difficult to interpret. In the face of decades of theory, this lack of interpretability is a significant barrier to building confidence in these models. This work outlines an approach to interpret EMLMs using sparse polynomial regression for comparison with theoretical understanding. To do so, we build on the concept of Locally Interpretable Model-agnostic Explanations (LIME) using physics-informed clustering, prototype selection, and library construction. While general, we demonstrate our method on tensor-basis neural networks used in Reynolds-Averaged Navier-Stokes simulations of hypersonic fluid flows. Results are presented for a simulated toy model and for direct numerical simulations (DNS) of turbulent flows over a flat plate.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Scalable Tensor Methods for Nonuniform Hypergraphs

While multilinear algebra appears natural for studying the multiway interactions modeled by hypergraphs, tensor methods for general hypergraphs have been stymied by theoretical and practical barriers. A recently proposed adjacency tensor is applicable to nonuniform hypergraphs, but is prohibitively costly to form and analyze in practice. We develop tensor times same vector (TTSV) algorithms for this tensor which improve complexity from $O(n^r)$ to a low-degree polynomial in $r$, where $n$ is the number of vertices and $r$ is the maximum hyperedge size. Our algorithms are implicit, avoiding formation of the order $r$ adjacency tensor. Here, we demonstrate the flexibility and utility of our approach in practice by developing tensor-based hypergraph centrality and clustering algorithms. We also show these tensor measures offer complementary information to analogous graph-reduction approaches on data, and are also able to detect higher-order structure that many existing matrix-based approaches provably cannot.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

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↗
DOE OSTI2026

Bayesian Adaptive Polynomial Chaos Expansions

Polynomial chaos expansions (PCEs) are widely used for uncertainty quantification (UQ) tasks, particularly in the applied mathematics community. However, PCE has received comparatively less attention in the statistics literature, and fully Bayesian formulations remain rare—especially with implementations in R. Motivated by the success of adaptive Bayesian machine learning models such as BART, BASS and BPPR, we develop a new fully Bayesian adaptive PCE method with an efficient and accessible R implementation: khaos. Our approach includes a novel proposal distribution that enables data-driven interaction selection and supports a modified g-prior tailored to PCE structure. Through simulation studies and real-world UQ applications, we demonstrate that the Bayesian adaptive PCE provides competitive performance for surrogate modeling, global sensitivity analysis and ordinal regression tasks.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Analytical expression of a finite, long, conical canted-cosine-theta coil for particle collider interaction regions

Magnets in the accelerator interaction region (IR) present significant challenges because of high field requirements and limited available space. Conical-shaped magnets offer advantages in these environments by allowing closer placement to the interaction point while maintaining clearance from synchrotron radiation. Interestingly, numerical studies have shown that conical canted-cosine-theta (CCT) designs produce a constant field distribution along the axial direction in the IR quadrupoles for the Electron-Ion Collider (EIC) at Brookhaven National Laboratory. However, the field harmonics generated by conical CCT windings are not yet fully understood. This paper presents an analytical approach to describe the magnetic field produced by a conical surface current and proposes a method for designing conical CCT magnets for accelerator applications. First, we begin with a surface current sheet having a general cosine-theta distribution in spherical coordinates and solve the vector potential using the Green’s function. The magnetic fields generated by the conical current sheet are expressed using associated Legendre polynomials. These results are then related to circular field harmonics and integral field harmonics for designing a coil that produces a pure multipole field. Next, a single layer of the conical CCT winding path is produced based on the cosine-theta current distribution. Finally, the magnetic field quality of dipole and quadrupole conical CCT coils with multiple layers is verified using the Biot-Savart law.

Yang, Ye↗
DOE OSTI2024

Loops of loops expansion in the amplituhedron

We study a novel geometric expansion for scattering amplitudes in the planar sector of $\mathcal{N}$ = 4 super Yang-Mills theory, in the context of the Amplituhedron which reproduces the all-loop integrand as a canonical differential form on the positive geometry. In a paper by Arkani-Hamed, Henn and one of the authors, it was shown that this result can be recast in terms of negative geometries with a certain hierarchy of loops (closed cycles) in the space of loop momenta, represented by lines in momentum twistor space. One can then calculate an all-loop order result in the approximation where only tree graphs in the space of all loops are considered. Furthermore, using differential equation methods, it is possible to calculate and resum integrated expressions and obtain strong coupling results. In this paper, we provide a more general framework for the ‘loops of loops’ expansion and outline a powerful method for the determination of differential forms for higher-order geometries. We solve the problem completely for graphs with one internal cycle, but the method can be used more generally for other geometries.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Hybrid algorithm for the time-dependent Hartree–Fock method using the Yang–Baxter equation on quantum computers *

Abstract The time-dependent Hartree–Fock (TDHF) method is an approach to simulate the mean field dynamics of electrons within the assumption that the electrons move independently in their self-consistent average field and within the space of single Slater determinants. One of the major advantages of performing time dynamics within Hartree–Fock theory is the free fermionic nature of the problem, which makes TDHF classically simulatable in polynomial time. Here, we present a hybrid TDHF implementation for quantum computers. This quantum circuit grows with time; but with our recent work on circuit compression via the Yang–Baxter equation (YBE), the resulting circuit is constant depth. This study provides a new way to simulate TDHF with the aid of a quantum device as well as provides a new direction for the application of YBE symmetry in quantum chemistry simulations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Data-driven projection pursuit adaptation of polynomial chaos expansions for dependent high-dimensional parameters

Uncertainty quantification (UQ) and inference involving a large number of parameters are valuable tools for problems associated with heterogeneous and non-stationary behaviors. The difficulty with these problems is exacerbated when these parameters are statistically dependent requiring statistical characterization over joint measures. Probabilistic modeling methodologies stand as effective tools in the realms of UQ and inference. Among these, polynomial chaos expansions (PCE), when adapted to low-dimensional quantities of interest (QoI), provide effective yet accurate approximations for these QoI in terms of an adapted orthogonal basis. These adaptation techniques have been cast as projection pursuits in Gaussian Hilbert space in what has been referred to as a projection pursuit adaptation (PPA) by Xiaoshu Zeng and Roger Ghanem (2023). The PPA method efficiently identifies an optimal low-dimensional space for representing the QoI and simultaneously evaluates an optimal PCE within that space. The quality of this approximation clearly depends on the size of the training dataset, which is typically a function of the adapted reduced dimension. Here, the complexity of the problem is thus mediated by the complexity of the low-dimensional quantity of interest and not the complexity of the high-dimensional parameter space.

Data-driven↗
DOE OSTI2025

An analytically tractable marked power spectrum

The increasing precision of cosmology data in the modern era is calling for methods to allow the extraction of non-Gaussian information using tools beyond two-point statistics. The marked power spectrum has the potential to extract beyond two-point information in a computationally efficient way while using much of the infrastructure already available for the power spectrum. In this work we explore the marked power spectrum from an analytical perspective. In particular, we explore a low-order polynomial for the mark that allows us to better control the theoretical uncertainties and we show that with minimal new degrees of freedom the analytical results match measurements from N-body simulations for both the matter field and biased tracers in redshift space. Finally, we show that even within the limited forms of mark that we consider, there are degeneracies that can be broken by inclusion of the marked auto-spectrum or the cross-spectrum with the unmarked field. I n conclusion, we discuss future theoretical developments that would enable us to apply this approach to survey data.

79 ASTRONOMY AND ASTROPHYSICS↗