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,063 records · Page 59

Characterizing Tradeoffs in Memory, Accuracy, and Speed for Chemistry Tabulation Techniques

Chemistry tabulation is a common approach in practical simulations of turbulent combustion at engineering scales. Linear interpolants have traditionally been used for accessing precomputed multidimensional tables but suffer from large memory requirements and discontinuous derivatives. Higher-degree interpolants address some of these restrictions but are similarly limited to relatively low-dimensional tabulation. Artificial neural networks (ANNs) can be used to overcome these limitations but cannot guarantee the same accuracy as interpolants and introduce challenges in reproducibility and reliable training. These challenges are enhanced as the physics complexity to be represented within the tabulation increases. Here, we assess the efficiency, accuracy, and memory requirements of Lagrange polynomials, tensor product B-splines, and ANNs as tabulation strategies. We analyze results in the context of nonadiabatic flamelet modeling where higher dimension counts are necessary. While ANNs do not require structuring of data, providing benefits for complex physics representation, interpolation approaches often rely on some structuring of the table. Interpolation using structured table inputs that are not directly related to the variables transported in a simulation can incur additional query costs. This is demonstrated in the present implementation of heat losses. We show that ANNs, despite being difficult to train and reproduce, can be advantageous for high-dimensional, unstructured datasets relevant to nonadiabatic flamelet models. Furthermore we demonstrate that Lagrange polynomials show significant speedup for similar accuracy compared to B-splines.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Impact of Sequential Ammonia Fiber Expansion (AFEX) Pretreatment and Pelletization on the Moisture Sorption Properties of Corn Stover

Combining ammonia fiber expansion (AFEX™) pretreatment with a depot processing facility is a promising option for delivering high-value densified biomass to the emerging bioenergy industry. However, because the pretreatment process results in a high moisture material unsuitable for pelleting or storage (40% wet basis), the biomass must be immediately dried. If AFEX pretreatment results in a material that is difficult to dry, the economics of this already costly operation would be at risk. This work tests the nature of moisture sorption isotherms and thin-layer drying behavior of corn (Zea mays L.) stover at 20°C to 60°C before and after sequential AFEX pretreatment and pelletization to determine whether any negative impacts to material drying or storage may result from the AFEX process. The equilibrium moisture content to equilibrium relative humidity relationship for each of the materials was determined using dynamic vapor sorption isotherms and modeled with modified Chung-Pfost, modified Halsey, and modified Henderson temperature-dependent models as well as the Double Log Polynomial (DLP), Peleg, and Guggenheim Anderson de Boer (GAB) temperature-independent models. Drying kinetics were quantified under thin-layer laboratory testing and modeled using the Modified Page's equation. Water activity isotherms for non-pelleted biomass were best modeled with the Peleg temperature-independent equation while isotherms for the pelleted biomass were best modeled with the Double Log Polynomial equation. Thin-layer drying results were accurately modeled with the Modified Page's equation. The results of this work indicate that AFEX pretreatment results in drying properties more favorable than or equal to that of raw corn stover, and pellets of superior physical stability in storage.

09 BIOMASS FUELS↗

Toward an international practical pressure scale: A proposal for an IPPS ruby gauge (IPPS-Ruby2020)

At the 26 th AIRAPT conference in 2017, a task group was formed to work on an International Practical Pressure Scale (IPPS). This report summarizes the activities of the task group toward an IPPS ruby gauge. We have selected three different approaches to establishing the relation between pressure ( P ) and ruby R1-line shift ( Δλ ) with three groups of optimal reference materials for applying these approaches. Using a polynomial form of the second order, the recommended ruby gauge (referred as Ruby2020) is expressed by: P [ G P a ] = 1.87 ( ± 0.01 ) × 10 3 Δ λ λ 0 1 + 5.63 ( ± 0.03 ) Δ λ λ 0 , where λ 0 is the wavelength of the R1-line near 694.25 nm at ambient condition. In June of 2020, the Executive Committee of AIRAPT endorsed the proposed Ruby2020. Finally, we encourage high-pressure practitioners to utilize Ruby2020 within its applicable pressure range (up to 150 GPa), so that pressure data can be directly compared across laboratories and amended consistently as better scales emerge in the future.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

AN ACCURATE FLUX DENSITY SCALE FROM 1 TO 50 GHz

