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 775 records · Page 43

Efficient Probabilistic Prediction and Uncertainty Quantification of Tropical Cyclone–Driven Storm Tides and Inundation

Abstract This study proposes and assesses a methodology to obtain high-quality probabilistic predictions and uncertainty information of near-landfall tropical cyclone–driven (TC-driven) storm tide and inundation with limited time and resources. Forecasts of TC track, intensity, and size are perturbed according to quasi-random Korobov sequences of historical forecast errors with assumed Gaussian and uniform statistical distributions. These perturbations are run in an ensemble of hydrodynamic storm tide model simulations. The resulting set of maximum water surface elevations are dimensionality reduced using Karhunen–Loève expansions and then used as a training set to develop a polynomial chaos (PC) surrogate model from which global sensitivities and probabilistic predictions can be extracted. The maximum water surface elevation is extrapolated over dry points incorporating energy head loss with distance to properly train the surrogate for predicting inundation. We find that the surrogate constructed with third-order PCs using elastic net penalized regression with leave-one-out cross validation provides the most robust fit across training and test sets. Probabilistic predictions of maximum water surface elevation and inundation area by the surrogate model at 48-h lead time for three past U.S. landfalling hurricanes (Irma in 2017, Florence in 2018, and Laura in 2020) are found to be reliable when compared to best track hindcast simulation results, even when trained with as few as 19 samples. The maximum water surface elevation is most sensitive to perpendicular track-offset errors for all three storms. Laura is also highly sensitive to storm size and has the least reliable prediction. Significance Statement The purpose of this study is to develop and evaluate a methodology that can be used to provide high-quality probabilistic predictions of hurricane-induced storm tide and inundation with limited time and resources. This is important for emergency management purposes during or after the landfall of hurricanes. Our results show that sampling forecast errors using quasi-random sequences combined with machine learning techniques that fit polynomial functions to the data are well suited to this task. The polynomial functions also have the benefit of producing exact sensitivity indices of storm tide and inundation to the forecasted hurricane properties such as path, intensity, and size, which can be used for uncertainty estimation. The code implementing the presented methodology is publicly available on GitHub.

54 ENVIRONMENTAL SCIENCES↗

Tuning a RANS k-e model for jet-in-crossflow simulations.

We develop a novel calibration approach to address the problem of predictive k e RANS simulations of jet-incrossflow. Our approach is based on the hypothesis that predictive k e parameters can be obtained by estimating them from a strongly vortical flow, specifically, flow over a square cylinder. In this study, we estimate three k e parameters, C%CE%BC, Ce2 and Ce1 by fitting 2D RANS simulations to experimental data. We use polynomial surrogates of 2D RANS for this purpose. We conduct an ensemble of 2D RANS runs using samples of (C%CE%BC;Ce2;Ce1) and regress Reynolds stresses to the samples using a simple polynomial. We then use this surrogate of the 2D RANS model to infer a joint distribution for the k e parameters by solving a Bayesian inverse problem, conditioned on the experimental data. The calibrated (C%CE%BC;Ce2;Ce1) distribution is used to seed an ensemble of 3D jet-in-crossflow simulations. We compare the ensemble's predictions of the flowfield, at two planes, to PIV measurements and estimate the predictive skill of the calibrated 3D RANS model. We also compare it against 3D RANS predictions using the nominal (uncalibrated) values of (C%CE%BC;Ce2;Ce1), and find that calibration delivers a significant improvement to the predictive skill of the 3D RANS model. We repeat the calibration using surrogate models based on kriging and find that the calibration, based on these more accurate models, is not much better that those obtained with simple polynomial surrogates. We discuss the reasons for this rather surprising outcome.

Lefantzi, Sophia↗

Heat Transfer in Void Generating Foam Decomposition: Further Development

Continued development of the additive conductivity material model, used to simulate changes in heat transfer that occurs in void generating foam decomposition, has resulted in an improved model and new features. The previous version of the model was calibrated against the Aria Bulk Fluid Element (BFE) solution and proposed a third-order polynomial correction term best captured the increased heat transfer due to voids in the foam. An investigation of the Fuego Conjugate Heat Transfer (CHT) and Aria BFE solutions at several geometries revealed the CHT solution and BFE solution had differing behavior across length scales, especially at smaller scales. Five calibration studies, using the Fuego CHT as the calibration data, were carried out with polynomial functions of 4-th, 3-rd, 2-nd, 1-st and 0-th orders to determine the best correction function that generalized well across length scales. Each polynomial function was calibrated/trained on six different sized geometries and then tested on three uniquely sized geometries. This study revealed that the 1-st order additive conductivity model performed the best. A new feature of void formation scaling was implemented to more realistically capture the heat transfer as voids are created. A scaling term was added to the model to activate the conductivity correction as decomposition progresses.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Power of Quantum Witnesses

