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 1,801 records · Page 100

Computation research

Least squares method used in linearizing roots of polynomial and to derive approximations

APPROXIMATION METHOD↗

Quantum Algorithms

This thesis describes several new quantum algorithms. These include a polynomial time algorithm that uses a quantum fast Fourier transform to find eigenvalues and eigenvectors of a Hamiltonian operator, and that can be applied in cases for which all know classical algorithms require exponential time.

Quantum Algorithms polynomial time algorithm Hamil↗

Optimizations of a Hardware Decoder for Deep-Space Optical Communications

The National Aeronautics and Space Administration has developed a capacity approaching modulation and coding scheme that comprises a serial concatenation of an inner accumulate pulse-position modulation (PPM) and an outer convolutional code [or serially concatenated PPM (SCPPM)] for deep-space optical communications. Decoding of this code uses the turbo principle. However, due to the nonbinary property of SCPPM, a straightforward application of classical turbo decoding is very inefficient. Here, we present various optimizations applicable in hardware implementation of the SCPPM decoder. More specifically, we feature a Super Gamma computation to efficiently handle parallel trellis edges, a pipeline-friendly 'maxstar top-2' circuit that reduces the max-only approximation penalty, a low-latency cyclic redundancy check circuit for window-based decoders, and a high-speed algorithmic polynomial interleaver that leads to memory savings. Using the featured optimizations, we implement a 6.72 megabits-per-second (Mbps) SCPPM decoder on a single field-programmable gate array (FPGA). Compared to the current data rate of 256 kilobits per second from Mars, the SCPPM coded scheme represents a throughput increase of more than twenty-six fold. Extension to a 50-Mbps decoder on a board with multiple FPGAs follows naturally. We show through hardware simulations that the SCPPM coded system can operate within 1 dB of the Shannon capacity at nominal operating conditions.

quadratic polynomial interleaver↗

COBRA-DDP: Trajectory Generation and Collision Avoidance Augmentations for eVTOL Vehicles

This paper presents a receding horizon model predictive control variation of the combined Bernstein polynomial optimal reciprocal collision avoidance (ORCA) differential dynamic programming (COBRA-DDP) algorithm for AAM vehicles. Collision avoidance in combination with effective trajectory replanning are expected to be core components of AAM vehicles operating within a crowded airspace. This environment necessitates the use of real-time trajectory planning algorithms that are capable of planning around large amounts of stationary and moving obstacles. Previous work on COBRA-DDP demonstrated the capability of the algorithm to produce dynamically feasible trajectories for AAM vehicles and general collision avoidance. This paper improves upon the previous work by increasing the number of stationary and moving obstacles, implementing a variation of COBRA-DDP that lends itself to real-time application. These advancements are demonstrated on a vertical takeoff and landing (VTOL) vehicle simulation with highly nonlinear vehicle dynamics.

COBRA-DDP↗

COBRA-DDP: Trajectory Generation and Collision Avoidance Augmentations for eVTOL Vehicles

This paper presents a receding horizon model predictive control variation of the combined Bernstein polynomial optimal reciprocal collision avoidance (ORCA) differential dynamic programming (COBRA-DDP) algorithm for AAM vehicles. Collision avoidance in combination with effective trajectory replanning are expected to be core components of AAM vehicles operating within a crowded airspace. This environment necessitates the use of real-time trajectory planning algorithms that are capable of planning around large amounts of stationary and moving obstacles. Previous work on COBRA-DDP demonstrated the capability of the algorithm to produce dynamically feasible trajectories for AAM vehicles and general collision avoidance. This paper improves upon the previous work by increasing the number of stationary and moving obstacles, implementing a variation of COBRA-DDP that lends itself to real-time application. These advancements are demonstrated on a vertical takeoff and landing (VTOL) vehicle simulation with highly nonlinear vehicle dynamics.

COBRA-DDP↗

Tree Image Growth Analysis Using the Instantaneous Phase and Frequency Modulation

We propose the use of Amplitude-Modulation Frequency-Modulation (AM-FM) methods for tree growth analysis. Tree growth is modeled using phase modulation. For adapting AM-FM methods to different images, we introduce the use of fast filterbank filter coefficient computation based on piecewise linear polynomials and radial frequency magnitude estimation using integer-based Savitzky-Golay filters for derivative estimation. For a wide range of images, a simple filterbank design with only 4 channel filters is used. Filterbank specification is based on two different methods. For each input image, the FM image is estimated using dominant component analysis. A tree growthmodel is developed to characterize and depict quarterly and half-seasonal growth of trees using instantaneous phase. Qualitative evaluation of inter- and intraring reconstruction is performed on 20 aspen images and a mixture of 12 tree images of various types. Qualitative scores indicate that the results were mostly of good to excellent quality (4.4/5.0 and 4.0/5.0 for the two databases, resp.).

