SEARCH · Search NASA

Results for “integer”

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 19 records

All sources NASA NTRS DOE OSTI

DOE OSTI2026

Surrogate model for third-integer resonance extraction at the Fermilab Delivery Ring

We present an ongoing work in which a surrogate model is being developed to reproduce the response dynamics of the third-integer resonant extraction process in the Delivery Ring (DR) at Fermilab. This is in pursuit of smoothly extracting circulating beam to the Mu2e Experiment’s production target, whereby the goal is to extract a uniform slice of the circulating 1e12 protons in the DR over 25,000 turns (43 ms). The DR contains 3 harmonic sextupoles that excite a third-integer resonance and three fast, tune-ramping quadrupole magnets that drive the horizontal tune towards the 29/3 resonance. In our initial work, the surrogate model trains on a semi-analytical simulation provided in the same format as live data. Using Reinforcement Learning (and other potential ML methods), the trained surrogate acts as the “environment” in which a simple ML control agent could learn to dynamically adjust the quadrupole ramp at 430 break points within the 43 microsecond spill window. The controller will be hosted on a dedicated Arria 10 FPGA. In this work, we report the accuracy and fidelity of the surrogate model in comparison to the response dynamics of the physics simulator.

Narayanan, Aakaash [Fermilab]↗

DOE OSTI2023

Incremental Interval Assignment by Integer Linear Algebra with Improvements

Interval Assignment (IA) is the problem of selecting the number of mesh edges (intervals) for each curve for conforming quad and hex meshing. The intervals x is fundamentally integer-valued. Many other approaches perform numerical optimization then convert a floating-point solution into an integer solution, which is slow and error prone. We avoid such steps: we start integer, and stay integer. Incremental Interval Assignment (IIA) uses integer linear algebra (Hermite normal form) to find an initial solution to the meshing constraints, satisfying the integer matrix equation Solving for reduced row echelon form provides integer vectors spanning the nullspace of A. Here we add vectors from the nullspace to improve the initial solution, maintaining Ax = b Heuristics find good integer linear combinations of nullspace vectors that provide strict improvement towards variable bounds or goals. IIA always produces an integer solution if one exists. In practice we usually achieve solutions close to the user goals, but there is no guarantee that the solution is optimal, nor even satisfies variable bounds, e.g. has positive intervals. We describe several algorithmic changes since first publication that tend to improve the final solution. The software is freely available.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

Half‐Integer Topological Charge Polarization of Quasi‐Dirac Bound States in the Continuum

Abstract The non‐trivial polarization topology of bound states in the continuum (BICs) provides new strategies in nanophotonics. The polarization topology depends on the geometric parameters and energy‐momentum dispersion of the system and can be engineered to add specific functionalities for light molding. Herein, such a possibility is investigated by studying the topology of the polarization states associated with the optical field radiated by BICs when Dirac‐cone‐degeneracy is lifted. The opening of a pseudogap in the Dirac cone dispersion of square‐lattice dielectric photonic crystal slabs is achieved by tuning the slab thickness. First, the emergence of half‐integer topological charges without the requirement of BIC annihilation is theoretically shown, which instead occurs when in‐plane inversion symmetry is broken. Then, using spin‐to‐orbital angular momentum conversion, the theory of half‐integer topological charges mediated by BICs is demonstrated and experimentally proved. The same device is able to give rise to vortices with different orbital angular momentum depending on the way it is illuminated, thus improving the potential of optical multiplexing. In addition, the additive character of the topology‐induced phase‐vortex generation is finally demonstrated for both integer and half‐integer charges using also vortex states as input beams, which is of relevance for information delivery.

36 MATERIALS SCIENCE↗

DOE OSTI2024

Density Dependence of the Phases of the v = 1 Integer Quantum Hall Plateau in Low Disorder Electron Gases

Recent magnetotransport measurements in low-disorder electron systems confined to GaAs/AlGaAs samples reveal that the v = 1 integer quantum Hall plateau is broken into three distinct regions. These three regions are associated with two phases with different types of bulk localization: the Anderson insulator is due to random quasiparticle localization, and the integer quantum Hall Wigner solid is due to pinning of a stiff quasiparticle lattice. Universal properties of the v = 1 plateau are highlighted: the structure of the stability diagram, the nonmonotonic dependence of the activation energy on the filling factor, and the alignment of features of the activation energy with features of the stability regions of the different phases are found to be similar in three samples spanning a wide range of electron densities. Quantitative differences between the samples are also discussed, such as the dependence of the onset temperature and the activation energy of the integer quantum Hall Wigner solid on the electron density. The findings provide insights into the localization behavior along the v = 1 integer quantum Hall plateau in the low disorder regime.

