Search NASA⌕ Search

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.

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

At least 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Quantum Adiabatic Optimization with Rydberg Arrays: Localization Phenomena and Encoding Strategies

Quantum adiabatic optimization seeks to solve combinatorial problems using quantum dynamics, requiring the Hamiltonian of the system to align with the problem of interest. However, these Hamiltonians are often incompatible with the native constraints of quantum hardware, necessitating encoding strategies to map the original problem into a hardware-conformant form. While the classical overhead associated with such mappings is easily quantifiable and typically polynomial in problem size, it is much harder to quantify their overhead on the quantum algorithm, e.g., the transformation of the adiabatic timescale. In this work, we address this challenge on the concrete example of the encoding scheme proposed in [Nguyen , PRX Quantum , 010316 (2023)], which is designed to map optimization problems on arbitrarily connected graphs into Rydberg atom arrays. We consider the fundamental building blocks underlying this encoding scheme and determine the scaling of the minimum gap with system size along adiabatic protocols. Even when the original problem is trivially solvable, we find that the encoded problem can exhibit an exponentially closing minimum gap. We show that this originates from a quantum coherent effect, which gives rise to an unfavorable localization of the ground-state wave function. On the QuEra Aquila neutral atom machine, we observe such localization and its effect on the success probability of finding the correct solution to the encoded optimization problem. Finally, we propose quantum-aware modifications of the encoding scheme that avoid this quantum bottleneck and lead to an exponential improvement in the adiabatic performance. This highlights the crucial importance of accounting for quantum effects when designing strategies to encode classical problems onto quantum platforms. Published by the American Physical Society 2025

Bombieri, Lisa (ORCID:0009000950422897)↗
DOE OSTI2025

Operator origin of anomalous dimensions in de Sitter space

The late-time limit of the power spectrum for heavy (principal series) fields in de Sitter (dS) space yields a series of polynomial terms with complex scaling dimensions. Such scaling behavior is expected to result from an associated operator with a complex dimension. In a free theory, these complex dimensions are known to match the constraints imposed by unitarity on the space of states. Yet, perturbative corrections to the scaling behavior of operators are naively inconsistent with unitary evolution of the quantum fields in dS space. This paper demonstrates how to compute one-loop corrections to the scaling dimensions that appear in the two-point function from the field theory description in terms of local operators. We first show how to evaluate these anomalous dimensions using Mellin space, which has the feature that it naturally accommodates a scaleless regulator. We then explore the consequences for the soft de Sitter effective theory (SdSET) description that emerges in the long wavelength limit. Carefully matching between the UV and SdSET descriptions requires the introduction of novel nondynamical “operators” in the effective theory. This is not only necessary to reproduce results extracted from the Källén-Lehmann representation (that use the space of unitary states directly), but it is also required by general arguments that invoke positivity. Published by the American Physical Society 2025

Cohen, Timothy↗
DOE OSTI2020

Dual-cone variational calculation of the two-electron reduced density matrix

The computation of strongly correlated quantum systems is challenging because of its potentially exponential scaling in the number of electron configurations. Variational calculation of the two-electron reduced density matrix (2-RDM) without the many-electron wave function exploits the pairwise nature of the electronic Coulomb interaction to compute a lower bound on the ground-state energy with polynomial computational scaling. Recently, a dual-cone formulation of the variational 2-RDM calculation was shown to generate the ground-state energy, albeit not the 2-RDM, at a substantially reduced computational cost, especially for higher $\textit{N}$-representability conditions such as the T2 constraint. Here we generalize the dual-cone variational 2-RDM method to compute not only the ground-state energy but also the 2-RDM. The central result is that we can compute the 2-RDM from a generalization of the Hellmann-Feynman theorem. Specifically, we prove that in the Lagrangian formulation of the dual-cone optimization the 2-RDM is the Lagrange multiplier. Further, we apply the method to computing the energies and properties of strongly correlated electrons—including atomic charges, electron densities, dipole moments, and orbital occupations—in an illustrative hydrogen chain and the nitrogen-fixation catalyst FeMoco. The dual variational computation of the 2-RDM with T2 or higher N -representability conditions provides a polynomially scaling approach to strongly correlated molecules and materials with significant applications in atomic and molecular and condensed-matter chemistry and physics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Continuous-time look-ahead flexible ramp scheduling in real-time operation

This paper develops a novel continuous-time look-ahead optimization model for co-optimizing balancing energy and flexible ramp products in real-time power systems operation. In addition, a continuous-time day-ahead operation model is developed to commit and schedule an adequate subset of generating units for providing balancing energy and ramping requirements in real-time operation. The up and down flexible ramp products are defined as continuous-time decision trajectories that continuously supply the real-time up and down ramping requirements of the system. The deliverability of flexible ramp products is secured through reserving the respective power requirements in generation capacity constraints of generating units. A function space solution method is proposed to reduce the dimensionality of day-ahead and real-time models through projecting them into finite-dimensional function spaces spanned by Bernstein polynomials, where the real-time operation decisions are modeled with a higher accuracy level than day-ahead decisions. Simulations are conducted on the IEEE-RTS system using CAISO load data, and the numerical results showcase the effectiveness of the proposed model in supplying the energy and flexible ramp requirements and avoiding ramping scarcity in the system, while reducing the operation costs.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2023

