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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

On the convergence of the fixed point method for solving neutron transport alpha eigenvalue problems

It was shown that the Fixed Point Method (also known as the Rayleigh Quotient Method) is several times faster than the Critical Search Method for solving neutron transport alpha eigenvalue problems. It was also shown that the Fixed Point Method is able to determine the alpha eigenvalues of sub-critical systems that are beyond the reach of the Critical Search Method. Despite these significant advances, the Fixed Point Method remains an unproven algorithm. Here, this report provides a proof.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

A Quantum Approach for Implementing Fixed-Point Arithmetic in Solving Ordinary Differential Equations

Differential equations (DEs) serve as fundamental tools in mathematical modeling across scientific disciplines, yet classical numerical solvers face limitations with large-scale or computationally intensive problems. This study explores a quantum-inspired approach to solving DEs, combining quantum- inspired techniques with classical methods. It focuses on fixed- point arithmetic on quantum circuits, utilizing basic quantum gates to manipulate DE solutions. We expand upon the techniques introduced by Zanger et al. [Quantum, 5, 502 (2021)] by offering a precise computation for a fixed-point signed multiplication scheme, while also presenting a quantum circuit capable of executing the fixed-point division algorithm. We demonstrate the feasibility of our approach through the simulation of a linear Ordinary Differential Equation (ODE), where initial conditions and parameters are encoded into quantum circuits using fixed- point representation. By executing sequences of quantum gates mimicking numerical integration steps, we obtain approximate solutions to the ODE with specified fixed-point precision.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

A Quantum Approach for Implementing Fixed-Point Arithmetic in Solving Ordinary Differential Equations

Differential equations (DEs) serve as fundamental tools in mathematical modeling across scientific disciplines, yet classical numerical solvers face limitations with large-scale or computationally intensive problems. This study explores a quantum-inspired approach to solving DEs, combining quantum-inspired techniques with classical methods. It focuses on fixed-point arithmetic on quantum circuits, utilizing basic quantum gates to manipulate DE solutions. We expand upon the techniques introduced by Zanger et al. [Quantum, 5, 502 (2021)] by offering a precise computation for a fixed-point signed multiplication scheme, while also presenting a quantum circuit capable of executing the fixed-point division algorithm. We demonstrate the feasibility of our approach through the simulation of a linear Ordinary Differential Equation (ODE), where initial conditions and parameters are encoded into quantum circuits using fixed-point representation. By executing sequences of quantum gates mimicking numerical integration steps, we obtain approximate solutions to the ODE with specified fixed-point precision.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
NASA NTRS1973

Fixed point theorems and dissipative processes.

Operators of the type considered by Hale et al. (1972) are used to show that under certain conditions there is a fixed point in a dissipative map within a Banach space. The conditions required for the existence of this fixed point are discussed in detail. Several fixed point theorems are formulated and proved.

Hale, J. K.↗
DOE OSTI2026

Coarse-grained fixed-point tensor networks and holographic reflected entropy in 3D gravity

We use the framework of fixed-point BCFT tensor networks to present a microscopic CFT derivation of the correspondence between reflected entropy (RE) and entanglement wedge cross section (EW) in AdS 3 /CFT 2 , for both bipartite and multipartite settings. These fixed-point tensor networks, obtained by triangulating Euclidean CFT path integrals, allow us to explicitly construct the canonical purification via cutting-and-gluing CFT path integrals. Employing modular flow in the large-c limit, we demonstrate that these intrinsic CFT manipulations reproduce bulk geometric prescriptions, without assuming the AdS/CFT dictionary. The emergence of bulk geometry is traced to coarse-graining over heavy states in the large-c limit. Universal coarse-grained BCFT data for compact 2D CFTs, through the relation to Liouville theory with ZZ boundary conditions, yields hyperbolic geometry on the Cauchy slice. The corresponding averaged replica partition functions reproduce all candidate EWs, arising from different averaging patterns, with the dominant one providing the correct RE and EW. In this way, many heuristic tensor-network intuitions in toy models are made precise and established directly from intrinsic CFT data.

AdS-CFT correspondence↗
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 NTRS2006

