SEARCH · Search NASA

Results for “Polynomial Constraints”

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.

50 records · Page 3

All sources NASA NTRS DOE OSTI

DOE OSTI2025

McCormick envelopes in mixed-integer PDE-constrained optimization

McCormick envelopes are a standard tool for deriving convex relaxations of optimization problems that involve polynomial terms. Such McCormick relaxations provide lower bounds, for example, in branch-and-bound procedures for mixed-integer nonlinear programs but have not gained much attention in PDE-constrained optimization so far. This lack of attention may be due to the distributed nature of such problems, which on the one hand leads to infinitely many linear constraints (generally state constraints that may be difficult to handle) in addition to the state equation for a pointwise formulation of the McCormick envelopes and renders bound-tightening procedures that successively improve the resulting convex relaxations computationally intractable. We analyze McCormick envelopes for a model problem class that is governed by a semilinear PDE involving a bilinearity and integrality constraints. We approximate the nonlinearity and in turn the McCormick envelopes by averaging the involved terms over the cells of a partition of the computational domain on which the PDE is defined. This yields convex relaxations that underestimate the original problem up to an a priori error estimate that depends on the mesh size of the discretization. These approximate McCormick relaxations can be improved by means of an optimization-based bound-tightening procedure. We show that their minimizers converge to minimizers to a limit problem with a pointwise formulation of the McCormick envelopes when driving the mesh size to zero. We provide a computational example, for which we certify all of our imposed assumptions. The results point to both the potential of the methodology and the gaps in the research that need to be closed. Our methodology provides a framework first for obtaining pointwise underestimators for nonconvexities and second for approximating them with finitely many linear inequalities in an infinite-dimensional setting.

Approximations and Expansions↗

DOE OSTI2023

Projection pursuit adaptation on polynomial chaos expansions

Here, the present work addresses the issue of accurate stochastic approximations in high-dimensional parametric space using tools from uncertainty quantification (UQ). The basis adaptation method and its accelerated algorithm in polynomial chaos expansions (PCE) were recently proposed to construct low-dimensional approximations adapted to specific quantities of interest (QoI). The present paper addresses one difficulty with these adaptations, namely their reliance on quadrature point sampling, which limits the reusability of potentially expensive samples. Projection pursuit (PP) is a statistical tool to find the “interesting” projections in high-dimensional data and thus bypass the curse-of-dimensionality. In the present work, we combine the fundamental ideas of basis adaptation and projection pursuit regression (PPR) to propose a novel method to simultaneously learn the optimal low-dimensional spaces and PCE representation from given data. While this projection pursuit adaptation (PPA) can be entirely data-driven, the constructed approximation exhibits mean-square convergence to the solution of an underlying governing equation and thus captures the supports and probability distributions associated with the physics constraints. The proposed approach is demonstrated on a borehole problem and a structural dynamics problem, demonstrating the versatility of the method and its ability to discover low-dimensional manifolds with high accuracy with limited data. In addition, the method can learn surrogate models for different quantities of interest while reusing the same data set.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Ansatz-Free Hamiltonian Learning with Heisenberg-Limited Scaling

Learning the unknown interactions that govern a quantum system is crucial for quantum information processing, device benchmarking, and quantum sensing. The problem, known as Hamiltonian learning, is well understood under the assumption that interactions are local, but this assumption may not hold for arbitrary Hamiltonians. Previous methods all require high-order inverse polynomial dependency with precision, unable to surpass the standard quantum limit and reach the gold-standard Heisenberg-limited scaling. Whether Heisenberg-limited Hamiltonian learning is possible without prior assumptions about the interaction structures, a challenge we term ansatz-free Hamiltonian learning , remains an open question. In this work, we present a quantum algorithm to learn arbitrary sparse Hamiltonians without any structure constraints using only black-box queries of the system’s real-time evolution and minimal digital controls to attain Heisenberg-limited scaling in estimation error. Our method is also resilient to state-preparation-and-measurement errors, enhancing its practical feasibility. We numerically demonstrate our ansatz-free protocol for learning physical Hamiltonians and validating analog quantum simulations, benchmarking our performance against the state-of-the-art Heisenberg-limited learning approach. Moreover, we establish a fundamental trade-off between total evolution time and quantum control on learning arbitrary interactions, revealing the intrinsic interplay between controllability and total evolution-time complexity for any learning algorithm. These results pave the way for further exploration into Heisenberg-limited Hamiltonian learning in complex quantum systems under minimal assumptions, potentially enabling new benchmarking and verification protocols.