60 APPLIED LIFE SCIENCES↗

KNIFE MILL COMMINUTION ENERGY ANALYSIS OF SWITCHGRASS, WHEAT STRAW, AND CORN STOVER AND CHARACTERIZATION OF PARTICLE SIZE DISTRIBUTIONS

Biomass preprocessing and pretreatment technologies such as size reduction and chemical preconditioning are aimed at reducing the cost of ethanol production from lignocellulosic biomass. Size reduction is an energy-intensive biomass preprocessing unit operation. In this study, switchgrass, wheat straw, and corn stover were chopped in an instrumented knife mill to evaluate size reduction energy and corresponding particle size distribution as determined with a standard forage sieve analyzer. Direct mechanical power inputs were determined using a dedicated data acquisition system for knife mill screen openings from 12.7 to 50.8 mm, rotor speeds between 250 and 500 rpm, and mass feed rates from 1 to 11 kg/min. A speed of 250 rpm gave optimum performance of the mill. Optimum feed rates for 25.4 mm screen and 250 rpm were 7.6, 5.8, and 4.5 kg/min for switchgrass, wheat straw, and corn stover, respectively. Total specific energy (MJ/Mg) was defined as the size reduction energy required to operate the knife mill plus that imparted to the biomass. Effective specific energy was defined as the energy imparted to the biomass. For these conditions, total specific energies were 27.3, 37.9, and 31.9 MJ/Mg and effective specific energies were 10.1, 15.5, and 3.2 MJ/Mg for switchgrass, wheat straw, and corn stover, respectively. These results demonstrated that biomass selection affects the size reduction energy, even for biomass with similar features. Second-order polynomial equations for the total specific energy requirement fitted well (R2 > 0.95) as a function of knife mill screen size, mass feed rate, and speed for biomass materials tested. The Rosin-Rammler equation fitted the cumulative undersize mass of switchgrass, wheat straw, and corn stover chop passed through ASABE sieves with high R2 (>0.983). Knife mill chopping of switchgrass, wheat straw, and corn stover resulted in particle size distributions classified as 'well-graded strongly fine-skewed mesokurtic', 'well-graded fine-skewed mesokurtic', and 'well-graded fine-skewed mesokurtic', respectively, for small knife mill screen sizes (12.7 to 25.4 mm) and distributions classified as 'well-graded fine-skewed mesokurtic', 'well-graded strongly fine-skewed mesokurtic', and 'well-graded fine-skewed mesokurtic', respectively, for the large screen size (50.8 mm). Total and effective specific energy values per unit size reduction of wheat straw were greater compared to those for switchgrass. Corn stover resulted in reduced total and effective specific energy per unit size reduction compared to wheat straw for the same operating conditions, but higher total specific energy per unit size reduction and lesser effective specific energy per unit size reduction compared to switchgrass. Data on minimized total specific energy with corresponding particle spectra will be useful for preparing feed material with a knife mill for subsequent grinding with finer size reduction devices.

09 BIOMASS FUELS↗

COMPARISON OF THE ACCURACY OF VARIOUS SPATIAL DISCRETIZATION SCHEMES OF THE DISCRETE ORDINATES EQUATIONS IN 2D CARTESIAN GEOMETRY

We present a comprehensive error estimation of four spatial discretization schemes of the two-dimensional Discrete Ordinates (SN) equations on Cartesian grids utilizing a Method of Manufactured Solution (MMS) benchmark suite based on variants of Larsen’s benchmark featuring different orders of smoothness of the underlying exact solution. The considered spatial discretization schemes include the arbitrarily high order transport methods of the nodal (AHOTN) and characteristic (AHOTC) types, the discontinuous Galerkin Finite Element method (DGFEM) and the recently proposed higher order diamond difference method (HODD) of spatial expansion orders 0 through 3. While AHOTN and AHOTC rely on approximate analytical solutions of the transport equation within a mesh cell, DGFEM and HODD utilize a polynomial expansion to mimick the angular flux profile across each mesh cell. Intuitively, due to the higher degree of analyticity, we expect AHOTN and AHOTC to feature superior accuracy compared with DGFEM and HODD, but at the price of potentially longer grind times and numerical instabilities. The latter disadvantages can result from the presence of exponential terms evaluated at the cell optical thickness that arise from the semianalytical solution process. This work quantifies the order of accuracy and the magnitude of the error of all four discretization methods for different optical thicknesses, scattering ratios and degrees of smoothness of the underlying exact solutions in order to verify or contradict the aforementioned intuitive expectation.