A Fixed Point VHDL Component Library for a High Efficiency Reconfigurable Radio Design Methodology

Advances in Field Programmable Gate Array (FPGA) technologies enable the implementation of reconfigurable radio systems for both ground and space applications. The development of such systems challenges the current design paradigms and requires more robust design techniques to meet the increased system complexity. Among these techniques is the development of component libraries to reduce design cycle time and to improve design verification, consequently increasing the overall efficiency of the project development process while increasing design success rates and reducing engineering costs. This paper describes the reconfigurable radio component library developed at the Software Defined Radio Applications Research Center (SARC) at Goddard Space Flight Center (GSFC) Microwave and Communications Branch (Code 567). The library is a set of fixed-point VHDL components that link the Digital Signal Processing (DSP) simulation environment with the FPGA design tools. This provides a direct synthesis path based on the latest developments of the VHDL tools as proposed by the BEE VBDL 2004 which allows for the simulation and synthesis of fixed-point math operations while maintaining bit and cycle accuracy. The VHDL Fixed Point Reconfigurable Radio Component library does not require the use of the FPGA vendor specific automatic component generators and provide a generic path from high level DSP simulations implemented in Mathworks Simulink to any FPGA device. The access to the component synthesizable, source code provides full design verification capability:

Hoy, Scott D.↗
NASA NTRS1972

Fixed point theorems and dissipative processes

The deficiencies of the theories that characterize the maximal compact invariant set of T as asymptotically stable, and that some iterate of T has a fixed point are discussed. It is shown that this fixed point condition is always satisfied for condensing and local dissipative T. Applications are given to a class of neutral functional differential equations.

Hale, J. K.↗
NASA NTRS1972

Fixed-point smoothing of sequentially correlated processes.

The fixed-point smoothing problem of sequentially correlated processes is considered. The filtering technique of such processes is extended to smoothing problems by simultaneously estimating the state and the accumulated contribution of process noise. Suboptimal filtering and smoothing are also discussed when data noise is regarded white in designing filters although it is actually sequentially correlated.-

Nishimura, T.↗
NASA NTRS1995

ASIC For Complex Fixed-Point Arithmetic

Application-specific integrated circuit (ASIC) performs 24-bit, fixed-point arithmetic operations on arrays of complex-valued input data. High-performance, wide-band arithmetic logic unit (ALU) designed for use in computing fast Fourier transforms (FFTs) and for performing ditigal filtering functions. Other applications include general computations involved in analysis of spectra and digital signal processing.

Petilli, Stephen G.↗
DOE OSTI2025

Convergence Analysis of the Alternating Anderson–Picard Method for Nonlinear Fixed-Point Problems

Anderson acceleration (AA) has been widely used to solve nonlinear fixed-point problems due to its rapid convergence. This work focuses on a variant of AA in which multiple Picard iterations are performed between each AA step, referred to as the Alternating Anderson–Picard (AAP) method. Furthermore, despite introducing more “slow” Picard iterations, this method has been shown to be efficient and even more robust in both linear and nonlinear cases. However, there is a lack of theoretical analysis for AAP in the nonlinear case. In this paper, we address this gap by establishing the equivalence between AAP and a multisecant-GMRES method that uses GMRES to solve a multisecant linear system at each iteration. From this perspective, we show that AAP “converges” to the Newton-GMRES method. Specifically, as the residual approaches zero, the multisecant matrix, the approximate Jacobian inverse, the search direction, and the optimization gain of AAP converge to their counterparts in the Newton-GMRES method. These connections provide insights for analyzing the asymptotic convergence properties of AAP. Consequently, we show that AAP is locally 𝑞-linear convergent and provide an upper bound for the convergence factor of AAP. To validate the theoretical results, numerical examples are provided.

Anderson acceleration↗
DOE OSTI2025

MLBS Halo scanning Lidar / Reviewed Data / Fixed-point vertical scans

This dataset contains high-frequency vertical velocity recorded by fixed-point vertical scans done by the University of Virginia Halo Streamline scanning lidar at the MLBS station. The quality control is performed according to the algorithm of Goring & Nikora (2002).

17 WIND ENERGY↗