Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Polynomial models”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 379 records · Page 21
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Extended kinetic lattice grand canonical Monte Carlo simulation method for transport of multicomponent ion mixtures through a model nanopore system

Abstract An extended version of the original kinetic lattice grand canonical Monte Carlo simulation method combined with mean field theory (KLGCMC/MF) ( J. Chem. Phys. 2007 , 127, 024706) is presented for the study of transport of multicomponent ion mixtures through a model nanopore. Comparison of the extended KLGCMC/MF (eKLGCMC/MF) simulation results with Poisson–Nernst–Planck (PNP) calculations is also made to confirm the validity of the extended simulation approach. Unlike the original version of KLGCMC/MF simulation method that treats only a binary ionic solution with one cation and one anion species, this extended version can deal with a system that includes ternary ion mixtures. A diffusion probability algorithm is also added to the extended version of the simulation method to describe the inhomogeneous diffusivity of ions that is often observed in the ion permeation through nanopores. Both Legendre and Chebyshev polynomials of the second kind were tested as a basis set for the basis set expansion (BSE) method with which to calculate the reaction field energy in the eKLGCMC/MF simulation. It turned out that the Legendre polynomials perform better than the Chebyshev polynomials, and as a result, the Legendre polynomials were implemented in the current version of eKLGCMC/MF simulation algorithm. The presented eKLGCMC/MF simulation method with new features finds its potential applications in nanopore systems where the correlation between ion species with the same sign of charges plays a key role such as oscillating ion currents or anomalous mole fraction effects.

Choi, Inhyeok↗
DOE OSTI2022

Relaxation mechanisms in a disordered system with Poisson-level statistics

Here we discuss the interplay between many-body localization and spin symmetry. To this end, we study the time evolution of several observables in the anisotropic t- j model. Like the Hubbard chain, the studied model contains charge and spin degrees of freedom, yet it has smaller Hilbert space and thus allows for numerical studies of larger systems. We compare the field disorder that breaks the $\mathbb{Z}_2$ spin symmetry and a potential disorder that preserves the latter symmetry. In the former case, sufficiently strong disorder leads to localization of all studied observables, at least for the studied system sizes. However, in the case of symmetry-preserving disorder, we observe that odd operators under the $\mathbb{Z}_2$ spin transformation relax towards the equilibrium value at relatively short timescales that grow only polynomially with the disorder strength. On the other hand, the dynamics of even operators and the level statistics within each symmetry sector are consistent with localization. Our results indicate that localization exists within each symmetry sector for symmetry-preserving disorder. Odd operators' apparent relaxation is due to their time evolution between distinct symmetry sectors.

36 MATERIALS SCIENCE↗
DOE OSTI2024

TokaMaker: An open-source time-dependent Grad-Shafranov tool for the design and modeling of axisymmetric fusion devices

Here, in this paper, we present a new static and time-dependent MagnetoHydroDynamic (MHD) equilibrium code, TokaMaker, for axisymmetric configurations of magnetized plasmas, based on the well-known Grad-Shafranov equation. This code utilizes finite element methods on an unstructured triangular grid to enable capturing accurate machine geometry and simple mesh generation from engineering-like descriptions of present and future devices. The new code is designed for ease of use without sacrificing capability and speed through a combination of Python, Fortran, and C/C++ components. A detailed description of the numerical methods of the code, including a novel formulation of the boundary conditions for free-boundary equilibria, and validation of the implementation of those methods using both analytic test cases and cross-code validation is shown. Results show expected convergence across tested polynomial degree for analytic and cross-code test cases.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

Efficient sparse state preparation via quantum walks

Continuous-time quantum walks (CTQWs) on dynamic graphs, referred to as dynamic CTQWs, are a recently introduced universal model of computation that offers a new paradigm in which to envision quantum algorithms. In this work, we develop an algorithm that converts single-edge and self-loop dynamic CTQWs to the gate model of computation. We use this mapping to introduce an efficient sparse quantum state preparation framework based on dynamic CTQWs. Our approach utilizes combinatorics techniques such as minimal hitting sets, minimum spanning trees, and shortest Hamiltonian paths to reduce the number of controlled gates required to prepare sparse states. We show that our framework encompasses the current state of the art ancilla-free sparse state preparation method by reformulating this method as a CTQW. This CTQW-based framework offers an alternative to the uniformly controlled rotation method used by Qiskit by requiring fewer CX gates when the target state has a polynomial number of non-zero amplitudes.

