Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “POLYNOMIAL”

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 829 records · Page 46
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

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)↗
DOE OSTI2021

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↗
DOE OSTI2025

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↗
DOE OSTI2021

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↗
DOE OSTI2018

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↗
DOE OSTI2023

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↗
DOE OSTI2020

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↗
DOE OSTI2016

Data-driven operator inference for nonintrusive projection-based model reduction

We presenta a nonintrusive projection-based model reduction method for full models based on time-dependent partial differential equations. Projection-based model reduction constructs the operators of a reduced model by projecting the equations of the full model onto a reduced space. Traditionally, this projection is intrusive, which means that the full-model operators are required either explicitly in an assembled form or implicitly through a routine that returns the action of the operators on a given vector; however, in many situations the full model is given as a black box that computes trajectories of the full-model states and outputs for given initial conditions and inputs, but does not provide the full-model operators. Our nonintrusive operator inference approach infers approximations of the reduced operators from the initial conditions, inputs, trajectories of the states, and outputs of the full model, without requiring the full-model operators. Our operator inference is applicable to full models that are linear in the state or have a low-order polynomial nonlinear term. The inferred operators are the solution of a least-squares problem and converge, with sufficient state trajectory data, in the Frobenius norm to the reduced operators that would be obtained via an intrusive projection of the full-model operators. Our numerical results reflect operator inference on a linear climate model and on a tubular reactor model with a polynomial nonlinear term of third order.

42 ENGINEERING↗
DOE OSTI2016

The value of continuity: Refined isogeometric analysis and fast direct solvers

Here, we propose the use of highly continuous finite element spaces interconnected with low continuity hyperplanes to maximize the performance of direct solvers. Starting from a highly continuous Isogeometric Analysis (IGA) discretization, we introduce C0-separators to reduce the interconnection between degrees of freedom in the mesh. By doing so, both the solution time and best approximation errors are simultaneously improved. We call the resulting method “refined Isogeometric Analysis (rIGA)”. To illustrate the impact of the continuity reduction, we analyze the number of Floating Point Operations (FLOPs), computational times, and memory required to solve the linear system obtained by discretizing the Laplace problem with structured meshes and uniform polynomial orders. Theoretical estimates demonstrate that an optimal continuity reduction may decrease the total computational time by a factor between p 2 and p 3 , with pp being the polynomial order of the discretization. Numerical results indicate that our proposed refined isogeometric analysis delivers a speed-up factor proportional to p 2 . In a 2D mesh with four million elements and p=5, the linear system resulting from rIGA is solved 22 times faster than the one from highly continuous IGA. In a 3D mesh with one million elements and p=3, the linear system is solved 15 times faster for the refined than the maximum continuity isogeometric analysis.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

A higher-order Lagrangian discontinuous Galerkin hydrodynamic method for solid dynamics

We present a new multidimensional high-order Lagrangian discontinuous Galerkin (DG) hydrodynamic method that supports hypoelastic and hyperelastic strength models for simulating solid dynamics with higher-order elements. We also present new one-dimensional test problems that have an analytic solution corresponding to a hyperelastic–plastic wave. A modal DG approach is used to evolve fields relevant to conservation laws. These fields are approximated high-order Taylor series polynomials. The stress fields are represented using nodal quantities. The constitutive models used to calculate the deviatoric stress are either a hypoelastic–plastic, infinitesimal strain hyperelastic–plastic, or finite strain hyperelastic–plastic model. These constitutive models require new methods for calculating high-order polynomials for the velocity gradient and deformation gradient in an element. The plasticity associated with the strength model is determined using a radial return method to with a J 2 yield criterion and perfect plasticity. The temporal evolution of the governing equations is achieved with the total variation diminishing Runge–Kutta (TVD RK) time integration method. A diverse suite of 1D and 2D test problems are calculated. Here, the new 1D piston test problems, which have analytic solutions for each elastic–plastic model, are presented and calculated to demonstrate the stability and formal accuracy of the various models with the new Lagrangian DG method. 2D test problems are calculated to demonstrate the stability and robustness of the new Lagrangian DG method on multidimensional problems with high-order elements, which have faces that can bend.

42 ENGINEERING↗
DOE OSTI2019