Computer-controlled finishing via dynamically constraint position-velocity-time scheduler

In a Computer Numerical Controlled (CNC) finishing process, the target material removal from an optical surface is guided by the convolution between the influence function of a machine tool and its dwell time at certain points over the surface. To reduce dynamics stressing and increase machining efficiency, the dwell time must be converted to varying velocities, which are the actual inputs to the machine tool controller. Conventionally, the conversion assumed constant acceleration and relied on linear motion interpolation, which caused discontinuities in velocities. This unsmooth motion affects the material removal distribution, and, thus, the accuracy of the finished surface shape. Many modern CNC machines support the smoother, cubic-polynomial interpolated Position-Velocity-Time (PVT) motion mode; however, the conventional scheduler may fail to provide suitable velocities for the PVT. Here in this study answers this challenge by proposing a novel PVT-based velocity scheduler that achieves smooth motion while considering CNC dynamic limits. Firstly, the principle of the PVT is explained, and the PVT-based velocity scheduler is formulated. Secondly, a quadratic programming is used to optimize the velocities by imposing the CNC dynamic constraints and the C 1 continuities (zeroth and first derivatives are continuous) simultaneously. Thirdly, the smoothness and accuracy of the scheduled velocities are studied on different kinds of tool paths via simulation. Finally, a sub-0.3 nm level surface finishing experiment using ion beam figuring is demonstrated to verify the feasibility of the proposed method. The PVT-based scheduler and simulator code is open-sourced.

36 MATERIALS SCIENCE↗
DOE OSTI2026

Quantum simulation of QED in Coulomb gauge

A recent work considered quantum simulation of Quantum Electrodynamics on a lattice in the Coulomb gauge with gauge degrees of freedom represented in the occupation basis in momentum space. In this work, we consider the more efficient representation of the gauge degrees of freedom in field basis in position space and develop a quantum algorithm for real-time simulation. We show that the continuum Coulomb gauge Hamiltonian is equivalent to the temporal gauge Hamiltonian when acting on physical states consisting of fermion and transverse gauge fields. The Coulomb gauge Hamiltonian is discretized by using the Green’s function of the discrete Laplacian operator under the Dirichlet boundary conditions. Both the continuum Coulomb gauge Hamiltonian and the discretized one proposed here guarantee that the unphysical longitudinal gauge fields are decoupled and commute with the corresponding Hamiltonian. Thus there is no need to impose any constraint. The local gauge field basis and the canonically conjugate variable basis are swapped efficiently using the quantum Fourier transform. We prove that the qubit cost to represent physical states and the gate count for real-time simulation scale polynomially with the lattice size, energy, time, accuracy, and Hamiltonian parameters in lattice units. The gate cost here for implementing the time evolution of the gauge field is reduced at least by a factor on the order of 10 8 for modest lattice size and accuracy level compared with the previous work.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Topological Effects Near Order–Disorder Transitions in Symmetric Diblock Copolymer Melts

The effects of polymer chain topology on the order–disorder transition of symmetric AB diblock copolymer melts are studied using coarse-grained molecular dynamics simulations. Specifically, we compared chain conformations near the lamellar-disordered transition in melts of symmetric (i.e., 50–50) AB diblock copolymers of linear chains, rings, and trefoil knots at the same chain lengths. The order (lamellar)–disorder transition temperature and the domain sizes both shifted to lower values with the introduction of topological constraints, leading to the following sequence: linear chains > rings > trefoil knots. Furthermore, investigation of the polymer chain conformations in terms of their radii of gyration, their writhe values (a measure for the degree of intertwining of a chain around itself), and their Jones polynomials (a method to measure entanglement of curves) showed that linear chains and rings remained stretched, while knots were stretched and tightened in disordered melts close to the lamellar-disorder transition. This work highlights chain topology as an important factor in affecting microphase separation in block copolymers.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Recent Advances of PyROS: A Pyomo Solver for Nonconvex Two-Stage Robust Optimization in Process Systems Engineering