We develop an absolute flux density scale for centimeter-wavelength astronomy by combining accurate flux density ratios determined by the Very Large Array between the planet Mars and a set of potential calibrators with the Rudy thermophysical emission model of Mars, adjusted to the absolute scale established by the Wilkinson Microwave Anisotropy Probe. The radio sources 3C123, 3C196, 3C286, and 3C295 are found to be varying at a level of less than {approx}5% per century at all frequencies between 1 and 50 GHz, and hence are suitable as flux density standards. We present polynomial expressions for their spectral flux densities, valid from 1 to 50 GHz, with absolute accuracy estimated at 1%-3% depending on frequency. Of the four sources, 3C286 is the most compact and has the flattest spectral index, making it the most suitable object on which to establish the spectral flux density scale. The sources 3C48, 3C138, 3C147, NGC 7027, NGC 6542, and MWC 349 show significant variability on various timescales. Polynomial coefficients for the spectral flux density are developed for 3C48, 3C138, and 3C147 for each of the 17 observation dates, spanning 1983-2012. The planets Venus, Uranus, and Neptune are included in our observations, and we derive their brightness temperatures over the same frequency range.

79 ASTRONOMY AND ASTROPHYSICS↗

Quantum Algorithm for Approximating Maximum Independent Sets

We present a quantum algorithm for approximating maximum independent sets of a graph based on quantum non-Abelian adiabatic mixing in the sub-Hilbert space of degenerate ground states, which generates quantum annealing in a secondary Hamiltonian. For both sparse and dense random graphs G , numerical simulation suggests that our algorithm on average finds an independent set of size close to the maximum size α ( G ) in low polynomial time. The best classical algorithms, by contrast, produce independent sets of size about half of α ( G ) in polynomial time.

Physics↗

Key Questions for the Quantum Machine Learner to Ask Themselves

Within the last several years quantum machine learning (QML) has begun to mature; however, many open questions remain. Rather than review open questions, in this perspective piece I will discuss my view about how we should approach problems in QML. In particular I will list a series of questions that I think we should ask ourselves when developing quantum algorithms for machine learning. These questions focus on what the definition of quantum ML is, what is the proper quantum analogue of QML algorithms is, how one should compare QML to traditional ML and what fundamental limitations emerge when trying to build QML protocols. As an illustration of this process I also provide information theoretic arguments that show that amplitude encoding can require exponentially more queries to a quantum model to determine membership of a vector in a concept class than classical bit-encodings would require; however, if the correct analogue is chosen then both the quantum and classical complexities become polynomially equivalent. This example underscores the importance of asking ourselves the right questions when developing and benchmarking QML algorithms.

Wiebe, Nathan O.↗

Tractable minor-free generalization of planar zero-field Ising models

In this work, we present a new family of zero-field Ising models over N binary variables/spins obtained by consecutive 'gluing' of planar and O(1)-sized components and subsets of at most three vertices into a tree. The polynomial time algorithm of the dynamic programming type for solving exact inference (computing partition function) and exact sampling (generating i.i.d. samples) consists of sequential application of an efficient (for planar) or brute-force (for O(1)-sized) inference and sampling to the components as a black box. To illustrate the utility of the new family of tractable graphical models, we first build a polynomial algorithm for inference and sampling of zero-field Ising models over K 33 -minor-free topologies and over K 5 -minor-free topologies—both of which are extensions of the planar zero-field Ising models—which are neither genus- nor treewidth-bounded. Second, we empirically demonstrate an improvement in the approximation quality of the NP-hard problem of inference over the square-grid Ising model in a node-dependent nonzero 'magnetic' field.

97 MATHEMATICS AND COMPUTING↗

Application of State Quantization-Based Methods in HEP Particle Transport Simulation

Simulation of particle-matter interactions in complex geometries is one of the main tasks in high energy physics (HEP) research. An essential aspect of it is an accurate and efficient particle transportation in a non-uniform magnetic field, which includes the handling of volume crossings within a predefined 3D geometry. Quantized State Systems (QSS) is a family of numerical methods that provides attractive features for particle transportation processes, such as dense output (sequences of polynomial segments changing only according to accuracy-driven discrete events) and lightweight detection and handling of volume crossings (based on simple root-finding of polynomial functions). In this work we present a proof-of-concept performance comparison between a QSS-based standalone numerical solver and an application based on the Geant4 simulation toolkit, with its default Runge-Kutta based adaptive step method. In a case study with a charged particle circulating in a vacuum (with interactions with matter turned off), in a uniform magnetic field, and crossing up to 200 volume boundaries twice per turn, simulation results showed speedups of up to 6 times in favor of QSS while it being 10 times slower in the case with zero volume boundaries.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Chronically underestimated: a reassessment of US heat waves using the extended heat index

