Search NASA⌕ Search

SEARCH · Search NASA

Results for “fixed-point”

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

Accuracy Guarantees and Quantum Advantage in Analog Open Quantum Simulation with and without Noise

Many-body open quantum systems, described by Lindbladian master equations, are a rich class of physical models that display complex equilibrium and out-of-equilibrium phenomena which remain to be understood. In this paper, we theoretically analyze noisy analog quantum simulation of geometrically local open quantum systems and provide evidence that this problem both is hard to simulate on classical computers and could be approximately solved on near-term quantum devices. First, given a noiseless quantum simulator, we show that the dynamics of local observables and the fixed-point expectation values of rapidly mixing local observables in geometrically local Lindbladians can be obtained to a precision of ϵ in time that is poly ( ϵ − 1 ) and uniform in system size. Furthermore, we establish that the quantum simulator would provide a superpolynomial advantage, in run-time scaling with respect to the target precision and either the evolution time (when simulating dynamics) or the Lindbladian’s decay rate (when simulating fixed points), over any classical algorithm for these problems, assuming BQP ≠ BPP . We then consider the presence of noise in the quantum simulator in the form of additional geometrically local Lindbladian terms. We show that the simulation tasks considered in this paper are stable to errors; i.e., they can be solved to a noise-limited, but system-size independent, precision. Finally, we establish that, assuming BQP ≠ BPP , there are stable geometrically local Lindbladian simulation problems such that, as the noise rate on the simulator is reduced, classical algorithms must take time superpolynomially longer in the inverse noise rate to attain the same precision as the analog quantum simulator. Published by the American Physical Society 2025

Kashyap, Vikram (ORCID:0000000208195207)↗
DOE OSTI2025

Superspin renormalization and slow relaxation in random spin systems

We develop an excited-state real-space renormalization group (RSRG-X) formalism to describe the dynamics of conserved densities in randomly interacting spin-12 systems. Our formalism is suitable for systems with U(1) and Z2 symmetries, and we apply it to chains of randomly positioned spins with dipolar XX+YY interactions, as arise in Rydberg quantum simulators and other platforms. The formalism generates a sequence of effective Hamiltonians that provide approximate descriptions for dynamics on successively smaller energy scales. These effective Hamiltonians involve “superspins”: two-level collective degrees of freedom constructed from (anti)aligned microscopic spins. Conserved densities can then be understood as relaxing via coherent collective spin flips. For the well-studied simpler case of randomly interacting nearest-neighbor XX+YY chains, the superspins reduce to single spins. Our formalism also leads to a numerical method capable of simulating the dynamics up to an otherwise inaccessible combination of large system size and late time. Focusing on disorder-averaged infinite-temperature autocorrelation functions, in particular the spin survival probability Sp¯(t), we demonstrate quantitative agreement between our algorithm and exact diagonalization (ED) at low but nonzero frequencies. Such agreement holds for chains with nearest-neighbor, next-nearest-neighbor, and long-range dipolar interactions. Our results indicate decay of Sp¯(t) slower than any power law and feature no significant deviation from the ∼1/ln2(t) asymptote expected from the infinite-randomness fixed-point of the nearest-neighbor model. We also apply the RSRG-X formalism to two-dimensional long-range systems of moderate size and find slow late-time decay of Sp¯(t).

Zhao, Yi J↗
DOE OSTI2025

Classifying One-Dimensional Quantum States Prepared by a Single Round of Measurements

Measurements and feedback have emerged as powerful resources for creating many-body quantum states. However, a detailed understanding has been restricted to fixed-point representatives of phases of matter. Here, we go beyond this and characterize the patterns of many-body entanglement that can be deterministically created from measurement. Focusing on one spatial dimension, a framework is developed for the case where a single round of measurements is the only entangling operation. We show this creates matrix-product states and identify necessary and sufficient tensor conditions for preparability, which uniquely determine the preparation protocol. We use these conditions to both classify preparable quantum states and characterize their physical constraints. In particular, we find a trade-off between the richness of the preparable entanglement spectrum and correlation functions, which leads to a no-go theorem for preparing certain quantum states. More broadly, we connect properties of the preparation protocol to the resulting phase of matter, including trivial, symmetry-breaking, and symmetry-protected topological phases—for both uniform and modulated symmetries. This work offers a resource-theoretic perspective on preparable quantum entanglement and shows how to systematically create states of matter, away from their fixed points, in quantum devices. Published by the American Physical Society 2025