The document presents recent algorithmic and implementation advances of the two-stage robust optimization (RO) solver PyROS, and a benchmarking study which demonstrates the utility of PyROS for two-stage RO problems. The advances include extensions of the scope of PyROS to models with uncertain variable bounds, improvements to the initializations of the subproblems used by the underlying cutting set algorithm, and extensions of the uncertainty set interfaces. The benchmarking study is performed on a library of over 8,500 instances, with variations in the nonlinearities, degree-of-freedom partitioning, uncertainty sets, and polynomial decision rule approximations. An amine-based CO2 capture case study is presented to demonstrate the utility of PyROS for large-scale process models. Overall, the results highlight the effectiveness of PyROS for obtaining robust solutions to optimization problems with uncertain equality constraints.

Sherman, Jason↗
DOE OSTI2022

U-splines: Splines over unstructured meshes

U-splines are a novel approach to the construction of a spline basis for representing smooth objects in Computer-Aided Design (CAD) and Computer-Aided Engineering (CAE). A spline is a piecewise-defined function that satisfies continuity constraints between adjacent cells in a mesh. U-splines differ from existing spline constructions, such as Non-Uniform Rational B-splines (NURBS), subdivision surfaces, T-splines, and hierarchical B-splines, in that they can accommodate local variation in cell size, polynomial degree, and smoothness simultaneously over more varied mesh configurations. Mixed cell types (e.g., triangle and quadrilateral cells in the same mesh) and T-junctions are also supported, although the continuity of interfaces with triangle and tetrahedral cells is limited in the present work. The U-spline algorithm introduces a new technique for using local null space solutions to construct basis functions for the global spline null space problem. The U-spline construction is presented for curves, surfaces, and volumes with higher dimensional generalizations possible. Lastly, a set of requirements are given to ensure that the U-spline basis is positive, forms a partition of unity, is complete, and is locally linearly independent.

42 ENGINEERING↗
DOE OSTI2023

On the Approximability of Random-Hypergraph MAX-3-XORSAT Problems with Quantum Algorithms

Constraint satisfaction problems are an important area of computer science. Many of these problems are in the complexity class NP which is exponentially hard for all known methods, both for worst cases and often typical. Fundamentally, the lack of any guided local minimum escape method ensures the hardness of both exact and approximate optimization classically, but the intuitive mechanism for approximation hardness in quantum algorithms based on Hamiltonian time evolution is poorly understood. We explore this question using the prototypically hard MAX-3-XORSAT problem class. We conclude that the mechanisms for quantum exact and approximation hardness are fundamentally distinct. We qualitatively identify why traditional methods such as quantum adiabatic optimization are not good approximation algorithms. We propose a new spectral folding optimization method that does not suffer from these issues and study it analytically and numerically. We consider random rank-3 hypergraphs including extremal planted solution instances, where the ground state satisfies an anomalously high fraction of constraints compared to truly random problems. We show that, if we define the energy to be $E = N_{unsat}-N_{sat}$, then spectrally folded quantum optimization will return states with energy $E \leq A E_{GS}$ (where $E_{GS}$ is the ground state energy) in polynomial time, where conservatively, $A \simeq 0.6$. We thoroughly benchmark variations of spectrally folded quantum optimization for random classically approximation-hard (planted solution) instances in simulation, and find performance consistent with this prediction. We do not claim that this approximation guarantee holds for all possible hypergraphs, though our algorithm's mechanism can likely generalize widely. These results suggest that quantum computers are more powerful for approximate optimization than had been previously assumed.

Kapit, Eliot↗
DOE OSTI2021

Practical algorithms for multivariate rational approximation

We present two approaches for computing rational approximations to multivariate functions, motivated by their effectiveness as surrogate models for high-energy physics (HEP) applications. Our first approach builds on the Stieltjes process to efficiently and robustly compute the coefficients of the rational approximation. Our second approach is based on an optimization formulation that allows us to include structural constraints on the rational approximation (in particular, constraints demanding the absence of singularities), resulting in a semi-infinite optimization problem that we solve using an outer approximation approach. We present results for synthetic and real-life HEP data, and we compare the approximation quality of our approaches with that of traditional polynomial approximations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Distributed Transient Safety Verification via Robust Control Invariant Sets: A Microgrid Application

Modern safety-critical energy infrastructures are increasingly operated in a hierarchical and modular control framework which allows for limited data exchange between the modules. In this context, it is important for each module to synthesize and communicate constraints on the values of exchanged information in order to assure system-wide safety. To ensure transient safety in inverter-based microgrids, we develop a set invariance-based distributed safety verification algorithm for each inverter module. Applying Nagumo's invariance condition, we construct a robust polynomial optimization problem to jointly search for safety-admissible set of control set-points and design parameters, under allowable disturbances from neighbors. We use sum-of-squares (SOS) programming to solve the verification problem and we perform numerical simulations using grid-forming inverters to illustrate the algorithm.

Bouvier, Jean-Baptiste H.↗
DOE OSTI2024

Bounding irrelevant operators in the 3d Gross-Neveu-Yukawa CFTs