A central theme in the study of quantum information is to understand whether quantum resources are more powerful than their classical counterparts. One such resource is quantum witness and understanding the power of quantum witnesses is one of the fundamental questions of quantum complexity theory. The broad object of this project was to understand the power of quantum witnesses and related objects and their properties: In this direction, this project addressed three key broader category of questions: 1) Are quantum witnesses more powerful than the classical witnesses? 2) How easy it is to copy quantum witnesses and what are their complexity theoretic implications? 3) Can quantum witnesses shed light or help provide super-polynomial quantum speedups on problems for which super-polynomial quantum speedups are shown to be not possible in general? The research conducted under this grant has directly addressed the three core pillars of the original proposal: characterizing the computational power of quantum witnesses, understanding their uncloneability, implications for complexity theory and identifying structural regimes for super-polynomial speedups.

97 MATHEMATICS AND COMPUTING↗

Multivariable quantum signal processing (M-QSP): prophecies of the two-headed oracle

Recent work shows that quantum signal processing (QSP) and its multi-qubit lifted version, quantum singular value transformation (QSVT), unify and improve the presentation of most quantum algorithms. QSP/QSVT characterize the ability, by alternating ansätze, to obliviously transform the singular values of subsystems of unitary matrices by polynomial functions; these algorithms are numerically stable and analytically well-understood. That said, QSP/QSVT require consistent access to a single oracle, saying nothing about computing joint properties of two or more oracles; these can be far cheaper to determine given an ability to pit oracles against one another coherently. This work introduces a corresponding theory of QSP over multiple variables: M-QSP. Surprisingly, despite the non-existence of the fundamental theorem of algebra for multivariable polynomials, there exist necessary and sufficient conditions under which a desired stable multivariable polynomial transformation is possible. Moreover, the classical subroutines used by QSP protocols survive in the multivariable setting for non-obvious reasons, and remain numerically stable and efficient. Up to a well-defined conjecture, we give proof that the family of achievable multivariable transforms is as loosely constrained as could be expected. The unique ability of M-QSP to obliviously approximate joint functions of multiple variables coherently leads to novel speedups incommensurate with those of other quantum algorithms, and provides a bridge from quantum algorithms to algebraic geometry.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

On the energy landscape of symmetric quantum signal processing

Symmetric quantum signal processing provides a parameterized representation of a real polynomial, which can be translated into an efficient quantum circuit for performing a wide range of computational tasks on quantum computers. For a given polynomial f , the parameters (called phase factors) can be obtained by solving an optimization problem. However, the cost function is non-convex, and has a very complex energy landscape with numerous global and local minima. It is therefore surprising that the solution can be robustly obtained in practice, starting from a fixed initial guess Φ 0 that contains no information of the input polynomial. To investigate this phenomenon, we first explicitly characterize all the global minima of the cost function. We then prove that one particular global minimum (called the maximal solution) belongs to a neighborhood of Φ 0 , on which the cost function is strongly convex under the condition ‖ f ‖ ∞ = O ( d − 1 ) with d = d e g ( f ) . Our result provides a partial explanation of the aforementioned success of optimization algorithms.

Wang, Jiasu↗

Machine Learning-Based Process Control for Injection Molding of Recycled Polypropylene

The increased interest in artificial intelligence in manufacturing has driven the adoption of machine learning to optimize processes and improve efficiency. A key challenge in injection molding is the variability of recycled materials, which affects part quality and processing stability. This study presents a novel closed-loop process control approach for injection molding, leveraging machine learning to adaptively predict processing inputs and quality outcomes. The methodology was tested on five blends of recycled polypropylene (rPP), using artificial neural networks (ANNs), linear regression, and polynomial regression to model the relationships between material properties and process parameters. The dataset was split 80/20 into training and testing sets. The ANN model was implemented using TensorFlow and Keras, with six hidden layers of 32 neurons per layer, ReLU activation, and an Adam optimizer. Empirical tuning and early stopping were used to optimize performance and prevent overfitting. Predictions were evaluated based on mean absolute error (MAE), mean squared error (MSE), and percentage error. The results showed that yield stress, ultimate elongation, and part weight were accurately predicted within a 5% error for linear and polynomial regression models and within a 10% error for the ANN. However, modulus predictions were less reliable, with errors of ~11% for ANN and linear regression and ~40% for polynomial regression, reflecting the inherent variability of this property in rPP blends. Predictions of processing inputs had errors ranging from 3% to 25%, depending on the model and response variable. No single modeling approach was consistently superior across all responses, highlighting the complexity of the relationship between material properties, process parameters, and quality metrics. Overall, the work demonstrates that closed-loop process control, powered by machine learning, can effectively predict key quality parameters in injection molding of recycled materials. The proposed approach can improve process stability and material utilization, facilitating increased adoption of sustainable materials.