Sahay, Rahul (ORCID:0000000174579826)↗
DOE OSTI2024

A Suppression-based STDP Rule Resilient to Jitter Noise in Spike Patterns for Neuromorphic Computing

Multi-spike models of synaptic plasticity, such as the triplet and suppression spike-timing-dependent plasticity (STDP) rules, exhibit better alignment with neurophysiological data in the brain compared to the pair-based STDP rule. Previous studies have empirically shown that the pair-based STDP rule can detect spatiotemporal spike patterns hidden in equally dense distractor spike trains in an unsupervised manner. However, it fails to detect spike patterns influenced by jitter noise. Given that spiking neural networks (SNNs) exhibit variability in generated spike trains in response to the same inputs, it becomes imperative to have learning rules capable of detecting spike patterns even in the presence of jitter noise. In this study, we introduce a simplified suppression-based STDP rule that demonstrates significantly enhanced tolerance to jitter in spike patterns compared to the pair-based STDP rule. Unlike the ideal suppression STDP rule, characterized by an exponential learning window and requiring high-resolution synapses, the simplified rule limits the synaptic efficacy update to a single bit at any given instant. Moreover, it employs 4-bit fixed-point synapses, facilitating straightforward implementation in neuromorphic hardware.

Gautam, Ashish [ORNL]↗
DOE OSTI2026

Two-Level Sketching Alternating Anderson Acceleration for Complex Physics Applications

We present a novel two-level sketching extension of the Alternating Anderson–Picard (AAP) method for accelerating fixed-point iterations in challenging single- and multiphysics simulations governed by discretized PDEs. Our approach combines a static, physics-based projection that reduces the least-squares (LS) problem to the most informative field (e.g., via Schur-complement insight) with a dynamic, algebraic sketching stage driven by a backward stability analysis under Lipschitz continuity. We introduce inexpensive estimators for stability thresholds and cache-aware randomized selection strategies to balance computational cost against memory access overhead. The resulting algorithm solves reduced LS systems in place, minimizes memory footprints, and seamlessly alternates between low-cost Picard updates and Anderson mixing. Implemented in Julia, our two-level sketching AAP achieves up to 50% time-to-solution reductions compared to standard Anderson acceleration—without degrading convergence rates—on benchmark problems including Stokes, 𝑝-Laplacian, bidomain, and Navier–Stokes formulations at varying problem sizes. These results demonstrate the method’s robustness, scalability, and potential for integration into high-performance scientific computing frameworks. Our implementation is available open source in the AAP.jl library.

Barnafi, Nicolas [University of Chile, Santiago]↗
DOE OSTI2025

(SPT-)LSM theorems from projective non-invertible symmetries

Projective symmetries are ubiquitous in quantum lattice models and can be leveraged to constrain their phase diagram and entanglement structure. In this paper, we investigate the consequences of projective algebras formed by non-invertible symmetries and lattice translations in a generalized 1+1 1 + 1 D quantum XY model based on group-valued qudits. This model is specified by a finite group G G and enjoys a projective \mathsf{Rep}(G)× Z(G) 𝖱 𝖾 𝗉 ( G ) × Z ( G ) and translation symmetry, where symmetry operators obey a projective algebra in the presence of symmetry defects. For invertible symmetries, such projective algebras imply Lieb-Schultz-Mattis (LSM) anomalies. However, this is not generally true for non-invertible symmetries, and we derive a condition on G G for the existence of an LSM anomaly. When this condition is not met, we prove an SPT-LSM theorem: any unique and gapped ground state is necessarily a non-invertible weak symmetry protected topological (SPT) state with non-trivial entanglement, for which we construct an example fixed-point Hamiltonian. The projectivity also affects the dual symmetries after gauging \mathsf{Rep}(G)× Z(G) 𝖱 𝖾 𝗉 ( G ) × Z ( G ) sub-symmetries, giving rise to non-Abelian and non-invertible dipole symmetries, as well as non-invertible translations. We complement our analysis with the SymTFT, where the projectivity causes it to be a topological order non-trivially enriched by translations. Throughout the paper, we develop techniques for gauging \mathsf{Rep}(G) 𝖱 𝖾 𝗉 ( G ) symmetry and inserting its symmetry defects on the lattice, which are applicable to other non-invertible symmetries.