99 GENERAL AND MISCELLANEOUS↗

Computation of Temperature-Dependent Legendre Moments of a Double-Differential Elastic Cross Section

A general expression for temperature-dependent Legendre moments of a double-differential elastic scattering cross section was derived by Ouisloumen and Sanchez [Nucl. Sci. Eng. 107, 189-200 (1991)]. Attempts to compute this expression are hindered by the three-fold nested integral, limiting their practical application to just the zeroth Legendre moment of an isotropic scattering. It is shown that the two innermost integrals could be evaluated analytically to all orders of Legendre moments, and for anisotropic scattering, by a recursive application of the integration by parts method. For this method to work, the anisotropic angular distribution in the center of mass is expressed as an expansion in Legendre polynomials. The first several Legendre moments of elastic scattering of neutrons on U-238 are computed at T=1000 K at incoming energy 6.5 eV for isotropic scattering in the center of mass frame. Legendre moments of the anisotropic angular distribution given via Blatt-Biedenharn coefficients are computed at ~1 keV. The results are in agreement with those computed by the Monte Carlo method.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Uncertainty quantification in reacting flow.

Chemically reacting flow models generally involve inputs and parameters that are determined from empirical measurements, and therefore exhibit a certain degree of uncertainty. Estimating the propagation of this uncertainty into computational model output predictions is crucial for purposes of reacting flow model validation, model exploration, as well as design optimization. Recent years have seen great developments in probabilistic methods and tools for efficient uncertainty quantification (UQ) in computational models. These tools are grounded in the use of Polynomial Chaos (PC) expansions for representation of random variables. The utility and effectiveness of PC methods have been demonstrated in a range of physical models, including structural mechanics, transport in porous media, fluid dynamics, aeronautics, heat transfer, and chemically reacting flow. While high-dimensionality remains nominally an ongoing challenge, great strides have been made in dealing with moderate dimensionality along with non-linearity and oscillatory dynamics. In this talk, I will give an overview of UQ in chemical systems. I will cover both: (1) the estimation of uncertain input parameters from empirical data, and (2) the forward propagation of parametric uncertainty to model outputs. I will cover the basics of forward PC UQ methods with examples of their use. I will also highlight the need for accurate estimation of the joint probability density over the uncertain parameters, in order to arrive at meaningful estimates of model output uncertainties. Finally, I will discuss recent developments on the inference of this density given partial information from legacy experiments, in the absence of raw data.

99 GENERAL AND MISCELLANEOUS↗

Uncertainty quantification in reacting flow.

Chemically reacting flow models generally involve inputs and parameters that are determined from empirical measurements, and therefore exhibit a certain degree of uncertainty. Estimating the propagation of this uncertainty into computational model output predictions is crucial for purposes of reacting flow model validation, model exploration, as well as design optimization. Recent years have seen great developments in probabilistic methods and tools for efficient uncertainty quantification (UQ) in computational models. These tools are grounded in the use of Polynomial Chaos (PC) expansions for representation of random variables. The utility and effectiveness of PC methods have been demonstrated in a range of physical models, including structural mechanics, transport in porous media, fluid dynamics, aeronautics, heat transfer, and chemically reacting flow. While high-dimensionality remains nominally an ongoing challenge, great strides have been made in dealing with moderate dimensionality along with non-linearity and oscillatory dynamics. In this talk, I will give an overview of UQ in chemical systems. I will cover both: (1) the estimation of uncertain input parameters from empirical data, and (2) the forward propagation of parametric uncertainty to model outputs. I will cover the basics of forward PC UQ methods with examples of their use. I will also highlight the need for accurate estimation of the joint probability density over the uncertain parameters, in order to arrive at meaningful estimates of model output uncertainties. Finally, I will discuss recent developments on the inference of this density given partial information from legacy experiments, in the absence of raw data.

99 GENERAL AND MISCELLANEOUS↗

Advanced methods for uncertainty quantification in tail regions of climate model predictions.