dynamic continuous time quantum walks↗
DOE OSTI2025

McCormick envelopes in mixed-integer PDE-constrained optimization

McCormick envelopes are a standard tool for deriving convex relaxations of optimization problems that involve polynomial terms. Such McCormick relaxations provide lower bounds, for example, in branch-and-bound procedures for mixed-integer nonlinear programs but have not gained much attention in PDE-constrained optimization so far. This lack of attention may be due to the distributed nature of such problems, which on the one hand leads to infinitely many linear constraints (generally state constraints that may be difficult to handle) in addition to the state equation for a pointwise formulation of the McCormick envelopes and renders bound-tightening procedures that successively improve the resulting convex relaxations computationally intractable. We analyze McCormick envelopes for a model problem class that is governed by a semilinear PDE involving a bilinearity and integrality constraints. We approximate the nonlinearity and in turn the McCormick envelopes by averaging the involved terms over the cells of a partition of the computational domain on which the PDE is defined. This yields convex relaxations that underestimate the original problem up to an a priori error estimate that depends on the mesh size of the discretization. These approximate McCormick relaxations can be improved by means of an optimization-based bound-tightening procedure. We show that their minimizers converge to minimizers to a limit problem with a pointwise formulation of the McCormick envelopes when driving the mesh size to zero. We provide a computational example, for which we certify all of our imposed assumptions. The results point to both the potential of the methodology and the gaps in the research that need to be closed. Our methodology provides a framework first for obtaining pointwise underestimators for nonconvexities and second for approximating them with finitely many linear inequalities in an infinite-dimensional setting.

Approximations and Expansions↗
DOE OSTI2022

Nonlinear dimension reduction for surrogate modeling using gradient information

We introduce a method for the nonlinear dimension reduction of a high-dimensional function $u:{\mathbb{R}}^d\rightarrow{\mathbb{R}}$, $d\gg 1$. Our objective is to identify a nonlinear feature map $g:{\mathbb{R}}^d\rightarrow{\mathbb{R}}^m$, with a prescribed intermediate dimension $m\ll d$, so that $u$ can be well approximated by $f\circ g$ for some profile function $f:{\mathbb{R}}^m\rightarrow{\mathbb{R}}$. We propose to build the feature map by aligning the Jacobian $\nabla g$ with the gradient $\nabla u$, and we theoretically analyze the properties of the resulting $g$. Once $g$ is built, we construct $f$ by solving a gradient-enhanced least squares problem. Our practical algorithm uses a sample $\{{\textbf{x}}^{(i)},u({\textbf{x}}^{(i)}),\nabla u({\textbf{x}}^{(i)})\}_{i=1}^N$ and builds both $g$ and $f$ on adaptive downward-closed polynomial spaces, using cross validation to avoid overfitting. We numerically evaluate the performance of our algorithm across different benchmarks, and explore the impact of the intermediate dimension $m$. We show that building a nonlinear feature map $g$ can permit more accurate approximation of $u$ than a linear $g$, for the same input data set.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Interface flux recovery framework for constructing partitioned heterogeneous time-integration methods

A common approach for the development of partitioned schemes employing different time integrators on different subdomains is to lag the coupling terms in time. This can lead to accuracy issues, especially in multistage methods. Here, in this article, we present a novel framework for partitioned heterogeneous time-integration methods, which allows the coupling of arbitrary multistage and multistep methods without reducing their order of accuracy. At the core of our approach are accurate estimates of the interface flux obtained from the Schur complement of an auxiliary monolithic system. We use these estimates to construct a polynomial-in-time approximation of the interface flux over the current time coupling window. This approximation provides the interface boundary conditions necessary to decouple the subdomain problems at any point within the coupling window. In so doing our framework enables a flexible choice of time-integrators for the individual subproblems without compromising the time-accuracy at the coupled problem level. This feature is the main distinction between our framework and other approaches. To demonstrate the framework, we construct a family of partitioned heterogeneous time-integration methods, combining multistage and multistep methods, for a simplified tracer transport component of the coupled air-sea system in Earth system models. We report numerical tests evaluating accuracy and flux conservation for different pairs of time-integrators from the explicit Runge-Kutta and Adams-Moulton families.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

