Search NASA⌕ Search

SEARCH · Search NASA

Results for “Arithmetic”

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 469 records · Page 26
All sourcesNASA NTRSDOE OSTI
NASA NTRS2016

An Optimized Multicolor Point-Implicit Solver for Unstructured Grid Applications on Graphics Processing Units

In the field of computational fluid dynamics, the Navier-Stokes equations are often solved using an unstructuredgrid approach to accommodate geometric complexity. Implicit solution methodologies for such spatial discretizations generally require frequent solution of large tightly-coupled systems of block-sparse linear equations. The multicolor point-implicit solver used in the current work typically requires a significant fraction of the overall application run time. In this work, an efficient implementation of the solver for graphics processing units is proposed. Several factors present unique challenges to achieving an efficient implementation in this environment. These include the variable amount of parallelism available in different kernel calls, indirect memory access patterns, low arithmetic intensity, and the requirement to support variable block sizes. In this work, the solver is reformulated to use standard sparse and dense Basic Linear Algebra Subprograms (BLAS) functions. However, numerical experiments show that the performance of the BLAS functions available in existing CUDA libraries is suboptimal for matrices representative of those encountered in actual simulations. Instead, optimized versions of these functions are developed. Depending on block size, the new implementations show performance gains of up to 7x over the existing CUDA library functions.

Zubair, Mohammad↗
NASA NTRS2016

Appreciation of the 2015 JGR Space Physics Peer Reviewers

The Editors of the Journal of Geophysical Research Space Physics are deeply indebted to the many people among the research community that serve this journal through peer review. The journal could not exist without the time and effort invested by the community through this voluntary activity, providing expert evaluations and thoughtful assessments of the work of others. In 2015, the journal had 1506 scientists contribute to the process with at least one peer review, for a total of 3575 reviews completed, including additional reviews of resubmitted manuscripts. There were 277 reviewers that contributed four or more reports in 2015. The average number of reviews per referee in 2015 was, therefore, 2.4. Note that the total number of manuscript final decisions (i.e., accept or reject) for Journal of Geophysical Research (JGR) Space Physics was 1147 in 2015. Of this, 774 were accepted and 373 were declined, for an acceptance rate of 67% last year. If the 1334 "revision" decisions are included in the tally, then the total number of decisions made in 2015 was 2481. Working out the arithmetic, it means that on average, a manuscript gets about 1.2 revision decisions before a final accept-or-reject decision. This explains the ~3.1 average number of reviews per manuscript throughout each paper's lifetime in the submission-revision editorial process. We are pleased and happy that the research community is willing and able to devote their resources toward this service endeavor. We appreciate each and every one of you that helped maintain the high quality of papers in JGR Space Physics last year. We look forward to another excellent year working with all of you through the year ahead.

Liemohn, Michael W.↗
NASA NTRS2018

Design and Development of a Laboratory-Scale Ice Adhesion Testing Device

When an aircraft traverses through clouds containing supercooled water droplets, in-flight icing can occur that negatively affects vehicle performance by increasing weight and drag leading to loss of lift. Super-cooled water droplets present in clouds that impact vehicle surfaces can lead to inflight icing any time during the year.1 Most events occur at temperatures ranging from 0 to -20degC. Ice generated on the aircraft can vary between clear/glaze, rime, and mixed (Fig. 1) depending on air temperature (-5 to -20degC), liquid water content (0.3-0.6 g/m3), and droplet size (median volumetric diameter of 15-40 μm). Current strategies to remove ice are based on active technologies such as pneumatic boots, heated surfaces, and deicing agents (i.e., ethylene- and propylene-based glycols). The latter have potential environmental concerns. A passive approach to mitigate accreting ice that is actively being investigated are protective coatings. An ice mitigating coating could potentially be used as a stand-alone material, but more likely in combination with an active approach. In the latter scenario, potential reduction in power consumption by the active approach may be realized. To determine the ice adhesion strength of impact ice that is representative of the aircraft environment is not a trivial matter. Test methods utilizing slowly formed ice (i.e., freezer ice) do not accurately simulate this environment. Likewise, some testing methodologies involve sample relocation from the icing environment to the test chamber that can result in thermal shock to the sample, thus affecting the results. The Adverse Environment Rotor Test Stand (AERTS) located at Pennsylvania State University (PSU) has been demonstrated to simulate impact icing conditions within the icing envelope for the determination of ice adhesion shear strength (IASS) without removal/relocation of the sample.2 Due to the confidence in results obtained from AERTS, this instrument is in high demand and requires a significant amount of lead time and capital investment to obtain IASS results. As a solution for quickly and economically screening coatings in a controlled manner under impact icing conditions, a laboratory-scale ice adhesion test and dead blades were then removed from the rotor/blade assembly to obtain the final mass. The IASS of the live blade was determined from the difference in mass (before and after testing) of the live and dead blades, the ice shed area, and the rpm of the shed event. The same live blade sample was tested in triplicate at all three test temperatures. Surface roughness was determined using a Bruker Dektak XT Stylus Profilometer. Measurements were conducted using a 12.5 μm tip at a vertical range of 65.5 μm with an applied force of 3 mg. Data were collected over a 1.0 mm length at a resolution of 0.056 μm/point. Five single line scans at different locations were collected and processed using a two-point leveling subtraction. The resultant Ra (arithmetic roughness) and Rq (root mean square roughness) average values were calculated.

