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

Long-term thermal stability and calibration of Type-II fiber Bragg grating array inscribed in radiation-hardened fibers

This paper investigates the long-term thermal stability of Type-II fiber Bragg grating (FBG) arrays, inscribed by femtosecond laser in radiation-hardened fiber, for potential applications as multiplexed sensors in high-temperature energy systems. The thermal stability of FBG sensors was assessed through 16 thermal cycles from room temperature (RT) to 750 ℃ about two months, involving 100 FBG sensors. The results show that the absolute temperature drift of FBG sensors can be reduced to less than 0.4 pm/day after 54 h thermal annealing process at a constant temperature of 800 ℃. As temperature sensors, the FBGs demonstrated stable performance, achieving a standard deviation (STD) of 1.8 pm (corresponding to a temperature resolution of 0.118 ℃) post-annealing. Repeated thermal cycles revealed a random drift of 2.3 pm in the FBG wavelength at RT. Polynomial fitting was explored as a calibration method to convert FBG wavelength shifts into absolute temperature measurements. By optimizing calibration temperature points (RT, 200 ℃, 400 ℃, and 750 ℃), the study shows that cubic polynomial calibration using four points yields an average R2 of 0.9997 and an RMSE of 3.58 ℃ across the entire temperature range (RT to 750 ℃). This approach represents an 11.53-fold improvement over empirical slope calibration and a 1.34-fold improvement over four-point piecewise fitting. The findings indicate that Type-II FBGs inscribed in radiation-hardened fibers can function as accurate temperature sensors, with performance on par with or exceeding that of thermocouples. With their multiplexing capability, robust signal transmission over long lead cables, and immunity to electromagnetic interference, FBG sensors offer a promising alternative to traditional electronic sensors for energy system monitoring.