Pace, Salvatore D. (ORCID:0000000306093335)↗
DOE OSTI2025

Conformal geometry from entanglement

In a physical system with conformal symmetry, observables depend on cross-ratios, measures of distance invariant under global conformal transformations (conformal geometry for short). We identify a quantum information-theoretic mechanism by which the conformal geometry emerges at the gapless edge of a 2+1D quantum many-body system with a bulk energy gap. We introduce a novel pair of information-theoretic quantities (\mathfrak{c}_{\textrm{tot}}, \eta) ( 𝔠 tot , η ) that can be defined locally on the edge from the wavefunction of the many-body system, without prior knowledge of any distance measure. We posit that, for a topological groundstate, the quantity \mathfrak{c}_{\textrm{tot}} 𝔠 tot is stationary under arbitrary variations of the quantum state, and study the logical consequences. We show that stationarity, modulo an entanglement-based assumption about the bulk, implies (i) \mathfrak{c}_{\textrm{tot}} 𝔠 tot is a non-negative constant that can be interpreted as the total central charge of the edge theory. (ii) \eta η is a cross-ratio, obeying the full set of mathematical consistency rules, which further indicates the existence of a distance measure of the edge with global conformal invariance. Thus, the conformal geometry emerges from a simple assumption on groundstate entanglement. We show that stationarity of \mathfrak{c}_{\textrm{tot}} 𝔠 tot is equivalent to a vector fixed-point equation involving \eta η , making our assumption locally checkable. We also derive similar results for 1+1D systems under a suitable set of assumptions.

Kim, Isaac H.↗
DOE OSTI2025

Even Higher-Level Synthesis: An Exploration of AI Hardware Accelerators using HLS4ML

With the rise of artificial intelligence, the popularization of deep learning, and a constantly evolving industry, the demand for flexible and efficient tools has never been greater. As algorithms grow more complex, their runtime and energy consumption increase exponentially. Customized hardware accelerators, long used for specific mathematical operations, remain essential for managing modern applications' computational and power demands. Hardware accelerators can speed up complex computations by orders of magnitude, but their manual design and verification processes are often challenging and time-consuming. High-Level Synthesis (HLS) provides a solution by transforming high-level algorithm descriptions, typically written in C++ or SystemC, into synthesizable RTL suitable for hardware implementation. This approach reduces development time for RTL engineers while offering flexibility beyond what traditional handwritten RTL can provide. We extended this capability to the machine-learning domain with the open-source framework hls4ml, which allows neural networks trained in Python frameworks like Tensorflow or PyTorch to be synthesized into efficient hardware representations for the traditional FPGA and ASIC flows. This breakthrough addresses the growing need for reduced design turnaround and easy verification of ML hardware accelerators with low latency and power efficiency constraints. During this tutorial, we will demonstrate how Python complements HLS by simplifying the ML design process, bridging the gap between software and hardware development. Attendees will explore how we translate neural networks modeled in Python into fixed-point C++ models suitable for HLS workflows. We will dive into strategies like Value-Range Analysis and Quantization-Aware Training, which optimize these designs for deployment and evaluate their accuracy, power consumption, and energy efficiency. To exemplify these concepts, experts from Fermilab will share their experiences applying this technology to high-energy physics experiments, where real-time, low-latency processing is critical. Over the years, Fermilab engineers have demonstrated how deep neural networks, optimized for hardware using hls4ml, can meet the stringent requirements of trigger systems at the CERN Large Hadron Collider. These systems rely on rapid decision-making to process immense data volumes while retaining only the most relevant events for further analysis. The application of hls4ml has also been extended to innovative technologies like smart pixel arrays. These smart pixels integrate ML inference capabilities directly into sensor devices, enabling localized data processing at the pixel level. This approach drastically reduces the need to transmit raw data to external processing units, significantly decreasing power consumption and latency. By embedding neural networks within the pixel architecture, the smart pixels can identify and prioritize relevant data in real time, providing a highly efficient solution for edge computing in scenarios such as particle detectors and imaging systems. Fermilab's work highlights the potential of hardware-accelerated ML in scenarios where both speed and power efficiency are mission-critical. Through this tutorial, attendees will gain valuable insights into the challenges and solutions of deploying ML in hardware. Understanding how HLS and hls4ml streamline the development of neural network-based hardware accelerators is fundamental for the industry's future. Participants will learn how these technologies are shaping the future of AI and scientific computing.

