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 991 records · Page 55

A generalized framework for reduced-order modeling of a wind turbine wake

A reduced-order model for a wind turbine wake is sought from large eddy simulation data. Fluctuating velocity fields are combined in the correlation tensor to form the kernel of the proper orthogonal decomposition (POD). Proper orthogonal decomposition modes resulting from the decomposition represent the spatially coherent turbulence structures in the wind turbine wake; eigenvalues delineate the relative amount of turbulent kinetic energy associated with each mode. Back-projecting the POD modes onto the velocity snapshots produces dynamic coefficients that express the amplitude of each mode in time. A reduced-order model of the wind turbine wake (wakeROM) is defined through a series of polynomial parameters that quantify mode interaction and the evolution of each POD mode coefficients. The resulting system of ordinary differential equations models the wind turbine wake composed only of the large-scale turbulent dynamics identified by the POD. Tikhonov regularization is used to recalibrate the dynamical system by adding additional constraints to the minimization seeking polynomial parameters, reducing error in the modeled mode coefficients. The wakeROM is periodically reinitialized with new initial conditions found by relating the incoming turbulent velocity to the POD mode coefficients through a series of open-loop transfer functions. The wakeROM reproduces mode coefficients to within 25.2%, quantified through the normalized root-mean-square error. Furthermore, a high-level view of the modeling approach is provided as a platform to discuss promising research directions, alternate processes that could benefit stability and efficiency, and desired extensions of the wakeROM.

17 WIND ENERGY↗

deal.II Implementation of a Weak Galerkin Finite Element Solver for Darcy Flow

This paper presents a weak Galerkin (WG) finite element solver for Darcy flow and its implementation on the deal.II platform. The solver works for quadrilateral and hexahedral meshes in a unified way. It approximates pressure by Q-type degree $k(≥ 0)$ polynomials separately defined in element interiors and on edges/faces. In this work, numerical velocity is obtained in the unmapped Raviart-Thomas space $RT_{[k]}$ via postprocessing based on the novel concepts of discrete weak gradients. The solver is locally mass-conservative and produces continuous normal fluxes. The implementation in deal.II allows polynomial degrees up to 5. Numerical experiments show that our new WG solver performs better than the classical mixed finite element methods.

54 ENVIRONMENTAL SCIENCES↗

Stringy canonical forms

Canonical forms of positive geometries play an important role in revealing hidden structures of scattering amplitudes, from amplituhedra to associahedra. In this paper, we introduce “stringy canonical forms”, which provide a natural definition and extension of canonical forms for general polytopes, deformed by a parameter α'. They are defined by real or complex integrals regulated with polynomials with exponents, and are meromorphic functions of the exponents, sharing various properties of string amplitudes. As α'→ 0, they reduce to the usual canonical form of a polytope given by the Minkowski sum of the Newton polytopes of the regulating polynomials, or equivalently the volume of the dual of this polytope, naturally determined by tropical functions. At finite α', they have simple poles corresponding to the facets of the polytope, with the residue on the pole given by the stringy canonical form of the facet. There is the remarkable connection between the α'→ 0 limit of tree-level string amplitudes, and scattering equations that appear when studying the α'→ ∞ limit. We show that there is a simple conceptual understanding of this phenomenon for any stringy canonical form: the saddle-point equations provide a diffeomorphism from the integration domain to the interior of the polytope, and thus the canonical form can be obtained as a pushforward via summing over saddle points. When the stringy canonical form is applied to the ABHY associahedron in kinematic space, it produces the usual Koba-Nielsen string integral, giving a direct path from particle to string amplitudes without an a priori reference to the string worldsheet. We also discuss a number of other examples, including stringy canonical forms for finite-type cluster algebras (with type A corresponding to usual string amplitudes), and other natural integrals over the positive Grassmannian.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Complementarity and the unitarity of the black hole S -matrix

