Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “critical 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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Critical percolation on the kagome hypergraph

In this report we study the percolation critical surface of the kagome lattice in which each triangle is allowed an arbitrary connectivity. Using the method of critical polynomials, we find points along this critical surface to high precision. This kagome hypergraph contains many unsolved problems as special cases, including bond percolation on the kagome and (3, 12 2 ) lattices, and site percolation on the hexagonal, or honeycomb, lattice, as well as a single point for which there is an exact solution. We are able to compute enough points along the critical surface to find a very accurate fit, essentially a Taylor series about the exact point, that allows estimations of the critical point of any system that lies on the surface to precision rivaling Monte Carlo and traditional techniques of similar accuracy. We find also that this system sheds light on some of the surprising aspects of the method of critical polynomials, such as why it is so accurate for certain problems, like the kagome and (3, 12 2 ) lattices. The bond percolation critical points of these lattices can be found to 17 and 18 digits, respectively, because they are in close proximity, in a sense that can be made quantitative, to the exact point on the critical surface. We also discuss in detail a parallel implementation of the method which we use here for a few calculations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Critical points of the random cluster model with Newman–Ziff sampling

Here, we present a method for computing transition points of the random cluster model using a generalization of the Newman–Ziff algorithm, a celebrated technique in numerical percolation, to the random cluster model. The new method is straightforward to implement and works for real cluster weight q > 0. Furthermore, results for an arbitrary number of values of q can be found at once within a single simulation. Because the algorithm used to sweep through bond configurations is identical to that of Newman and Ziff, which was conceived for percolation, the method loses accuracy for large lattices when q > 1. However, by sampling the critical polynomial, accurate estimates of critical points in two dimensions can be found using relatively small lattice sizes, which we demonstrate here by computing critical points for non-integer values of q on the square lattice, to compare with the exact solution, and on the unsolved non-planar square matching lattice. The latter results would be much more difficult to obtain using other techniques.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Iterative quantum optimization of spin glass problems with rapidly oscillating transverse fields

In this work, we introduce a new iterative quantum algorithm, called Iterative Symphonic Tunneling for Satisfiability problems (IST-SAT), which solves quantum spin glass optimization problems using high-frequency oscillating transverse fields. IST-SAT operates as a sequence of iterations, in which bitstrings returned from one iteration are used to set spin-dependent phases in oscillating transverse fields in the next iteration. Over several iterations, the novel mechanism of the algorithm steers the system toward the problem ground state. We benchmark IST-SAT on sets of hard MAX-3-XORSAT problem instances with exact state vector simulation, and report polynomial speedups over Trotterized adiabatic quantum computation and the best known semi-greedy classical algorithm. When IST-SAT is seeded with a sufficiently good initial approximation, the algorithm converges to exact solution(s) in a polynomial number of iterations. Our numerical results identify a critical Hamming radius, or quality of initial approximation, where the time-to-solution crosses from exponential to polynomial scaling in problem size. This work proposes IST-SAT a new quantum algorithm, which improves upon solutions obtained from initial classical or quantum optimization algorithms. The steering mechanism we introduce through IST-SAT presents a new path toward achieving quantum advantage in optimization.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Convergence and Quantum Advantage of Trotterized MERA for Strongly-Correlated Systems

Strongly-correlated quantum many-body systems are difficult to study and simulate classically. We recently proposed a variational quantum eigensolver (VQE) based on the multiscale entanglement renormalization ansatz (MERA) with tensors constrained to certain Trotter circuits. Here, we determine the scaling of computation costs for various critical spin chains which substantiates a polynomial quantum advantage in comparison to classical MERA simulations based on exact energy gradients or variational Monte Carlo. Algorithmic phase diagrams suggest an even greater separation for higher-dimensional systems. Hence, the Trotterized MERA VQE is a promising route for the efficient investigation of strongly-correlated quantum many-body systems on quantum computers. Furthermore, we show how the convergence can be substantially improved by building up the MERA layer by layer in the initialization stage and by scanning through the phase diagram during optimization. For the Trotter circuits being composed of single-qubit and two-qubit rotations, it is experimentally advantageous to have small rotation angles. We find that the average angle amplitude can be reduced considerably with negligible effect on the energy accuracy. Benchmark simulations suggest that the structure of the Trotter circuits for the TMERA tensors is not decisive; in particular, brick-wall circuits and parallel random-pair circuits yield very similar energy accuracies.

