SEARCH · Engineering Papers

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↗

NASA NTRS1999

Fast Integer Ambiguity Resolution for GPS Attitude Determination

In this paper, a new algorithm for GPS (Global Positioning System) integer ambiguity resolution is shown. The algorithm first incorporates an instantaneous (static) integer search to significantly reduce the search space using a geometric inequality. Then a batch-type loss function is used to check the remaining integers in order to determine the optimal integer. This batch function represents the GPS sightline vectors in the body frame as the sum of two vectors, one depending on the phase measurements and the other on the unknown integers. The new algorithm has several advantages: it does not require an a-priori estimate of the vehicle's attitude; it provides an inherent integrity check using a covariance-type expression; and it can resolve the integers even when coplanar baselines exist. The performance of the new algorithm is tested on a dynamic hardware simulator.

Lightsey, E. Glenn↗

NASA NTRS1986

Discrete Dirac equation on a finite half-integer lattice

The formulation of the Dirac equation on a discrete lattice with half-integer spacing and periodic boundary conditions is investigated analytically. The importance of lattice formulations for problems in field theory and quantum mechanics is explained; the concept of half-integer Fourier representation is introduced; the discrete Dirac equation for the two-dimensional case is derived; dispersion relations for the four-dimensional case are developed; and the spinor formulation for the Dirac fields on the half-integer lattice and the discrete time variable for the four-dimensional time-dependent Dirac equation are obtained. It is argued that the half-integer lattice, because it takes the Dirac Lagrangian into account, is more than a mere relabeling of the integer lattice and may have fundamental physical meaning (e.g., for the statistics of fermions). It is noted that the present formulation does not lead to species doubling, except in the continuum limit.

Smalley, L. L.↗

NASA NTRS1998

A Polynomial Time, Numerically Stable Integer Relation Algorithm

Let x = (x1, x2...,xn be a vector of real numbers. X is said to possess an integer relation if there exist integers a(sub i) not all zero such that a1x1 + a2x2 + ... a(sub n)Xn = 0. Beginning in 1977 several algorithms (with proofs) have been discovered to recover the a(sub i) given x. The most efficient of these existing integer relation algorithms (in terms of run time and the precision required of the input) has the drawback of being very unstable numerically. It often requires a numeric precision level in the thousands of digits to reliably recover relations in modest-sized test problems. We present here a new algorithm for finding integer relations, which we have named the "PSLQ" algorithm. It is proved in this paper that the PSLQ algorithm terminates with a relation in a number of iterations that is bounded by a polynomial in it. Because this algorithm employs a numerically stable matrix reduction procedure, it is free from the numerical difficulties, that plague other integer relation algorithms. Furthermore, its stability admits an efficient implementation with lower run times oil average than other algorithms currently in Use. Finally, this stability can be used to prove that relation bounds obtained from computer runs using this algorithm are numerically accurate.

Ferguson, Helaman R. P.↗

NASA NTRS2010

Using Integer Clocks to Verify the Timing-Sync Sensor Network Protocol

We use the UPPAAL model checker for Timed Automata to verify the Timing-Sync time-synchronization protocol for sensor networks (TPSN). The TPSN protocol seeks to provide network-wide synchronization of the distributed clocks in a sensor network. Clock-synchronization algorithms for sensor networks such as TPSN must be able to perform arithmetic on clock values to calculate clock drift and network propagation delays. They must be able to read the value of a local clock and assign it to another local clock. Such operations are not directly supported by the theory of Timed Automata. To overcome this formal-modeling obstacle, we augment the UPPAAL specification language with the integer clock derived type. Integer clocks, which are essentially integer variables that are periodically incremented by a global pulse generator, greatly facilitate the encoding of the operations required to synchronize clocks as in the TPSN protocol. With this integer-clock-based model of TPSN in hand, we use UPPAAL to verify that the protocol achieves network-wide time synchronization and is devoid of deadlock. We also use the UPPAAL Tracer tool to illustrate how integer clocks can be used to capture clock drift and resynchronization during protocol execution

Huang, Xiaowan↗

NASA NTRS2019

Partition-based Feasible Integer Solution Pre-computation for Hybrid Model Predictive Control

For multiparametric mixed-integer convex programming problems such as those encountered in hybrid model predictive control, we propose an algorithm for generating a feasible partition of a subset of the parameter space. The result is a static map from the current parameter to a suboptimal integer solution such that the remaining convex program is feasible. Convergence is proved with a new insight that the overlap among the feasible parameter sets of each integer solution governs the partition complexity. The partition is stored as a tree which makes querying the feasible solution efﬁcient. The algorithm can be used to warm start a mixed integer solver with a real-time guarantee or to provide a reference integer solution in several suboptimal MPC schemes. The algorithm is tested on randomly generated systems with up to six states, demonstrating the effectiveness of the approach.

Bayard, David S.↗

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↗

NASA NTRS1994

Algorithm For Integer Cosine Transforms

Algorithm computes coefficients of integer cosine transforms, containing only integer coefficients approximately proportional to floating-point coefficients of discrete cosine transforms. Used in compression of image data in blocks of N x N pixels, discrete cosine transforms involve large amounts of computation, typically amounting to 80 percent of computational load in data-compression scheme. In constructing integer approximations, competing requirements are to obtain data-compression and data-decompression performances comparable to those of corresponding descrete cosine transforms while taking advantage of simplicity afforded by integer arithmetic to reduce complexity and amount of computation.

Pollara, Fabrizio↗

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)↗

NASA NTRS1982

Quadratic integer programming for large scale banded matrices

This paper is concerned with the integer quadratic program where the variables are constrained to belong to a given set of discrete values. This quadratic integer program is shown to be equivalent to a problem of finding the shortest path in a particular directed graph called a trellis when the matrix is a positive-definite symmetric banded matrix. An efficient procedure for solving this shortest path problem is presented which allows the solution of the integer quadratic program. This method is particularly effective when the half-bandwidth of the matrix is significantly smaller than its dimension.

Yan, T. Y.↗

NASA NTRS1986

A new VLSI complex integer multiplier which uses a quadratic-polynomial residue system with Fermat numbers

A quadratic-polynomial Fermat residue number system (QFNS) has been used to compute complex integer multiplications. The advantage of such a QFNS is that a complex integer multiplication requires only two integer multiplications. In this article, a new type Fermat number multiplier is developed which eliminates the initialization condition of the previous method. It is shown that the new complex multiplier can be implemented on a single VLSI chip. Such a chip is designed and fabricated in CMOS-pw technology.

Truong, T. K.↗

NASA NTRS1987

A new VLSI complex integer multiplier which uses a quadratic-polynomial residue system with Fermat numbers

Shyu, H. C.↗

NASA NTRS1992

Software For Integer Programming

Improved Exploratory Search Technique for Pure Integer Linear Programming Problems (IESIP) program optimizes objective function of variables subject to confining functions or constraints, using discrete optimization or integer programming. Enables rapid solution of problems up to 10 variables in size. Integer programming required for accuracy in modeling systems containing small number of components, distribution of goods, scheduling operations on machine tools, and scheduling production in general. Written in Borland's TURBO Pascal.

Fogle, F. R.↗