Recently, Akers et al. proposed a non-isometric holographic map from the interior of a black hole to its exterior. Within this model, we study properties of the black hole S-matrix, which are in principle accessible to observers who stay outside the black hole. Specifically, we investigate a scenario in which an infalling agent interacts with radiation both outside and inside the black hole. Because the holographic map involves postselection, the unitarity of the S-matrix is not guaranteed in this scenario, but we find that unitarity is satisfied to very high precision if suitable conditions are met. If the internal black hole dynamics is described by a pseudorandom unitary transformation, and if the operations performed by the infaller have computational complexity scaling polynomially with the black hole entropy, then the S-matrix is unitary up to corrections that are superpolynomially small in the black hole entropy. Furthermore, while in principle quantum computation assisted by postselection can be very powerful, we find under similar assumptions that the S-matrix of an evaporating black hole has polynomial computational complexity.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Trigonometric continuous-variable gates and hybrid quantum simulations of the sine-Gordon model

Hybrid qubit-qumode quantum computing platforms provide a natural setting for simulating interacting bosonic quantum field theories. However, existing continuous-variable gate constructions rely predominantly on polynomial functions of canonical quadratures. In this work, we introduce a complementary universality paradigm based on trigonometric continuous-variable gates, which enable a Fourier-like representation of bosonic operators and are particularly well suited for periodic and non-perturbative interactions. We present an ancilla-based framework for implementing trigonometric gates with arguments given by arbitrary Hermitian functions of qumode quadratures. The protocol yields unitary gates deterministically, and non-unitary gates through probabilistic post-selection. As a concrete application, we develop a hybrid qubit-qumode quantum simulation of the lattice sine-Gordon model. Using these gates, we prepare ground states via quantum imaginary-time evolution, simulate real-time dynamics, compute time-dependent vertex two-point correlation functions, and extract quantum kink profiles under topological boundary conditions. Our results demonstrate that trigonometric continuous-variable gates provide a physically natural framework for simulating interacting field theories on near-term hybrid quantum hardware, while establishing a parallel route to universality beyond polynomial gate constructions. We expect that the trigonometric gates introduced here to find broader applications, including quantum simulations of condensed matter systems, quantum chemistry, and biological models.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

The ghost in the radiation: robust encodings of the black hole interior

We reconsider the black hole firewall puzzle, emphasizing that quantum error-correction, computational complexity, and pseudorandomness are crucial concepts for understanding the black hole interior. We assume that the Hawking radiation emitted by an old black hole is pseudorandom, meaning that it cannot be distinguished from a perfectly thermal state by any efficient quantum computation acting on the radiation alone. We then infer the existence of a subspace of the radiation system which we interpret as an encoding of the black hole interior. This encoded interior is entangled with the late outgoing Hawking quanta emitted by the old black hole, and is inaccessible to computationally bounded observers who are outside the black hole. Specifically, efficient operations acting on the radiation, those with quantum computational complexity polynomial in the entropy of the remaining black hole, commute with a complete set of logical operators acting on the encoded interior, up to corrections which are exponentially small in the entropy. Thus, under our pseudorandomness assumption, the black hole interior is well protected from exterior observers as long as the remaining black hole is macroscopic. On the other hand, if the radiation is not pseudorandom, an exterior observer may be able to create a firewall by applying a polynomial-time quantum computation to the radiation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Spectral fluctuations in the Sachdev-Ye-Kitaev model

We present a detailed quantitative analysis of spectral correlations in the Sachdev-Ye-Kitaev (SYK) model. We find that the deviations from universal Random Matrix Theory (RMT) behavior are due to a small number of long-wavelength fluctuations (of the order of the number of Majorana fermions N ) from one realization of the ensemble to the next one. These modes can be parameterized effectively in terms of Q-Hermite orthogonal polynomials, the main contribution being due to scale fluctuations for which we give a simple analytical estimate. Our numerical results for N = 32 show that only the lowest eight polynomials are needed to eliminate the nonuniversal part of the spectral fluctuations. The covariance matrix of the coefficients of this expansion can be obtained analytically from low-order double-trace moments. We evaluate the covariance matrix of the first six moments and find that it agrees with the numerics. We also analyze the spectral correlations in terms of a nonlinear σ-model, which is derived through a Fierz transformation, and evaluate the one and two-point spectral correlation functions to two-loop order. The wide correlator is given by the sum of the universal RMT result and corrections whose lowest-order term corresponds to scale fluctuations. However, the loop expansion of the σ-model results in an ill-behaved expansion of the resolvent, and it gives universal RMT fluctuations not only for q= 4 or higher even q-body interactions, but also for the q= 2 SYK model albeit with a much smaller Thouless energy while the correct result in this case should have been Poisson statistics. In our numerical studies we analyze the number variance and spectral form factor for N = 32 and q = 4. We show that the quadratic deviation of the number variance for large energies appears as a peak for small times in the spectral form factor. After eliminating the long-wavelength fluctuations, we find quantitative agreement with RMT up to an exponentially large number of level spacings for the number variance or exponentially short times in the case of the spectral form factor.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

