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 199 records · Page 11

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

3D Cloud Aerosol Precipitation Experiment at kennaook Cape Grim (3D-CAPE-k) Field Campaign Report

The objective of this campaign was to complement the U.S. Department of Energy Atmospheric Radiation Measurement (ARM) User Facility’s Cloud And Precipitation Experiment at kennaook (CAPE-k) in northwest Tasmania by deploying scanning, fixed pointing angle, and in situ aerosol, cloud, and precipitation remote-sensing instruments during the last six months of the experiment. These instruments provided a three-dimensional (3D) context to the second ARM Mobile Facility (AMF2) vertically pointing observations collected at the kennaook Cape Grim (KCG) site and captured a portion of the life cycle of the clouds before and after the passage over the AMF2 vertical column. These 3D cloud measurements will be used in the near future to 1) investigate how the vertical profiles of aerosol and cloud properties are representative of the broader area and how these properties evolve during the portion of the cloud life cycle captured by the scanning instruments, 2) quantify how accurate the cloud fraction derived with assumptions from vertically pointing observations are compared with direct 3D cloud fraction measurements, 3) evaluate cloud fraction and liquid water path in the Australian Community Climate and Earth-System Simulator–Convective-scale (ACCESS-C) forecast model, and 4) evaluate aerosol and cloud products from the European Space Agency/Japanese Aerospace Exploration Agency (ESA/JAXA) Earth Cloud Aerosol Radiation Explorer (EarthCARE) mission using the scanning measurements, offering more chances of exact collocation, thereby complementing the statistical approach we are planning to employ with AMF2 observations for that same purpose.

54 ENVIRONMENTAL SCIENCES↗

Adiabatic Longitudinal Island Formation Due to Phase Modulation Using BLonD

The studies of adiabatic island generation through tracking near the quarter integer resonance and separately, through phase modulation was conducted using the accelerator code BLonD. Parameters from the Hadron Storage Ring (HSR) were used in the model. The demonstration of resonance island formation through phase modulation will help to understand this possible source of beam dilution during the store and further control of the bunch shaping. In this document, an algorithm to calculate the 5 th , 7 th , and N th order resonances is given, tracking results are presented, and the stable fixed point calculations with comparison to Poincaré contours are given.

43 PARTICLE ACCELERATORS↗

Hyperspectral traits (TSWIFT) UC Davis Populus trichocarpa Common Garden

This dataset provides tower-based hyperspectral remote sensing measurements of individualPopulustrees collected with the TSWIFT system to support genetic analyses of canopy photosynthetic traits over time under drought. From 2022-08-18 to 2022-10-18, spectra were repeatedly acquired from the same targeted canopy area of each tree using fixed pointing coordinates. The dataset includes hyperspectral measurements from 400–900 nm and ultraspectral measurements from 730–780 nm. These spectra enable calculation of reflectance-based vegetation indices and other spectral traits, including solar-induced fluorescence (SIF) retrievals from the ultraspectral region. Because measurements were collected exclusively over a drought treatment plot, derived phenotypes are intended for drought-context genetic association and prediction analyses.

09 BIOMASS FUELS↗

Defining Detection Limits for Continuous Monitoring Systems for Methane Emissions at Oil and Gas Facilities

Networks of fixed-point continuous monitoring systems are becoming widely used in the detection and quantification of methane emissions from oil and gas facilities in the United States. Regulatory agencies and operators are developing performance metrics for these systems, such as minimum detection limits. Performance characteristics, such as minimum detection limits, would ideally be expressed in emission rate units; however, performance parameters such as detection limits for a continuous monitoring system (CMS) will depend on meteorological conditions, the characteristics of emissions at the site where the CMS is deployed, the positioning of CMS devices in relation to the emission sources, and the amount of time allowed for the CMS to detect an emission source. This means that certifying the performance of a CMS will require test protocols with well-defined emission rates and durations; initial protocols are now being used in field tests. Field testing results will vary, however, depending on meteorological conditions and the time allowed for detection. This work demonstrates methods for evaluating CMS performance characteristics using dispersion modeling and defines an approach for normalizing test results to standard meteorological conditions using dispersion modeling.

Chen, Qining (ORCID:0000000316908091)↗

Robust Learning with Implicit Residual Networks