Anderson insulator↗

DOE OSTI2025

Domain Decomposition for Integer Optimal Control with Total Variation Regularization

Total variation integer optimal control problems admit solutions and necessary optimality conditions via geometric variational analysis. In spite of the existence of said solutions, algorithms which solve the discretized objective suffer from high numerical cost associated with the combinatorial nature of integer programming. Hence, such methods are often limited to small and medium-sized problems. We propose a globally convergent, coordinate descent–inspired algorithm that allows tractable subproblem solutions restricted to a partition of the domain. Our decomposition method solves relatively small trust-region subproblems that modify the control variable on a subdomain only. Given nontrivial subdomain overlap, we prove that a global first-order necessary optimality condition is equivalent to a first-order necessary optimality condition per subdomain. We additionally show that a sufficient decrease is achieved on a single subdomain by way of a trust-region subproblem solver using geometric measure–theoretic arguments, which we integrate with a greedy patch selection to prove convergence of our algorithm. In conclusion, we demonstrate the practicality of our algorithm on a benchmark large-scale, PDE-constrained integer optimal control problem and find that our method is faster than the state of the art.

domain decomposition↗

DOE OSTI2023

Emergence of competing electronic states from non-integer nuclear charges

Understanding many-electron phenomena with competing near-degenerate electronic states is of fundamental importance to chemistry and condensed matter physics. One of the most significant challenges for exploring such many-electron phenomena is the necessity for large system sizes in order to realize competing states, far beyond those practical for first-principles methods. Here, we show how allowing non-integer nuclear charges expands the space of computationally tractable electron systems that host competing electronic states. The emergence of competing electronic states from non-integer nuclear charges is exemplified in the simple 2-electron H 2 molecule and used to examine the microscopic structure of doped quasi-1D cuprate chains, showing how non-integer nuclear charges can open a window for first-principles calculations of difficult many-electron phenomena.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2023

Half-Integer Conductance Plateau at the ν = 2 / 3 Fractional Quantum Hall State in a Quantum Point Contact

The v = 2/3 fractional quantum Hall state is the hole-conjugate state to the primary Laughlin v = 1/3 state. Here, we investigate transmission of edge states through quantum point contacts fabricated on a GaAs/AlGaAs heterostructure designed to have a sharp confining potential. When a small but finite bias is applied, we observe an intermediate conductance plateau with G = 0.5⁢(e 2 /ℎ). This plateau is observed in multiple QPCs, and persists over a significant range of magnetic field, gate voltage, and source-drain bias, making it a robust feature. Using a simple model that considers scattering and equilibration between counterflowing charged edge modes, we find this half-integer quantized plateau to be consistent with full reflection of an inner counterpropagating -1/3 edge mode while the outer integer mode is fully transmitted. In a QPC fabricated on a different heterostructure which has a softer confining potential, we instead observe an intermediate conductance plateau at G = (1/3)⁢(e 2 /ℎ). These results provide support for a model at v = 2/3 in which the edge transitions from a structure having an inner upstream -1/3 charge mode and outer downstream integer mode to a structure with two downstream 1/3 charge modes when the confining potential is tuned from sharp to soft and disorder prevails.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2025

Chern Insulators at Integer and Fractional Filling in Moiré Pentalayer Graphene

The advent of moiré platforms for engineered quantum matter has led to discoveries of integer and fractional quantum anomalous Hall effects, with predictions for correlation-driven topological states based on electron crystallization. Here, we report an array of trivial and topological insulators formed in a moiré lattice of rhomobohedral pentalayer graphene (R5G). At a doping of one electron per moiré unit cell ( ν = 1 ), we see a correlated insulator with a Chern number that can be tuned between C = 0 and + 1 by an electric displacement field. This is accompanied by a series of additional Chern insulators with C = + 1 originating from fractional fillings of the moiré lattice— ν = 1 / 4 , 1 / 3 , and 2 / 3 —associated with the formation of moiré-driven topological electronic crystals. At ν = 2 / 3 the system exhibits an integer quantum anomalous Hall effect at zero magnetic field, but further develops hints of an incipient C = 2 / 3 fractional Chern insulator in a modest field. Our results establish moiré R5G as a fertile platform for studying the competition and potential intertwining of integer and fractional Chern insulators. Published by the American Physical Society 2025

Waters, Dacen (ORCID:0000000335880039)↗

DOE OSTI2023

Piecewise linear approximation with minimum number of linear segments and minimum error: A fast approach to tighten and warm start the hierarchical mixed integer formulation

