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 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
NASA NTRS2001

Using EEG To Detect and Monitor Mental Fatigue

This project aims to develop EEG-based methods for detecting and monitoring mental fatigue. Mental fatigue poses a serious risk, even when performance is not apparently degraded. When such fatigue is associated with sustained performance of a single type of cognitive task it may be related to the metabolic energy required for sustained activation of cortical areas specialized for that task. The objective of this study was to adapt EEG to monitor cortical energy over a long period of performance of a cognitive task. Multielectrode event related potentials (ERPs) were collected every 15 minutes in nine subjects who performed a mental arithmetic task (algebraic sum of four randomly generated negative or positive digits). A new problem was presented on a computer screen 0.5 seconds after each response; some subjects endured for as long as three hours. ERPs were transformed to a quantitative measure of scalp electrical field energy. The average energy level at electrode P3 (near the left angular gyrus), 100-300 msec latency, was compared over the series of ERPs. For most subjects, scalp energy density at P3 gradually fell over the period of task performance and dramatically increased just before the subject was unable to continue the task. This neural response can be simulated for individual subjects using, a differential equation model in which it is assumed that the mental arithmetic task requires a commitment of metabolic energy that would otherwise be used for brain activities that are temporarily neglected. Their cumulative neglect eventually requires a reallocation of energy away from the mental arithmetic task.

Montgomery, Leslie↗
NASA NTRS2010

Model-Checking with Edge-Valued Decision Diagrams

We describe an algebra of Edge-Valued Decision Diagrams (EVMDDs) to encode arithmetic functions and its implementation in a model checking library along with state-of-the-art algorithms for building the transition relation and the state space of discrete state systems. We provide efficient algorithms for manipulating EVMDDs and give upper bounds of the theoretical time complexity of these algorithms for all basic arithmetic and relational operators. We also demonstrate that the time complexity of the generic recursive algorithm for applying a binary operator on EVMDDs is no worse than that of Multi-Terminal Decision Diagrams. We have implemented a new symbolic model checker with the intention to represent in one formalism the best techniques available at the moment across a spectrum of existing tools: EVMDDs for encoding arithmetic expressions, identity-reduced MDDs for representing the transition relation, and the saturation algorithm for reachability analysis. We compare our new symbolic model checking EVMDD library with the widely used CUDD package and show that, in many cases, our tool is several orders of magnitude faster than CUDD.

Roux, Pierre↗
NASA NTRS2009

A Comparative Study of Randomized Constraint Solvers for Random-Symbolic Testing

The complexity of constraints is a major obstacle for constraint-based software verification. Automatic constraint solvers are fundamentally incomplete: input constraints often build on some undecidable theory or some theory the solver does not support. This paper proposes and evaluates several randomized solvers to address this issue. We compare the effectiveness of a symbolic solver (CVC3), a random solver, three hybrid solvers (i.e., mix of random and symbolic), and two heuristic search solvers. We evaluate the solvers on two benchmarks: one consisting of manually generated constraints and another generated with a concolic execution of 8 subjects. In addition to fully decidable constraints, the benchmarks include constraints with non-linear integer arithmetic, integer modulo and division, bitwise arithmetic, and floating-point arithmetic. As expected symbolic solving (in particular, CVC3) subsumes the other solvers for the concolic execution of subjects that only generate decidable constraints. For the remaining subjects the solvers are complementary.

Takaki, Mitsuo↗
DOE OSTI2016

Evaluating marginal likelihood with thermodynamic integration method and comparison with several other numerical methods

Evaluating marginal likelihood is the most critical and computationally expensive task, when conducting Bayesian model averaging to quantify parametric and model uncertainties. The evaluation is commonly done by using Laplace approximations to evaluate semianalytical expressions of the marginal likelihood or by using Monte Carlo (MC) methods to evaluate arithmetic or harmonic mean of a joint likelihood function. This study introduces a new MC method, i.e., thermodynamic integration, which has not been attempted in environmental modeling. Instead of using samples only from prior parameter space (as in arithmetic mean evaluation) or posterior parameter space (as in harmonic mean evaluation), the thermodynamic integration method uses samples generated gradually from the prior to posterior parameter space. This is done through a path sampling that conducts Markov chain Monte Carlo simulation with different power coefficient values applied to the joint likelihood function. The thermodynamic integration method is evaluated using three analytical functions by comparing the method with two variants of the Laplace approximation method and three MC methods, including the nested sampling method that is recently introduced into environmental modeling. The thermodynamic integration method outperforms the other methods in terms of their accuracy, convergence, and consistency. The thermodynamic integration method is also applied to a synthetic case of groundwater modeling with four alternative models. The application shows that model probabilities obtained using the thermodynamic integration method improves predictive performance of Bayesian model averaging. As a result, the thermodynamic integration method is mathematically rigorous, and its MC implementation is computationally general for a wide range of environmental problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Mixed-precision iterative refinement using tensor cores on GPUs to accelerate solution of linear systems

