Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “POLYNOMIALS”

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 1,027 records · Page 57

Modified GMDH-NN algorithm and its application for global sensitivity analysis

Global sensitivity analysis (GSA) is a very useful tool to evaluate the influence of input variables in the whole distribution range. Sobol' method is the most commonly used among variance-based methods, which are efficient and popular GSA techniques. High dimensional model representation (HDMR) is a popular way to compute Sobol' indices, however, its drawbacks cannot be ignored. We show that modified GMDH-NN algorithm can calculate coefficients of metamodel efficiently, so this paper aims at combining it with HDMR and proposes GMDH-HDMR method. The new method shows higher precision and faster convergent rate. Several numerical and engineering examples are used to confirm its advantages. - Highlights: • The GMDH-NN is improved to construct the explicit polynomial model of optimal complexity by self-organization. • The paper aims at combining improved GMDH-NN with HDMR expansions and using it to compute Sobol' indices directly. • The method can be applied in uniform, normal and exponential distribution by using suitable orthogonal polynomials. • Engineering examples, e.g., electronic circuit models can be solved by the presented method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A variable high-order shock-capturing finite difference method with GP-WENO

Here, we present a new finite difference shock-capturing scheme for hyperbolic equations on static uniform grids. The method provides selectable high-order accuracy by employing a kernel-based Gaussian Process (GP) data prediction method which is an extension of the GP high-order method originally introduced in a finite volume framework by the same authors. The method interpolates Riemann states to high order, replacing the conventional polynomial interpolations with polynomial-free GP-based interpolations. For shocks and discontinuities, this GP interpolation scheme uses a nonlinear shock handling strategy similar to Weighted Essentially Non-Oscillatory (WENO), with a novelty consisting in the fact that nonlinear smoothness indicators are formulated in terms of the Gaussian likelihood of the local stencil data, replacing the conventional L 2 -type smoothness indicators of the original WENO method. We demonstrate that these GP-based smoothness indicators play a key role in the new algorithm, providing significant improvements in delivering high – and selectable – order accuracy in smooth flows, while successfully delivering non-oscillatory solution behavior in discontinuous flows.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Avoiding erroneous analysis of MIM diode current-voltage characteristics through exponential fitting

Accurate fitting of measured current-voltage [$I$ ($V$) ] data is crucial to the correct analysis and understanding of metal-insulator–metal (MIM) diodes, especially for optical rectennas. With the commonly used polynomial fitting of the $I$$(V)$ data, the order of the fit can drastically affect the diode performance metrics such as resistance, responsivity, and asymmetry. Additionally, the resulting fitting coefficients provide no useful parameters. An exponential-based equation can fit the $I$$(V)$ data well, can avoid artifacts from the choice of order of the polynomial, and allows for the accurate calculation of diode performance metrics directly from the fitting coefficients. Finally, connecting the performance metrics to fitting coefficients shows a correspondence between zero-bias responsivity and asymmetry at any given voltage.

42 ENGINEERING↗

Validation and uncertainty quantification of detector response functions for a $1"×2"$ NaI collimated detector intended for inverse radioisotope source mapping applications

Detector response functions (DRFs) are often used for inverse analysis. We compute the DRF of a sodium iodide (NaI) nuclear material holdup field detector using the code named g03 developed by the Center for Engineering Applications of Radioisotopes (CEAR) at NC State University. Three measurement campaigns were performed in order to validate the DRF’s constructed by g03: on-axis detection of calibration sources, off-axis measurements of a highly enriched uranium (HEU) disk, and on-axis measurements of the HEU disk with steel plates inserted between the source and the detector to provide attenuation. Furthermore, this work quantifies the uncertainty of the Monte Carlo simulations used in and with g03, as well as the uncertainties associated with each semi-empirical model employed in the full DRF representation. Overall, for the calibration source measurements, the response computed by the DRF for the prediction of the full-energy peak region of responses was good, i.e. within two standard deviations of the experimental response. In contrast, the DRF tended to overestimate the Compton continuum by about 45–65% due to inadequate tuning of the electron range multiplier fit variable that empirically represents physics associated with electron transport that is not modeled explicitly in g03. For the HEU disk measurements, computed DRF responses tended to significantly underestimate (more than 20%) the secondary full-energy peaks (any peak of lower energy than the highest-energy peak computed) due to scattering in the detector collimator and aluminum can, which is not included in the g03 model. We ran a sufficiently large number of histories to ensure for all of the Monte Carlo simulations that the statistical uncertainties were lower than their experimental counterpart’s Poisson uncertainties. The uncertainties associated with least-squares fits to the experimental data tended to have parameter relative standard deviations lower than the peak channel relative standard deviation in most cases and good reduced chi-square values. The highest sources of uncertainty were identified as the energy calibration polynomial factor (due to limited source availability and NaI resolution) and the Ba-133 peak fit (only a very weak source was available), which were 20% and 10%, respectively.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

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↗