In several areas of economics and engineering, it is often necessary to fit discrete data points or approximate nonlinear functions with continuous functions. Piecewise linear (PWL) functions are a convenient way to achieve this. PWL functions can be modeled in mathematical problems using only linear and integer variables. Moreover, there is a computational benefit in using PWL functions that have the least possible number of segments. This work proposes a novel hierarchical mixed integer linear programming (MILP) formulation that identifies a continuous PWL approximation with minimum number of linear segments for a given target maximum error. The proposed MILP formulation also identifies the solution with the least maximum error among the solutions with minimum number of segments. Then, this work proposes a fast iterative algorithm that identifies non necessarily continuous PWL approximations by solving O(S log N) linear programming (LP) problems, where N is the number of data points and S is the minimum number of segments in the non necessarily continuous case. This work demonstrates that tight bounds for the MILP problem can be derived from these approximations. Next, a fast algorithm is introduced to transform a non necessarily continuous PWL approximation into a continuous one. Finally, the tight bounds and the continuous PWL approximations are used to tighten and warm start the MILP problem. The tightened formulation is shown in experimental results to be more efficient, especially for large data sets, with a solution time that is up to two orders of magnitude less than the existing literature.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Alternative mixed integer linear programming optimization for joint job scheduling and data allocation in grid computing

This paper presents a novel approach to the joint optimization of job scheduling and data allocation in grid computing environments. We formulate this joint optimization problem as a mixed integer quadratically constrained program. To tackle the nonlinearity in the constraint, we alternatively fix a subset of decision variables and optimize the remaining ones via Mixed Integer Linear Programming (MILP). We solve the MILP problem at each iteration via an off-the-shelf MILP solver. Our experimental results show that our method significantly outperforms existing heuristic methods, employing either independent optimization or joint optimization strategies. We have also verified the generalization ability of our method over grid environments with various sizes and its high robustness to the algorithm setting.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

Learning Symbolic Expressions: Mixed-Integer Formulations, Cuts, and Heuristics

Here, in this paper, we consider the problem of learning a regression function without assuming its functional form. This problem is referred to as symbolic regression. An expression tree is typically used to represent a solution function, which is determined by assigning operators and operands to the nodes. Cozad and Sahinidis propose a nonconvex mixed-integer nonlinear program (MINLP), in which binary variables are used to assign operators and nonlinear expressions are used to propagate data values through nonlinear operators, such as square, square root, and exponential. We extend this formulation by adding new cuts that improve the solution of this challenging MINLP. We also propose a heuristic that iteratively builds an expression tree by solving a restricted MINLP. We perform computational experiments and compare our approach with a mixed-integer program–based method and a neural network–based method from the literature.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Optimal sizing of battery energy storage systems for peak shaving and demand response using a degradation-aware Bayesian Optimization-Mixed-Integer Linear Programming framework

The increasing integration of renewable energy and rising electricity demand highlight the importance of battery energy storage systems for peak shaving and demand response. Unlike prior approaches that overlook operational impacts on degradation, this study proposes a Bayesian Optimization–Mixed Integer Linear Programming framework for optimal battery energy storage system sizing. In this framework, Mixed Integer Linear Programming determines short-term scheduling while a calibrated electrochemical model iteratively evaluates degradation. The central hypothesis is that the framework can efficiently identify optimal sizes that yield realistic and economically robust outcomes. The method is tested across three scenarios: peak shaving, peak shaving with energy-reduction demand response, and peak shaving with power-reduction demand response. Results show that the framework converge to the optimum within 20 iterations out of 150 possible sizes. Under baseline conditions, the framework consistently selects the smallest feasible system, minimizing unnecessary degradation costs from oversized storage. Sensitivity analyses reveal that larger systems are favored as demand rates or incentives increase. Comparisons of demand response programs indicate that power-reduction demand response offers greater economic benefits than energy-reduction demand response, although demand savings from peak shaving remain the dominant contributor to overall performance. This study demonstrates that the proposed framework balances computational tractability with degradation fidelity, identifies critical economic thresholds for investment, and offers a practical, flexible tool to guide industrial stakeholders in cost-effective battery energy storage system deployment.

Batteries↗

DOE OSTI2026

Navigating Large Chemical Spaces Using Graph Theory and Integer Programming