Extended virtual element method for the Laplace problem with singularities and discontinuities

In this paper, we propose the extended virtual element method (X-VEM) to treat singularities and crack discontinuities that arise in the Laplace problem. The virtual element method (VEM) is a stabilized Galerkin formulation on arbitrary polytopal meshes, wherein the basis functions are implicit (virtual)—they are not known explicitly nor do they need to be computed within the problem domain. In this work, suitable projection operators are used to decompose the bilinear form on each element into two parts: a consistent term that reproduces the first-order polynomial space and a correction term that ensures stability. A similar approach is pursued in the X-VEM with a few notable extensions. To capture singularities and discontinuities in the discrete space, we augment the standard virtual element space with an additional contribution that consists of the product of virtual nodal basis (partition-of-unity) functions with enrichment functions. For discontinuities, basis functions are discontinuous across the crack and for singularities a weakly singular enrichment function that satisfies the Laplace equation is chosen. For the Laplace problem with a singularity, we devise an extended projector that maps functions that lie in the extended virtual element space onto linear polynomials and the enrichment function, whereas for the discontinuous problem, the consistent element stiffness matrix has a block-structure that is readily computed. An adaptive homogeneous numerical integration method is used to accurately and efficiently (no element-partitioning is required) compute integrals with integrands that are weakly singular. Once the element projection matrix is computed, the same steps as in the standard VEM are followed to compute the element stabilization matrix. Numerical experiments are performed on quadrilateral and polygonal (convex and nonconvex elements) meshes for the problem of an $\textit{L}$-shaped domain with a corner singularity and the problem of a cracked membrane under mode III loading, and results are presented that affirm the sound accuracy and demonstrate the optimal rates of convergence in the $\textit{L}^2$ norm and energy of the proposed method.

42 ENGINEERING↗
DOE OSTI2020

hp -VPINNs: Variational physics-informed neural networks with domain decomposition

We formulate a general framework for hp-variational physics-informed neural networks (hp-VPINNs) based on the nonlinear approximation of shallow and deep neural networks and hp-refinement via domain decomposition and projection onto the space of high-order polynomials. The trial space is the space of neural network, which is defined globally over the entire computational domain, while the test space contains piecewise polynomials. Specifically in this study, the hp-refinement corresponds to a global approximation with a local learning algorithm that can efficiently localize the network parameter optimization. Here, we demonstrate the advantages of hp-VPINNs in both accuracy and training cost for several numerical examples of function approximation and in solving differential equations.

42 ENGINEERING↗
DOE OSTI2021

Galerkin formulations of isogeometric shell analysis: Alleviating locking with Greville quadratures and higher-order elements

Here we propose new quadrature schemes that asymptotically require only four in-plane points for Reissner–Mindlin shell elements and nine in-plane points for Kirchhoff–Love shell elements in B-spline and NURBS-based isogeometric shell analysis, independent of the polynomial degree p of the elements. The quadrature points are Greville abscissae associated with pth-order B-spline basis functions whose continuities depend on the specific Galerkin formulations, and the quadrature weights are calculated by solving a linear moment fitting problem in each parametric direction. The proposed shell element formulations are shown through numerical studies to be rank sufficient and to be free of spurious modes. The studies reveal comparable accuracy, in terms of both displacement and stress, compared with fully integrated spline-based shell elements, while at the same time reducing storage and computational cost associated with forming element stiffness and mass matrices and force vectors. The high accuracy with low computational cost makes the proposed quadratures along with higher-order spline bases, in particular polynomial orders, p = 5 and 6, good choices for alleviating membrane and shear locking in shells.

42 ENGINEERING↗
DOE OSTI2021

Simulation of dynamic crystal plasticity with a Lagrangian discontinuous Galerkin hydrodynamic method