In this effort, we propose a new deep architecture utilizing residual blocks inspired by implicit discretization schemes. As opposed to the standard feed-forward networks, the outputs of the proposed implicit residual blocks are defined as the fixed points of the appropriately chosen nonlinear transformations. We show that this choice leads to the improved stability of both forward and backward propagations, has a favorable impact on the generalization power, and allows for control the robustness of the network with only a few hyperparameters. In addition, the proposed reformulation of ResNet does not introduce new parameters and can potentially lead to a reduction in the number of required layers due to improved forward stability. Finally, we derive the memory-efficient training algorithm, propose a stochastic regularization technique, and provide numerical results in support of our findings.

Reshniak, Viktor↗

Stability Analysis of Parameter Varying Genetic Toggle Switches Using Koopman Operators

The genetic toggle switch is a well known model in synthetic biology that represents the dynamic interactions between two genes that repress each other. The mathematical models for the genetic toggle switch that currently exist have been useful in describing circuit dynamics in rapidly dividing cells, assuming fixed or time-invariant kinetic rates. There is a growing interest in being able to model and extend synthetic biological function for growth conditions such as stationary phase or during nutrient starvation. As cells transition from one growth phase to another, kinetic rates become time-varying parameters. In this paper, we propose a novel class of parameter varying nonlinear models that can be used to describe the dynamics of genetic circuits, including the toggle switch, as they transition from different phases of growth. We show that there exists unique solutions for this class of systems, as well as for a class of systems that incorporates the microbial phenomena of quorum sensing. Further, we show that the domain of these systems, which is the positive orthant, is positively invariant. We also showcase a theoretical control strategy for these systems that would grant asymptotic monostability of a desired fixed point. We then take the general form of these systems and analyze their stability properties through the framework of time-varying Koopman operator theory. A necessary condition for asymptotic stability is also provided as well as a sufficient condition for instability. A Koopman control strategy for the system is also proposed, as well as an analogous discrete time-varying Koopman framework for applications with regularly sampled measurements.

Harrison, Jamiree (ORCID:0000000265351579)↗

Qubit Regularization and Qubit Embedding Algebras

Qubit regularization is a procedure to regularize the infinite dimensional local Hilbert space of bosonic fields to a finite dimensional one, which is a crucial step when trying to simulate lattice quantum field theories on a quantum computer. When the qubit-regularized lattice quantum fields preserve important symmetries of the original theory, qubit regularization naturally enforces certain algebraic structures on these quantum fields. We introduce the concept of qubit embedding algebras (QEAs) to characterize this algebraic structure associated with a qubit regularization scheme. We show a systematic procedure to derive QEAs for the O(N) lattice spin models and the SU(N) lattice gauge theories. While some of the QEAs we find were discovered earlier in the context of the D-theory approach, our method shows that QEAs are far richer. A more complete understanding of the QEAs could be helpful in recovering the fixed points of the desired quantum field theories.

97 MATHEMATICS AND COMPUTING↗

A DG-IMEX Method for Two-moment Neutrino Transport: Nonlinear Solvers for Neutrino–Matter Coupling

Neutrino-matter interactions play an important role in core-collapse supernova (CCSN) explosions as they contribute to both lepton number and/or four-momentum exchange between neutrinos and matter, and thus act as the agent for neutrino-driven explosions. Due to the multiscale nature of neutrino transport in CCSN simulations, an implicit treatment of neutrino-matter interactions is desired, which requires solutions of coupled nonlinear systems in each step of the time integration scheme. In this paper we design and compare nonlinear iterative solvers for implicit systems with energy coupling neutrino-matter interactions commonly used in CCSN simulations. Specifically, we consider electron neutrinos and antineutrinos, which interact with static matter configurations through the Bruenn 85 opacity set. The implicit systems arise from the discretization of a nonrelativistic two-moment model for neutrino transport, which employs the discontinuous Galerkin (DG) method for phase-space discretization and an implicit-explicit (IMEX) time integration scheme. In the context of this DG-IMEX scheme, we propose two approaches to formulate the nonlinear systems — a coupled approach and a nested approach. For each approach, the resulting systems are solved with Anderson-accelerated fixedpoint iteration and Newton’s method. The performance of these four iterative solvers has been compared on relaxation problems with various degree of collisionality, as well as proto-neutron star deleptonization problems with several matter profiles adopted from spherically symmetric CCSN simulations. Here, numerical results suggest that the nested Anderson-accelerated fixed-point solver is more efficient than other tested solvers for solving implicit nonlinear systems with energy coupling neutrino-matter interactions.