Di Guglielmo, Giuseppe [Fermilab]↗
DOE OSTI2026

thornado+FLASH-X: A Hybrid Discontinuous Galerkin–Implicit-explicit and Finite-volume Framework for Neutrino-radiation Hydrodynamics in Core-collapse Supernovae

We present neutrino-transport algorithms implemented in the toolkit for high-order neutrino-radiation hydrodynamics (thornado) and their coupling to self-gravitating hydrodynamics within the adaptive mesh refinement–based multiphysics simulation framework FLASH-X. thornado, developed primarily for simulations of core-collapse supernovae (CCSNe), employs a spectral, six-species two-moment formulation with algebraic closure and special-relativistic observer corrections accurate to $\mathcal{O}(v/c)$, and uses discontinuous Galerkin (DG) methods for phase-space discretization combined with implicit-explicit time stepping. A key development is a nonlinear neutrino–matter coupling algorithm based on nested fixed-point iteration with Anderson acceleration, enabling fully implicit treatment of collisional processes, including energy-coupling interactions such as neutrino–electron scattering and pair production. Coupling to finite-volume (FV) hydrodynamics is achieved through a hybrid DG-FV representation of the fluid variables and operator-split evolution within FLASH-X. The implementation is verified using basic transport tests with idealized opacities and relaxation and deleptonization problems with tabulated microphysics. Spherically symmetric CCSN simulations demonstrate accuracy and robustness of the coupled scheme, including close agreement with the CCSN simulation code Chimera. An axisymmetric CCSN simulation further demonstrates the viability of DG-based neutrino transport for multidimensional supernova modeling within FLASH-X. thornado’s neutrino-transport solver is GPU-enabled using OpenMP offloading or OpenACC, and all CCSN applications included in this work use the GPU implementation. Together, these results establish a foundation for future enhancements in physics fidelity, numerical algorithms, and computational performance, for increasingly realistic large-scale CCSN simulations.