On detrending stream velocity time series for robust tidal flow turbulence characterization

We investigated the impact of detrending techniques on turbulence quantities from tidal stream flow data, focusing on the autocorrelation function, $ρ_{uu}$, and velocity spectrum, $Φ(f)$. Standard detrending methods, including high-pass frequency-based and polynomial-based techniques, are examined, alongside a proposed alternative method, the empirical mode decomposition (EMD). Our results highlight that intervals of flow acceleration and deceleration, typical in tidal and riverine flows, significantly affect the estimation of turbulence quantities using high-pass frequency filtering and polynomial detrending of varying orders. These methods can strongly influence $ρ_{uu}$ and $Φ(f)$, thereby affecting the accurate estimation of derived quantities. We examine two variations of detrending data using EMD; the first removes only the EMD residue, and the second removes both the residue and the largest scale intrinsic mode function (IMF). By comparing the detrended spectra with the modeled von Kármán spectra, we demonstrate that the second variation (i.e., removing the residue and the largest scale IMF) successfully removed the large-scale trend of the data while retaining the energy of other scales.

Detrend↗

Spline based least squares integration for two-dimensional shape or wavefront reconstruction

In this paper, we present a novel method to handle two-dimensional shape or wavefront reconstruction from its slopes. The proposed integration method employs splines to fit the measured slope data with piecewise polynomials and uses the analytical polynomial functions to represent the height changes in a lateral spacing with the pre-determined spline coefficients. The linear least squares method is applied to estimate the height or wavefront as a final result. Numerical simulations verify that the proposed method has less algorithm errors than two other existing methods used for comparison. Especially at the boundaries, the proposed method has better performance. The noise influence is studied by adding white Gaussian noise to the slope data. Finally, experimental data from phase measuring deflectometry are tested to demonstrate the feasibility of the new method in a practical measurement.

42 ENGINEERING↗

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↗

Comparing smoothing techniques for extracting MOSFET threshold voltage

Measurement noise acts as a barrier to the accurate calculation of threshold voltage by derivative-based extraction methods. We examined several smoothing techniques and their effects on measurement noise in threshold voltage extracted by the linear extrapolation method and the g m /I d method. We applied these techniques on a set of SiC power MOSFET devices before and after they had undergone accelerated thermal testing. The smoothing methods examined are least-squares polynomial fitting, low-pass filtering using Butterworth and Chebyshev fillers, and differential smoothing. These methods are compared by their shift in threshold voltage compared to unsmoothed data and their standard deviation among the measurements of each device. All methods performed poorly at smoothing when extracting via the g m /I d due to the large amounts of high-magnitude subthreshold noise, mostly tending to extract threshold voltages far below the expected value. Differential smoothing provided results closest to the expected value with an absolute shift of 1.2 V on average. The smoothing methods performed better with the LE method. On a failed device, all smoothing methods except polynomial smoothing preserved the large threshold voltage anomaly for four out of five measurements. These results show that choice of smoothing method, if used must be evaluated based on the device and extraction method.

42 ENGINEERING↗

A Perspective on Quantum Computing Applications in Quantum Chemistry Using 25-100 Logical Qubits