Smith, Joseph G., Jr.↗
NASA NTRS2018

A Formally Verified Floating-Point Implementation of the Compact Position Reporting Algorithm

The Automatic Dependent Surveillance-Broadcast (ADS-B) system allows aircraft to communicate their current state, including position and velocity information, to other aircraft in their vicinity and to ground stations. The Compact Position Reporting (CPR) algorithm is the ADS-B module responsible for the encoding and decoding of aircraft positions. CPR is highly sensitive to computer arithmetic since it heavily relies on functions that are intrinsically unstable such as floor and modulo. In this paper, a formally-verified double-precision floating-point implementation of the CPR algorithm is presented. The verification proceeds in three steps. First, an alternative version of CPR, which reduces the floating-point rounding error is proposed. Then, the Prototype Verification System (PVS) is used to formally prove that the ideal real-number counterpart of the improved algorithm is mathematically equivalent to the standard CPR definition. Finally, the static analyzer Frama-C is used to verify that the double-precision implementation of the improved algorithm is correct with respect to its operational requirement. The alternative algorithm is currently being considered for inclusion in the revised version of the ADS-B standards document as the reference implementation of the CPR algorithm.

Laura Titolo↗
NASA NTRS2010

TPSAS-NF1676L-9990-DND

PVS (Prototype Veri cation System)1 is an interactive environment for the specification and verification of systems. PVS provides a strongly typed specification language, which is based on Higher-Order Logic. The type system of PVS supports: sub-typing, dependent-types, abstract data types, parametric types, records, unions, and tuples. The PVS theorem prover includes decision procedures for a variety of theories such as linear arithmetic, propositional logic, and temporal logic. This seminar will provide a gentle introduction to the basic and advanced features of PVS, including: theory interpretations, real number proving, batch proving, rapid prototyping, and strategy development. All these features are illustrated with simple examples and exercises.

César Muñoz↗
NASA NTRSDate not supplied

Towards Formalization of Advanced Linear Algebra with Applications to Dynamical Systems using PVS

Linear Algebra is essential for numerous aerospace problems of interest. Formal reasoning about hybrid systems that contain variables modeled by differential equations rely on concepts from Linear Algebra such as eigenvalues, matrix decompositions, and matrix valued functions. For example, the long-term dynamics of a system of differential equations depend on the stability/instability of its equilibrium points, which often reduces to an eigenvalue problem. This talk will embark on a quest to formalize theorems and results about eigenvalues and eigenvectors using PVS. We shall start our journey with 2 x 2 complex matrices, where we will apply our PVS code to a simple example of a dynamical system. Since it can be difficult or impossible to give simple expressions of eigenvalues for larger matrices (i.e. 5 x 5 or higher), we then move towards specifying the power method for verified computation of eigenvalue approximations in PVS. This effort requires development of multivariate complex arithmetic. At the end of the day, having such additions to the PVS NASA libraries will help move towards the use of formal methods to verify concepts of control theory and system level verification.

Linear Algebra↗
NASA NTRSDate not supplied

Memory Optimizations for Sparse Linear Algebra on GPU Hardware