Double-precision floating-point arithmetic (FP64) has been the de facto standard for engineering and scientific simulations for several decades. Problem complexity and the sheer volume of data coming from various instruments and sensors motivate researchers to mix and match various approaches to optimize compute resources, including different levels of floating-point precision. In recent years, machine learning has motivated hardware support for half-precision floating-point arithmetic. A primary challenge in high-performance computing is to leverage reduced-precision and mixed-precision hardware. We show how the FP16/FP32 Tensor Cores on NVIDIA GPUs can be exploited to accelerate the solution of linear systems of equations Ax = b without sacrificing numerical stability. The techniques we employ include multiprecision LU factorization, the preconditioned generalized minimal residual algorithm (GMRES), and scaling and auto-adaptive rounding to avoid overflow. We also show how to efficiently handle systems with multiple right-hand sides. On the NVIDIA Quadro GV100 (Volta) GPU, we achieve a 4×-5× performance increase and 5× better energy efficiency versus the standard FP64 implementation while maintaining an FP64 level of numerical stability.

GMRES↗
DOE OSTI2017

An Analytical Time–Domain Expression for the Net Ripple Produced by Parallel Interleaved Converters

We apply modular arithmetic and Fourier series to analyze the superposition of N interleaved triangular waveforms with identical amplitudes and duty-ratios. Here, interleaving refers to the condition when a collection of periodic waveforms with identical periods are each uniformly phase-shifted across one period. The main result is a time-domain expression which provides an exact representation of the summed and interleaved triangular waveforms, where the peak amplitude and parameters of the time-periodic component are all specified in closed-form. Analysis is general and can be used to study various applications in multi-converter systems. This model is unique not only in that it reveals a simple and intuitive expression for the net ripple, but its derivation via modular arithmetic and Fourier series is distinct from prior approaches. The analytical framework is experimentally validated with a system of three parallel converters under time-varying operating conditions.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRSDate not supplied

Automatic Generation of Guard-Stable Floating-Point Code

In floating-point programs, test instability occurs when the control flow of a conditional statement diverges from its ideal execution under real arithmetic. This phenomenon is caused by the presence of round-off errors in floating-point computations. Writing programs that correctly handle test instability often require expertise on finite precision computations and rounding errors. This paper presents a fully automatic tool chain that generates and formally verifies a test-stable floating-point C program from its functional specification in real arithmetic. The generated program is instrumented to soundly detect when unstable tests may occur and, in these cases, to issue a warning. The proposed approach combines the PRECiSA floating-point static analyzer, the Frama-C software verification suite, and the PVS theorem prover.

Floating-Point Arithmetic↗
DOE OSTI2018

Improved Nested Sampling and Surrogate-Enabled Comparison With Other Marginal Likelihood Estimators

Estimating marginal likelihood is of central importance to Bayesian model selection and/or model averaging. The nested sampling method has been recently used together with the Metropolis-Hasting (M-H) sampling algorithm for estimating marginal likelihood. This study develops a new implementation of nested sampling by using the DiffeRential Evolution Adaptive Metropolis (DREAMzs) sampling algorithm. The two implementations of nested sampling are evaluated for four models of a synthetic groundwater flow modeling. The DREAMzs-based nested sampling outperforms the M-H-based nested sampling in terms of their accuracy, convergence, efficiency, and stability, which is attributed to the fact that DREAMzs is more robust than M-H for parameter sampling. The nested sampling method is also compared with four other methods (arithmetic mean, harmonic mean, stabilized harmonic mean, and thermodynamic integration) commonly used for estimating marginal likelihood and posterior probability of the four groundwater models. The comparative study requires hundreds of millions of model executions, which would not be possible without using surrogate models to replace the original models. Using the arithmetic mean estimator as the reference, the comparison reveals that thermodynamic integration outperforms nested sampling in terms of accuracy and stability, whereas nested sampling is more computationally efficient to reach to convergence. Here, the harmonic mean and stabilized harmonic mean methods give the worst marginal likelihood estimation. Accurate marginal likelihood estimation is important for accurate estimation of posterior model probability and better predictive performance of Bayesian model averaging.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2022