On the Cauchy problem for Boltzmann equation modeling a polyatomic gas

In the present article, we consider the Boltzmann equation that models a polyatomic gas by introducing one additional continuous variable, referred to as microscopic internal energy. We establish existence and uniqueness theory in the space homogeneous setting for the full non-linear case, under an extended Grad-type assumption on transition probability rates, which comprises hard potentials for both the relative speed and internal energy with the rate in the interval 0,2, multiplied by an integrable angular part and integrable partition functions. The Cauchy problem is resolved by means of an abstract ordinary differential equation (ODE) theory in Banach spaces for the initial data with finite and strictly positive gas mass and energy, finite momentum, and additionally finite K* polynomial moment, with K* depending on the rate of the transition probability and the structure of a polyatomic molecule or its internal degrees of freedom. Moreover, we prove that polynomially and exponentially weighted Banach space norms associated with the solution are both generated and propagated uniformly in time.

Physics↗
DOE OSTI2020

Improving galaxy clustering measurements with deep learning: analysis of the DECaLS DR7 data

ABSTRACT Robust measurements of cosmological parameters from galaxy surveys rely on our understanding of systematic effects that impact the observed galaxy density field. In this paper, we present, validate, and implement the idea of adopting the systematics mitigation method of artificial neural networks for modelling the relationship between the target galaxy density field and various observational realities including but not limited to Galactic extinction, seeing, and stellar density. Our method by construction allows a wide class of models and alleviates overtraining by performing k-fold cross-validation and dimensionality reduction via backward feature elimination. By permuting the choice of the training, validation, and test sets, we construct a selection mask for the entire footprint. We apply our method on the extended Baryon Oscillation Spectroscopic Survey (eBOSS) Emission Line Galaxies (ELGs) selection from the Dark Energy Camera Legacy Survey (DECaLS) Data Release 7 and show that the spurious large-scale contamination due to imaging systematics can be significantly reduced by up-weighting the observed galaxy density using the selection mask from the neural network and that our method is more effective than the conventional linear and quadratic polynomial functions. We perform extensive analyses on simulated mock data sets with and without systematic effects. Our analyses indicate that our methodology is more robust to overfitting compared to the conventional methods. This method can be utilized in the catalogue generation of future spectroscopic galaxy surveys such as eBOSS and Dark Energy Spectroscopic Instrument (DESI) to better mitigate observational systematics.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2026

Statistical Correlation of Heliostat Pointing Deviation With Wind

This work was carried out as part of the Heliostat Consortium (HelioCon) Field Deployment subtask with the aim to develop a reduced order model framework for correlating wind speed and pointing deviation of a heliostat facet. There are only sparse field measurements of heliostat pointing deviations and accompanying wind conditions published in the literature. Heliostat test standards, such as IEC 62862-4-3, propose a suite of tests including laser pointing repeatability at wind speeds below 4 m/s, and provide technical requirements for heliostat slope and tracking deviations in coarse average wind speed bins of 4 m/s, 6 m/s, and 8 m/s. In addressing the gap of the variation of heliostat pointing deviation with wind speed, field measurements of laser pointing on a grid target and wind conditions were analyzed in this study at the Third-Party Metrology Platform at the National Laboratory of the Rockies (NLR) Flatirons Campus. Horizontal pointing deviations were found to follow a logarithmic relationship with peak wind speed, whereas vertical pointing deviations follow an exponential relationship with peak wind speed. Both horizontal and vertical pointing deviations also follow a second order polynomial relationship, as expected from the proportionality of elastic loads and deformations with the square of wind speed. The results indicate that heliostat facet pointing deviations in the vertical direction increase at a faster rate than in the horizontal direction with increasing wind speed over the tested range, however these are dependent on the heliostat structural design. Next steps are recommended for additional field measurements to confirm a linear relationship of pointing deviation with applied moment on a heliostat facet, and to distinguish between gravity-induced and wind-induced pointing deviations at different elevation angles. The derived correlations in the preliminary analysis in this report serve as a case study for heliostat developers and plant operators to estimate the wind-induced pointing deviations and their variation with peak gust wind speed. Next steps in future work would recommend higher resolution and longer duration datasets for different elevation angles and wind directions to reduce uncertainties and variance of collected laser beam spot data and their correlations with bin-averaged wind speed.