Krantz, Joshua↗

Modeling the Echelle Spectra Continuum with Alpha Shapes and Local Regression Fitting

Continuum normalization of echelle spectra is an important data analysis step that is difficult to automate. Polynomial fitting requires a reasonably high-order model to follow the steep slope of the blaze function. However, in the presence of deep spectral lines, a high-order polynomial fit can result in ripples in the normalized continuum that increase errors in spectral analysis. Here, we present two algorithms for flattening the spectrum continuum. The Alpha-shape Fitting to Spectrum algorithm is completely data driven, using an alpha shape to obtain an initial estimate of the blaze function. The Alpha-shape and Lab Source Fitting to Spectrum algorithm incorporates a continuum constraint from a laboratory source reference spectrum for the blaze function estimation. These algorithms are tested on a simulated spectrum, where we demonstrate improved normalization compared to polynomial regression for continuum fitting. We show an additional application, using the algorithms for mitigation of spatially correlated quantum efficiency variations and fringing in the charge-coupled device detector of the EXtreme PREcision Spectrometer.

79 ASTRONOMY AND ASTROPHYSICS↗

Runge-Kutta Discontinuous Galerkin Method with a Simple and Compact Hermite WENO Limiter on Unstructured Meshes

Abstract In this paper we generalize a new type of compact Hermite weighted essentially non-oscillatory (HWENO) limiter for the Runge-Kutta discontinuous Galerkin (RKDG) method, which was recently developed in [38] for structured meshes, to two dimensional unstructured meshes. The main idea of this HWENO limiter is to reconstruct the new polynomial by the usage of the entire polynomials of the DG solution from the target cell and its neighboring cells in a least squares fashion [11] while maintaining the conservative property, then use the classical WENO methodology to form a convex combination of these reconstructed polynomials based on the smoothness indicators and associated nonlinear weights. The main advantage of this new HWENO limiter is the robustness for very strong shocks and simplicity in implementation especially for the unstructured meshes considered in this paper, since only information from the target cell and its immediate neighbors is needed. Numerical results for both scalar and system equations are provided to test and verify the good performance of this new limiter.

Physics↗

Necessary and sufficient conditions for the complete controllability and observability of systems in series using the coprime factorization of a rational matrix

The series connection of two linear time-invariant systems that have minimal state space system descriptions is considered. From these descriptions, strict-system-equivalent polynomial matrix system descriptions in the manner of Rosenbrock are derived. They are based on the factorization of the transfer matrix of the subsystems as a ratio of two right or left coprime polynomial matrices. They give rise to a simple polynomial matrix system description of the tandem connection. Theorem 1 states that for the complete controllability and observability of the state space system description of the series connection, it is necessary and sufficient that certain 'denominator' and 'numerator' groups are coprime. Consequences for feedback systems are drawn in Corollary 1. The role of pole-zero cancellations is explained by Lemma 3 and Corollaires 2 and 3.

Callier, F. M.↗

A formulation consideration for orthogonal collocation procedures

Numerical instabilities often arise in the use of high-ordered collocation approximations for numerically solving parabolic partial differential equations. These problems may be reduced by formulations involving evaluation of collocation polynomials rather than combination of the polynomials into a power series. As an illustration, two formulations using shifted Legendre polynomials of order 26 and less are compared.

Lashmet, P. K.↗

Correction factors for on-line microprobe analysis of multielement alloy systems

An on-line correction technique was developed for the conversion of electron probe X-ray intensities into concentrations of emitting elements. This technique consisted of off-line calculation and representation of binary interaction data which were read into an on-line minicomputer to calculate variable correction coefficients. These coefficients were used to correct the X-ray data without significantly increasing computer core requirements. The binary interaction data were obtained by running Colby's MAGIC 4 program in the reverse mode. The data for each binary interaction were represented by polynomial coefficients obtained by least-squares fitting a third-order polynomial. Polynomial coefficients were generated for most of the common binary interactions at different accelerating potentials and are included. Results are presented for the analyses of several alloy standards to demonstrate the applicability of this correction procedure.