Dominguez-Ontiveros, Elvis [ORNL] (ORCID:000000018↗
DOE OSTI2025

Enabling Real-Time Communication in Multi-Agent Systems: A Graph Neural Network Based Approach

Global connectivity enables effective coordination in Multi-Agent Systems (MAS). Solving these connection problems under hardware constraints is an NP-hard non-Euclidean Degree Constrained Minimum Spanning Tree (DCMST) problem. Prior MAS controllers coordinate team movement for task completion and collision avoidance; some considering Line-of-Sight (LOS) maintenance but prioritizing flexibility over guarantees. Evolutionary Algorithms (EA) have been shown to find good solutions for DCMST, but their performance degrades with larger populations required to support a large MAS. We present a method based on edge graph attention networks, trained offline to reduce online computation times. Empirical comparisons with greedy polynomial-time solvers and EA show that our method leverages latent graph information to consistently find constraint-satisfying solutions in less time.

connectivity maintenance↗
DOE OSTI2025

Similarity Metric for Data Optimization and Efficient Training of Reactive Machine Learning Force Fields for Hydrocarbon Radiolysis

Radiolysis is a common approach to sterilize polymers, chemically modify them for upcycling, and accelerate their decomposition for recycling purposes. Reactive molecular dynamics (MD) simulations provide a powerful tool to generate atomic-level trajectories of the reactive processes and quantify radiolytic chemical degradation pathways. For this, machine learning (ML) surrogate models for reactive force fields with quantum mechanical accuracy are now widely used, which require ML training data sets that can provide information on atomic environments for target chemical systems. However, radiolysis chemistry can be highly complex and diverse, which poses significant challenges for generating training data to parametrize ML models. In this regard, we developed a method for optimizing the training data set using a cosine similarity metric to help guide training set selection for radiolysis of polyethylene, a model hydrocarbon polymer, as well as to enhance the transferability of our reactive ML force field (MLFF) to a variety of molecular and polymeric systems. Our approach performs atom-by-atom comparisons between local atomic environments to pinpoint important data points associated with rare and localized events, such as radiolysis damage within structures. We apply this approach to train the Chebyshev Interaction Model for Efficient Simulation (ChIMES) MLFF model, which expresses the atomic interaction potentials in terms of linear combinations of many-body Chebyshev polynomials. We first show that our method can reduce our training set size by ∼70% while improving overall accuracy compared to more standard MD model fitting approaches. We then validate our optimum model against diverse hydrocarbon simulation data, including simple alkanes and systems with unsaturated carbon bonds, over a wide range of thermodynamic conditions. Finally, we use our ChIMES model to perform MD simulations of radiolytic damage with large-scale systems that help avoid system size effects. Overall, our approach yields an MD force field that retains most of the accuracy of the underlying quantum method while yielding many orders of improvement in computational efficiency. In conclusion, our efforts will have impact on future hydrocarbon polymer radiolysis studies, where the chemical details of the polymer–radiation interactions can have a strong effect on the resulting products observed in experiments.

Hydrocarbons↗
DOE OSTI2025

Construction of approximate invariants for nonintegrable Hamiltonian systems

We present a method to construct high-order polynomial approximate invariants (AI) for nonintegrable Hamiltonian dynamical systems and apply it to a modern ring-based particle accelerator. Taking advantage of a special property of one-turn transformation maps expressed as square matrices, AIs can be constructed order by order iteratively. Evaluating AI with simulation data, we observe that AI’s fluctuation is actually a measure of chaos. Through minimizing the fluctuations, the stable region of long-term motions, i.e., the dynamic aperture of the accelerator, could be enlarged.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Coherency-Constrained Spectral Clustering for Power Network Reduction

This paper presents a methodology for reducing the complexity of large-scale power network models using spectral clustering, aggregation of electrical components, and cost function approximation. Two approaches are explored using unconstrained and constrained spectral clustering to determine areas for effective system reduction. Once the system areas are determined, both loads and generators by type are aggregated, and their new cost function is approximated through polynomial curve-fitting or statistical methods. The performance of reduced networks is evaluated in terms of their ability to follow the true daily cost of the original system over a 24-hour period considering a set of several days. Two test systems are taken as test beds. Application of the methodology to a modified version of the IEEE 39-bus system reduces it from 17 generators to a 4-bus system and 9 generators with about 93% of accuracy. Similarly, the IEEE 118-bus system is reduced from 19 generators to a 3-bus system with three aggregated units achieving over 99% of accuracy. These findings address scalability challenges and enhance accuracy for high and mid-loading level conditions, and by aggregating thermal units with similar cost functions.

42 ENGINEERING↗
DOE OSTI2025

Construction of approximate invariants for non-integrable Hamiltonian systems

We present a method to construct high-order polynomial approximate invariants (AI) for non integrable Hamiltonian dynamical systems, and apply it to a modern ring-based particle accelerator. Taking advantage of a special property of one-turn transformation maps in the form of a square matrix, AIs can be constructed order-by-order iteratively. Evaluating AI with simulation data, we observe that AI’s fluctuation is actually a measure of chaos. Through minimizing the fluctuations, the stable region of long-term motions, i.e., the dynamic aperture of the accelerator, could be enlarged.

43 PARTICLE ACCELERATORS↗
DOE OSTI2026

Spectra-to-exposure conversion using polynomial response models for gamma-ray field characterization

Accurate measurement of exposure rate from gamma-ray spectral data remains a critical challenge during radiological emergency response operations. Conventional methods rely on pre-defined static conversion factors derived from fixed geometries and isotopic compositions, which often fail to capture real-world environmental variability. This study presents a generalized approach as a "next-step" for converting gamma-ray spectral data into exposure rate using polynomial response models. The method introduces a flexible weighting scheme based on the in-situ detector response to distributed sources, enabling a pathway towards improved correspondence between measured spectra and "ground-truth" exposure rates. Experimental data from sodium iodide NaI(Tl) detectors were used to validate the approach as, at least equivalent to the current count-to-exposure method employed in emergency response CONOPS. Results show that the polynomial weighting model is sufficiently equal to the count-to-exposure method and may help improve accuracy given its adaptability to real-world conditions.

61 RADIATION PROTECTION AND DOSIMETRY↗
DOE OSTI2026

Scalable quantum computational science: A perspective from block-encodings and polynomial transformations

Significant developments made in quantum hardware and error correction recently have been driving quantum computing toward practical utility. However, gaps remain between abstract quantum algorithmic development and practical applications in computational sciences. In this perspective article, we propose several properties that scalable quantum computational science methods should possess. We further discuss how block-encodings and polynomial transformations can potentially serve as a unified framework with the desired properties. Recent advancements on these topics are presented, including the construction and assembly of block-encodings, and various generalizations of quantum signal processing (QSP) algorithms to perform polynomial transformations. The scalability of QSP methods on parallel and distributed quantum architectures is also highlighted. Promising applications in simulation and observable estimation in chemistry, physics, and optimization problems are presented. We hope this perspective serves as a gentle introduction to state-of-the-art quantum algorithms for the computational science community and inspires future development of scalable quantum computational science methodologies that bridge theory and practice.

Bayesian inference↗
DOE OSTI2025

Boosting efficiency and reducing graph reliance: Basis adaptation integration in Bayesian multi-fidelity networks

The computational cost of high-fidelity numerical models makes outer-loop analysis, which requires repeated interrogation of the model such as uncertainty quantification, computationally demanding. Multi-fidelity methods, which construct a surrogate model using data from an ensemble of models of varying cost and accuracy, can substantially reduce the cost of outer-loop analysis. However, these methods can be difficult to apply when the model ensemble does not admit a clear hierarchy a priori and the correlations between models are low. Consequently, in this paper, we present a multi-fidelity method that leverages dimension reduction to enhance the correlation between models, thereby reducing the amount of data needed to train a surrogate from an unordered ensemble of models. Our method utilizes basis adaptation to build low-dimensional polynomial chaos expansions of each model and employs Multi-fidelity Networks to encode the relationships among models. We show that the resulting method exhibit two notable advantages over its counterpart: (1) enhanced accuracy (both reduced bias and variance); and (2) reduced dependency on the graph structure encoding relationships among models. We demonstrate the approach on an analytical test problem and a challenging finite element model for a spent nuclear fuel. Our method produces a surrogate model that is significantly more accurate than either a single-fidelity surrogate or a multi-fidelity surrogate constructed without basis adaptation.

42 ENGINEERING↗
DOE OSTI2025

Ansatz-Free Hamiltonian Learning with Heisenberg-Limited Scaling

Learning the unknown interactions that govern a quantum system is crucial for quantum information processing, device benchmarking, and quantum sensing. The problem, known as Hamiltonian learning, is well understood under the assumption that interactions are local, but this assumption may not hold for arbitrary Hamiltonians. Previous methods all require high-order inverse polynomial dependency with precision, unable to surpass the standard quantum limit and reach the gold-standard Heisenberg-limited scaling. Whether Heisenberg-limited Hamiltonian learning is possible without prior assumptions about the interaction structures, a challenge we term ansatz-free Hamiltonian learning , remains an open question. In this work, we present a quantum algorithm to learn arbitrary sparse Hamiltonians without any structure constraints using only black-box queries of the system’s real-time evolution and minimal digital controls to attain Heisenberg-limited scaling in estimation error. Our method is also resilient to state-preparation-and-measurement errors, enhancing its practical feasibility. We numerically demonstrate our ansatz-free protocol for learning physical Hamiltonians and validating analog quantum simulations, benchmarking our performance against the state-of-the-art Heisenberg-limited learning approach. Moreover, we establish a fundamental trade-off between total evolution time and quantum control on learning arbitrary interactions, revealing the intrinsic interplay between controllability and total evolution-time complexity for any learning algorithm. These results pave the way for further exploration into Heisenberg-limited Hamiltonian learning in complex quantum systems under minimal assumptions, potentially enabling new benchmarking and verification protocols.

machine learning↗
DOE OSTI2025

An eigenvalue-based method for computing the relaxed pressure in compressible multiphase flow with N phases

The modeling of compressible multiphase flows is a decades-old area of study with many applications across various fields. Many of these application areas use stiff pressure relaxation. This process involves the solution of a nonlinear system with N + 1 equations and N + 1 unknowns, where N is the number of phases. The resolution of this system with general equations of state (EOSs) is difficult. Furthermore, nonlinear systems can admit multiple solutions, and current solution methods do not address this possibility. Very recently, a thermodynamic relaxation method was introduced, which effectively maps a relatively simple predictor equation of state onto a more complex target equation of state. In this context, the target EOSs are the chosen EOSs for the thermodynamic model. Furthermore, this thermodynamic relaxation has the benefit of simplifying the stiff pressure relaxation system of equations. In this article, we show this system reduces to a polynomial of degree N, which can be recast as an eigenvalue problem through the use of the associated companion matrix. We show that although this eigenvalue method is generally less efficient than Newton–Raphson iteration, it does not suffer from convergence issues and finds all N roots of the polynomial. Hence, the method provides a fail-safe for root-finding iterative methods and a way to address the issue of multiple solutions to the nonlinear system of equations in stiff pressure relaxation.

Eigenvalue algorithm↗
DOE OSTI2025

RTN-099: Photometric Transformation Relations for the LSST Data Preview 1

This technical note provides photometric transformation relations between the Vera C. Rubin Observatory's LSSTCam and LSSTComCam systems and other photometric systems. These transformations are derived using both synthetic and empirical data and are intended to support calibration and comparison across survey systems. We present both polynomial equations and lookup-table-based methods, depending on the available data and desired accuracy. The transformations are generally valid for stars with typical spectral energy distributions (SEDs), and caution should be used when applying them to objects with strong emission lines or atypical colors.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2026

RTN-125: Photometric Transformation Relations for the LSST Data Preview 2

This technical note provides photometric transformation relations between the NSF-DOE Vera C. Rubin Observatory's Data Preview 2 (DP2) and other photometric systems. These transformations are derived using both synthetic and empirical data and are intended to support calibration and comparison across survey systems. We present both polynomial equations and lookup-table-based methods, depending on the available data and desired accuracy. The transformations are generally valid for stars with typical spectral energy distributions (SEDs), and caution should be used when applying them to objects with strong emission lines or atypical colors.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

ZERNIPAX: A fast and accurate Zernike polynomial calculator in Python

Zernike polynomials serve as an orthogonal basis on the unit disc, and have proven to be effective in optics simulations, astrophysics, and more recently in plasma simulations. Unlike Bessel functions, Zernike polynomials are inherently finite and smooth at the disc center (r=0), ensuring continuous differentiability along the axis. This property makes them particularly suitable for simulations, requiring no additional handling at the origin. We developed ZERNIPAX, an open-source Python package capable of utilizing CPU/GPUs, leveraging Google's JAX package and available on GitHub as well as the Python software repository PyPI. Furthermore, our implementation of the recursion relation between Jacobi polynomials significantly improves computation time compared to alternative methods by use of parallel computing while still performing more accurately for high-mode numbers.

Astrophysics↗
DOE OSTI2025

Image-Driven Hybrid Structural Analysis Based on Continuum Point Cloud Method with Boundary Capturing Technique

Conventional approaches for the structural health monitoring of infrastructures often rely on physical sensors or targets attached to structural members, which require considerable preparation, maintenance, and operational effort, including continuous on-site adjustments. This paper presents an image-driven hybrid structural analysis technique that combines digital image processing (DIP) and regression analysis with a continuum point cloud method (CPCM) built on a particle-based strong formulation. Polynomial regressions capture the boundary shape change due to the structural loading and precisely identify the edge and corner coordinates of the deformed structure. The captured edge profiles are transformed into essential boundary conditions. This allows the construction of a strongly formulated boundary value problem (BVP), classified as the Dirichlet problem. Capturing boundary conditions from the digital image is novel, although a similar approach was applied to the point cloud data. It was shown that the CPCM is more efficient in this hybrid simulation framework than the weak-form-based numerical schemes. Unlike the finite element method (FEM), it can avoid aligning boundary nodes with regression points. A three-point bending test of a rubber beam was simulated to validate the developed technique. The simulation results were benchmarked against numerical results by ANSYS and various relevant numerical schemes. The technique can effectively solve the Dirichlet-type BVP, yielding accurate deformation, stress, and strain values across the entire problem domain when employing a linear strain model and increasing the number of CPCM nodes. In addition, comparative analysis with conventional displacement tracking techniques verifies the developed technique’s robustness. The proposed technique effectively circumvents the inherent limitations of traditional monitoring methods resulting from the reliance on physical gauges or target markers so that a robust and non-contact solution for remote structural health monitoring in real-scale infrastructures can be provided, even in unfavorable experimental environments.

Chemistry↗
DOE OSTI2025

Neural chaos: A spectral stochastic neural operator

Building surrogate models for operators with uncertainty quantification capabilities is essential for many engineering applications where randomness–such as variability in material properties, boundary conditions, and initial conditions–is unavoidable. Polynomial Chaos Expansion (PCE) is widely recognized as a go-to method for constructing stochastic surrogates in both intrusive and non-intrusive ways, and it has recently been used in the context of operator learning. However, its application becomes challenging for complex or high-dimensional processes, as achieving accuracy requires higher-order polynomials, which can increase computational demand and/or the risk of overfitting. Furthermore, PCE requires specialized treatments to manage random variables that are not independent, and these treatments may be problem-dependent or may fail with increasing complexity. Here, in this work, we adopt the same formalism as the spectral expansion used in PCE; however, we replace the classical polynomial basis functions with neural network (NN) basis functions to leverage their expressivity. To achieve this, we propose an algorithm that identifies NN-parameterized basis functions in a purely data-driven manner, without any prior assumptions about the joint distribution of the random variables involved, whether independent or dependent, or about their marginal distributions. The proposed algorithm identifies each NN-parameterized basis function sequentially, ensuring they are orthogonal with respect to the data distribution. The basis functions are constructed directly on the joint stochastic variables without requiring a tensor product structure or assuming independence of the random variables. This approach may offer greater flexibility for complex stochastic models, while simplifying implementation compared to the tensor product structures typically used in PCE to handle random vectors. This is particularly advantageous given the current state of open-source packages, where building and training neural networks can be done with just a few lines of code and extensive community support. We demonstrate the effectiveness of the proposed scheme through several numerical examples of varying complexity and provide comparisons with classical PCE.

Polynomial chaos expansion↗
DOE OSTI2026

A projection method for particle resampling

Particle discretizations of partial differential equations are advantageous for high-dimensional kinetic models in phase-space due to their better scalability than continuum approaches with respect to dimension. Complex processes collectively referred to as particle noise hamper long time simulations with particle methods. One approach to address this problem is particle mesh adaptivity, or remapping, known as particle resampling and remeshing. Here, this work introduces a resampling method that projects particles to and from a (finite element) function space. The method is simple, using standard sparse linear algebra and finite element techniques, and it preserves all moments up to the order of a polynomial represented exactly by the continuum function space. It is distinguished from most other mesh-based methods in that new particle positions and number are decoupled from the mesh, allowing particle and continuum meshes to be adapted relatively independently. While this work is developed with structured particle and continuum phase-space grids on 1X + 1V Vlasov-Poisson models of Landau damping and two-stream instability, the method is well-suited to unstructured grids. Stable long time dynamics are demonstrated up to time T = 500. Reproducibility artifacts and data are publicly available.

Kinetic methods↗
DOE OSTI2025

Investigating the universality of five-point QCD scattering amplitudes at high energy

We investigate 2 → 3 QCD scattering amplitudes in multi-Regge kinematics, i.e. where the final partons are strongly ordered in rapidity. In this regime amplitudes exhibit intriguing factorisation properties which can be understood in terms of effective degrees of freedom called reggeons. Working within the Balitsky/JIMWLK framework, we predict these amplitudes for the first time to next-to-next-to-leading logarithmic order, and compare against the limit of QCD scattering amplitudes in full colour and kinematics. We find that the latter can be described in terms of universal objects, and that the apparent non-universality arising at NNLL comes from well-defined and under-control contributions that we can predict. Thanks to this observation, we extract for the first time the universal vertex that controls the emission of the central-rapidity gluon, both in QCD and $\mathcal{N}$ = 4 super Yang-Mills.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