17 WIND ENERGY↗
DOE OSTI2021

Planetary normal mode computation: Parallel algorithms, performance and reproducibility

This report is an extension of work entitled “Computing planetary interior normal modes with a highly parallel polynomial filtering eigensolver.” by Shi et al., [1] originally presented at the SC18 conference. A highly parallel polynomial filtered eigensolver was developed and exploited to calculate the planetary normal modes. The proposed method is ideally suited for computing interior eigenpairs for large-scale eigenvalue problems as it greatly enhances memory and computational efficiency. In this article, the second-order finite element method is used to further improve the accuracy as only the first-order finite element method was deployed in the previous work. The parallel algorithm, its parallel performance up to 20k processors, and the great computational accuracy are illustrated. The reproducibility of the previous work was successfully performed on the Student Cluster Competition at the SC19 conference by several participant teams using a completely different Mars-model dataset on different clusters. Both weak and strong scaling performances of the reproducibility by the participant teams were impressive and encouraging. The analysis and reflection of their results are demonstrated and future direction is discussed.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Efficient method for estimating the time evolution of the proto-neutron star mass and radius from a supernova neutrino signal

In this paper, we present a novel method to estimate the time evolution of the proto-neutron star (PNS) structure from the neutrino signal in a core-collapse supernova (CCSN). Employing recent results from multidimensional CCSN simulations, we delve into a relation between the total emitted neutrino energy (TONE) and PNS mass/radius, and we find that they are strongly correlated with each other. We fit the relation by simple polynomial functions connecting the TONE to the mass and radius of the PNS as a function of time. By combining another fitting function representing the correlation between the TONE and the cumulative number of events at each neutrino observatory, the PNS mass and radius can be retrieved from purely observed neutrino data. We demonstrate retrievals of PNS mass and radius from mock data of the neutrino signal, and we assess the capability of our proposed method. While underlining the limitations of the method, we also discuss the importance of the joint analysis with the gravitational wave signal. This would reduce uncertainties of parameter estimations in our method, and may narrow down the possible neutrino oscillation model. The proposed method is a very easy and inexpensive computation, which will be useful in real data analysis of the CCSN neutrino signal.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2020

Data-Driven Many-Body Models for Molecular Fluids: CO 2 /H 2 O Mixtures as a Case Study

In this study, we extend the scope of the many-body TTM-nrg and MB-nrg potential energy functions (PEFs), originally introduced for halide ion–water and alkali-metal ion–water interactions, to the modeling of carbon dioxide (CO2) and water (H2O) mixtures as prototypical examples of molecular fluids. Both TTM-nrg and MB-nrg PEFs are derived entirely from electronic structure data obtained at the coupled cluster level of theory and are, by construction, compatible with MB-pol, a many-body PEF that has been shown to accurately reproduce the properties of water. Although both TTM-nrg and MB-nrg PEFs adopt the same functional forms for describing permanent electrostatics, polarization, and dispersion, they differ in the representation of short-range contributions, with the TTM-nrg PEFs relying on conventional Born–Mayer expressions and the MB-nrg PEFs employing multidimensional permutationally invariant polynomials. By providing a physically correct description of many-body effects at both short and long ranges, the MB-nrg PEFs are shown to quantitatively represent the global potential energy surfaces of the CO 2 –CO 2 and CO 2 –H 2 O dimers and the energetics of small clusters, as well as to correctly reproduce various properties in both gas and liquid phases. Furthermore, building upon previous studies of aqueous systems, our analysis provides further evidence for the accuracy and efficiency of the MB-nrg framework in representing molecular interactions in fluid mixtures at different temperature and pressure conditions.

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

Quantum error correction from complexity in Brownian SYK