On the Trotter Error in Many-body Quantum Dynamics with Coulomb Potentials

Efficient simulation of many-body quantum systems is central to advances in physics, chemistry, and quantum computing, with a key question being whether the simulation cost scales polynomially with the system size. Here, in this work, we analyze many-body quantum systems with Coulomb interactions, which are fundamental to electronic and molecular systems. We prove that Trotterization for such unbounded Hamiltonians achieves a 1/4-order convergence rate, with explicit polynomial dependence on the number of particles. The result holds for all initial wavefunctions in the domain of the Hamiltonian, and the 1/4-order convergence rate is optimal, as previous work has numerically demonstrated that it can be saturated by a specific initial ground state. The main challenges arise from the many-body structure and the singular nature of the Coulomb potential. Our proof strategy differs from prior state-of-the-art Trotter analyses, addressing both difficulties in a unified framework. Our analysis treats the Coulomb potential as an unbounded operator without modification or regularization, and does not rely on spatial discretization, making it compatible with both first- and second-quantized circuit constructions.

Fang, Di [Duke Univ., Durham, NC (United States)]↗

Sparse low rank approximation of potential energy surfaces with applications in estimation of anharmonic zero point energies and frequencies

We introduce a method that exploits sparse representation of potential energy surfaces (PES) on a polynomial basis set selected by compressed sensing . The method is useful for studies involving large numbers of PES evaluations, such as the search for local minima, transition states, or integration. We apply this method for estimating zero point energies and frequencies of molecules using a three step approach. In the first step, we interpret the PES as a sparse tensor on polynomial basis and determine its entries by a compressed sensing based algorithm using only a few PES evaluations. Then, we establish a rank reduction strategy to compress this tensor in a suitable low-rank canonical tensor format using standard tensor compression tools. This allows representing a high dimensional PES as a small sum of products of one dimensional functions. Finally, a low dimensional Gauss–Hermite quadrature rule is used to integrate the product of sparse canonical low-rank representation of PES and Green’s function in the second-order diagrammatic vibrational many-body Green’s function theory (XVH2) for estimation of zero-point energies and frequencies. Numerical tests on molecules considered in this work indicate a more efficient scaling of computational cost with molecular size as compared to other methods.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Positivity Limiters for Filtered Spectral Approximations of Linear Kinetic Transport Equations

We analyze the properties and compare the performance of several positivity limiters for spectral approximations with respect to the angular variable of linear transport equations. It is well-known that spectral methods suffer from the occurrence of (unphysical) negative spatial particle concentrations due to the fact that the underlying polynomial approximations are not always positive at the kinetic level. Positivity limiters address this defect by enforcing positivity of the polynomial approximation on a finite set of preselected points. With a proper PDE solver, they ensure positivity of the particle concentration at each step in a time integration scheme. We review several known positivity limiters proposed in other contexts and also introduce a modification for one of them. We give error estimates for the consistency of the positive approximations produced by these limiters and compare the theoretical estimates to numerical results. We then solve two benchmark problems with these limiters, make qualitative and quantitative observations about the solutions, and then compare the efficiency of the different limiters.

97 MATHEMATICS AND COMPUTING↗

A Bayesian Framework for Spectral Reprojection

Abstract Fourier partial sum approximations yield exponential accuracy for smooth and periodic functions, but produce the infamous Gibbs phenomenon for non-periodic ones. Spectral reprojection resolves the Gibbs phenomenon by projecting the Fourier partial sum onto a Gibbs complementary basis, often prescribed as the Gegenbauer polynomials. Noise in the Fourier data and the Runge phenomenon both degrade the quality of the Gegenbauer reconstruction solution, however. Motivated by its theoretical convergence properties, this paper proposes a new Bayesian framework for spectral reprojection, which allows a greater understanding of the impact of noise on the reprojection method from a statistical point of view. We are also able to improve the robustness with respect to the Gegenbauer polynomials parameters. Finally, the framework provides a mechanism to quantify the uncertainty of the solution estimate.