Abstract The heat index, or apparent temperature, was never defined for extreme heat and humidity, leading to the widespread adoption of a polynomial extrapolation designed by the United States National Weather Service. Recently, however, the heat index has been extended to all combinations of temperature and humidity, presenting an opportunity to reassess past heat waves. Here, three-hourly temperature and humidity are used to evaluate the extended heat index over the contiguous United States during the years 1984–2020. It is found that the 99.9th percentile of the daily maximum heat index is highest over the Midwest. Identifying and ranking heat waves by the spatially integrated exceedance of that percentile, the Midwest once again stands out as home to the most extreme heat waves, including the top-ranked July 2011 and July 1995 heat waves. The extended heat index can also be used to evaluate the physiological stress induced by heat and humidity. It is found that the most extreme Midwest heat waves tax the cardiovascular system with a skin blood flow that is elevated severalfold, approaching the physiological limit. These effects are not captured by the National Weather Service’s polynomial extrapolation, which also underestimates the heat index by as much as 10 ∘ C (20 ∘ F) during severe heat waves.

54 ENVIRONMENTAL SCIENCES↗

Potts-model critical manifolds revisited

We compute the critical polynomials for the q-state Potts model on all Archimedean lattices, using a parallel implementation of the algorithm of Ref. [1] that gives us access to larger sizes than previously possible. The exact polynomials are computed for bases of size 6 6 unit cells, and the root in the temperature variable v = e K -1 is determined numerically at q = 1 for bases of size 8 8. This leads to improved results for bond percolation thresholds, and for the Potts-model critical manifolds in the real (q; v) plane. In the two most favourable cases, we find now the kagome-lattice threshold to eleven digits and that of the (3; 12 2 ) lattice to thirteen. Our critical manifolds reveal many interesting features in the antiferromagnetic region of the Potts model, and determine accurately the extent of the Berker-Kadano phase for the lattices studied.

97 MATHEMATICS AND COMPUTING↗

Superresolution without separation

Abstract This article provides a theoretical analysis of diffraction-limited superresolution, demonstrating that arbitrarily close point sources can be resolved in ideal situations. Precisely, we assume that the incoming signal is a linear combination of $M$ shifted copies of a known waveform with unknown shifts and amplitudes, and one only observes a finite collection of evaluations of this signal. We characterize properties of the base waveform such that the exact translations and amplitudes can be recovered from $2M+1$ observations. This recovery can be achieved by solving a weighted version of basis pursuit over a continuous dictionary. Our analysis shows that $\ell_1$-based methods enjoy the same separation-free recovery guarantees as polynomial root finding techniques, such as de Prony’s method or Vetterli’s method for signals of finite rate of innovation. Our proof techniques combine classical polynomial interpolation techniques with contemporary tools from compressed sensing.

Schiebinger, Geoffrey↗

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↗

A high-order time-parallel scheme for solving wave propagation problems via the direct construction of an approximate time-evolution operator

Our manuscript demonstrates a technique for efficiently solving the classical wave equation, the shallow water equations, and, more generally, equations of the form ∂u/∂t=Lu∂u/∂t=Lu, where LL is a skew-Hermitian differential operator. The idea is to explicitly construct an approximation to the time-evolution operator exp(τL)exp(τL) for a relatively large time-step ττ. Recently developed techniques for approximating oscillatory scalar functions by rational functions, and accelerated algorithms for computing functions of discretized differential operators are exploited. Principal advantages of the proposed method include: stability even for large time-steps, the possibility to parallelize in time over many characteristic wavelengths and large speed-ups over existing methods in situations where simulation over long times are required. Numerical examples involving the 2D rotating shallow water equations and the 2D wave equation in an inhomogenous medium are presented, and the method is compared to the 4th order Runge–Kutta (RK4) method and to the use of Chebyshev polynomials. The new method achieved high accuracy over long-time intervals, and with speeds that are orders of magnitude faster than both RK4 and the use of Chebyshev polynomials.

97 MATHEMATICS AND COMPUTING↗

Dual-cone variational calculation of the two-electron reduced density matrix