79 ASTRONOMY AND ASTROPHYSICS↗

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↗

dlmcfpt.c1

The DLMC VAP uses inertial data from the ARM NAV system to transform the Doppler lidar beam angles (az and el) from the lidar's frame of reference to an Earth-fixed frame such the azimuth angle is measured clockwise from true north and the elevation angle is measured from the local horizon. Additionally, the VAP compensates the observed radial (air) velocity data for the effects of the platform velocity (i.e. corrected_radial_velocity = observed_radial_velocity-platform_radial_velocity). The VAP was developed specifically for MOSAiC. The dlmcfpt.c1 product contains the fixed point, or staring data. The dlmcusr.c1 product contains a user defined scan which is anything the operator wants it to be.

54 ENVIRONMENTAL SCIENCES↗

dlmcusr.c1

The DLMC VAP uses inertial data from the ARM NAV system to transform the Doppler lidar beam angles (az and el) from the lidar's frame of reference to an Earth-fixed frame such the azimuth angle is measured clockwise from true north and the elevation angle is measured from the local horizon. Additionally, the VAP compensates the observed radial (air) velocity data for the effects of the platform velocity (i.e. corrected_radial_velocity = observed_radial_velocity-platform_radial_velocity). The VAP was developed specifically for MOSAiC. The dlmcfpt.c1 product contains the fixed point, or staring data. The dlmcusr.c1 product contains a user defined scan which is anything the operator wants it to be.

54 ENVIRONMENTAL SCIENCES↗

dlfpt2.b1

Doppler Lidar - Partial Fixed Pointing mode

54 ENVIRONMENTAL SCIENCES↗

Artificial Intelligence and Computer Vision for Cost-Effective Benthic Habitat Characterizations

Machine learning applied to computer vision and pattern recognition is a type of artificial intelligence that has advanced rapidly in the last 10 to 15 years, spurred forward by breakthroughs in deep convolutional neural networks. These state-of-the-art methods are poised to become widely used in environmental monitoring applications as a result of the increasing abundance of data available from different imaging platforms (e.g., fixed-point cameras, drone surveys, high-resolution satellite data) that can be analyzed to observe, model, and understand environmental conditions. Computer vision and pattern recognition (CVPR) tools advance our ability to use imagery and camera-based tools in cost-effective ways for environmental monitoring. Although these techniques offer great potential, some challenges remain, such as the need for large sets of labeled images for model training and validation and optimized hardware and software to ensure that the models can be trained effectively and in a reasonable amount of time. Here, we have overcome many of these rate-limiting challenges by using a diverse image library built across multiple projects coupled with staff expertise and onsite computing resources. We are working toward a fully automated SPI processing system and also are moving to develop CVPR analytical tools for other imaging platforms and data sets.

02 PETROLEUM↗

Equations of Motion for the Vertical Rigid-Body Rotor: Linear and Nonlinear Cases

Centuries ago, the prolific mathematician Leonhard Euler (1707–1783) wrote down the equations of motion (EOM) for the heavy symmetrical top with one point fixed. The resulting set of equations turned out to be nonlinear and had a limited number of closed-form solutions.Today, tools such as transfer matrix and finite elements enable the calculation of the rotordynamic properties for rotor-bearing systems. Some of these tools rely on the “linearized” version of the EOM to calculate the eigenvalues, unbalance response, or transients in these systems.In fact, industry standards mandate that rotors be precisely balanced to have safe operational characteristics. However, in some cases, the nonlinear aspect of the EOM should be considered.The purpose of this chapter is to show examples of how the linear vs. nonlinear formulations differ. This chapter also shows how excessive unbalance is capable of dramatically altering the behavior of the system and can produce chaotic motions associated with the “jump” phenomenon.

Laos, Hector↗

thornado-transport: Anderson- and GPU-accelerated nonlinear solvers for neutrino-matter coupling