Li, Tongtong (ORCID:0000000276644764)↗

Insights on the continuous representations of piecewise-smooth nonlinear systems: limits of applicability and effectiveness

Dynamical systems subject to intermittent contact are often modeled with piecewise-smooth contact forces. However, the discontinuous nature of the contact can cause inaccuracies in numerical results or failure in numerical solvers. Representing the piecewise contact force with a continuous and smooth function can mitigate these problems, but not all continuous representations may be appropriate for this use. Here, five representations used by previous researchers (polynomial, rational polynomial, hyperbolic tangent, arctangent, and logarithm-arctangent functions) are studied to determine which ones most accurately capture nonlinear behaviors including super- and subharmonic resonances, multiple solutions, and chaos. The test case is a single-DOF forced Duffing oscillator with freeplay nonlinearity, solved using direct time integration. This work intends to expand on past studies by determining the limits of applicability for each representation and what numerical problems may occur.

42 ENGINEERING↗

Graph decomposition techniques for solving combinatorial optimization problems with variational quantum algorithms

The quantum approximate optimization algorithm (QAOA) has the potential to approximately solve complex combinatorial optimization problems in polynomial time. However, current noisy quantum devices cannot solve large problems due to hardware constraints. In this work, we develop an algorithm that decomposes the QAOA input problem graph into a smaller problem and solves MaxCut using QAOA on the reduced graph. The algorithm requires a subroutine that can be classical or quantum—in this work, we implement the algorithm twice on each graph. One implementation uses the classical solver Gurobi in the subroutine and the other uses QAOA. We solve these reduced problems with QAOA. On average, the reduced problems require only approximately 1/10 of the number of vertices than the original MaxCut instances. Furthermore, the average approximation ratio of the original MaxCut problems is 0.75, while the approximation ratios of the decomposed graphs are on average of 0.96 for both Gurobi and QAOA. With this decomposition, we are able to measure optimal solutions for ten 100-vertex graphs by running single-layer QAOA circuits on the Quantinuum trapped-ion quantum computer H1-1, sampling each circuit only 500 times. This approach is best suited for sparse, particularly k-regular graphs, as k-regular graphs on n vertices can be decomposed into a graph with at most $\frac{nk}{k+1}$ vertices in polynomial time. Further reductions can be obtained with a potential trade-off in computational time. In conclusion, while this paper applies the decomposition method to the MaxCut problem, it can be applied to more general classes of combinatorial optimization problems.

97 MATHEMATICS AND COMPUTING↗

Uniform Subspace Correction Preconditioners for Discontinuous Galerkin Methods with hp-Refinement

In this paper, we develop subspace correction preconditioners for discontinuous Galerkin (DG) discretizations of elliptic problems with hp-refinement. These preconditioners are based on the decomposition of the DG finite element space into a conforming subspace, and a set of small nonconforming edge spaces. The conforming subspace is preconditioned using a matrix-free low-order refined technique, which in this work, we extend to the hp-refinement context using a variational restriction approach. The condition number of the resulting linear system is independent of the granularity of the mesh h, and the degree of the polynomial approximation p. The method is amenable to use with meshes of any degree of irregularity and arbitrary distribution of polynomial degrees. Furthermore, numerical examples are shown on several test cases involving adaptively and randomly refined meshes, using both the symmetric interior penalty method and the second method of Bassi and Rebay (BR2).

97 MATHEMATICS AND COMPUTING↗

Subplane collision probabilities method applied to control rod cusping in 2D/1D

The MPACT code is being jointly developed by the University of Michigan and Oak Ridge National Laboratory. It uses the 2D/1D method to solve neutron transport problems for reactors. The 2D/1D method decomposes the problem into a stack of 2D planes, and uses a high fidelity transport method to resolve all heterogeneity in each plane. These planes are then coupled axially using a lower order solver. Using this scheme, 3D solutions to the transport equation can be obtained at a much lower cost.One assumption made by the 2D/1D method is that the materials are axially homogeneous for each 2D plane. Violation of this assumption requires homogenization, which can significantly reduce the accuracy of the calculation. This paper presents two new subgrid methods to address this issue. The first method is polynomial decusping, a simple correction used to address control rods partially inserted into a 2D plane. The second is the subplane collision probabilities method, which is a more accurate, more robust subgrid method that can be applied to other axial heterogeneities.Each method was applied to a variety of problems. Results were compared to fine mesh solutions which had no axial heterogeneity and to Monte Carlo reference solutions generated using KENO-VI. It was shown that the polynomial decusping method was effective in many cases, but it had some limitations, with 3D pin power errors as high as 25% compared to KENO-VI. In conclusion, the subplane collision probabilities method performed much better, lowering the maximum pin power error to less than 5% in every calculation.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Dietary uptake of geosmin in rainbow trout ( Oncorhynchus mykiss )

