SEARCH · Search NASA

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 631 records · Page 35

All sources NASA NTRS DOE OSTI

DOE OSTI2024

Platform Of Optimal Experiment Management

The platform of optimal experiment management, POEM, powered with automated machine learning to accelerate the discovery of optimal solutions, and automatically guide the design of experiments to be evaluated. POEM currently supports 1) random model explorations for experiment design, 2) sparse grid model explorations with Gaussian Polynomial Chaos surrogate model to accelerate experiment design ,3) time-dependent model sensitivity and uncertainty analysis to identify the importance features for experiment design, 4) model calibrations via Bayesian inference to integrate experiments to improve model performance, and 5) Bayesian optimization for optimal experimental design. In addition, POEM aims to simplify the process of experimental design for users, enabling them to analyze the data with minimal human intervention, and improving the technological output from research activities.

Wang, Congjian [Idaho National Laboratory (INL), I↗

DOE OSTI2024

khaos

An R implementation of a modified version of the sparse Bayesian polynomial chaos expansion algorithm of Shao et al., (2017).

Rumsey, Kellin↗

DOE OSTI2025

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↗

DOE OSTI2020

A phenomenological rate of injection model for predicting fuel injection with application to mixture formation in light-duty diesel engines

Fuel injection rate laws are one of the most important pieces of information needed when modeling engine combustion with computational fluid dynamics. In this study, a simple phenomenological model of a common-rail injector was developed and calibrated for the Bosch CRI2.2 platform. The model requires three tunable parameter fits, making it relatively easy to calibrate and suitable for injector modeling when high-fidelity information about the internal injector’s geometry and electrical circuit details are not available. Each injection pulse is modeled as a sequence of up to four stages: an injection needle mechanical opening transient, a full-lift viscous flow inertial transient, a Bernoulli steady-state stage, and a needle descent transient. Parameters for each stage are obtained as polynomial fits from measured injection rate properties. The model enforces total injected mass, and the intermediate stages are only introduced if the injection pulse duration is long enough. Experimental rates of injection from two separate campaigns on the same injector were used to calibrate the model. The model was first validated against measured injection rate laws featuring pilot injections, short partially premixed combustion pulses, and conventional diesel combustion injection strategies. Then, it was employed as an input to engine computational fluid dynamics simulations, which were run to simulate experiments of mixture formation in an optically accessible light-duty diesel engine. It was found that, though simple, this model is capable of predicting both pilot and main injection pulse mass flow rates well: the simulations yielded accurate predictions of in-cylinder equivalence ratio distributions from injection strategies for both partially premixed combustion and pilot injections. Also, once calibrated, the model produced appropriate results for a wide range of injected mass and rail pressure values. Finally, it was observed that usage of such a relatively simple model can be a good choice when high-fidelity injection rate input and highly detailed information of the injector’s geometry and operation are not available, particularly as noticeable discrepancies can be present also among different experimental campaigns on similar hardware.

42 ENGINEERING↗

DOE OSTI2023

End-to-end GPU acceleration of low-order-refined preconditioning for high-order finite element discretizations

In this article, we present algorithms and implementations for the end-to-end GPU acceleration of matrix-free low-order-refined preconditioning of high-order finite element problems. The methods described here allow for the construction of effective preconditioners for high-order problems with optimal memory usage and computational complexity. The preconditioners are based on the construction of a spectrally equivalent low-order discretization on a refined mesh, which is then amenable to, for example, algebraic multigrid preconditioning. The constants of equivalence are independent of mesh size and polynomial degree. For vector finite element problems in H(curl) and H(div) (e.g., for electromagnetic or radiation diffusion problems), a specially constructed interpolation–histopolation basis is used to ensure fast convergence. Detailed performance studies are carried out to analyze the efficiency of the GPU algorithms. The kernel throughput of each of the main algorithmic components is measured, and the strong and weak parallel scalability of the methods is demonstrated. The different relative weighting and significance of the algorithmic components on GPUs and CPUs is discussed. Results on problems involving adaptively refined nonconforming meshes are shown, and the use of the preconditioners on a large-scale magnetic diffusion problem using all spaces of the finite element de Rham complex is illustrated.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Scalable multilevel Monte Carlo methods exploiting parallel redistribution on coarse levels

Here, we study an element agglomeration coarsening strategy that requires data redistribution at coarse levels when the number of coarse elements becomes smaller than the number of MPI processes used on the finest level. The overall procedure generates coarse elements (general unstructured unions of fine grid elements) within the framework of element-based algebraic multigrid methods (or AMGe) studied previously. The AMGe-generated coarse spaces have the ability to exhibit approximation properties of the same order as the fine-level spaces since by construction they contain the piecewise polynomials of the same order as on the fine level. These approximation properties are key for the successful use of AMGe in multilevel solvers for nonlinear partial differential equations as well as for multilevel Monte Carlo (MLMC) simulations. The ability to coarsen without being constrained by the number of MPI processes, as described in the present paper, allows to improve the scalability of these solvers as well as the overall MLMC method. The paper illustrates this latter fact with detailed scalability study of MLMC simulations applied to model Darcy equations with a stochastic log-normal permeability field.

AMGe↗

DOE OSTI2025

Enabling Real-Time Communication in Multi-Agent Systems: A Graph Neural Network Based Approach

Global connectivity enables effective coordination in Multi-Agent Systems (MAS). Solving these connection problems under hardware constraints is an NP-hard non-Euclidean Degree Constrained Minimum Spanning Tree (DCMST) problem. Prior MAS controllers coordinate team movement for task completion and collision avoidance; some considering Line-of-Sight (LOS) maintenance but prioritizing flexibility over guarantees. Evolutionary Algorithms (EA) have been shown to find good solutions for DCMST, but their performance degrades with larger populations required to support a large MAS. We present a method based on edge graph attention networks, trained offline to reduce online computation times. Empirical comparisons with greedy polynomial-time solvers and EA show that our method leverages latent graph information to consistently find constraint-satisfying solutions in less time.

connectivity maintenance↗

DOE OSTI2020

Optimization-Driven Scenario Grouping

Scenario decomposition algorithms for stochastic programs compute bounds by dualizing all nonanticipativity constraints and solving individual scenario problems independently. Here, we develop an approach that improves on these bounds by reinforcing a carefully chosen subset of nonanticipativity constraints, effectively placing scenarios into groups. Specifically, we formulate an optimization problem for grouping scenarios that aims to improve the bound by optimizing a proxy metric based on information obtained from evaluating a subset of candidate feasible solutions. We show that the proposed grouping problem is NP-hard in general, identify a polynomially solvable case, and present two formulations for solving the problem: a matching formulation for a special case and a mixed-integer programming formulation for the general case. We use the proposed grouping scheme as a preprocessing step for a particular scenario decomposition algorithm and demonstrate its effectiveness in solving standard test instances of two-stage 0–1 stochastic programs. Using this approach, we are able to prove optimality for all previously unsolved instances of a standard test set. Additionally, we implement this scheme as a preprocessing step for PySP, a publicly available and widely used implementation of progressive hedging, and compare this grouping approach with standard grouping approaches on large-scale stochastic unit commitment instances. Finally, the idea is extended to propose a finitely convergent algorithm for two-stage stochastic programs with a finite feasible region.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Advances in MINLP to Identify Energy-Efficient Distillation Configurations

Separation of mixtures of chemicals, ubiquitous in chemical and petrochemical industries, by distillation is energy intensive. Nearly 3% of the overall energy is used for distillation in the United States. Improving the distillation process is crucial for making chemical industries more sustainable. However, designing distillation sequences is challenging because the choice set is vast, and the equations governing the physical process are highly nonconvex. Traditional design practices rely on heuristics and often result in suboptimal solutions. Tumbalam Gooty et al. present the first approach that reliably identifies the distillation sequence that requires the least energy for a given separation. By embedding convex hulls of substructures and adapting the reformulation-linearization technique to fractions of polynomials, they demonstrated that their approach outperforms the state-of-the-art. Their work will help the chemical industry reduce greenhouse gas emissions associated with distillation.

Business & Economics↗

DOE OSTI2022

Analytic error analysis of cross section interpolation methods in nodal diffusion codes - I : Theory

This paper discusses two cross section interpolation methods commonly found in popular nodal codes; the partial derivatives and multiple tables models. The motivation for choosing a model, and thus a case matrix structure, is a trade off between accuracy and computational cost. Due to decades of experience, there are default structures that are sufficient for current light water reactor analysis. However, this is not necessarily the case for advanced reactor designs. Therefore, it is advantageous to understand the sources of error in cross section interpolation models so that the quality of a case matrix may be improved. A mathematical framework for these models is presented in this work that provides a more rigorous connection between the nuclear engineering field's cross section interpolation methods and the broader mathematical field of function approximation. The two cross section models examined in this paper were found to utilize Lagrange interpolation and are a subset of Lagrange tensor products. Classical results of Lagrange polynomial error analysis were then applied to the partial derivative and multiple tables models to derive expressions for the total point-wise error. The analytical results classify the total error into two parts: the model form error and interpolation error. Finally, based on our observations, a better foundation for improving the quality of a case matrix is proposed. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

DOE OSTI2020

SSA Monte Carlo and Master Equation Modeling of Neutron Leakage Distributions

Strongly stochastic neutron populations in highly subcritical multiplying media containing weak spontaneous fission sources are unique indicators of the presence of SNM. For instance, in neutron multiplicity counting, an extended tail in the count number probability distribution is observed that is a characteristic of and sensitive to the amount of SNM present. Theoretical modeling and efficient computation of stochastic neutron distributions are complementary to experimental measurements and moreover shed light on the fundamental interactions and transport processes that underlie nuclear signatures. Modeling approaches that are intermediate between gross-system level models and high-fidelity but computationally demanding Monte Carlo simulations are of particular interest in this regard. Furthermore we present three advances on existing work in point kinetic or lumped geometry: (i) implementation of the Stochastic Simulation Algorithm (SSA), a system state-updating Monte Carlo method that is more e cient than single-event Monte Carlo in lumped geometries, (ii) application of the backward Master equation to obtain time-gated count moments, and (iii) reconstructing the count number distribution from the deterministically computed moments using a generalized Laguerre polynomial expansion.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2023

Phase retrieval using Gaussian basis functions

A wavefront map of arbitrary aperture can be represented by a sum of Gaussian basis functions. Its performance is compared here to other representation methods such as orthonormal polynomials and Fourier modes. Gaussian basis functions can be applied to phase retrieval of high-frequency wavefront maps. Experiments show good agreement with direct measurements by a wavefront sensor. Finally, optimum measurement conditions are discussed based on the statistics of wavefront properties.

47 OTHER INSTRUMENTATION↗

DOE OSTI2021

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↗

DOE OSTI2024

E-PVT: enhanced position-velocity-time scheduler for computer-controlled optical finishing with comprehensive considerations of dynamics constraints, continuity and efficiency

Deterministic computer-controlled optical finishing is an essential approach for achieving high-quality optical surfaces. Its determinism and convergence rely heavily on precise and smooth motion control to guide the machine tool over an optical surface to correct residual errors. One widely supported and smooth motion control model is position-velocity-time (PVT), which employs piecewise cubic polynomials to describe positions. Our prior research introduced a PVT-based velocity scheduling method, demonstrating sub-nanometer level convergence in ion beam figuring (IBF) processes. However, three challenges remained. Firstly, this method relies on quadratic programming, resulting in computational intensiveness for dense tool paths. Secondly, the dynamics constraints and velocity and acceleration continuities are not comprehensively considered, limiting the full potential of PVT-based control. Thirdly, no compensation mechanism existed when dynamics constraints are exceeded. In this study, in response to these challenges, we proposed the Enhanced PVT (E-PVT) method, reducing the time complexity from O ( n 3 ) to O ( n ) while fully addressing dynamics constraints and continuities. A novel compensation method utilizing particle swarm optimization was proposed to address situations where dynamics constraints might be exceeded while maintaining the overall processing efficiency. Validation through simulation and experimentation confirmed the improved performance of E-PVT.

36 MATERIALS SCIENCE↗

DOE OSTI2025

Modal focal adaptive optics for Bessel-focus two-photon fluorescence microscopy

Adaptive optics (AO) improves the spatial resolution of microscopy by correcting optical aberrations. While its application has been well established in microscopy modalities utilizing a circular pupil, its adaptation to systems with non-circular pupils, such as Bessel-focus two-photon fluorescence microscopy (2PFM) with an annular pupil, remains relatively uncharted. Herein, we present a modal focal AO (MFAO) method for Bessel-focus 2PFM. Measuring and correcting aberration using a spatial light modulator placed in conjugation with the focal plane of the microscope objective, MFAO employs Zernike annular polynomials — a first in AO implementation — to achieve performance on par with a previous zonal AO method, but with a notably simplified optical configuration. We validated the performance of MFAO in correcting artificial and sample-induced aberrations, as well as in in vivo imaging of zebrafish larvae and mouse brains. By expanding the application of modal AO to annular pupils as well as aberration measurement and correction to a wavefront modulator at the objective focal plane, MFAO represents a notable advancement in the implementation of AO in microscopy.

47 OTHER INSTRUMENTATION↗

DOE OSTI2024

Extreme-value statistics in nonlinear optics

We show that, although nonlinear optics may give rise to a vast multitude of statistics, all these statistics converge, in their extreme-value limit, to one of a few universal extreme-value statistics. Specifically, in the class of polynomial nonlinearities, such as those found in the Kerr effect, weak-field harmonic generation, and multiphoton ionization, the statistics of the nonlinear-optical output converges, in the extreme-value limit, to the exponentially tailed, Gumbel distribution. Exponentially growing nonlinear signals, on the other hand, such as those induced by parametric instabilities and stimulated scattering, are shown to reach their extreme-value limits in the class of the Fréchet statistics, giving rise to extreme-value distributions (EVDs) with heavy, manifestly nonexponential tails, thus favoring extreme-event outcomes and rogue-wave buildup.

Zheltikov, Aleksei M. (ORCID:0000000291380576)↗

DOE OSTI2023

Impact of longitudinal phase-matching variations on three-wave nonlinear interactions

A general study of three-wave nonlinear mixing in the presence of longitudinal variations in phase-matching conditions is presented. The efficiency of second-harmonic generation and optical parametric amplification is quantified using a normalized set of equations and a polynomial description of the wave-vector mismatch as a function of the longitudinal coordinate. These modeling results are used to estimate the impact of spatial variations in wave-vector mismatch experimentally obtained for five partially deuterated potassium dihydrogen phosphate crystals. The longitudinal inhomogeneities in the properties of crystals of similar quality are not expected to have a significant impact on their use for second-harmonic generation and optical parametric amplification, but the efficiency of nonlinear processes in crystals with larger variations could decrease.

36 MATERIALS SCIENCE↗

DOE OSTI2022

The DPG Method for the Convection-Reaction Problem, Revisited

In this work, we study both conforming and non-conforming versions of the practical DPG method for the convection-reaction problem. We determine that the most common approach for DPG stability analysis – construction of a local Fortin operator – is infeasible for the convection-reaction problem. We then develop a line of argument based on a direct proof of discrete stability; we find that employing a polynomial enrichment for the test space does not suffice for this purpose, motivating the introduction of a (two-element) subgrid mesh. The argument combines mathematical analysis with numerical experiments.

97 MATHEMATICS AND COMPUTING↗