An effort to maximize memory bandwidth utilization for a sparse linear algebra kernel executing on NVIDIA® Tesla V100 and A100 Graphics Processing Units (GPUs) is described. The kernel consists of a block-sparse matrix-vector product and a series of forward/backward triangular solves. The computation is memory-bound and exhibits low arithmetic intensity. Along with a relatively small block size, the data layout poses a challenge to effectively utilize the available memory bandwidth on common GPU architectures. An earlier implementation using a warp to process a single row of the matrix was found to yield good memory performance on the V100 architecture. However, anew approach, which assigns a warp to six rows of the matrix, is proposed for the A100. In addition, two new features offered by the A100 architecture are explored.L2residency control enables a portion of theL2cache to be used for persistent data access, and the asynchronous copy instruction allows data to be loaded directly from main memory into shared memory. Demonstrations show that the new implementation improves memory bandwidth utilization from 71.5% to 81.2% of the peak available on theA100 architecture.

GPU↗
NASA NTRS2022

Retraction Note: A 10 per cent increase in global land evapotranspiration from 2003 to 2019

In this article, we calculated global land evapotranspiration for 2003 to 2019 using a massbalance approach. To do this, we calculated evapotranspiration as the residual of the water balance, using an ensemble of datasets for precipitation, discharge and total water storage change. We made an error in calculating the global mean precipitation: we used arithmetic averaging to calculate the mean, instead of calculating a spatially weighted mean to account for the changing grid box size with latitude. As a result, the magnitudes of the global mean precipitation time series were underestimated. This impacted the subsequent calculation of global mean evapotranspiration, resulting in the mean evapotranspiration values being underestimated and altering some results. We are therefore retracting this article. We thank Ning Ma and others for bringing this error to our attention.

Madeleine Pascolini-Campbell↗
NASA NTRS2022

The Harmonic Linearized Navier-Stokes Equations for Transition Prediction in Three-Dimensional Flows

The conventional method to predict the onset of laminar-turbulent transition in convectively unstable boundary-layer flows is based on the logarithmic amplification ratio, the so-called N-factor, of the linear instability waves. To calculate the N-factor, the flow variables are decomposed into a laminar basic state solution and the linear disturbances, which are assumed to be harmonic in time. The most commonly used linear stability analysis approaches include the locally parallel linear stability theory (LST) and the nonlocal, weakly nonparallel parabolized stability equations (PSE). However, these methods do not account for strong streamwise gradients that are encountered in several configurations of interest, such as those in the vicinity of roughness elements, steps, gaps, or corners. To compute the linear evolution of disturbances along such strongly nonparallel regions, the harmonic linearized Navier-Stokes equations (HLNSE) need to be solved. The discretization of the HLNSE for spanwise/azimuthally inhomogeneous laminar basic states yields a linear system of complex arithmetic with a leading dimension of the order of 10^(7) to 10^(8) even in relatively simple flows. A combined multithread and multiprocessor algorithm is implemented for the direct solution of such linear systems. Results for a supersonic boundary layer over a three-dimensional roughness patch show good agreement with experimental measurements when the evolution of the instability waves over the roughness patch is included via the HLNSE. Additionally, inflow-resolvent analysis based on the HLNSE for discrete-roughness-induced disturbances in the nose tip of a blunt cone at Mach 6 demonstrates the importance of including the disturbance amplification along the near vicinity of the roughness element and separation region.

Boundary Layer Stability↗
NASA NTRS2022

The Harmonic Linearized Navier-Stokes Equations for Transition Prediction in Three-Dimensional Flows

The conventional method to predict the onset of laminar-turbulent transition in convectively unstable boundary-layer flows is based on the logarithmic amplification ratio, the so-called N-factor, of the linear instability waves. To calculate the N-factor, the flow variables are decomposed into a laminar basic state solution and the linear disturbances, which are assumed to be harmonic in time. The most commonly used linear stability analysis approaches include the locally parallel linear stability theory (LST) and the non-local, weakly nonparallel parabolized stability equations (PSE). However, these methods do not account for strong streamwise gradients that are encountered in several configurations of interest, as roughness elements, steps, gaps, or corners. To solve the linear evolution of disturbances along such strongly nonparallel regions, the harmonic linearized Navier-Stokes equations (HLNSE) need to be solved. The discretization of the HLNSE for spanwise/azimuthally inhomogeneous laminar basic states yields a linear system of complex arithmetic with a leading dimension of the order of 107 to 108. A combined multithread and multiprocessor algorithm is implemented for the direct solution of such linear system. Results for a supersonic boundary layer over a three-dimensional roughness patch show good agreement with experimental measurements when the evolution of the instability waves over the roughness patch is included via the HLNSE.