The intersection of quantum computing and quantum chemistry represents a promising frontier for achieving quantum utility in domains of both scientific and societal relevance. Owing to the exponential growth of classical resource requirements for simulating quantum systems, quantum chemistry has long been recognized as a natural candidate for quantum computation. This perspective focuses on identifying scientifically meaningful use cases where early fault-tolerant quantum computers, which are considered to be equipped with approximately 25-100 logical qubits, could deliver tangible impact. While recent advances in classical computing have pushed the boundaries of tractable simulations to unprecedented scales, this logical-qubit regime represents the first window where quantum devices can pursue qualitatively distinct strategies, such as polynomial-scaling phase estimation, direct simulation of quantum dynamics, and active-space embedding, that remain challenging for classical solvers, such as multireference charge-transfer and conical-intersection states central to photochemistry and materials design. We highlight near-term opportunities in algorithm and software design, discuss representative chemical problems suited for quantum acceleration, and propose strategic roadmaps and collaborative pathways for advancing practical quantum utility in quantum chemistry.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

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↗

State Preparation of Antisymmetrized Geminal Power on a Quantum Computer without Number Projection

The antisymmetrized geminal power (AGP) is equivalent to the number projected Bardeen–Cooper–Schrieffer (PBCS) wave function. It is also an elementary symmetric polynomial (ESP) state. We generalize previous research on deterministically implementing the Dicke state to a state preparation algorithm for an ESP state, or equivalently AGP, on a quantum computer. Our method is deterministic and has polynomial cost, and it does not rely on number symmetry breaking and restoration. We also show that our circuit is equivalent to a disentangled unitary paired coupled cluster operator and a layer of unitary Jastrow operator acting on a single Slater determinant. Here, the method presented herein highlights the ability of disentangled unitary coupled cluster to capture nontrivial entanglement properties that are hardly accessible with traditional Hartree–Fock based electronic structure methods.

97 MATHEMATICS AND COMPUTING↗

Energy Minimization of Discrete Protein Titration State Models Using Graph Theory

There are several applications in computational biophysics which require the optimization of discrete interacting states; e.g., amino acid titration states, ligand oxidation states, or discrete rotamer angles. Such optimization can be very time-consuming as it scales exponentially in the number of sites to be optimized. In this paper, we describe a new polynomial-time algorithm for optimization of discrete states in macromolecular systems. This algorithm was adapted from image processing and uses techniques from discrete mathematics and graph theory to restate the optimization problem in terms of maximum flow-minimum cut graph analysis. The interaction energy graph, a graph in which vertices (amino acids) and edges (interactions) are weighted with their respective energies, is transformed into a flow network in which the value of the minimum cut in the network equals the minimum free energy of the protein, and the cut itself encodes the state that achieves the minimum free energy. Because of its deterministic nature and polynomial-time performance, this algorithm has the potential to allow for the ionization state of larger proteins to be discovered.

energy minimization↗

Distribution–Based Global Sensitivity Analysis in Hydrology

Global sensitivity analysis (GSA) is routinely used in academic setting to quantify the influence of input variability and uncertainty on predictions of a quantity of interest. Practical applications of GSA are hampered by its high computational cost, which arises from the need to run large (e.g., groundwater) models multiple times, and by its reliance on the analysis of variance, which formally requires input parameters to be uncorrelated. The former difficulty can be alleviated by replacing expensive models with inexpensive (e.g., polynomial) surrogates, while adoption of distribution-based (rather than variance-based) metrics can, in principle, overcome the latter but at significantly increased computational cost. To make use of distribution-based GSA feasible for regional-scale models with a large number of degrees of freedom, we supplement it with a surrogate model built with polynomial chaos expansions with analytically updated coefficients. Here, we demonstrate the computational efficiency of our algorithm on a case study dealing with evaluation of the effects of temperature variability on annual evapotranspiration at the regional scale.

42 ENGINEERING↗

Efficient multimode Wigner tomography

