Search NASA⌕ Search

SEARCH · Search NASA

Results for “fixed points”

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 253 records · Page 14

Adiabatic behavior of an elliptical vortex in a time-dependent external strain flow

The adiabatic behavior of two-dimensional (2D) fluid vortices subject to slowly varying, time-dependent external strain flows is studied theoretically, and experimentally using magnetized non-neutral electron plasmas. Here the E × B drift dynamics of the electrons perpendicular to the magnetic field are analogous to the motion of fluid vorticity under the 2D Euler equations describing ideal fluids. A low-dimensional elliptical vortex patch model is used along with a WKB approximation to derive a formula for the breaking of an adiabatic invariant due to the changing external flow. The invariant is interpreted as the amplitude of a perturbative oscillation about a stable fixed point corresponding to a steady elliptical vortex. Smooth, hyperbolic tangent and piecewise linear ramp functions are considered for the external strain time dependence. Standard exponential breaking is observed in the former case, whereas the latter exhibits a power-law breaking curve with periodic modulation. It is found that a driving term in the equations of motion contributes the majority of the breaking whereas the frequency variation plays a weaker, but significant role. The experimental data agree closely with the theoretical model. The most significant deviation is due to inviscid damping behavior associated with the smooth edges of the experimental vortices, which tends to reduce the amplitude of the oscillation. Finally, the results are compared and contrasted with other related experimental, numerical, and theoretical work.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Criticality of Two-Dimensional Disordered Dirac Fermions in the Unitary Class and Universality of the Integer Quantum Hall Transition

Two-dimensional (2D) Dirac fermions are a central paradigm of modern condensed matter physics, describing low-energy excitations in graphene, in certain classes of superconductors, and on surfaces of 3D topological insulators. At zero energy E=0, Dirac fermions with mass m are band insulators, with the Chern number jumping by unity at m=0. This observation lead Ludwig et al. [Phys. Rev. B 50, 7526 (1994)PRBMDO0163-182910.1103/PhysRevB.50.7526] to conjecture that the transition in 2D disordered Dirac fermions (DDF) and the integer quantum Hall transition (IQHT) are controlled by the same fixed point and possess the same universal critical properties. Given the far-reaching implications for the emerging field of the quantum anomalous Hall effect, modern condensed matter physics, and our general understanding of disordered critical points, it is surprising that this conjecture has never been tested numerically. In this work, we report the results of extensive numerics on the phase diagram and criticality of 2D DDF in the unitary class. We find a critical line at m=0, with an energy-dependent localization length exponent. At large energies, our results for the DDF are consistent with state-of-the-art numerical results ν IQH =2.56-2.62 from models of the IQHT. At E=0, however, we obtain ν 0 =2.30-2.36 incompatible with ν IQH . This result challenges conjectured relations between different models of the IQHT, and several interpretations are discussed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Strange Metals as Ersatz Fermi Liquids

Here, a long-standing mystery of fundamental importance in correlated electron physics is to understand strange non-Fermi liquid metals that are seen in diverse quantum materials. A striking experimental feature of these metals is a resistivity that is linear in temperature (T). In this Letter we ask what it takes to obtain such non-Fermi liquid physics down to zero temperature in a translation invariant metal. If in addition the full frequency (ω) dependent conductivity satisfies ω/T scaling, we argue that the T-linear resistivity must come from the intrinsic physics of the low energy fixed point. Combining with earlier arguments that compressible translation invariant metals are “ersatz Fermi liquids” with an infinite number of emergent conserved quantities, we obtain powerful and practical conclusions. We show that there is necessarily a diverging susceptibility for an operator that is odd under inversion and time reversal symmetries, and has zero crystal momentum. We discuss a few other experimental consequences of our arguments, as well as potential loopholes, which necessarily imply other exotic phenomena.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Convex Optimization for Nonequilibrium Steady States on a Hybrid Quantum Processor

Finding the transient and steady state properties of open quantum systems is a central problem in various fields of quantum technologies. Here, in this work, we present a quantum-assisted algorithm to determine the steady states of open system dynamics. By reformulating the problem of finding the fixed point of Lindblad dynamics as a feasibility semidefinite program, we bypass several well-known issues with variational quantum approaches to solving for steady states. We demonstrate that our hybrid approach allows us to estimate the steady states of higher dimensional open quantum systems and discuss how our method can find multiple steady states for systems with symmetries.

97 MATHEMATICS AND COMPUTING↗

Asymptotic Freedom at the Berezinskii-Kosterlitz-Thouless Transition without Fine-Tuning Using a Qubit Regularization

We propose a two-dimensional hard-core loop-gas model as a way to regularize the asymptotically free massive continuum quantum field theory that emerges at the Berezinskii-Kosterlitz-Thouless transition. Without fine-tuning, our model can reproduce the universal step-scaling function of the classical lattice X Y model in the massive phase as we approach the phase transition. This is achieved by lowering the fugacity of Fock-vacuum sites in the loop-gas configuration space to zero in the thermodynamic limit. Some of the universal quantities at the Berezinskii-Kosterlitz-Thouless transition show smaller finite size effects in our model as compared to the traditional X Y model. Our model is a prime example of qubit regularization of an asymptotically free massive quantum field theory in Euclidean space-time and helps understand how asymptotic freedom can arise as a relevant perturbation at a decoupled fixed point without fine-tuning. Published by the American Physical Society 2024