Boundary Layer Stability↗
NASA NTRS2022

Structural and chemical complexity of minerals: An update

The complexities of chemical composition and crystal structure are fundamental characteristics of minerals that have high relevance to the understanding of their stability, occurrence and evolution. This review summarises recent developments in the field of mineral complexity and outlines possible directions for its future elaboration. The database of structural and chemical complexity parameters of minerals is updated by H-correction of structures with unknown H positions and the inclusion of new data. The revised average complexity values (arithmetic means) for all minerals are 3.54(2) bits/atom and 345(10) bits/cell (based upon 4443 structure reports). The distributions of atomic information amounts, chemIG and strIG, versus the number of mineral species fit the normal modes, whereas the distributions of total complexities, chemIG,total and strIG,total, along with numbers of atoms per formula and per unit cell are log normal. The three most complex mineral species known today are ewingite, morrisonite and ilmajokite, all either discovered or structurally characterised within the last five years. The most important complexity-generating mechanisms in minerals are: (1) the presence of isolated large clusters; (2) the presence of large clusters linked together to form three-dimensional frameworks; (3) formation of complex three-dimensional modular frameworks; (4) formation of complex modular layers; (5) high hydration state in salts with complex heteropolyhedral units; and (6) formation of ordered superstructures of relatively simple structure types. The relations between symmetry and complexity are considered. The analysis of temporal dynamics of mineralogical discoveries since 1875 with the step of 25 years show the increasing chemical and structural complexities of human knowledge of the mineral kingdom in the history of mineralogy. In the Earth’s history, both diversity and complexity of minerals experience dramatic increases associated with the formation of Earth’s continental crust, initiation of plate tectonics and the Great Oxidation event.

complexity↗
NASA NTRSDate not supplied

A Provably Correct Floating-Point Implementation of Well Clear Avionics Concepts

The NASA DAIDALUS library provides formal definitions for Detect-and-Avoid avionics concepts such as when an aircraft is well-clear with respect to the surrounding air traffic, i.e., it does not operate in such proximity to create a collision hazard. While several properties are proven correct for DAIDALUS assuming ideal real number arithmetic, an actual implementation that uses floating-point numbers may behave unexpectedly because of round-off errors and run-time exceptions. This paper presents an experience report on the application of a formal methods toolchain to extract and verify floating-point C code from a real-valued specification of the well-clear module of DAIDALUS. This toolchain comprises the PVS theorem prover, the PRECiSA floating-point analyzer and code generator, and the Frama-C analysis suite. The generated code is automatically instrumented to detect when the control flow of the floating-point program may diverge from the ideal real number specification, and it is annotated with contracts that state the maximum accumulated round-off error. The absence of overflows is also formally verified for the generated code. In order to apply the toolchain to an industrial case study such as DAIDALUS, a formally verified pre-processing of the input specification is performed, which includes a program slicing and several semantic-preserving simplifications.

Program verification↗
NASA NTRSDate not supplied

Perturbations in Brain Functional Connectivity Patterns After Waking From Slow Wave Sleep Under Different Cognitive States