Here we present a new Lagrangian modal discontinuous Galerkin (DG) hydrodynamic method that supports a dynamic dislocation based crystal plasticity model for simulating the mechanical behavior of crystallographic materials, both single crystal and polycrystalline, under dynamic conditions. A modal DG approach is used to evolve fields relevant to conservation laws. These fields are approximated by Taylor series polynomials of varying degree. These polynomials describe macro-scale hydrodynamic behavior while their evolution is determined by evaluating the dynamic crystal plasticity model at material points within the element. The dynamic crystal plasticity model is sensitive to the time increment size, with too large of time increments leading to instability in the model. To mitigate this, the temporal evolution of the dynamic crystal plasticity model is achieved with the combination of a sub-incrementing scheme with Heun’s third-order time integration scheme, which is also used to temporally evolve the governing equations. The implementation of the dynamic crystal plasticity model within the DG framework is tested using a 2D approximation of the Taylor impact test with a single crystal material, using quadratic elements that have faces that can bend. In addition to the standard continuous material modeling, we propose a new simulation method that would represent the heterogeneous behavior of polycrystalline microstructures within an element by varying the position and material properties of the material points within the element. This method is demonstrated using random orientation distributions on materials points that are arranged in both structured and random configurations.

42 ENGINEERING↗
DOE OSTI2017

A reconstructed discontinuous Galerkin method for the compressible Navier-Stokes equations on three-dimensional hybrid grids

A reconstructed discontinuous Galerkin (rDG(P1P2)) method, originally introduced for the compressible Euler equations, is developed for the solution of the compressible Navier–Stokes equations on 3D hybrid grids. In this method, a piecewise quadratic polynomial solution is obtained from the underlying piecewise linear DG solution using a hierarchical Weighted Essentially Non-Oscillatory (WENO) reconstruction. The reconstructed quadratic polynomial solution is then used for the computation of the inviscid fluxes and the viscous fluxes using the second formulation of Bassi and Reay (Bassi–Rebay II). The developed rDG(P 1 P 2 ) method is used to compute a variety of flow problems to assess its accuracy, efficiency, and robustness. Additionally, the numerical results demonstrate that the rDG(P 1 P 2 ) method is able to achieve the designed third-order of accuracy at a cost slightly higher than its underlying second-order DG method, outperform the third order DG method in terms of both computing costs and storage requirements, and obtain reliable and accurate solutions to the direct numerical simulation (DNS) of compressible turbulent flows.

42 ENGINEERING↗
DOE OSTI2020

High-order matrix-free incompressible flow solvers with GPU acceleration and low-order refined preconditioners

In this work, we present a matrix-free flow solver for high-order finite element discretizations of the incompressible Navier-Stokes and Stokes equations with GPU acceleration. For high polynomial degrees, assembling the matrix for the linear systems resulting from the finite element discretization can be prohibitively expensive, both in terms of computational complexity and memory. For this reason, it is necessary to develop matrix-free operators and preconditioners, which can be used to efficiently solve these linear systems without access to the matrix entries themselves. The matrix-free operator evaluations utilize GPU-accelerated sum-factorization techniques to minimize memory movement and maximize throughput. The preconditioners developed in this work are based on a low-order refined methodology with parallel subspace corrections, as described for diffusion problems in [1]. The saddle-point Stokes system is solved using block-preconditioning techniques, which are robust in mesh size, polynomial degree, time step, and viscosity. For the incompressible Navier-Stokes equations, we make use of projection (fractional step) methods, which require Helmholtz and Poisson solves at each time step. The performance of our flow solvers is assessed on several benchmark problems in two and three spatial dimensions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Fantômas unconfined: global QCD fits with Bézier parameterizations

Fantômas is a C++ toolkit for exploring the parametrization dependence of parton distribution functions (PDFs) and other correlator functions in quantum chromodynamics (QCD). Fantômas facilitates the generation of adaptable polynomial parametrizations for PDFs, called metamorphs, to find best-fit PDF solutions and quantify the epistemic uncertainty associated with the parametrizations during their fitting. The method employs Bézier curves as universal approximators for a variety of PDF shapes. Integrated into the xFitter framework for the global QCD analysis, Fantômas provides a foundation for general models of PDFs, while reducing the computational time compared to the approaches utilizing traditional polynomial parametrizations as well as providing an interpretable alternative to neural-network-based models. This paper outlines the structure and practical usage of the Fantômas toolkit, including its inputs, outputs, and implementation within xFitter. It also provides a practical example of using Fantômas for uncertainty quantification as well as the combination of PDF fits into a single ensemble.

Bézier curves↗