Endeve, Eirik [Oak Ridge National Laboratory (ORNL↗
NASA NTRS1972

Bounded state space

This investigation is divided functionally into three different areas: (1) study of bounded state space, (2) nonlinear smoothing theory, and (3) system identification. (1) Study of bounded state space: necessary and sufficient conditions for an optimal control are obtained for a bounded state space optimal control problem. The difficulty of determining the so-called jump conditions is eliminated; however, the problem of determining the points where the response either enters or leaves the boundary still remains unsolved. (2) Nonlinear smoothing theory: nonlinear fixed-interval, fixed-point and fixed-lag smoothing of a random signal generated by a stochastic differential equation are investigated. Results on the asymptotic stability of a linear constant-parameter fixed-interval smoothing filter are obtained. (3) System identification: a particular stochastic modelling problem is solved. An Ito stochastic integral equation is used to mathematically model a black box having multiple inputs and multiple outputs. A new method for identifying system parameters is presented.

Eyman, E. D.↗
NASA NTRS1973

Digital random-number generator

For binary digit array of N bits, use N noise sources to feed N nonlinear operators; each flip-flop in digit array is set by nonlinear operator to reflect whether amplitude of generator which feeds it is above or below mean value of generated noise. Fixed-point uniform distribution random number generation method can also be used to generate random numbers with other than uniform distribution.

Brocker, D. H.↗
NASA NTRS1973

Continuous dependence of fixed points of condensing maps

Many problems in analysis are concerned with the dependence upon parameters of fixed points of maps. For contraction mappings, criteria are relatively easy to obtain and have been known for some time. In the study of solutions of functional differential equations, more general results were needed. It is the purpose of this paper to give a rather general fixed-point theorem for condensing maps depending on a parameter, to prove continuous dependence and to indicate how many of the previous results are special cases.

Hale, J. K.↗
NASA NTRS1973

New hardware realizations of nonrecursive digital filters.

Analysis of the bit-level operations involved in the convolution realizing a nonrecursive digital filter leads to hardware designs of digital filters based on the operation of counting. Two distinct designs are outlined: the first one is capable of very high speed but is rather expensive; the second is quite slow but has the advantages of low cost and high flexibility. The basic designs considered utilize fixed-point representation for the data and filter coefficients. Variants allowing floating-point representation of the coefficients are also described.

Zohar, S.↗
NASA NTRS1974

Implementation of digital filters for minimum quantization errors

In this paper a technique is developed for choosing programing forms and bit configurations for digital filters that minimize the quantization errors. The technique applies to digital filters operating in fixed-point arithmetic in either open-loop or closed-loop systems, and is implemented by a digital computer program that is based on a digital simulation of the system. As an output the program gives the programing form required for minimum quantization errors, the total bit configuration required in the filter, and the location of the binary decimal point at each quantizer within the filter.

Phillips, C. L.↗
NASA NTRS1974

An improved version of the table look-up algorithm for pattern recognition

The table look-up approach to pattern recognition has been used for 3 years at several research centers in a variety of applications. A new version has been developed which is faster, requires significantly less core memory, and retains full precision of the input data. The new version can be used on low-cost minicomputers having 32K words (16 bits each) of core memory and fixed-point arithmetic; no special-purpose hardware is required. An initial FORTRAN version of this system can classify an ERTS computer-compatible tape into 24 classes in less than 15 minutes.

Eppler, W. G.↗
NASA NTRS1976

Periodic motion in a class of nth-order autonomous differential equations

Sufficient conditions are obtained for the existence of periodic motion in a class of autonomous nonlinear differential equations of order greater than two. The approach is based on the decomposition of an equation into a linear and a nonlinear part. The analysis relies on some basic ideas from linear analysis and geometry. Sufficient conditions for a periodic solution are derived by means of a general topological principle referred to as the torus principle. The existence of a periodic solution is concluded by an appropriate use of the Brouwer fixed-point theorem.

Williamson, D.↗
NASA NTRS1975

Some estimation formulae for continuous time-invariant linear systems

In this brief paper we examine a Riccati equation decomposition due to Reid and Lainiotis and apply the result to the continuous time-invariant linear filtering problem. Exploitation of the time-invariant structure leads to integration-free covariance recursions which are of use in covariance analyses and in filter implementations. A super-linearly convergent iterative solution to the algebraic Riccati equation (ARE) is developed. The resulting algorithm, arranged in a square-root form, is thought to be numerically stable and competitive with other ARE solution methods. Certain covariance relations that are relevant to the fixed-point and fixed-lag smoothing problems are also discussed.

Bierman, G. J.↗
NASA NTRS1978

Vision-based guidance for an automated roving vehicle

A controller designed to guide an automated vehicle to a specified target without external intervention is described. The intended application is to the requirements of planetary exploration, where substantial autonomy is required because of the prohibitive time lags associated with closed-loop ground control. The guidance algorithm consists of a set of piecewise-linear control laws for velocity and steering commands, and is executable in real time with fixed-point arithmetic. The use of a previously-reported object tracking algorithm for the vision system to provide position feedback data is described. Test results of the control system on a breadboard rover at the Jet Propulsion Laboratory are included.

Griffin, M. D.↗