Sleep inertia refers to the state of transition between sleep and wake characterized by impaired alertness, confusion, and reduced cognitive and behavioral performance. While the behavioral symptoms of sleep inertia are well described, the neurological changes that lead to this state remain elusive. Here, to understand the state of sleep inertia and the reorganization that the brain undergoes, we took a graph theoretical approach and compared the EEG derived brain connectivity patterns before sleep and after waking up while participants (n = 10) performed multiple tasks that differed in cognitive complexities. We focused on how the degree and the clustering coefficient of brain regions (EEG sensors) change immediately after participants wake up from slow wave sleep. During a psychomotor vigilance task (PVT), designed to assess vigilant attention, we find that the brain regions with strong network connectivity (degree) before sleep show a reduction in connectivity after waking. In contrast, those with low connectivity before sleep have greater connectivity after waking. The regions that undergo these changes are specific to each participant and these findings are unique to the beta frequency range, which plays a key role in sensorimotor functioning and preserving the current state of the brain. Moreover, in tasks that required inhibitory control and arithmetic reasoning, we found that only regions with weak connectivity before sleep exhibited more connections after waking, but regions with high connectivity prior to sleeping remained unchanged, highlighting task specific effects. Furthermore, we find that during the PVT, the clustering coefficient within low frequency oscillations of the brain is reduced upon waking while it remains unchanged during other tasks. These results suggest that the connections between regions that are lost after abrupt awakening can be reallocated to other regions in order to renormalize the brain. However, this response may only be evident during specific cognitive states and may be more nuanced during complex task performance.

sleep inertia↗
DOE OSTI2025

Sub-microsecond Transformers for Jet Tagging on FPGAs

We present the first sub-microsecond transformer implementation on an FPGA achieving competitive performance for state-of-the-art high-energy physics benchmarks. Transformers have shown exceptional performance on multiple tasks in modern machine learning applications, including jet tagging at the CERN Large Hadron Collider (LHC). However, their computational complexity prohibits use in real-time applications, such as the hardware trigger system of the collider experiments up until now. In this work, we demonstrate the first application of transformers for jet tagging on FPGAs, achieving $\mathcal{O}(100)$ nanosecond latency with superior performance compared to alternative baseline models. We leverage high-granularity quantization and distributed arithmetic optimization to fit the entire transformer model on a single FPGA, achieving the required throughput and latency. Furthermore, we add multi-head attention and linear attention support to hls4ml, making our work accessible to the broader fast machine learning community. This work advances the next-generation trigger systems for the High Luminosity LHC, enabling the use of transformers for real-time applications in high-energy physics and beyond.

Laatu, Lauri [Imperial Coll., London]↗
DOE OSTI2026

Fast and Accurate Intersections on a Sphere

We introduce a fast, high-precision algorithm for calculating intersections between great circle arcs and lines of constant latitude on the unit sphere. We first propose a simplified intersection point formula with improved speed and numerical robustness over the ones traditionally implemented in geoscience software. We then show how algorithms based on the concept of error-free transformations (EFT) can be applied to evaluate this formula within a relative error bound that is on the order of machine precision. Here, we demonstrate that, with a vectorized and parallelized implementation, this enhanced accuracy is achieved with no compute time overhead compared to a direct calculation in hardware floating point, making our algorithm suitable for performance-sensitive applications like regridding of high-resolution climate data. In contrast, evaluating our formula using high-precision data types like quadruple precision and arbitrary precision, or using the robust intersection computation routines from the Computational Geometry Algorithms Library, leads to significant computational overhead, especially since these alternatives inhibit vectorization. More generally, our work demonstrates how EFT techniques can be combined and extended to implement nontrivial geometric calculations with high accuracy and speed.

Environmental sciences↗
DOE OSTI2025

ComPort: Rigorous Testing Methods to Safeguard Software Porting (Final Technical Report)

This is a technical report from the lead institution – University of Utah, Kahlert School of Computing – funded under the Department of Energy, Office of Science, Office of Advanced Scientific Computing Research under award number DE-SC0022252. We summarize our work done over the three years of funding received. The relevant papers and software have already been uploaded at the DOE site.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1984

The Development of an Airborne Instrumentation Computer System for Flight Test

Instrumentation interfacing frequently requires the linking of intelligent systems together, as well as requiring the link itself to be intelligent. The airborne instrumentation computer system (AICS) was developed to address this requirement. Its small size, approximately 254 by 133 by 140 mm (10 by 51/4 by 51/2 in), standard bus, and modular board configuration give it the ability to solve instrumentation interfacing and computation problems without forcing a redesign of the entire unit. This system has been used on the F-15 aircraft digital electronic engine control (DEEC) and its follow on engine model derivative (EMD) project and in an OV-1C Mohawk aircraft stall speed warning system. The AICS is presently undergoing configuration for use on an F-104 pace aircraft and on the advanced fighter technology integration (AFTI) F-111 aircraft.

Voice synthesizer↗