Miao, Qiang [Duke Quantum Center, Duke University,↗
DOE OSTI2024

Perturbative unorientable JT gravity and matrix models

We consider an orthogonal polynomial formulation of the double scaling limit of multicritical matrix models in the β = 1 Dyson-Wigner class. They capture the physics of 2D quantum gravity coupled to minimal matter on unorientable surfaces, otherwise called unoriented minimal strings. We derive a formula for the density of states valid to all orders in perturbation theory. We show how to define an interpolation between the multicritical models and that a certain interpolation among an infinite number of them provides an alternative definition of unoriented JT gravity. We discuss the strengths and weaknesses of our formulation.

1/N Expansion↗
DOE OSTI2024

Probing Postmeasurement Entanglement without Postselection

We study the problem of observing quantum collective phenomena emerging from large numbers of measurements. These phenomena are difficult to observe in conventional experiments because, in order to distinguish the effects of measurement from dephasing, it is necessary to postselect on sets of measurement outcomes with Born probabilities that are exponentially small in the number of measurements performed. An unconventional approach, which avoids this exponential “postselection problem”, is to construct cross-correlations between experimental data and the results of simulations on classical computers. However, these cross-correlations generally have no definite relation to physical quantities. We first show how to incorporate classical shadows into this framework, thereby allowing for the construction of quantum information-theoretic cross-correlations. We then identify cross-correlations that both upper and lower bound the measurement-averaged von Neumann entanglement entropy, as well as cross-correlations that lower bound the measurement-averaged purity and entanglement negativity. These bounds show that experiments can be performed to constrain postmeasurement entanglement without the need for postselection. To illustrate our technique, we consider how it could be used to observe the measurement-induced entanglement transition in Haar-random quantum circuits. We use exact numerical calculations as proxies for quantum simulations and, to highlight the fundamental limitations of classical memory, we construct cross-correlations with tensor-network calculations at finite bond dimension. Our results reveal a signature of measurement-induced criticality that can be observed using a quantum simulator in polynomial time and with polynomial classical memory. Published by the American Physical Society 2024

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
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 OSTI2021

Statistical Multiobjective Optimization of Thiospinel CoNi 2 S 4 Nanocrystal Synthesis via Design of Experiments

Thiospinels, such as CoNi 2 S 4 , are showing promise for numerous applications, including as catalysts for the hydrogen evolution reaction, hydrodesulfurization, and oxygen evolution and reduction reactions; however, CoNi 2 S 4 has not been synthesized as small, colloidal nanocrystals with high surface-area-to-volume ratios. Traditional optimization methods to control nanocrystal attributes such as size typically rely upon one variable at a time (OVAT) methods that are not only time and labor intensive but also lack the ability to identify higher-order interactions between experimental variables that affect target outcomes. Herein, we demonstrate that a statistical design of experiments (DoE) approach can optimize the synthesis of CoNi 2 S 4 nanocrystals, allowing for control over the responses of nanocrystal size, size distribution, and isolated yield. After implementing a 2 5–2 fractional factorial design, the statistical screening of five different experimental variables identified temperature, Co:Ni precursor ratio, Co:thiol ratio, and their higher-order interactions as the most critical factors in influencing the aforementioned responses. Second-order design with a Doehlert matrix yielded polynomial functions used to predict the reaction parameters needed to individually optimize all three responses. A multiobjective optimization, allowing for the simultaneous optimization of size, size distribution, and isolated yield, predicted the synthetic conditions needed to achieve a minimum nanocrystal size of 6.1 nm, a minimum polydispersity (σ/$\bar{d}$) of 10%, and a maximum isolated yield of 99%, with a desirability of 96%. The resulting model was experimentally verified by performing reactions under the specified conditions. Furthermore, our work illustrates the advantage of multivariate experimental design as a powerful tool for accelerating control and optimization in nanocrystal syntheses.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2024

Sensitivity Analysis of Irradiated Fueled Experiments using the MOOSE Framework [Slides]

Modeling and simulation (M&S) methods are able to predict uncertainties in experimental parameters (e.g., power and fission density) during irradiation. A shortfall exists in predicting how sensitive some of the parameters will behave during the experimental process. Sensitivity and Uncertainty Quantification (SUQ) is critical in support of qualification and licensing reactor fuels. The application of a method to quantify the uncertainty in these experiments is critical to the prediction of their performance. In this work, we propose the use of a polynomial chaos expansion (PCE) method to quantify the sensitive parameters in these simulations and, in an extension, their experimental surrogates. We propose to perform M&S using PCE uncertainty quantification on a previously irradiated fueled experiment in order to provide a validation case for Griffin and expand its use as a verification and validation (V&V) tool for experiments with a neutronics component. Griffin is an advanced, deterministic neutronics analysis code built using the MOOSE (multiphysics object-oriented simulation environment) framework which can provide state-of-the-art neutronic analysis on M&S of experiments. We will use the stochastic tools module (STM) in MOOSE to provide PCE uncertainty quantification on the proposed experimental setup. Idaho National Laboratory (INL) does not yet have an in-house developed code with V&V approval for experiments performed on-site; this work would provide a necessary addition of support for experiments performed at INL. The Nuclear Regulatory Commission (NRC) has explicitly requested uncertainties in calculated values such as fuel power and burnup, and the development of this capability would benefit the relationship between INL and the NRC.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2022

3D spherical functional expansion tallies in Serpent 2 Monte Carlo code

This work extends the application of functional expansion tallies to 3D spherical geometries. The 3D Zernike polynomials are set as an orthonormal polynomials basis for the functional reconstruction. The study describes the construction of the complete set of polynomials, a natural expansion of the spherical harmonics polynomials where 3D Zernike moments can be evaluated as a linear combination of the geometrical moments. The 3D Zernike polynomials formulation and the computational approach implemented in Serpent 2 are presented and tested through the Godiva model from the ICSBEP criticality benchmark test cases. The implementation results are in agreement with a reference solution described in a fine-resolution mesh, enhancing also the performance and memory demand. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
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 OSTI2022

Inverse Modeling of Hydrologic Parameters in CLM4 via Generalized Polynomial Chaos in the Bayesian Framework

In this work, generalized polynomial chaos (gPC) expansion for land surface model parameter estimation is evaluated. We perform inverse modeling and compute the posterior distribution of the critical hydrological parameters that are subject to great uncertainty in the Community Land Model (CLM) for a given value of the output LH. The unknown parameters include those that have been identified as the most influential factors on the simulations of surface and subsurface runoff, latent and sensible heat fluxes, and soil moisture in CLM4.0. We set up the inversion problem in the Bayesian framework in two steps: (i) building a surrogate model expressing the input–output mapping, and (ii) performing inverse modeling and computing the posterior distributions of the input parameters using observation data for a given value of the output LH. The development of the surrogate model is carried out with a Bayesian procedure based on the variable selection methods that use gPC expansions. Our approach accounts for bases selection uncertainty and quantifies the importance of the gPC terms, and, hence, all of the input parameters, via the associated posterior probabilities.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Topology, criticality, and dynamically generated qubits in a stochastic measurement-only Kitaev model

Here we consider a paradigmatic solvable model of topological order in two dimensions, Kitaev's honeycomb Hamiltonian, and turn it into a measurement-only dynamics consisting of stochastic measurements of two-qubit bond operators. We find an entanglement phase diagram that resembles that of the Hamiltonian problem in some ways, while being qualitatively different in others. When one type of bond is dominantly measured, we find area-law entangled phases that protect two topological qubits (on a torus) for a time exponential in system size. This generalizes the recently proposed idea of Floquet codes, where logical qubits are dynamically generated by a time-periodic measurement schedule, to a stochastic setting. When all types of bonds are measured with comparable frequency, we find a critical phase with a logarithmic violation of the area law, which sharply distinguishes it from its Hamiltonian counterpart. The critical phase has the same set of topological qubits, as diagnosed by the tripartite mutual information, but protects them only for a time polynomial in system size. Furthermore, we observe an unusual behavior for the dynamical purification of mixed states, characterized at late times by the dynamical exponent z = $\frac{1}{2}$ a superballistic dynamics made possible by measurements.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2024

Mathematical methods for optimal polynomial recovery of high-dimensional systems from noisy data

The goal of our Early Career Research Project (ECRP) is to establish a modern mathematical foundation that will enable next-generation computational methods for polynomial approximation of high-dimensional systems, having a certain set of constraints, from a limited amount of noisy data. Such a foundation is critical to realizing the future potential of the DOE user facilities, and will ultimately empower scientists to address a fundamental question, namely, “how many realizations of a nonlinear manifold are required to recover the entire high-dimensional solution map, with optimal approximation guarantees and minimal computational cost?” The central theme of this effort aims to conquer this challenge by pioneering the development of extraordinarily innovative theoretical analysis and transformational non-intrusive computational methodologies. Such approaches will enable the reconstruction of the entire high-dimensional solution map, with accuracy comparable to the best approximation, while utilizing an optimal number of samples. During this reporting period we have made significant progress on four thrusts.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Asymptotic consistency of the WSINDy algorithm in the limit of continuum data

In this work we study the asymptotic consistency of the weak-form sparse identification of nonlinear dynamics algorithm (WSINDy) in the identification of differential equations from noisy samples of solutions. We prove that the WSINDy estimator is unconditionally asymptotically consistent for a wide class of models that includes the Navier–Stokes, Kuramoto–Sivashinsky and Sine–Gordon equations. We thus provide a mathematically rigorous explanation for the observed robustness to noise of weak-form equation learning. Conversely, we also show that, in general, the WSINDy estimator is only conditionally asymptotically consistent, yielding discovery of spurious terms with probability one if the noise level exceeds a critical threshold σ c . We provide explicit bounds on σ c in the case of Gaussian white noise and we explicitly characterize the spurious terms that arise in the case of trigonometric and/or polynomial libraries. Furthermore, we show that, if the data is suitably denoised (a simple moving average filter is sufficient), then asymptotic consistency is recovered for models with locally-Lipschitz, polynomial-growth nonlinearities. Our results reveal important aspects of weak-form equation learning, which may be used to improve future algorithms. We demonstrate our findings numerically using the Lorenz system, the cubic oscillator, a viscous Burgers-growth model and a Kuramoto–Sivashinsky-type high-order PDE.

asymptotic consistency↗
DOE OSTI2023

Phase diagram to demarcate supercritical, transcritical, and continuous phase regimes for binary fluid equilibrium mixing relevant to combustion applications

Here, a robust methodology to develop phase diagrams of binary fluid mixtures at fixed thermo dynamic conditions (pressure, temperature, and mole fraction) as well as of two initially separated fluids undergoing mixing near critical conditions are presented for fluids and con ditions relevant to rockets, gas turbines, and diesel engine applications. Phase equilibria of mixtures is first examined to provide insight into the continuous-phase mixing behavior (including but not limited to supercritical behavior), and to develop a broadly applicable phase-diagram for binary fluid mixtures at fixed conditions. Next, adiabatic mixing theory and reduced Helmholtz equations of state are used to predict the thermodynamic conditions required to attain continuous-phase binary fluid mixing near critical conditions. Then, a 3D surface diagram (P,T fuel ,T amb ) separating single and two-phase regions is constructed by varying the ambient pressure and the initial temperatures of the two fluids. Polynomial fits of the 3D surfaces for 10 different binary mixtures are tabulated for nitrogen-alkane and methane-oxygen blends relevant to air-breathing and propellant based engines, respectively.

42 ENGINEERING↗
DOE OSTI2022

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↗