Unnam, J.↗

Failure analysis of composite laminates with free edges

Linear elastic stress distributions obtained from a refined finite element mesh are used in conjunction with the tensor polynomial failure criterion to predict the initiation of failure in symmetric, finite-width graphite-epoxy laminates under tensile loading. Results are presented for a wide variety of laminates including: (+ and - theta)s angle-ply; cross-ply (0/90)s and (90/0)s; and quasi-isotropic (90/0/+ and - 45)s and (+ and -45/0/90)s. It is shown that the elastic stress distributions generally compare favorably with other published results, but also indicate improved satisfaction of the stress-free boundary conditions and indicate some differences in the singular behavior of selected stress components at the free edge. The tensor polynomial failure criterion is used to predict the location and mode of first failure. Examination of the individual terms of the polynomial indicates different modes of failure depending upon the laminate configuration.

Herakovich, C. T.↗

Tensile stress-strain behavior of graphite/epoxy laminates

The tensile stress-strain behavior of a variety of graphite/epoxy laminates was examined. Longitudinal and transverse specimens from eleven different layups were monotonically loaded in tension to failure. Ultimate strength, ultimate strain, and strss-strain curves wee obtained from four replicate tests in each case. Polynominal equations were fitted by the method of least squares to the stress-strain data to determine average curves. Values of Young's modulus and Poisson's ratio, derived from polynomial coefficients, were compared with laminate analysis results. While the polynomials appeared to accurately fit the stress-strain data in most cases, the use of polynomial coefficients to calculate elastic moduli appeared to be of questionable value in cases involving sharp changes in the slope of the stress-strain data or extensive scatter.

Garber, D. P.↗

Processing MAGSAT data for comparison with geoid anomalies

A digital data library of MAGSAT data consisting of 1,615,636 measurements from the quiet data set, is geographically sorted, and allows rapid analysis and processing of all the quiet magnetic data about any selected location. Because this library of MAGSAT data is compatible with existing gravity and geoid data library processing and display system software, correlations between MAGSAT, surface gravity, GEOS-3 radar altimeter geoid and bathymetric data sets can be conveniently detected and analyzed. Polynomial trends from each half-orbit were removed as an effective way of estimating and removing ring current effects following estimation of the core field contribution. It was found that a third order polynomial is the lowest polynomial order that appears to provide the best consistency of residual anomalies between coincident orbits.

Bowin, C. O.↗

Geometric accuracy of LANDSAT-4 MSS image data

Analyses of the LANDSAT-4 MSS image data of North Georgia provided by the EDC in CCT-p formats reveal that errors of approximately + or - 30 m in the raw data can be reduced to about + or - 55 m based on rectification procedures involving the use of 20 to 30 well-distributed GCPs and 2nd or 3rd degree polynomial equations. Higher order polynomials do not appear to improve the rectification accuracy. A subscene area of 256 x 256 pixels was rectified with a 1st degree polynomial to yield an RMSE sub xy value of + or - 40 m, indicating that USGS 1:24,000 scale quadrangle-sized areas of LANDSAT-4 data can be fitted to a map base with relatively few control points and simple equations. The errors in the rectification process are caused by the spatial resolution of the MSS data, by errors in the maps and GCP digitizing process, and by displacements caused by terrain relief. Overall, due to the improved pointing and attitude control of the spacecraft, the geometric quality of the LANDSAT-4 MSS data appears much improved over that of LANDSATS -1, -2 and -3.

Welch, R.↗

Simplified Convolution Codes

Simple recursive algorithm efficiently calculates minimum-weight error vectors using Diophantine equations. Recursive algorithm uses general solution of polynomial linear Diophantine equation to determine minimum-weight error polynomial vector in equation in polynomial space.

Truong, T. K.↗

Optimum Cyclic Redundancy Codes for Noisier Channels

Binary cyclic redundancy codes for feedback communication over noisy digital links are considered. The standard 16 bit American Data and Computer Communication Protocol (ADCCP) polynomial is designed for digital links which already have a low input bit error probability. For file transfer between personal computers over telephone circuits, the quality of resulting digital circuit may be much lower. The 3 byte (24 bit) and 4 byte (32 bit) polynomials are considered. Generator polynomials of a certain class have minimum weight and yet achieve the bound on minimum distance for arbitrary codes. Particular choices for 24 bit and 32 bit redundancies are exhibited: of weight and distance 6 in the 24-bit case; and weight 10 and distance 8 in the 32-bit case.

Merkey, P.↗