We study the robustness of quantum error correction in a one-parameter ensemble of codes generated by the Brownian SYK model, where the parameter quantifies the encoding complexity. The robustness of error correction by a quantum code is upper bounded by the “mutual purity” of a certain entangled state between the code subspace and environment in the isometric extension of the error channel, where the mutual purity of a density matrix ρAB is the difference $\mathcal{F}$ p ($A : B$) ≡ $\mathrm{T}$r $p^{2}_{AB}$ - $\mathrm{T}$r $p^{2}_{A}$ $\mathrm{T}$r $p^{2}_{B}$. We show that when the encoding complexity is small, the mutual purity is O(1) for the erasure of a small number of qubits (i.e., the encoding is fragile). However, this quantity decays exponentially, becoming O(1/N) for O(log N) encoding complexity. Further, at polynomial encoding complexity, the mutual purity saturates to a plateau of O(e -N ). We also find a hierarchy of complexity scales associated to a tower of subleading contributions to the mutual purity that quantitatively, but not qualitatively, adjust our error correction bound as encoding complexity increases. In the AdS/CFT context, our results suggest that any portion of the entanglement wedge of a general boundary subregion A with sufficiently high encoding complexity is robustly protected against low-rank errors acting on A with no prior access to the encoding map. From the bulk point of view, we expect such bulk degrees of freedom to be causally inaccessible from the region A despite being encoded in it.

1/N expansion↗
DOE OSTI2025

Emergence of the polydeterminant in QCD

A generalization of the determinant appears in particle physics in effective Lagrangian interaction terms that model the chiral anomaly in quantum chromodynamics (Giacosa et al. in Phys Rev D 97(9):091901, 2018, Phys Rev D 109(7):L071502, 2024), in particular in connection to mesons. This polydeterminant function, known in the mathematical literature as a mixed discriminant, associates N distinct N x N complex matrices into a complex number and reduces to the usual determinant when all matrices are taken as equal. Here, we explore the main properties of the polydeterminant applied to (quantum) fields by using a formalism and a language close to high-energy physics approaches. We discuss its use as a tool to write down novel chiral anomalous Lagrangian terms and present an explicit illustrative model for mesons. Finally, the extension of the polydeterminant as a function of tensors is shown.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
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 OSTI2023

Subspace recursive Fermi-operator expansion strategies for large-scale DFT eigenvalue problems on HPC architectures

Quantum mechanical calculations for material modeling using Kohn–Sham density functional theory (DFT) involve the solution of a nonlinear eigenvalue problem for N smallest eigenvector-eigenvalue pairs, with N proportional to the number of electrons in the material system. Here, these calculations are computationally demanding and have asymptotic cubic scaling complexity with the number of electrons. Large-scale matrix eigenvalue problems arising from the discretization of the Kohn–Sham DFT equations employing a systematically convergent basis traditionally rely on iterative orthogonal projection methods, which are shown to be computationally efficient and scalable on massively parallel computing architectures. However, as the size of the material system increases, these methods are known to incur dominant computational costs through the Rayleigh–Ritz projection step of the discretized Kohn–Sham Hamiltonian matrix and the subsequent subspace diagonalization of the projected matrix. This work explores the potential of polynomial expansion approaches based on recursive Fermi-operator expansion as an alternative to the subspace diagonalization of the projected Hamiltonian matrix to reduce the computational cost. Subsequently, we perform a detailed comparison of various recursive polynomial expansion approaches to the traditional approach of explicit diagonalization on both multi-node central processing unit and graphics processing unit architectures and assess their relative performance in terms of accuracy, computational efficiency, scaling behavior, and energy efficiency.

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

Orbit averaging coherent states: holographic three-point functions of AdS giant gravitons

We study correlation functions of two AdS giant gravitons in AdS 5 × S 5 and a BPS supergravity mode using holography. In the gauge theory these are described by BPS correlators of Schur polynomials of fully-symmetric representations and a single trace operator. We find full agreement between the semiclassical gravity and gauge theory computations at large N, for both diagonal and off-diagonal structure constants. Our analysis in $\mathcal{N}$ = 4 SYM provides a simpler derivation to the results in the literature, and it can be readily generalized to operators describing bound states of AdS giant gravitons as well as bubbling geometries.

1/N Expansion↗