Physics↗

Symmetric Mass Generation with Four SU(2) Doublet Fermions

We study a single exactly massless staggered fermion in the fundamental representation of an SU(2) gauge group. We utilize an nHYP-smeared fermion action supplemented with additional heavy Pauli-Villars fields that serve to decrease lattice artifacts. The phase diagram exhibits a clear two-phase structure with a conformal phase at weak coupling and a novel new phase, the symmetric mass generation (SMG) phase, appearing at strong coupling. The SMG phase is confining with all states gapped and chiral symmetry unbroken. Our finite size scaling analysis provides strong evidence that the phase transition between these two phases is continuous, which would allow for the existence of a continuum SMG phase. Furthermore, the renormalization group flows are consistent with a 𝛽 function that vanishes quadratically at the new fixed point, suggesting that the 𝑁 𝑓 = 4 flavor SU(2) gauge theory lies at the opening of the conformal window.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Engineered thermalization and cooling of quantum many-body systems

We develop a scheme for engineering genuine thermal states in analog quantum simulation platforms by coupling local degrees of freedom to driven, dissipative ancilla pseudospins. We demonstrate the scheme in a many-body quantum spin lattice simulation setting. A Born-Markov master equation describing the dynamics of the many-body system is developed, and we show that if the ancilla energies are periodically modulated, with a carefully chosen hierarchy of timescales, one can effectively thermalize the many-body system. Through analysis of the time-dependent dynamical generator, we determine the conditions under which the true thermal state is an approximate dynamical fixed point for general system Hamiltonians. Finally, we evaluate the thermalization protocol through numerical simulation and discuss prospects for implementation on current quantum simulation hardware.

36 MATERIALS SCIENCE↗

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↗

Asymptotic gauge symmetry and UV extension of the nonperturbative coupling in holographic QCD

We extend our recent analytic study of the strong coupling 𝛼 eff in the nonperturbative and near-perturbative regimes [Phys. Rev. Lett. 133, 181901 (2024)] by imposing rigorous renormalization-group constraints from asymptotically free gauge theories at 𝑄 2 → ∞. The asymptotic boundary conditions modify the scaling properties of 𝛼eff at large values of the momentum transfer 𝑄 2 and lead to a scale-dependent confinement strength 𝜅⁡(𝑄 2 ). This requires that both 𝜅⁡(𝑄 2 ) and 𝛼 eff⁡ (𝑄 2 , 𝜅⁡(𝑄 2 )) remain holomorphic in the complex 𝑄 2 plane, except at the physical cuts associated with the heavy-quark thresholds and the singularity flow trajectory studied in our previous Letter. For color SU(3), a precise connection is found between the scaling exponent of 𝜅⁡(𝑄 2 ) in the ultraviolet, the value of the infrared fixed point of the strong coupling, and the number of flavors in agreement with observations. The nonperturbative analytic model gives an accurate description of the strong coupling across all scales, up to the highest available data.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

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

GPU-Based Static Data-Flow Analysis for Fast and Scalable Android App Vetting

Many popular vetting tools for Android applications use static code analysis techniques. In particular, Interprocedural Data-Flow Graph (IDFG) construction is the computation at the core of Android static data-flow analysis and consumes most of the analysis time. Many analysis tools use a worklist algorithm, an iterative fixed-point approach, to construct the IDFG. In this paper, we observe that a straightforward GPU parallelization of the worklist algorithm leads to significant underutilization of the GPU resources. We identify four performance bottlenecks, namely, frequent dynamic memory allocations, high branch divergence, workload imbalance, and irregular memory access patterns. Accordingly, we propose GDroid, a GPU-based worklist algorithm implementation with multiple fine-grained optimizations tailored to common characteristics of Android applications. The optimizations considered are: matrix-based data structure, memory access-based node grouping, and worklist merging. Our experimental evaluation, performed on 1000 Android applications, shows that the proposed optimizations are beneficial to performance, and GDroid can achieve up to 128X speedups against a plain GPU implementation.

Android security↗

Robust and Simple ADMM Penalty Parameter Selection

We present a new method for online selection of the penalty parameter for the alternating direction method of multipliers (ADMM) algorithm. ADMM is a widely used method for solving a range of optimization problems, including those that arise in signal and image processing. In its standard form, ADMM includes a scalar hyperparameter, known as the penalty parameter, which usually has to be tuned to achieve satisfactory empirical convergence. In this work, we develop a framework for analyzing the ADMM algorithm applied to a quadratic problem as an affine fixed point iteration. Using this framework, we develop a new method for automatically tuning the penalty parameter by detecting when it has become too large or small. We analyze this and several other methods with respect to their theoretical properties, i.e., robustness to problem transformations, and empirical performance on several optimization problems. Our proposed algorithm is based on a theoretical framework with clear, explicit assumptions and approximations, is theoretically covariant/invariant to problem transformations, is simple to implement, and exhibits competitive empirical performance.