Multistage mixed precision iterative refinement

Abstract Low precision arithmetic, in particular half precision (16‐bit) floating point arithmetic, is now available in commercial hardware. Using lower precision can offer significant savings in computation and communication costs with proportional savings in energy. Motivated by this, there has been a renewed interest in mixed precision iterative refinement schemes for solving linear systems , and new variants of GMRES‐based iterative refinement have been developed. Each particular variant with a given combination of precisions leads to different condition number‐based constraints for convergence of the backward and forward errors, and each has different performance costs. The constraints for convergence given in the literature are, as an artifact of the analyses, often overly strict in practice, and thus could lead a user to select a more expensive variant when a less expensive one would have sufficed. In this work, we develop a multistage mixed precision iterative refinement solver which aims to combine existing mixed precision approaches to balance performance and accuracy and improve usability. For a user‐specified initial combination of precisions, the algorithm begins with the least expensive approach and convergence is monitored via inexpensive computations with quantities produced during the iteration. If slow convergence or divergence is detected using particular stopping criteria, the algorithm switches to use a more expensive, but more reliable variant. A novel aspect of our approach is that, unlike existing implementations, our algorithm first attempts to use “stronger” GMRES‐based solvers for the solution update before resorting to increasing the precision(s). In some scenarios, this can avoid the need to refactorize the matrix in higher precision. We perform extensive numerical experiments on a variety of random dense problems and problems from real applications which confirm the benefits of the multistage approach.

Oktay, Eda↗
DOE OSTI2016

Numerically stable, scalable formulas for parallel and online computation of higher-order multivariate central moments with arbitrary weights

Formulas for incremental or parallel computation of second order central moments have long been known, and recent extensions of these formulas to univariate and multivariate moments of arbitrary order have been developed. Such formulas are of key importance in scenarios where incremental results are required and in parallel and distributed systems where communication costs are high. We survey these recent results, and improve them with arbitrary-order, numerically stable one-pass formulas which we further extend with weighted and compound variants. We also develop a generalized correction factor for standard two-pass algorithms that enables the maintenance of accuracy over nearly the full representable range of the input, avoiding the need for extended-precision arithmetic. We then empirically examine algorithm correctness for pairwise update formulas up to order four as well as condition number and relative error bounds for eight different central moment formulas, each up to degree six, to address the trade-offs between numerical accuracy and speed of the various algorithms. Finally, we demonstrate the use of the most elaborate among the above mentioned formulas, with the utilization of the compound moments for a practical large-scale scientific application.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Accelerating nuclear configuration interaction calculations through a preconditioned block iterative eigensolver

We describe a number of recently developed techniques for improving the performance of large-scalenuclear configuration interaction calculations on high performance parallel computers. We show thebenefit of using a preconditioned block iterative method to replace the Lanczos algorithm that hastraditionally been used to perform this type of computation. The rapid convergence of the block iterativemethod is achieved by a proper choice of starting guesses of the eigenvectors and the construction of aneffective preconditioner. These acceleration techniques take advantage of special structure of the nuclearconfiguration interaction problem which we discuss in detail. The use of a block method also allows usto improve the concurrency of the computation, and take advantage of the memory hierarchy of modernmicroprocessors to increase the arithmetic intensity of the computation relative to data movement. Wealso discuss the implementation details that are critical to achieving high performance on massivelyparallel multi-core supercomputers, and demonstrate that the new block iterative solver is two to threetimes faster than the Lanczos based algorithm for problems of moderate sizes on a Cray XC30 system.

Shao, Meiyue↗
DOE OSTI2021

Higher-order particle representation for particle-in-cell simulations