The computation of strongly correlated quantum systems is challenging because of its potentially exponential scaling in the number of electron configurations. Variational calculation of the two-electron reduced density matrix (2-RDM) without the many-electron wave function exploits the pairwise nature of the electronic Coulomb interaction to compute a lower bound on the ground-state energy with polynomial computational scaling. Recently, a dual-cone formulation of the variational 2-RDM calculation was shown to generate the ground-state energy, albeit not the 2-RDM, at a substantially reduced computational cost, especially for higher $\textit{N}$-representability conditions such as the T2 constraint. Here we generalize the dual-cone variational 2-RDM method to compute not only the ground-state energy but also the 2-RDM. The central result is that we can compute the 2-RDM from a generalization of the Hellmann-Feynman theorem. Specifically, we prove that in the Lagrangian formulation of the dual-cone optimization the 2-RDM is the Lagrange multiplier. Further, we apply the method to computing the energies and properties of strongly correlated electrons—including atomic charges, electron densities, dipole moments, and orbital occupations—in an illustrative hydrogen chain and the nitrogen-fixation catalyst FeMoco. The dual variational computation of the 2-RDM with T2 or higher N -representability conditions provides a polynomially scaling approach to strongly correlated molecules and materials with significant applications in atomic and molecular and condensed-matter chemistry and physics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Matrix product state and mean-field solutions for one-dimensional systems can be found efficiently

We consider the problem of approximating ground states of one-dimensional quantum systems within the two most common variational ansatzes, namely, the mean-field ansatz and matrix product states. We show that both for mean field and for matrix product states of fixed bond dimension, the optimal solutions can be found in a way which is provably efficient (i.e., scales polynomially). This implies that the corresponding variational methods can be in principle recast in a way which scales provably polynomially. Moreover, our findings imply that ground states of one-dimensional commuting Hamiltonians can be found efficiently.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum algorithm for simulating the wave equation

We present a quantum algorithm for simulating the wave equation under Dirichlet and Neumann boundary conditions. The algorithm uses Hamiltonian simulation and quantum linear system algorithms as subroutines. It relies on factorizations of discretized Laplacian operators to allow for polynomially improved scaling in truncation errors and improved scaling for state preparation relative to general purpose quantum algorithms for solving linear differential equations. Relative to classical algorithms for simulating the D-dimensional wave equation, our quantum algorithm achieves exponential space savings and achieves a speedup which is polynomial for fixed D and exponential in D. Furthermore, we also consider using Hamiltonian simulation for Klein-Gordon equations and Maxwell's equations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Obstacles to quantum annealing in a planar embedding of XORSAT

We introduce a planar embedding of the k-regular k-XORSAT problem, in which solutions are encoded in the ground state of a classical statistical mechanics model of reversible logic gates arranged on a square grid and acting on bits that represent the Boolean variables of the problem. The special feature of this embedding is that the resulting model lacks a finite-temperature phase transition, thus bypassing the first-order thermodynamic transition known to occur in the random graph representation of XORSAT. In spite of this attractive feature, the thermal relaxation into the ground state displays remarkably slow glassy behavior. The question addressed in this paper is whether this planar embedding can afford an efficient path to solution of k-regular k-XORSAT via quantum adiabatic annealing. We first show that our model bypasses an avoided level crossing and consequent exponentially small gap in the limit of small transverse fields. We then present quantum Monte Carlo results for our embedding of the k-regular k-XORSAT that strongly support a picture in which second-order and first-order transitions develop at a finite transverse field for k = 2 and k = 3, respectively. Furthermore, this translates into power-law and exponential dependences in the scaling of energy gaps with system size, corresponding to times-to-solution which are, respectively, polynomial and exponential in the number of variables. We conclude that neither classical nor quantum annealing can efficiently solve our reformulation of XORSAT, even though the original problem can be solved in polynomial time by Gaussian elimination.

2-dimensional systems↗

A new kind of topological quantum order: A dimensional hierarchy of quasiparticles built from stationary excitations

Here, we introduce exactly solvable models of interacting (Majorana) fermions in d ≥ 3 spatial dimensions that realize a new kind of fermion topological quantum order, building on a model presented by S. Vijay, T. H. Hsieh, and L. Fu [Phys. Rev. X 5, 041038 (2015)]. These models have extensive topological ground-state degeneracy and a hierarchy of pointlike, topological excitations that are only free to move within submanifolds of the lattice. In particular, one of our models has fundamental excitations that are completely stationary. To demonstrate these results, we introduce a powerful polynomial representation of commuting Majorana Hamiltonians. Remarkably, the physical properties of the topologically ordered state are encoded in an algebraic variety, defined by the common zeros of a set of polynomials over a finite field. This provides a “geometric” framework for the emergence of topological order.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