Navigating and analyzing large chemical spaces are necessary to accelerate the design and discovery of new molecules and chemical processes. In this work, we introduce a computational framework that integrates graph theory and integer programming to enable the efficient navigation of large chemical spaces. Our framework represents the chemical space as a graph, wherein nodes represent molecules and edges represent the degree of similarity or connectivity based on domain-specific information. Using the graph representation, we identify representative molecules by computing the so-called minimum dominating set (MDS), which in our context is the minimum set of molecules that is connected to all other molecules. We present a suite of solution strategies for the MDS problem including heuristic and rigorous integer programming (IP) approaches. We show that these approaches allow us to capture physicochemical properties and domain-specific logic and constraints, facilitating the identification of molecules with the target properties. We demonstrate the effectiveness of the proposed approach by navigating the chemical space of per- and polyfluoroalkyl substances (PFAS); this comprises approximately 15,000 molecular structures. We compare our framework against traditional dimensionality reduction and clustering methods such as t-SNE and K-means clustering.

Chemical structure↗

DOE OSTI2023

A Mixed integer linear programming‐based distributed energy management for networked microgrids considering network operational objectives and constraints

Abstract Mixed integer linear programming (MILP)–based distributed energy management for networked microgrids embedded modern distribution systems is proposed. Considering the diverse ownership of microgrids, distributed energy resources (DERs) that interface directly with utilities and responsive loads, an alternating direction method of multipliers–based distributed framework was formulated for the scheduling of networked microgrids embedded modern distribution systems by adjusting nodal price signals iteratively. In addition, to make the formulated optimization problems resolvable through more accessible and popular MILP solvers, different linearisation techniques were employed to transform the nonlinear terms into linear or mixed integer linear formats. The proposed MILP‐based distributed method preserves all participants' autonomy (e.g., microgrids, DERs that interface directly with utilities and responsive loads), while incentivising them to actively participate in the distribution system operation with price signals. The proposed method is validated with results of numerical simulation using a modern distribution system consisting of multiple networked microgrids, DERs that interface directly with utilities, as well as responsive loads.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2023

Observation of half-integer Shapiro steps in graphene Josephson junctions

We study quantum transport and AC Josephson effect of hexagonal boron nitride encapsulated graphene (BGB) Josephson junctions (JJs). Our experiments reveal the emergence of the half-integer Shapiro steps in the n-type regime with high electron carrier densities. We attribute this observation to the gate-tunable transmission probability of the graphene junction. Furthermore, our numerical simulations are consistent with the appearance of half-integer Shapiro steps at high transparency, which suggests a skewed current phase relationship in the graphene JJ.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

DOE OSTI2026

Third integer resonant extraction transit time simulation studies

In this work, we present the investigation of transit time of particles in the non-linear third-integer resonant extraction process. Transit time is defined as the number of turns a particle takes to get extracted once it is in the unstable region in the phase space, i.e., outside the triangular separatrix in case of third-integer resonance. The study of transit time is important because transit time directly contributes to the beam response time during resonant extraction and thus knowing it apriori would be practically useful in designing of the extraction system. In this work, we shall investigate the analytical derivation of the transit time of particles (to the first order Kobayashi Hamiltonian) in different parts of the phase space distribution and compare against the analytical results. We also compare the simulation result of the transit time of particles (with higher statistics) for the static as well as dynamic extraction conditions cases, particularly in the context of resonant extraction parameters for Mu2e experiment at Fermilab.

Narayanan, Aakaash [Fermilab]↗

DOE OSTI2025

Third Integer Resonant Extraction Transit Time Simulation Studies

Narayanan, Aakaash [Fermilab] (ORCID:0000000157944↗

DOE OSTI2025

Surrogate Modelling of 3rd Integer Resonant Extraction at Fermilab Delivery Ring

We present an ongoing work in which a surrogate model is being developed to reproduce the response dynamics of the third-integer resonant extraction process in the Delivery Ring (DR) at Fermilab. This effort is in pursuit of smoothly extracting circulating beam to the Mu2e Experiment s production target, wherein the goal is to extract a uniform slice of the circulating $1e12$ protons in the DR over 25,000 turns (43~ms). The DR contains 3 harmonic sextupoles which excite a third-integer resonance as well as three fast, tune-ramping quadrupole magnets which drive the horizontal tune towards the $29/3$ resonance. In our initial work the surrogate model trains on a semi-analytical simulation provided in the same format as live data. Using Reinforcement Learning (and other potential ML methods), the trained surrogate acts as the environment in which a simple ML control agent could learn to dynamically adjust the quadrupole ramp at 430 break points within the 43 microsecond spill window. The control agent will be hosted on a dedicated Arria 10 FPGA, introducing its own requirements on control agent architecture. In this work we report the accuracy and fidelity of surrogate models in comparison to the response dynamics of the physics simulator.

Narayanan, Aakaash [Fermilab] (ORCID:0000000157944↗