machine learning↗

DOE OSTI2020

Novel Geometric Operations for Linear Programming

This report summarizes the work performed under the project "Linear Programming in Strongly Polynomial Time." Linear programming (LP) is a classic combinatorial optimization problem heavily used directly and as an enabling subroutine in integer programming (IP). Specifically IP is the same as LP except that some solution variables must take integer values (e.g. to represent yes/no decisions). Together LP and IP have many applications in resource allocation including general logistics, and infrastructure design and vulnerability analysis. The project was motivated by the PI's recent success developing methods to efficiently sample Voronoi vertices (essentially finding nearest neighbors in high-dimensional point sets) in arbitrary dimension. His method seems applicable to exploring the high-dimensional convex feasible space of an LP problem. Although the project did not provably find a strongly-polynomial algorithm, it explored multiple algorithm classes. The new medial simplex algorithms may still lead to solvers with improved provable complexity. We describe medial simplex algorithms and some relevant structural/complexity results. We also designed a novel parallel LP algorithm based on our geometric insights and implemented it in the Spoke-LP code. A major part of the computational step is many independent vector dot products. Our parallel algorithm distributes the problem constraints across processors. Current commercial and high-quality free LP solvers require all problem details to fit onto a single processor or multicore. Our new algorithm might enable the solution of problems too large for any current LP solvers. We describe our new algorithm, give preliminary proof-of-concept experiments, and describe a new generator for arbitrarily large LP instances.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2026

Correlation of Surface Acoustic Wave (SAW) force myography sensor output with elbow joint torque

Accurate assessment of skeletal muscle forces and net joint torque is essential for preventing fatigue-related injuries, optimizing physical training, and monitoring disease progression in neuromuscular conditions. However, existing joint torque evaluation techniques are hindered by limited portability and high operational costs, confining their use to controlled laboratory or clinical settings. Despite substantial advances in wearable joint torque estimation systems, ongoing challenges such as power constraints, bulky wired setups, and susceptibility to environmental or motion artifacts underscore the urgent need for truly batteryless, wireless solutions deployable in real-world settings. This paper proposes a novel surface acoustic wave (SAW)-based force myography (FMG) system for noninvasive measurement of joint torque, validated against a gold-standard electromechanical dynamometer. The approach uses a single SAW sensor embedded in an armband to detect volumetric biceps brachii changes, with a second-order polynomial mapping sensor output and elbow angle to torque. Seven participants were tested in both isometric (15°–90°) and isokinetic (10°/s and 20°/s) supinated elbow flexion tasks. Under isometric conditions, subject-specific calibration achieved a normalized root-mean-square error (NRMSE) of 13.6% ± 6.0% and R 2 = 0.834 ± 0.180, while a group-level model yielded 14.4% ± 6.8% and 0.808 ± 0.208, respectively. For isokinetic trials, the group model produced an NRMSE of 24.1% ± 6.6% at 10°/s and 24.9% ± 08.9% at 20°/s, highlighting the feasibility of using a single-sensor SAW-FMG setup across different speeds. Because SAW devices support wireless, battery-free operation, the proposed system offers a pathway to portable, real-time monitoring for sports medicine, rehabilitation, and clinical diagnostics.

36 MATERIALS SCIENCE↗

DOE OSTI2022

PolyODENet: Deriving mass-action rate equations from incomplete transient kinetics data

Kinetics of a reaction network that follows mass-action rate laws can be described with a system of ordinary differential equations (ODEs) with polynomial right-hand side. However, it is challenging to derive such kinetic differential equations from transient kinetic data without knowing the reaction network, especially when the data are incomplete due to experimental limitations. We introduce a program, PolyODENet, toward this goal. Based on the machine-learning method Neural ODE, PolyODENet defines a generative model and predicts concentrations at arbitrary time. As such, it is possible to include unmeasurable intermediate species in the kinetic equations. Importantly, we have implemented various measures to apply physical constraints and chemical knowledge in the training to regularize the solution space. Here, using simple catalytic reaction models, we demonstrate that PolyODENet can predict reaction profiles of unknown species and doing so even reveal hidden parts of reaction mechanisms.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2022