We perform a numerical bootstrap study of scalar operators in the critical 3d Gross-Neveu-Yukawa models, a family of conformal field theories containing N Majorana fermions in the fundamental representation of an O(N) global symmetry. We compute rigorous bounds on the scaling dimensions of the next-to-lowest parity-even and parity-odd singlet scalars at N = 2, 4, and 8. All of these dimensions have lower bounds greater than 3, implying that there are only two relevant singlet scalars and placing constraints on the RG flow structure of these theories.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
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 OSTI2025

Coupling Approaches with Non-matching Grids for Classical Linear Elasticity and Bond-based Peridynamic Models in 1D

Local-nonlocal coupling approaches provide a means to combine the computational efficiency of local models and the accuracy of nonlocal models. To facilitate the coupling of the two models, non-matching grids are often desirable as nonlocal grids usually require a finer resolution than local grids. In that case, it is often convenient to resort to interpolation operators so that models can exchange information in the overlap regions when nodes from the two grids do not coincide. This paper studies three existing coupling approaches, namely 1) a method that enforces matching displacements in an overlap region, 2) a variant that enforces a constraint on the stresses instead, and 3) a method that considers a variable horizon in the vicinity of the interfaces. Further, the effect of the interpolation order and of the grid ratio on the performance of the three coupling methods with non-matching grids is carefully studied on one-dimensional examples using polynomial manufactured solutions. The numerical results show that the degree of the interpolants should be chosen with care to avoid introducing additional modeling errors, or simply minimize these errors, in the coupling approach.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

An Iterative Response-Surface-Based Approach for Chance-Constrained AC Optimal Power Flow Considering Dependent Uncertainty

A modern power system is characterized by a stochastic variation of the loads and an increasing penetration of renewable energy generation, which results in large uncertainties in its states. These uncertainties bring formidable challenges to the power system planning and operation process. To address these challenges, we propose a cost-effective, iterative response-surface-based approach for the chance-constrained AC optimal power-flow problem that aims to ensure the secure operation of the power systems considering dependent uncertainties. Starting from a stochastic-sampling-based framework, we first utilize the copula theory to simulate the dependence among multivariate uncertain inputs. Then, to reduce the prohibitive computational time required in the traditional Monte-Carlo method, we propose, instead of using the original complicated power-system model, to rely on a polynomial-chaos-based response surface. This response surface allows us to efficiently evaluate the time-consuming power-system model at arbitrary distributed sampled values with a negligible computational cost. This further enables us to efficiently conduct an online stochastic testing for the system states that not only screens out the statistical active constraints, but also assists in a better design of the tightened bounds without using any Gaussian or symmetric assumption. Finally, an iterative procedure is executed to fine-tune the optimal solution that better satisfies a predefined probability. The simulations conducted in multiple test systems demonstrate the excellent performance of the proposed method.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2023

Day-ahead continuous double auction-based peer-to-peer energy trading platform incorporating trading losses and network utilisation fee

Integration of distributed energy resources, such as photovoltaic solar (PV), introduces new opportunities to establish local energy market frameworks to improve renewable energy utilisation in residential sectors. Such peer-to-peer (P2P) energy trading refers to a local market structure where customers (and prosumers) interact to share excess PV generation to enhance the individual and community social welfare. In this work, a day-ahead continuous double auction (CDA)-based P2P market structure considering network losses and network utilisation fees was designed. Day-ahead PV energy is modelled using fractional integral polynomials and the output is forecasted using an autoregressive integrated moving average model for each market interval. Based on the customer load and excess PV energy, the CDA market is cleared using a bid/ask matching mechanism. The performance of the P2P market was evaluated by computing different welfare metrics while analysing the effect of network constraints. The results show that the designed CDA-based P2P market structure increases the social welfare of all participants by an average of 17.75% compared to the baseline for the presented cases. Moreover, the impact of the forecasting error between the day-ahead and real-time market was also quantified.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2026

Analog and symbolic computation through the Koopman framework

We develop a Koopman operator framework for studying the computational structure of dynamical systems. Specifically, we show that the resolvent of the Koopman operator provides a natural abstraction of halting, yielding a ‘Koopman halting problem’ that is recursively enumerable in general. For symbolic systems, such as those defined on Cantor space, this operator formulation captures reachability between clopen sets, while for equicontinuous systems we prove that the Koopman halting problem is decidable. Our framework demonstrates that absorbing (halting) states in coarse-grained finite automata correspond to Koopman eigenfunctions with eigenvalue one, while cycles in the transition graph impose spectral constraints associated with periodic dynamics. These results provide a unifying perspective on computation in symbolic and analog systems, showing how computational universality is reflected in operator spectra, invariant subspaces, and algebraic structures. Beyond symbolic dynamics, this operator-theoretic lens opens pathways to analyze the computational properties of a broader class of dynamical systems, including polynomial and analog models, and suggests that computational hardness may admit dynamical signatures in terms of Koopman spectral structure.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