42 ENGINEERING↗

Design of Hopfield Networks Based on Superconducting Coupled Oscillators

The global energy shortage has driven the development of many energy-efficient computational platforms beyond Moore's law, among which brain-inspired neuromorphic computing is one of the promising solutions. Associative memory and pattern recognition are important computations solved by brain-inspired Hopfield networks. Classical Hopfield networks store memories via fixed point attractors of their dynamics. In oscillatory Hopfield networks, these attractors are replaced by periodic orbits. Here, we design an oscillatory Hopfield network based on coupled superconducting oscillators. We first employ a mathematical phase reduction approach to map networks of coupled superconducting rapid single flux quantum (RSFQ) ring oscillators to coupled Kuramoto phase-oscillator networks. We use this theory to numerically optimize the hardware's mutual inductances in order to directly match the phase-reduced superconducting oscillators to a model of phase-oscillator-based Hopfield networks. The resulting network can store multiple oscillatory phase-locked memory patterns and recover the patterns based on the initial phase conditions. As different pattern recognition tasks, or learning, require tunable connectivity strengths between the oscillatory nodes, we further employ a coupler circuit that enables tuning the coupling strength between two oscillators by applying an external flux. We demonstrate the functionality of our design through numerical simulations of a small example network with oscillators operating at 86 GHz and recognizing patterns within 10 ns. Our approach enables the learning and retrieval of dynamical memory patterns with a wide range of applications where rhythmic dynamic output is beneficial.

Cheng, Ran↗

Projected Multi-Agent Consensus Equilibrium (PMACE) With Application to Ptychography

Multi-Agent Consensus Equilibrium (MACE) formulates an inverse imaging problem as a balance among multiple update agents such as data-fitting terms and denoisers. However, each such agent operates on a separate copy of the full image, leading to redundant memory use and slow convergence when each agent affects only a small subset of the full image. In this article, we extend MACE to Projected Multi-Agent Consensus Equilibrium (PMACE), in which each agent updates only a projected component of the full image, thus greatly reducing memory use for some applications. We describe PMACE in terms of an equilibrium problem and an equivalent fixed-point problem and show that in most cases the PMACE equilibrium is not the solution of an optimization problem. To demonstrate the value of PMACE, we apply it to the problem of ptychography, in which a sample is reconstructed from the diffraction patterns resulting from coherent X-ray illumination at multiple overlapping spots. In our PMACE formulation, each spot corresponds to a separate data-fitting agent, with the final solution found as an equilibrium among all the agents. In conclusion, our results demonstrate that the PMACE reconstruction algorithm generates more accurate reconstructions at a lower computational cost than existing ptychography algorithms when the spots are sparsely sampled.

97 MATHEMATICS AND COMPUTING↗

Analysis of a New Implicit Solver for a Semiconductor Model

Here, we present and analyze a new iterative solver for implicit discretizations of a simplified Boltzmann--Poisson system. The algorithm builds on recent work that incorporated a sweeping algorithm for the Vlasov--Poisson equations as part of nested inner-outer iterative solvers for the Boltzmann--Poisson equations. The new method eliminates the need for nesting and requires only one transport sweep per iteration. It arises as a new fixed-point formulation of the discretized system which we prove to be contractive for a given electric potential. We also derive an accelerator to improve the convergence rate for systems in the drift-diffusion regime. We numerically compare the efficiency of the new solver, with and without acceleration, against a recently developed nested iterative solver.

97 MATHEMATICS AND COMPUTING↗

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

On two nucleons near unitarity with perturbative pions

We explore the impact of perturbative pions on the Unitarity Expansion in the two-nucleon S-waves of Chiral Effective Field Theory at next-to-next-to leading order (N 2 LO). Pion exchange explicitly breaks the nontrivial fixed point’s universality, i.e. invariance of S waves under both conformal and Wigner’s combined SU(4) spin–isospin transformations. On the other hand, Unitarity explicitly breaks chiral symmetry. The two seem incompatible in their respective exact-symmetry limits. χEFT with Perturbative Pions in the Unitarity Expansion resolves the apparent conflict in the Unitarity Window (phase shifts 45° ≲ δ(k) ≲ 135°), i.e. around momenta most relevant for low-energy nuclear systems. Its only LO scale is the scattering momentum; NLO adds only scattering length, effective range and non-iterated one-pion exchange (OPE); and N 2 LO only once-iterated OPE. Agreement in the 1 S 0 channel is very good.

Chiral symmetry↗

pnnl/mcl-runtime

The Minos Computing Library (MCL) is a task-based programming language and runtime for extremely heterogeneous systems. MCL facilitates writing program for heterogeneous devices and porting applications across different systems and devices. MCL supports asynchronous execution of computing tasks on all available heterogeneous devices, including GPUs, FGPAs, fixed-point accelerators, and AI accelerators. MCL provides a high-level programming interface and automatically and autonomously performs resource management, load balancing, and locality-aware scheduling.

Central, PNNL Developer↗