PolyODENet

Wu, Qin [Brookhaven National Lab. (BNL), Upton, NY↗

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

High‐order cubature rules for tetrahedra

Summary In this paper, we construct new high‐order numerical integration schemes for tetrahedra, with positive weights and integration points that are in the interior of the domain. The construction of cubature rules is a challenging problem, which requires the solution of strongly nonlinear algebraic (moment) equations with side conditions given by affine inequality constraints. We present a robust algorithm based on a sequence of three modified Newton procedures to solve the constrained minimization problem. In the literature, numerical integration rules for the tetrahedron are available up to order p =15. We obtain integration rules for the tetrahedron from p =2 to p =20, which are computed using multiprecision arithmetic. For p ≤15, our approach provides integration rules that have the same or fewer number of integration points than existing rules; for p =16 to p =20, our rules are new. Numerical tests are presented that verify the polynomial‐precision of the cubature rules. Convergence studies are performed for the integration of exponential, rational, weakly singular and trigonometric test functions over tetrahedra with flat and curved faces. In all tests, improvements in accuracy is realized as p is increased, though in some cases nonmonotonic convergence is observed.

Jaśkowiec, Jan↗

DOE OSTI2022

Minkowski Functionals of SDSS-III BOSS: Hints of Possible Anisotropy in the Density Field?

We present measurements of the Minkowski functionals extracted from the SDSS-III BOSS catalogs. After defining the Minkowski functionals, we describe how an unbiased reconstruction of these statistics can be obtained from a field with masked regions and survey boundaries, validating our methodology with Gaussian random fields and mock galaxy snapshot data. From the BOSS galaxy data, we generate a set of four density fields in three dimensions corresponding to the northern and southern skies of LOWZ and CMASS catalogs, smoothing over large scales (Gaussian smoothing scale of 35 Mpc) such that the field is perturbatively non-Gaussian. We extract the Minkowski functionals from each data set separately, and measure their shapes and amplitudes by fitting a Hermite polynomial expansion. For the shape parameter of the Minkowski functional curves a0, that is related to the bispectrum of the field, we find that the LOWZ-South data presents a systematically lower value of a 0 = –0.080 ± 0.040 than its northern sky counterpart a 0 = 0.032 ± 0.024. Although the significance of this discrepancy is not very high, it potentially indicates some systematics in the data or that the matter density field exhibits anisotropy at low redshift. By assuming a standard isotropic flat ΛCDM cosmology, the amplitudes of the Minkowski functionals from the combination of northern and southern sky data give the constraints Ω c h 2 n s = 0.110 ± 0.006 and 0.111 ± 0.008 for CMASS and LOWZ, respectively, which is in agreement with the Planck ΛCDM best-fit Ω c h 2 n s = 0.116 ± 0.001.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2020

Calibration, measurement, and characterization of soil moisture dynamics in a central Amazonian tropical forest

Soil moisture plays a key role in hydrological, biogeochemical, and energy budgets of terrestrial ecosystems. Accurate soil moisture measurements in remote ecosystems such as the Amazon are difficult and limited because of logistical constraints. Time domain reflectometry (TDR) sensors are widely used to monitor soil moisture and require calibration to convert the TDR's dielectric permittivity measurement (K a ) to volumetric water content (θ v ). In this study, our objectives were to develop a field-based calibration of TDR sensors in an old-growth upland forest in the central Amazon, to evaluate the performance of the calibration, and then to apply the calibration to determine the dynamics of soil moisture content within a 14.2 -m-deep vertical soil profile. Depth-specific TDR calibration using local soils in a controlled laboratory setting yielded a novel K a –θ v third-degree polynomial calibration. The sensors were later installed to their specific calibration depth in a 14.2-m pit. The widely used K a –θ v relationship (Topp model) underestimated the site-specific θ v by 22–42%, indicating significant error in the model when applied to these well-structured, clay-rich tropical forest soils. The calibrated wet- and dry-season θ v data showed a variety of depth and temporal variations highlighting the importance of soil textural differentiation, root uptake depths, as well as event to seasonal precipitation effects. Data such as these are greatly needed for improving our understanding of ecohydrological processes within tropical forests and for improving models of these systems in the face of changing environmental conditions.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2021

The impact of new d(p,γ)3 rates on Big Bang Nucleosynthesis

We consider the effect on Big Bang Nucleosynthesis (BBN) of new measurements of the d(p,γ) 3 He cross section by the LUNA Collaboration. These have an important effect on the primordial abundance of D/H which is also sensitive to the baryon density at the time of BBN. We have re-evaluated the thermal rate for this reaction, using a world average of cross section data, which we describe with model-independent polynomials; our results are in good agreement with a similar analysis by LUNA. We then perform a full likelihood analysis combining BBN and Planck cosmic microwave background (CMB) likelihood chains using the new rate combined with previous measurements and compare with the results using previous rates. Concordance between BBN and CMB measurements of the anisotropy spectrum using the old rates was excellent. The predicted deuterium abundance at the Planck value of the baryon density was (D/H) BBN+CMB old = (2.57 ± 0.13) × 10 –5 which can be compared with the value determined from quasar absorption systems (D/H) obs = (2.55 ± 0.03) × 10 –5 . Using the new rates we find (D/H) BBN+CMB = (2.51 ± 0.11) × 10 –5 . We thus find consistency among BBN theory, deuterium and 4He observations, and the CMB, when using reaction rates fit in our data-driven approach. We also find that the new reaction data tightens the constraints on the number of relativistic degrees of freedom during BBN, giving the effective number of light neutrino species N ν = 2.880 ± 0.144 in good agreement with the Standard Model of particle physics. Lastly, we note that the observed deuterium abundance continues to be more precise than the BBN+CMB prediction, whose error budget is now dominated by d(d,n) 3 He and d(d,p) 3 H.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2021

Permutationally Invariant Polynomial Expansions with Unrestricted Complexity

A general strategy is presented for constructing and validating permutationally invariant polynomial (PIP) expansions for chemical systems of any stoichiometry. Demonstrations are made for three categories of gas-phase dynamics and kinetics: collisional energy-transfer trajectories for predicting pressure-dependent kinetics, three-body collisions for describing transient van der Waals adducts relevant to atmospheric chemistry, and nonthermal reactivity via quasiclassical trajectories. In total, 30 systems are considered with up to 15 atoms and 39 degrees of freedom. Permutational invariance is enforced in PIP expansions with as many as 13 million terms and 13 permutationally distinct atom types by taking advantage of petascale computational resources. The quality of the PIP expansions is demonstrated through the systematic convergence of in-sample and out-of-sample errors with respect to both the number of training data and the order of the expansion, and these errors are shown to predict errors in the dynamics for both reactive and nonreactive applications. Here, the parallelized code distributed as part of this work enables the automation of PIP generation for complex systems with multiple channels and flexible user-defined symmetry constraints and for automatically removing unphysical unconnected terms from the basis set expansions, all of which are required for simulating complex reactive systems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2025

Spinor representations for fields with any spin: Lorentz tensor basis for operators and covariant multipole decomposition

This paper discusses a framework to parametrize and decompose operator matrix elements for particles with higher spin (j > 1/2) using chiral representations of the Lorentz group, i.e. the (j, 0) and (0, j) representations and their parity-invariant direct sum. Unlike traditional approaches that require imposing constraints to eliminate spurious degrees of freedom, these chiral representations contain exactly the 2j + 1 components needed to describe a spin-j particle. The central objects in the construction are the t-tensors, which are generalizations of the Pauli four-vector σ μ for higher spin. For the generalized spinors of these representations, we demonstrate how the algebra of the t-tensors allows to formulate a generalization of the Dirac matrix basis for any spin. For on-shell bilinears, we show that a set consisting exclusively of covariant multipoles of order 0 ≤ m ≤ 2j forms a complete basis. We provide explicit expressions for all bilinears of the generalized Dirac matrix basis, which are valid for any spin value. As a byproduct of our derivations we present an efficient algorithm to compute the t-tensor matrix elements. The formalism presented here paves the way to use a more unified approach to analyze the non-perturbative QCD structure of hadrons and nuclei across different spin values, with clear physical interpretation of the resulting distributions as covariant multipoles.

Angular momentum of light↗