Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Polynomial models”

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 307 records · Page 17

Flap-lag-torsional dynamic modelling of rotor blades in hover and in forward flight, including the effect of cubic nonlinearities

The differential equations of motion, and boundary conditions, describing the flap-lead/lag-torsional motion of a flexible rotor blade with a precone angle and a variable pitch angle, which incorporates a pretwist, are derived via Hamilton's principle. The meaning of inextensionality is discussed. The equations are reduced to a set of three integro partial differential equations by elimination of the extension variable. The generalized aerodynamic forces are modelled using Greenberg's extension of Theodorsen's strip theory. The equations of motion are systematically expanded into polynomial nonlinearities with the objective of retaining all terms up to third degree. The blade is modeled as a long, slender, of isotropic Hookean materials. Offsets from the blade's elastic axis through its shear center and the axes for the mass, area and aerodynamic centers, radial nonuniformaties of the blade's stiffnesses and cross section properties are considered and the effect of warp of the cross section is included in the formulation.

Crespodasilva, M. R. M.↗

GenMod: A generative modeling approach for spectral representation of PDEs with random inputs

Here, we propose a method for quantifying uncertainty in high-dimensional PDE systems with random parameters, where the number of solution evaluations is small. Parametric PDE solutions are often approximated using a spectral decomposition based on polynomial chaos expansions. For the class of systems we consider (i.e., high dimensional with limited solution evaluations) the coefficients are given by an underdetermined linear system in a regression formulation. This implies additional assumptions, such as sparsity of the coefficient vector, are needed to approximate the solution. Here, we present an approach where we assume the coefficients are close to the range of a generative model that maps from a low to a high dimensional space of coefficients. Our approach is inspired be recent work examining how generative models can be used for compressed sensing in systems with random Gaussian measurement matrices. Using results from PDE theory on coefficient decay rates, we construct an explicit generative model that predicts the polynomial chaos coefficient magnitudes. The algorithm we developed to find the coefficients, which we call GenMod, is composed of two main steps. First, we predict the coefficient signs using Orthogonal Matching Pursuit. Then, we assume the coefficients are within a sparse deviation from the range of a sign-adjusted generative model. This allows us to find the coefficients by solving a nonconvex optimization problem, over the input space of the generative model and the space of sparse vectors. We obtain theoretical recovery results for a Lipschitz continuous generative model and for a more specific generative model, based on coefficient decay rate bounds. We examine three high-dimensional problems and show that, for all three examples, the generative model approach outperforms sparsity promoting methods at small sample sizes.

97 MATHEMATICS AND COMPUTING↗

Moltensaltpropnet

MoltenSaltPropnet is a physics-informed machine learning framework that aims to predict the thermophysical properties of molten fluoride and chloride salt mixtures, which are crucial for the design and safety of Generation IV molten salt reactors. The code processes data from the Molten-Salt Thermal Properties Database (MSTDB-TP) and the Janz compendium, converting critically evaluated correlations into fast, differentiable surrogate models for density, viscosity, thermal conductivity, and heat capacity across 448 distinct salt systems. The implementation consists of several key components: 1. Data Curation: The code parses and cleans the raw data, normalizing elemental mole fractions and extracting relevant regression coefficients for various thermophysical properties. 2. Feature Engineering: It generates fixed-length numerical descriptors that encapsulate the composition and temperature, incorporating polynomial interaction terms and dimensionality-reduction techniques to optimize model performance. 3. Coefficient Learning: Four different machine learning architectures are employed: a deep residual network (ResNet), a Kolmogorov–Arnold network (KAN), a sparsity-inducing neural network (SNN), and classical regression models. Each model learns to predict coefficients that define the temperature-dependent correlations for the thermophysical properties. 4. Property Reconstruction: The predicted coefficients are used to compute temperature-dependent property values, ensuring positivity and monotonic trends through a composite loss function that enforces physical constraints. 5. User Interface: An open-source web application enables users to filter the database, train task-specific models, and visualize the results, allowing for rapid exploration of candidate salt mixtures. MoltenSaltPropnet bridges the gap between limited experimental data and high-fidelity reactor simulations, providing a powerful tool for researchers in the field of molten salt reactors and advanced nuclear energy systems.