Abstract Advancements in quantum system lifetimes and control have enabled the creation of increasingly complex quantum states, such as those on multiple bosonic cavity modes. When characterizing these states, traditional tomography scales exponentially with the number of modes in both computational and experimental measurement requirement, which becomes prohibitive as the system size increases. Here, we implement a state reconstruction method whose sampling requirement instead scales polynomially with system size, and thus mode number, for states that can be represented within such a polynomial subspace. We demonstrate this improved scaling with Wigner tomography of multimode entangled W states of up to 4 modes on a 3D circuit quantum electrodynamics (cQED) system. This approach performs similarly in efficiency to existing matrix inversion methods for 2 modes, and demonstrates a noticeable improvement for 3 and 4 modes, with even greater theoretical gains at higher mode numbers.

Science & Technology - Other Topics↗

Quantum computational phase transition in combinatorial problems

Quantum Approximate Optimization algorithm (QAOA) aims to search for approximate solutions to discrete optimization problems with near-term quantum computers. As there are no algorithmic guarantee possible for QAOA to outperform classical computers, without a proof that bounded-error quantum polynomial time (BQP) ≠ nondeterministic polynomial time (NP), it is necessary to investigate the empirical advantages of QAOA. We identify a computational phase transition of QAOA when solving hard problems such as SAT—random instances are most difficult to train at a critical problem density. We connect the transition to the controllability and the complexity of QAOA circuits. Moreover, we find that the critical problem density in general deviates from the SAT-UNSAT phase transition, where the hardest instances for classical algorithms lies. Then, we show that the high problem density region, which limits QAOA’s performance in hard optimization problems (reachability deficits), is actually a good place to utilize QAOA: its approximation ratio has a much slower decay with the problem density, compared to classical approximate algorithms. Indeed, it is exactly in this region that quantum advantages of QAOA over classical approximate algorithms can be identified.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum Zeno Monte Carlo for computing observables

The recent development of logical quantum processors marks a pivotal transition from the noisy intermediate-scale quantum (NISQ) era to the fault-tolerant quantum computing (FTQC) era. These devices have the potential to address classically challenging problems with polynomial computational time using quantum properties. However, they remain susceptible to noise, necessitating noise resilient algorithms. We introduce Quantum Zeno Monte Carlo (QZMC), a classical-quantum hybrid algorithm that demonstrates resilience to device noise and Trotter errors while showing polynomial computational cost for a gapped system. QZMC computes static and dynamic properties without requiring initial state overlap or variational parameters, offering reduced quantum circuit depth.

Han, Mancheon [Korea Institute for Advanced Study ↗

Rapidly convergent quantum Monte Carlo using a Chebyshev projector

The multireference coupled-cluster Monte Carlo (MR-CCMC) algorithm is a determinant-based quantum Monte Carlo (QMC) algorithm that is conceptually similar to Full Configuration Interaction QMC (FCIQMC). It has been shown to offer a balanced treatment of both static and dynamic correlation while retaining polynomial scaling, although application to large systems with significant strong correlation remained impractical. In this paper, we document recent algorithmic advances that enable rapid convergence and a more black-box approach to the multireference problem. These include a logarithmically scaling metric-tree-based excitation acceptance algorithm to search for determinants connected to the reference space at the desired excitation level and a symmetry-screening procedure for the reference space. We show that, for moderately sized reference spaces, the new search algorithm brings about an approximately 8-fold acceleration of one MR-CCMC iteration, while the symmetry screening procedure reduces the number of active reference space determinants with essentially no loss of accuracy. We also introduce a stochastic implementation of an approximate wall projector, which is the infinite imaginary time limit of the exponential projector, using a truncated expansion of the wall function in Chebyshev polynomials. Notably, this wall-Chebyshev projector can be used to accelerate any projector-based QMC algorithm. We show that it requires significantly fewer applications of the Hamiltonian to achieve the same statistical convergence. We benchmark these acceleration methods on the beryllium and carbon dimers, using initiator FCIQMC and MR-CCMC with basis sets up to cc-pVQZ quality.

Zhao, Zijun↗