Geosmin is a primary source of muddy/earthy ‘off-flavors’ in farmed fish, which may render their organoleptic quality unacceptable to consumers. Model systems of geosmin uptake typically comprise exposure to waterborne geosmin that is absorbed via the gills. The present research demonstrates dietary exposure as an alternative route of geosmin uptake in Rainbow Trout (Oncorhynchus mykiss) fillets. Trout (average initial weight of 355 g) were stocked in quadruplicate compartmentalized raceways (N = 4 compartments per treatment, n = 50 fish per compartment) supplied with first-use, flow-through water (4.5 complete turnovers per hour). Fish were fed diets containing 0 (control dose), 0.005 (low dose), 0.05 (medium dose), or 0.5 (high dose) mg geosmin/kg feed at 1% body weight/day for four weeks. Fillets (12 fillets/diet/week plus 12 pre-trial fillet samples) and weekly feed and water samples were analyzed via GC–MS to determine geosmin concentrations. Feeding behavior was documented daily according to a four-point scale. ANOVA with post-hoc Tukey tests and polynomial contrast, regression, correlation, and chi-squared statistical analyses were applied to data (α = 0.05 significance level). Palatability of feed did not hinder consumption of the geosmin-spiked feeds: although fish responded positively to all feeds, the most aggressive feeding behavior was observed among those fed medium and high dose feed. Geosmin was effectively imparted into fillets after one week, and no significant temporal effect was found after four weeks. Mean geosmin concentrations significantly increased in fillets from low (mean of 26 ng/kg geosmin) to medium (202 ng/kg) to high (441 ng/kg) dose feed groups during the trial. Polynomial contrasts and regression modeling validated this significant positive effect of dose on geosmin uptake, with an estimated 166 ng/kg rise in fillet-geosmin for every log 10 increase in feed concentration. Waterborne geosmin levels immediately post-feeding were conditionally independent of concentrations in feed and fillets, therefore dietary uptake was affirmed as the predominant mechanism of absorption in the present experimental system. Finally, based on these findings, geosmin-spiked feeds may be used to induce predictable, repeatable levels of this off-flavor compound in fillets and serve as a model system for further investigation of sensory quality and off-flavor mitigation strategies for farm-raised fish.

59 BASIC BIOLOGICAL SCIENCES↗

Spectral Mesh-Free Quadrature for Planar Regions Bounded by Rational Parametric Curves

This article presents spectral, mesh-free, Green’s theorem-based numerical quadrature schemes for integrating functions over planar regions bounded by rational parametric curves. Our algorithm proceeds in two steps: (1) We first find intermediate quadrature rules for line integrals along the region’s boundary curves corresponding to Green’s theorem. (2) We then use a high-order quadrature rule to compute the numerical antiderivative of the integrand along a coordinate axis, which is used to evaluate the Green’s theorem line integral. We present two methods to compute the intermediate quadrature rule. The first is spectrally accurate (it converges faster than any algebraic order with respect to number of quadrature points) and is relatively easy to implement, but has no guarantee of polynomial exactness. The second guarantees exactness for polynomial integrands up to a pre-specified degree with an a priori-known number of quadrature points and retains the convergence properties of the first, but is slightly more complicated. The quadrature schemes have applications to computation of geometric moments, immersogeometric analysis, conservative field transfer between high-order meshes, and initialization of multi-material simulations with rational geometry. We compare the quadrature schemes produced using our method to other methods in the literature and show that they are much more efficient both in terms of number of quadrature points and computational time. We provide an open-source implementation of the algorithm in MATLAB.

97 MATHEMATICS AND COMPUTING↗