Conventional methods for uncertainty quantification are generally challenged in the 'tails' of probability distributions. This is specifically an issue for many climate observables since extensive sampling to obtain a reasonable accuracy in tail regions is especially costly in climate models. Moreover, the accuracy of spectral representations of uncertainty is weighted in favor of more probable ranges of the underlying basis variable, which, in conventional bases does not particularly target tail regions. Therefore, what is ideally desired is a methodology that requires only a limited number of full computational model evaluations while remaining accurate enough in the tail region. To develop such a methodology, we explore the use of surrogate models based on non-intrusive Polynomial Chaos expansions and Galerkin projection. We consider non-conventional and custom basis functions, orthogonal with respect to probability distributions that exhibit fat-tailed regions. We illustrate how the use of non-conventional basis functions, and surrogate model analysis, improves the accuracy of the spectral expansions in the tail regions. Finally, we also demonstrate these methodologies using precipitation data from CCSM simulations.

54 ENVIRONMENTAL SCIENCES↗

Diffusion Synthetic Acceleration for High-Order Discontinuous Finite Element SN Transport Schemes and Application to Locally Refined Unstructured Meshes

Diffusion synthetic acceleration (DSA) schemes compatible with adaptive mesh refinement (AMR) grids are derived for the SN transport equations discretized using high-order discontinuous finite elements. These schemes are directly obtained from the discretized transport equations by assuming a linear dependence in angle of the angular flux along with an exact Fick's law and, therefore, are categorized as partially consistent. These schemes are akin to the symmetric interior penalty technique applied to elliptic problems and are all based on a second-order discontinuous finite element discretization of a diffusion equation (as opposed to a mixed or P1 formulation). Therefore, they only have the scalar flux as unknowns. A Fourier analysis has been carried out to determine the convergence properties of the three proposed DSA schemes for various cell optical thicknesses and aspect ratios. Out of the three DSA schemes derived, the modified interior penalty (MIP) scheme is stable and effective for realistic problems, even with distorted elements, but loses effectiveness for some highly heterogeneous configurations. The MIP scheme is also symmetric positive definite and can be solved efficiently with a preconditioned conjugate gradient method. Its implementation in an AMR SN transport code has been performed for both source iteration and GMRes-based transport solves, with polynomial orders up to 4. Numerical results are provided and show good agreement with the Fourier analysis results. Results on AMR grids demonstrate that the cost of DSA can be kept low on locally refined meshes.

42 ENGINEERING↗

Sensitivities and Uncertainties Related to Numerics and Building Features in Urban Modeling

Oak Ridge National Laboratory (ORNL) has been engaged in the development and testing of a computational system that would use a grid of activation foil detectors to provide postdetonation forensic information from a nuclear device detonation. ORNL has developed a high-performance, three-dimensional (3-D) deterministic radiation transport code called Denovo. Denovo solves the multigroup discrete ordinates (SN) equations and can output 3-D data in a platform-independent format that can be efficiently analyzed using parallel, high-performance visualization tools. To evaluate the sensitivities and uncertainties associated with the deterministic computational method numerics, a numerical study on the New York City Times Square model was conducted using Denovo. In particular, the sensitivities and uncertainties associated with various components of the calculational method were systematically investigated, including (a) the Legendre polynomial expansion order of the scattering cross sections, (b) the angular quadrature, (c) multigroup energy binning, (d) spatial mesh sizes, (e) the material compositions of the building models, (f) the composition of the foundations upon which the buildings rest (e.g., ground, concrete, or asphalt), and (g) the amount of detail included in the building models. Although Denovo may calculate the idealized model well, there may be uncertainty in the results because of slight departures of the above-named parameters from those used in the idealized calculations. Fluxes and activities at selected locations from perturbed calculations are compared with corresponding values from the idealized or base case to determine the sensitivities associated with specified parameter changes. Results indicate that uncertainties related to numerics can be controlled by using higher fidelity models, but more work is needed to control the uncertainties related to the model.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

The inhibiting bisection problem.

Given a graph where each vertex is assigned a generation or consumption volume, we try to bisect the graph so that each part has a significant generation/consumption mismatch, and the cutsize of the bisection is small. Our motivation comes from the vulnerability analysis of distribution systems such as the electric power system. We show that the constrained version of the problem, where we place either the cutsize or the mismatch significance as a constraint and optimize the other, is NP-complete, and provide an integer programming formulation. We also propose an alternative relaxed formulation, which can trade-off between the two objectives and show that the alternative formulation of the problem can be solved in polynomial time by a maximum flow solver. Our experiments with benchmark electric power systems validate the effectiveness of our methods.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Refine your search to explore more results.