Algorithms for neutrino-matter coupling in core-collapse supernovae (CCSNe) are investigated in the context of a spectral two-moment model, which is discretized in space with the discontinuous Galerkin method, integrated in time with implicit-explicit (IMEX) methods, and implemented in the toolkit for high-order neutrino-radiation hydrodynamics (thornado). The model considers electron neutrinos and antineutrinos and tabulated opacities from Bruenn (1985), which includes neutrino-electron scattering and pair processes. The nonlinear system arising from implicit time discretization of the equations governing neutrino-matter coupling is iterated to convergence using Anderson-accelerated fixed-point methods, which avoid formation of Jacobians and inversion of dense linear systems. Numerical experiments show that, for a given tolerance, a nested iteration scheme which aims to reduce opacity evaluations can lower the computational cost. Our initial port to GPUs, using both OpenMP and OpenACC, shows an overall speedup of up to ~ 100× when compared to results using a single CPU core. These results indicate that the algorithms implemented in thornado are well-suited to GPU acceleration.

Laiu, Paul↗

Development of Segregated Thermal-Hydraulics Solvers in MOOSE

The simulation of fluid flows is an essential part of the design and analysis of nuclear systems. Algorithms able to simulate flows at different fidelity levels are available in the Multiphysics Object-Oriented Simulation Environment (MOOSE) and MOOSE-based applications such as Pronghorn \cite{novak2018pronghorn}, Pronghorn-Subchannel, RELAP-7, and SAM. Currently, significant effort is being invested in the development of coarse-mesh Computational Fluid Dynamics (CFD) capabilities within MOOSE and Pronghorn for the simulation of Generation IV nuclear reactors. Traditionally, the solution algorithms in MOOSE have relied on Newton or quasi-Newton methods (such as the preconditioned Jacobian-free Newton-Krylov method) where residuals and Jacobians (or approximations thereof) are constructed. Both Newton and quasi-Newton methods require the solution of a linear system at each nonlinear Newton iteration with the Jacobian as the system matrix. The Jacobian contains blocks originating from all variables in the problem (i.e., for thermal-hydraulics at least pressure, velocities, and temperature). Due to the formulation of the problem in a general multiphysics setting on unstructured mesh, creating a good preconditioner for the linear system can be challenging, thus many fluid applications have utilized direct solver-based methods such as LU factorization. However, with increasing system size and complexity in multi-dimensional problems, the direct solution of linear systems becomes computationally expensive both in execution time and and memory. For this reason, recent effort has focused on adapting segregated solution algorithms for CFD problems in MOOSE. These algorithms use fixed-point iteration between segregated systems whose assembly and preconditioning are easier those of the monolithic system. Initial results show that the segregated solution algorithm outperforms the monolithic approach in terms of memory usage and for large 3D problems in terms of CPU time as well.

42 ENGINEERING↗

Development of Segregated Thermal-Hydraulics Solvers in MOOSE

The simulation of fluid flows is an essential part of the design and analysis of nuclear systems. Algorithms able to simulate flows at different fidelity levels are available in the Multiphysics Object-Oriented Simulation Environment (MOOSE) and MOOSE-based applications such as Pronghorn \cite{novak2018pronghorn}, Pronghorn-Subchannel, RELAP-7, and SAM. Currently, significant effort is being invested in the development of coarse-mesh Computational Fluid Dynamics (CFD) capabilities within MOOSE and Pronghorn for the simulation of Generation IV nuclear reactors. Traditionally, the solution algorithms in MOOSE have relied on Newton or quasi-Newton methods (such as the preconditioned Jacobian-free Newton-Krylov method) where residuals and Jacobians (or approximations thereof) are constructed. Both Newton and quasi-Newton methods require the solution of a linear system at each nonlinear Newton iteration with the Jacobian as the system matrix. The Jacobian contains blocks originating from all variables in the problem (i.e., for thermal-hydraulics at least pressure, velocities, and temperature). Due to the formulation of the problem in a general multiphysics setting on unstructured mesh, creating a good preconditioner for the linear system can be challenging, thus many fluid applications have utilized direct solver-based methods such as LU factorization. However, with increasing system size and complexity in multi-dimensional problems, the direct solution of linear systems becomes computationally expensive both in execution time and and memory. For this reason, recent effort has focused on adapting segregated solution algorithms for CFD problems in MOOSE. These algorithms use fixed-point iteration between segregated systems whose assembly and preconditioning are easier those of the monolithic system. Initial results show that the segregated solution algorithm outperforms the monolithic approach in terms of memory usage and for large 3D problems in terms of CPU time as well.

42 ENGINEERING↗