In this paper we present an alternative approach to the representation of simulation particles for unstructured electrostatic and electromagnetic PIC simulations. In our modified PIC algorithm we represent particles as having a smooth shape function limited by some specified finite radius, r 0 . A unique feature of our approach is the representation of this shape by surrounding simulation particles with a set of virtual particles with delta shape, with fixed offsets and weights derived from Gaussian quadrature rules and the value of r 0 . As the virtual particles are purely computational, they provide the additional benefit of increasing the arithmetic intensity of traditionally memory bound particle kernels. The modified algorithm is implemented within Sandia National Laboratories' unstructured EMPIRE-PIC code, for electrostatic and electromagnetic simulations, using periodic boundary conditions. We show results for a representative set of benchmark problems, including electron orbit, a transverse electromagnetic wave propagating through a plasma, numerical heating, and a plasma slab expansion. In this work, good error reduction across all of the chosen problems is achieved as the particles are made progressively smoother, with the optimal particle radius appearing to be problem-dependent.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

Evaluating MPI resource usage summary statistics

The Message Passing Interface (MPI) remains the dominant programming model for scientific applications running on today’s high-performance computing (HPC) systems. This dominance stems from MPI’s powerful semantics for inter-process communication that has enabled scientists to write applications for simulating important physical phenomena. MPI does not, however, specify how messages and synchronization should be carried out. Those details are typically dependent on low-level architecture details and the message characteristics of the application. Therefore, analyzing an application’s MPI resource usage is critical to tuning MPI’s performance on a particular platform. The result of this analysis is typically a discussion of the mean message sizes, queue search lengths and message arrival times for a workload or set of workloads. While a discussion of the arithmetic mean in MPI resource usage might be the most intuitive summary statistic, it is not always the most accurate in terms of representing the underlying data. In this paper, we analyze MPI resource usage for a number of key MPI workloads using an existing MPI trace collector and discrete-event simulator. Our analysis demonstrates that the average, while easy and efficient to calculate, is a useful metric for characterizing latency and bandwidth measurements, but may not be a good representation of application message sizes, match list search depths, or MPI inter-operation times. Additionally, we show that the median and mode are superior choices in many cases. We also observe that the arithmetic mean is not the best representation of central tendency for data that are drawn from distributions that are multi-modal or have heavy tails. Furthermore, the results and analysis of our work provide valuable guidance on how we, as a community, should discuss and analyze MPI resource usage data for scientific applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Can We Describe Graphene Confined Water Structures as Overlapping of Approaching Graphene–Water Interfacial Structures?

We investigate the microscopic mechanisms of the overlap of interfacial structures in confined fluids and attempt to answer the question whether the confined structures can be predicted from the original density profiles of individual solid–fluid interfaces. For that purpose, we perform (globally) isobaric–isothermal (locally, grand canonical) molecular dynamics simulations to extract not only the axial distribution functions of the water sites for the uncoupled graphene–water interfaces, but also those corresponding to the confined aqueous environments over the interplate range $8 ≤ h (Å) ≤ 28$ typically at ambient conditions. We have tested two (i.e., an arithmetic and a geometric) superposition approximations for the singlet density of confined water between flat graphene plates, as well as for a combination of flat and corrugated graphene plates. The outcome of this study suggests that the answer to the title’s question is a “yes”, provided that the interplate distance h is large enough to avoid fluid geometric packing frustration.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2016

Retention of intermediate polarization states in ferroelectric materials enabling memories for multi-bit data storage

A homogeneous ferroelectric single crystal exhibits only two remanent polarization states that are stable over time, whereas intermediate, or unsaturated, polarization states are thermodynamically instable. Commonly used ferroelectric materials however, are inhomogeneous polycrystalline thin films or ceramics. To investigate the stability of intermediate polarization states, formed upon incomplete, or partial, switching, we have systematically studied their retention in capacitors comprising two classic ferroelectric materials, viz. random copolymer of vinylidene fluoride with trifluoroethylene, P(VDF-TrFE), and Pb(Zr,Ti)O{sub 3}. Each experiment started from a discharged and electrically depolarized ferroelectric capacitor. Voltage pulses were applied to set the given polarization states. The retention was measured as a function of time at various temperatures. The intermediate polarization states are stable over time, up to the Curie temperature. We argue that the remarkable stability originates from the coexistence of effectively independent domains, with different values of polarization and coercive field. A domain growth model is derived quantitatively describing deterministic switching between the intermediate polarization states. We show that by using well-defined voltage pulses, the polarization can be set to any arbitrary value, allowing arithmetic programming. The feasibility of arithmetic programming along with the inherent stability of intermediate polarization states makes ferroelectric materials ideal candidates for multibit data storage.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Spectral induced polarization monitoring of induced calcite precipitation in subsurface sediments