Retamales, Mauricio Eduardo Tano [Idaho National L↗

A micro-computer-based system to compute magnetic variation

A mathematical model of magnetic variation in the continental United States was implemented in the Ohio University Loran-C receiver. The model is based on a least squares fit of a polynomial function. The implementation on the microprocessor based Loran-C receiver is possible with the help of a math chip which performs 32 bit floating point mathematical operations. A Peripheral Interface Adapter is used to communicate between the 6502 based microcomputer and the 9511 math chip. The implementation provides magnetic variation data to the pilot as a function of latitude and longitude. The model and the real time implementation in the receiver are described.

Kaul, Rajan↗

Accurate calculation of many-body energies in water clusters using a classical geometry-dependent induction model

We incorporate geometry-dependent distributed multipole and polarizability surfaces into an induction model that is used to describe the 3- and 4-body terms of the interaction between water molecules. The expansion is carried out up to hexadecapole with the multipoles distributed on the atom sites. Dipole-dipole, dipole-quadrupole, and quadrupole-quadrupole distributed polarizabilities are used to represent the response of the multipoles to an electric field. We compare the model against two large databases consisting of 43,844 3-body terms and 3,603 4-body terms obtained from high level ab initio calculations previously used to fit the MB-pol and q-AQUA interaction potentials. The classical induction model with no adjustable parameters reproduces the ab-initio 3- and 4-body terms contained in these teo Databases with a Root-Mean-Square-Error (RMSE) of 0.104/0.058 and a Mean-Absolute-Error (MAE) of 0.054/0.026 kcal/mol, respectively, results that are on a par with those obtained 1 by fitting the same data using tens of thousands of Permutationally Invariant Polynomials (PIPs). This demonstrates the accuracy of this physically motivated model in describing the 3- and 4-body terms in the interactions between water molecules with no adjustable parameters. The triple-dipole-dispersion energy was included in the 3-body energy and was found to be small but not quite negligible. The model represents a practical, efficient and transferable approach for obtaining accurate non-additive interactions for multi-component systems without the need of performing tens of thousands of high level electronic structure calculations and fitting them with tens of thousands of PIPs.

molecular analysis water, aqueous↗

A micro-computer based system to compute magnetic variation

A mathematical model of magnetic variation in the continental United States (COT48) was implemented in the Ohio University LORAN C receiver. The model is based on a least squares fit of a polynomial function. The implementation on the microprocessor based LORAN C receiver is possible with the help of a math chip, Am9511 which performs 32 bit floating point mathematical operations. A Peripheral Interface Adapter (M6520) is used to communicate between the 6502 based micro-computer and the 9511 math chip. The implementation provides magnetic variation data to the pilot as a function of latitude and longitude. The model and the real time implementation in the receiver are described.

Kaul, R.↗

Kernel polynomial method for linear spin wave theory

Calculating dynamical spin correlations is essential for matching model magnetic exchange Hamiltonians to momentum-resolved spectroscopic measurements. A major numerical bottleneck is the diagonalization of the dynamical matrix, especially in systems with large magnetic unit cells, such as those with incommensurate magnetic structures or quenched disorder. In this paper, we demonstrate an efficient scheme based on the kernel polynomial method for calculating dynamical correlations of relevance to inelastic neutron scattering experiments. This method reduces the scaling of numerical cost from cubic to linear in the magnetic unit cell size.

97 MATHEMATICS AND COMPUTING↗

Determination of airplane aerodynamic parameters from flight data at high angles of attack

The problem of determining airplane aerodynamic model equations and estimating the associated parameters from flight data taken at high angles of attack is addressed. Two representations of the aerodynamic function based on the polynomial and spline representations are given. Then the technique of building an adequate model using a stepwise regression is presented with examples demonstrating the construction of the model and various approaches to model verification.

Klein, V.↗

Considerations for modeling thin cirrus effects via brightness temperature differences

Brightness temperature difference (BTD) values are calculated for selected Geostationary Operational Environmental Satellite (GOES-6) channels (3.9, 12.7 micrometer) and Advanced Very High Resolution Radiometer channels (3.7, 12.0 micrometer). Daytime and nighttime discrimination of particle size information is possible given the infrared cloud extinction optical depth and the BTD value. BTD values are presented and compared for cirrus clouds composed of equivalent ice spheres (volume, surface area) versus randomly oriented hexagonal ice crystals. The effect of the hexagonal ice crystals is to increase the magnitude of the BTD values calculated relative to equivalent ice sphere (volume, surface area) BTDs. Equivalent spheres (volume or surface area) do not do a very good job of modeling hexagonal ice crystal effects on BTDs; however, the use of composite spheres improves the simulation and offers interesting prospects. Careful consideration of the number of Legendre polynomial coefficients used to fit the scattering phase functions is crucial to realistic modeling of cirrus BTDs. Surface and view-angle effects are incorporated to provide more realistic simulation.

Schmidt, E. O.↗

SIR-B ocean-wave enhancement with fast Fourier transform techniques

Shuttle Imaging Radar (SIR-B) imagery is Fourier filtered to remove the estimated system-transfer function, reduce speckle noise, and produce ocean scenes with a gray scale that is proportional to wave height. The SIR-B system response to speckled scenes of uniform surfaces yields an estimate of the stationary wavenumber response of the imaging radar, modeled by the 15 even terms of an eighth-order two-dimensional polynomial. Speckle can also be used to estimate the dynamic wavenumber response of the system due to surface motion during the aperture synthesis period, modeled with a single adaptive parameter describing an exponential correlation along track. A Fourier filter can then be devised to correct for the wavenumber response of the remote sensor and scene correlation, with subsequent subtraction of an estimate of the speckle noise component. A linearized velocity bunching model, combined with a surface tilt and hydrodynamic model, is incorporated in the Fourier filter to derive estimates of wave height from the radar intensities corresponding to individual picture elements.

Tilley, David G.↗

A methodology for decay heat characterization in molten salt reactors

Accurate decay heat prediction in molten salt reactors (MSRs) faces dual challenges: complex operational uncertainties and the need for interpretable models compatible with engineering workflows. This work presents a hybrid machine learning and segmented polynomial methodology that addresses both requirements through three key innovations. First, a modular data architecture encodes MSR-specific operational parameters (power density: 1-100 W cm -3 , humidity: 0-0.1 wt %, air ingress: 0-0.1 mol %) with uncertainty-aware temporal discretization spanning 15 orders of magnitude. Second, region-optimized machine learning models achieve 92.3 % root mean square error (RMSE) reduction over conventional polynomials while maintaining physical interpretability through automated piecewise equation generation. Third, dual front-end interfaces accelerate safety analyses — a Jupyter environment enables researchers to explore 10,000+ parameter combinations via interactive widgets, while a Streamlit web application reduces design iteration cycles through production-grade visualization tools. Operational deployment demonstrates prediction times of only a couple hundred milliseconds for 10 4 years decay profiles, enabling real-time optimization of spent fuel container designs.

42 - ENGINEERING↗

PolyFit: A C++ code for Polynomial Curve Fit with Calculation of Error Bars

In radiobiology, many dose-response results are modeled using the so-called linear-quadratic (LQ)model, which means that results are modeled as a function of dose Das 𝑅(𝐷)=𝛽0+𝛽1𝐷+𝛽2𝐷2. The coefficients 𝛽0, 𝛽1and 𝛽2are obtained from fitting a series of data points (𝑥𝑖, 𝑦𝑖), which is usually done using a least-square method. The LQ and more generally the polynomial fit capability is implemented in many software that analyzes data. However, there are some instances where the fitting needs to be done programmatically. Furthermore, depending on the software used, some features may not be implemented. In this mini-review, I discuss the basis of polynomial fitting, including the calculation of errors on the coefficients and results, use of weighting and fixing the intercept value (the coefficient 𝛽0). A simple C++ code to perform the polynomial curve fitting is also provided. This code should be useful not only in radiobiology but in other fields of science as well.

Ianik Plante↗

PolyFit: A C++ code for Polynomial Curve Fit with Calculation of Error Bars

In radiobiology, many dose-response results are modeled using the so-called linear-quadratic(LQ)model, which means that results are modeled as a function of dose Das 𝑅(𝐷)=𝛽0+𝛽1𝐷+𝛽2𝐷2. The coefficients 𝛽0, 𝛽1and 𝛽2are obtained from fitting a series of data points (𝑥𝑖,𝑦𝑖), which is usually done using a least-square method. The LQ and more generally the polynomial fit capability is implemented in many software that analyzes data. However, it is often convenient to do the fitting programmatically, especially when a large number of datasets should be analyzed. Furthermore, depending on the software used, some features may not be implemented. In this mini-review, I discuss the basis of polynomial fitting, including the calculation of errors on the coefficients and results, use of weighting and fixing the intercept value (the coefficient 𝛽0). A simple C++ code to perform the polynomial curve fitting is also provided. This code should be useful not only in radiobiology but in other fields of science as well.

Ianik Plante↗

A 3D High-Order Unstructured Finite-Volume Algorithm for Solving Maxwell's Equations

A three-dimensional finite-volume algorithm based on arbitrary basis functions for time-dependent problems on general unstructured grids is developed. The method is applied to the time-domain Maxwell equations. Discrete unknowns are volume integrals or cell averages of the electric and magnetic field variables. Spatial terms are converted to surface integrals using the Gauss curl theorem. Polynomial basis functions are introduced in constructing local representations of the fields and evaluating the volume and surface integrals. Electric and magnetic fields are approximated by linear combinations of these basis functions. Unlike other unstructured formulations used in Computational Fluid Dynamics, the new formulation actually does not reconstruct the field variables at each time step. Instead, the spatial terms are calculated in terms of unknowns by precomputing weights at the beginning of the computation as functions of cell geometry and basis functions to retain efficiency. Since no assumption is made for cell geometry, this new formulation is suitable for arbitrarily defined grids, either smooth or unsmooth. However, to facilitate the volume and surface integrations, arbitrary polyhedral cells with polygonal faces are used in constructing grids. Both centered and upwind schemes are formulated. It is shown that conventional schemes (second order in Cartesian grids) are equivalent to the new schemes using first degree polynomials as the basis functions and the midpoint quadrature for the integrations. In the new formulation, higher orders of accuracy are achieved by using higher degree polynomial basis functions. Furthermore, all the surface and volume integrations are carried out exactly. Several model electromagnetic scattering problems are calculated and compared with analytical solutions. Examples are given for cases based on 0th to 3rd degree polynomial basis functions. In all calculations, a centered scheme is applied in the interior, while an upwind matching scheme is employed at material interfaces and the Engquist-Majda non-reflecting boundary condition is implemented at the numerical outer boundaries. The staggered leapfrog scheme and the Runge-Kutta methods are utilized for the time integration. Excellent agreements are found between the numerical and analytical solutions.

Liu, Yen↗

Creation of an Fe 3 P Schreibersite Density Functional Tight Binding Model for Astrobiological Simulations

The mineral schreibersite, e.g., Fe 3 P, is commonly found in iron-rich meteorites and could have served as an abiotic phosphorus source for prebiotic chemistry. However, atomistic calculations of its degradation chemistry generally require quantum simulation approaches, which can be too computationally cumbersome to study sufficient time and length scales for this process. In this regard, we have created a computationally efficient semiempirical quantum density functional tight binding (DFTB) model for iron and phosphorus-containing materials by adopting an existing semiautomated workflow that represents many-body interactions by linear combinations of Chebyshev polynomials. Here, we have utilized a relatively small training set to optimize a DFTB model that is accurate for schreibersite physical and chemical properties, including its bulk properties, surface energies, and water absorption. We then show that our model shows strong transferability to several iron phosphide solids as well as multiple allotropes of iron metal. Our resulting DFTB parametrization will allow us to interrogate schreibersite aqueous decomposition at longer time and length scales than standard quantum approaches, providing for more detailed investigations of its role in prebiotic chemistry on early Earth.

36 MATERIALS SCIENCE↗

Tensorized Feature Spaces for Feature Explosion

In this paper 1 1 This manuscript has been authored by UT-Battelle, LLC under Contract No. DE-AC05-000R22725 with the U.S. Department of Energy. The United States Government retains and the publisher, by accepting the article for publication, acknowledges that the United States Government retains a nonexclusive, paid-up, irrevocable, worldwide license to publish or reproduce the published form of this manuscript, or allow others to do so, for United States Government purposes. The Department of Energy will provide public access to these results of federally sponsored research in accordance with the DOE Public Access Plan (http://energy.gov/downloads/doe-public-access-plan) This research used resources of the Oak Ridge Leadership Computing Facility, which is a DOE Office of Science User Facility supported under Contract DE-AC05-000R22725., we present a novel framework that uses tensor factorization to generate richer feature spaces for pixel classification in hyperspectral images. In particular, we assess the performance of different tensor rank decomposition methods as compared to the traditional kernel-based approaches for the hyperspectral image classification problem. We propose Orion, which takes as input a hyperspectral image tensor and a rank and outputs an enhanced feature space from the factor matrices of the decomposed tensor. Our method is a feature explosion technique that inherently maps low dimensional input space in $\mathbb{R}^{K}$ to high dimensional space in $\mathbb{R}^{R}$ , where $R\gg K$ , say in the order of 1000x, like a kernel. We show how the proposed method exploits the multi-linear structure of hyperspectral three dimensional tensor. We demonstrate the effectiveness of our method with experiments on three publicly available hyperspectral datasets with labeled pixels and compare their classification performance against traditional linear and non-linear supervised learning methods such as SVM with Linear, Polynomial, RBF kernels, and the Multi-Layer Perceptron model. Finally, we explore the relationship between the rank of the tensor decomposition and the classification accuracy using several hyperspectral datasets with ground truth.

Pasricha, Ravdeep Singh↗

RISE: robust iterative surface extension for sub-nanometer X-ray mirror fabrication

Precision optics have been widely required in many advanced technological applications. X-ray mirrors, as an example, serve as the key optical components at synchrotron radiation and free electron laser facilities. They are rectangular silicon or glass substrates where a rectangular Clear Aperture (CA) needs to be polished to sub-nanometer Root Mean Squared (RMS) to keep the imaging capability of the incoming X-ray wavefront at the diffraction limit. The convolutional polishing model requires a CA to be extended with extra data, from which the dwell time is calculated via deconvolution. However, since deconvolution is very sensitive to boundary errors and noise, the existing surface extension methods can hardly fulfill the sub-nanometer requirement. On one hand, the figure errors in a CA were improperly modeled during the extension, leading to continuity issues along the boundary. On the other hand, uncorrectable high-frequency errors and noise were also extended. In this study, we propose a novel Robust Iterative Surface Extension (RISE) method that resolves these problems with a data fitting strategy. RISE models the figure errors in a CA with orthogonal polynomials and ensures that only correctable errors are fit and extended. Combined with boundary conditions, an iterative refinement of dwell time is then proposed to compensate the errors brought by the extension and deconvolution, which drastically reduces the estimated figure error residuals in a CA while the increase of total dwell time is negligible. To our best knowledge, RISE is the first data fitting-based surface extension method and is the first to optimize dwell time based on iterative extension. An experimental verification of RISE is given by fabricating two elliptic cylinders (10 mm × 80 mm CAs) starting from a sphere with a radius of curvature around 173 m using ion beam figuring. The figure errors in the two CAs greatly improved from 204.96 nm RMS and 190.28 nm RMS to 0.62 nm RMS and 0.71 nm RMS, respectively, which proves that RISE is an effective method for sub-nanometer level X-ray mirror fabrication.

36 MATERIALS SCIENCE↗

Observations and reduction techniques of the US Coast and Geodetic Survey

The plate reduction method and other aspects of the world geodetic net are described. About one hundred stars are used as reference stars on the PAGEOS satellite plates obtained on 300mm f.1. and later 450mm f.1. Wild BC-4 cameras. The measurements are made manually now on diapositives since these can, according to experience, be measured with higher accuracy and are adjusted following a rigorous projective geometric model. The satellite images are analytically represented by a polynomial curve, of which seven fictitious points are regarded as the result from this plate. Some other aspects of the program are also discussed.

Schmid, H. H.↗