Co-precipitation of contaminants within the crystalline structure of calcite is a promising natural attenuation or remedial technology being considered at contaminated sites. We explore the sensitivity of the spectral induced polarization (SIP) method to induced calcite precipitation in natural sediments as a path forward to non-invasively monitor these sites. We performed time-lapse column experiments using phased (I-IV) injections over 40 days on natural sediments from the Hanford Site (Washington State, USA). In the phased injections, abiotic calcite precipitation was induced and confirmed to have occurred. Previous work in glass beads and homogeneous sand was limited to high frequency detection of calcite, however in this work we observed the development of two polarization mechanisms, one at high frequency (>100 Hz) and one at low frequency (< 100 Hz). Based on the characteristic frequencies from the SIP high and low frequency regimes, characteristic length scales (L) were computed where the adsorption mode of Na+ versus Ca2+ was compared by using diffusion coefficients corresponding to Na+ versus an arithmetically averaged value for Na+ and Ca2+. Using the diffusion coefficient of Na+, the high frequency L was found to correlate well with the size of the calcite crystals. The low frequency L correlated well with the individual natural sediment grain sizes within the columns. During late experimental times (day 36 and 40), the characteristic low frequency in two of the experimental columns shifted to lower frequencies (<0.001 Hz) which may signify SIP sensitivity of the formed calcite with the sediment grains. In field applications, the development of a low frequency polarization length scale to monitor calcite precipitation is promising for field monitoring applications, however further laboratory work needs to be performed to examine the SIP sensitivity of calcite formation in the presence of to natural sediments

calcium carbonate, calcite, precipitation, spectra↗
DOE OSTI2021

Efficient phase-factor evaluation in quantum signal processing

Quantum signal processing (QSP) is a powerful quantum algorithm to exactly implement matrix polynomials on quantum computers. Asymptotic analysis of quantum algorithms based on QSP has shown that asymptotically optimal results can in principle be obtained for a range of tasks, such as Hamiltonian simulation and the quantum linear system problem. A further benefit of QSP is that it uses a minimal number of ancilla qubits, which facilitates its implementation on near-to-intermediate term quantum architectures. However, there is so far no classically stable algorithm allowing computation of the phase factors that are needed to build QSP circuits. Existing methods require the use of variable precision arithmetic and can only be applied to polynomials of a relatively low degree. We present here an optimization-based method that can accurately compute the phase factors using standard double precision arithmetic operations. We demonstrate the performance of this approach with applications to Hamiltonian simulation, eigenvalue filtering, and quantum linear system problems. Furthermore, our numerical results show that the optimization algorithm can find phase factors to accurately approximate polynomials of a degree larger than 10000 with errors below 10 -12 .

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Fast inversion, preconditioned quantum linear system solvers, fast Green's-function computation, and fast evaluation of matrix functions

Preconditioning is the most widely used and effective way for treating ill-conditioned linear systems in the context of classical iterative linear system solvers. We introduce a quantum primitive called fast inversion, which can be used as a preconditioner for solving quantum linear systems. The key idea of fast inversion is to directly block encode a matrix inverse through a quantum circuit implementing the inversion of eigenvalues via classical arithmetics. We demonstrate the application of preconditioned linear system solvers for computing single-particle Green's functions of quantum many-body systems, which are widely used in quantum physics, chemistry, and materials science. We analyze the complexities in three scenarios: the Hubbard model, the quantum many-body Hamiltonian in the plane-wave-dual basis, and the Schwinger model. We also provide a method for performing Green's function calculation in second quantization within a fixed-particle manifold and note that this approach may be valuable for simulation more broadly. Aside from solving linear systems, fast inversion also allows us to develop fast algorithms for computing matrix functions, such as the efficient preparation of Gibbs states. Furthermore, we introduce two efficient approaches for such a task, based on the contour-integral formulation and the inverse transform, respectively.

97 MATHEMATICS AND COMPUTING↗