Search NASA⌕ Search

SEARCH · Search NASA

Results for “numerical algorithm computing”

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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Dyson maps and unitary evolution for Maxwell equations in tensor dielectric media

The propagation and scattering of electromagnetic waves in dielectric media is of theoretical and experimental interest in a wide variety of fields. An understanding of observational results generally requires a numerical solution of Maxwell equations—usually implemented on conventional computers using sophisticated numerical algorithms. In recent years, advances in quantum information science and in the development of quantum computers have piqued curiosity about taking advantage of these resources for an alternate numerical approach to Maxwell equations. This requires a reformulation of the classical Maxwell equations into a form suitable for quantum computers which, unlike conventional computers, are limited to unitary operations. In this paper, a unitary framework is developed for the propagation of electromagnetic waves in a spatially inhomogeneous, passive, nondispersive, and anisotropic dielectric medium. For such a medium, generally, the evolution operator in the combined Faraday-Ampere equations is not unitary. There are two steps needed to convert this equation into a unitary evolution equation. In the first step, a weighted Hilbert space is formulated in which the generator of dynamics is a pseudo-Hermitian operator. In the second step, a Dyson map is constructed which maps the weighted-physical-Hilbert space to the original Hilbert space. Furthermore, the resulting evolution equation for the electromagnetic wave fields is unitary. Utilizing the framework developed in these steps, a unitary evolution equation is derived for electromagnetic wave propagation in a uniaxial dielectric medium. The resulting form is suitable for quantum computing.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

ZFP: A compressed array representation for numerical computations

HPC trends favor algorithms and implementations that reduce data motion relative to FLOPS. We investigate the use of lossy compressed data arrays in place of traditional IEEE floating point arrays to store the primary data of calculations. Simulation is fundamentally an exercise in controlled approximation, and error introduced by finite-precision arithmetic (or lossy compression) is just one of several sources of error that need to be managed to ensure sufficient accuracy in a computed result. We describe ZFP, a compressed numerical format designed for in-memory storage of multidimensional arrays, and summarize theoretical results that demonstrate that the error of repeated lossy compression can be bounded and controlled. Furthermore, we establish a relationship between grid resolution and compression-induced errors and show that, contrary to conventional floating point, ZFP reduces finite-difference errors with finer grids. We present example calculations that demonstrate data reduction by 4x or more with negligible impact on solution accuracy. Our results further demonstrate several orders-of-magnitude increase in accuracy using ZFP over IEEE floating point and Posits for the same storage budget.

Lindstrom, Peter↗
NASA NTRS2000

Experience with a Genetic Algorithm Implemented on a Multiprocessor Computer

Numerical experiments were conducted to find out the extent to which a Genetic Algorithm (GA) may benefit from a multiprocessor implementation, considering, on one hand, that analyses of individual designs in a population are independent of each other so that they may be executed concurrently on separate processors, and, on the other hand, that there are some operations in a GA that cannot be so distributed. The algorithm experimented with was based on a gaussian distribution rather than bit exchange in the GA reproductive mechanism, and the test case was a hub frame structure of up to 1080 design variables. The experimentation engaging up to 128 processors confirmed expectations of radical elapsed time reductions comparing to a conventional single processor implementation. It also demonstrated that the time spent in the non-distributable parts of the algorithm and the attendant cross-processor communication may have a very detrimental effect on the efficient utilization of the multiprocessor machine and on the number of processors that can be used effectively in a concurrent manner. Three techniques were devised and tested to mitigate that effect, resulting in efficiency increasing to exceed 99 percent.

Plassman, Gerald E.↗
NASA NTRS2000

Experience with a Genetic Algorithm Implemented on a Multiprocessor Computer

Numerical experiments were conducted to find out the extent to which a Genetic Algorithm (GA) may benefit from a multiprocessor implementation, considering, on one hand, that analyses of individual designs in a population are independent of each other so that they may be executed concurrently on separate processors, and, on the other hand, that there are some operations in a GA that cannot be so distributed. The algorithm experimented with was based on a gaussian distribution rather than bit exchange in the GA reproductive mechanism, and the test case was a hub frame structure of up to 1080 design variables. The experimentation engaging up to 128 processors confirmed expectations of radical elapsed time reductions comparing to a conventional single processor implementation. It also demonstrated that the time spent in the non-distributable parts of the algorithm and the attendant cross-processor communication may have a very detrimental effect on the efficient utilization of the multiprocessor machine and on the number of processors that can be used effectively in a concurrent manner. Three techniques were devised and tested to mitigate that effect, resulting in efficiency increasing to exceed 99 percent.

Plassman, Gerald E.↗
NASA NTRS2018

Far-field Lorenz-Mie Scattering in an Absorbing Host Medium. II: Improved Stability of the Numerical Algorithm

A recently developed FORTRAN program computing far-field optical observables for spherical particles in an absorbing medium has exhibited numerical instability arising when the product of the particle vacuum size parameter and the imaginary part of the refractive index of the host becomes sufficiently large. We offer a simple analytical explanation of this instability and propose a compact numerical algorithm for the stable computation of Lorenz–Mie coefficients based on an upward recursion formula for spherical Hankel functions of a complex argument. Extensive tests confirm an excellent accuracy of this algorithm approaching machine precision. The improved public-domain FORTRAN program is available at https://www.giss.nasa.gov/staff/mmishchenko/Lorenz-Mie.html.

Lorenz-Mie theory↗
NASA NTRS1996

Computational aeroacoustics and numerical simulation of supersonic jets

The research project has been a computational study of computational aeroacoustics algorithms and numerical simulations of the flow and noise of supersonic jets. During this study a new method for the implementation of solid wall boundary conditions for complex geometries in three dimensions has been developed. In addition, a detailed study of the simulation of the flow in and noise from supersonic circular and rectangular jets has been conducted. Extensive comparisons have been made with experimental measurements. A summary of the results of the research program are attached as the main body of this report in the form of two publications. Also, the report lists the names of the students who were supported by this grant, their degrees, and the titles of their dissertations. In addition, a list of presentations and publications made by the Principal Investigators and the research students is also included.

Morris, Philip J.↗
NASA NTRS1988

A multidimensional model for aerosols - Description of computational analogs

The numerical algorithms used to simulate the advection, diffusion, sedimentation, coagulation, and condensational growth of atmospheric aerosols are described. The model can be used in one, two, or three spatial dimensions. The continuity equation in a generalized horizontal and vertical coordinate system is developed, which allows the model to be quickly adapted to a wide variety of dynamical models of global or regional scale. Algorithms are developed to treat the various physical processes, and the results of simulations are presented, which show the strengths and weaknesses of these algorithms. Although the emphasis is on the modeling of aerosols, the work is also applicable to the simulations of the transport of gases.

Toon, O. B.↗
NASA NTRS1993

Improved Algorithm Computes Incompressible Flow

Algorithm numerically integrates Navier-Stokes equations of time-dependent or steady flow of incompressible, viscous fluid. Simulates realistic three-dimensional flows bounded by stationary or moving surface(s) of complicated shape(s). Only two arbitrary parameters specified by user. Algorithm described in "Numerical Simulation Of Flow Through An Artificial Heart" (ARC-12478). Algorithm tested by application to number of steady and unsteady flows, including flow in artificial heart discussed in noted prior article.

Rogers, Stuart E.↗
NASA NTRS1974

Satellite-tracking and earth-dynamics research programs

Observations and research progress of the Smithsonian Astrophysical Observatory are reported. Satellite tracking networks (ground stations) are discussed and equipment (Baker-Nunn cameras) used to observe the satellites is described. The improvement of the accuracy of a laser ranging system of the ground stations is discussed. Also, research efforts in satellite geodesy (tides, gravity anomalies, plate tectonics) is discussed. The use of data processing for geophysical data is examined, and a data base for the Earth and Ocean Physics Applications Program is proposed. Analytical models of the earth's motion (computerized simulation) are described and the computation (numerical integration and algorithms) of satellite orbits affected by the earth's albedo, using computer techniques, is also considered. Research efforts in the study of the atmosphere are examined (the effect of drag on satellite motion), and models of the atmosphere based on satellite data are described.

Source record↗
DOE OSTI2011

Ridge-Valley Graphs: Combinatorial Ridge Detection Using Jacobi Sets

Ridges are one of the key feature of interest in areas such as computer vision and image processing. Even though a significant amount of research has been directed to defining and extracting ridges some fundamental challenges remain. For example, the most popular ridge definition (height ridge) is not invariant under monotonic transformations and its global structure is typically ignored during numerical computations. Furthermore, many existing algorithm are based on numerical heuristics and are rarely guaranteed to produce consistent results. In this paper a small change to the height ridge definition gives a definition that is consistent with the desired invariants. Nevertheless, we show that this definition results in similar structures compared to the most common traditional approach and that both formulations are equivalent for quadratic functions. Furthermore, this definition can be cast in the form of a degenerate Jacobi set, which allows insights into the global structure of ridges. In particular, we introduce the Ridge-Valley graph as the complete description of all ridges in an image. Analyzing this graph reveals similar invariants to those found for traditional ridge formulations, such as the fact that ridges do not merge. Finally, using the connection to Jacobi sets we describe a new combinatorial algorithm to extract the Ridge-Valley graph from sampled images that is guaranteed to produce a valid structure.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Investigating power capping toward energy-efficient scientific applications: Investigating Power Capping toward Energy-Efficient Scientific Applications

The emergence of power efficiency as a primary constraint in processor and system design poses new challenges concerning power and energy awareness for numerical libraries and scientific applications. Power consumption also plays a major role in the design of data centers, which may house petascale or exascale-level computing systems. At these extreme scales, understanding and improving the energy efficiency of numerical libraries and their related applications becomes a crucial part of the successful implementation and operation of the computing system. In this paper, we study and investigate the practice of controlling a compute system's power usage, and we explore how different power caps affect the performance of numerical algorithms with different computational intensities. Further, we determine the impact, in terms of performance and energy usage, that these caps have on a system running scientific applications. This analysis will enable us to characterize the types of algorithms that benefit most from these power management schemes. Our experiments are performed using a set of representative kernels and several popular scientific benchmarks. Lastly, we quantify a number of power and performance measurements and draw observations and conclusions that can be viewed as a roadmap to achieving energy efficiency in the design and execution of scientific algorithms.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
NASA NTRS1994

Modeling composite and fluffy grains: The effects of porosity

Recent studies of interplanetary and interstellar dust provide evidence that cosmic dust grains are fluffy, composite objects, highlighting the need for models of the electromagnetic scattering by these grains. Effective medium theory (EMT) with Mie-type series solutions has been used to explore the effects of porosity which would be important in composite dust particles. While this indirect approach is both flexible and computationally efficient, it is not necessarily a good approximation. The need for EMT and its rather restrictive assumptions may be circumvented through a direct computation of the scattering properties via finite element methods, such as the discrete dipole approximation (DDA). Recently, the utility of the DDA method has been advanced significantly through improvements in theory, in numerical algorithms, and in computer hardware. Extensive calculations with the DDA method are used here to examine more directly the effects of porosity. A particular emphasis is placed upon developing a valid methodology. For both solid and porous targets we establish both numerical and physical convergence properties over the range of size parameter that is required for our study. DDA cross sections for grains with a range of porosity are compared to those computed by the EMT/series expansion technique to examine the applicability of several mixing rules, including two extensions of the Bruggeman rule. We show that for particles with Rayleigh vacuum inclusions, the extension proposed by Rouleau & Martin is quite successful. We also investigate the effects of larger, non-Rayleigh vacuum inclusions for various levels of porosity and find that they can be significant.

Wolff, Michael J.↗
NASA NTRS1998

New Parallel Algorithms for Structural Analysis and Design of Aerospace Structures

Subspace and Lanczos iterations have been developed, well documented, and widely accepted as efficient methods for obtaining p-lowest eigen-pair solutions of large-scale, practical engineering problems. The focus of this paper is to incorporate recent developments in vectorized sparse technologies in conjunction with Subspace and Lanczos iterative algorithms for computational enhancements. Numerical performance, in terms of accuracy and efficiency of the proposed sparse strategies for Subspace and Lanczos algorithm, is demonstrated by solving for the lowest frequencies and mode shapes of structural problems on the IBM-R6000/590 and SunSparc 20 workstations.

Nguyen, Duc T.↗
DOE OSTI2012

Controlled Nonlinear Stochastic Delay Equations: Part II: Approximations and Pipe-Flow Representations

This is the second part of a work dealing with key issues that have not been addressed in the modeling and numerical optimization of nonlinear stochastic delay systems. We consider new classes of models, such as those with nonlinear functions of several controls (such as products), each with is own delay, controlled random Poisson measure driving terms, admissions control with delayed retrials, and others. Part I was concerned with issues concerning the class of admissible controls and their approximations, since the classical definitions are inadequate for our models. This part is concerned with transportation equation representations and their approximations. Such representations of nonlinear stochastic delay models have been crucial in the development of numerical algorithms with much reduced memory and computational requirements. The representations for the new models are not obvious and are developed. They also provide a template for the adaptation of the Markov chain approximation numerical methods.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1991

Numerical algorithm comparison for the accurate and efficient computation of high-incidence vortical flow

Computations from two Navier-Stokes codes, NSS and F3D, are presented for a tangent-ogive-cylinder body at high angle of attack. Features of this steady flow include a pair of primary vortices on the leeward side of the body as well as secondary vortices. The topological and physical plausibility of this vortical structure is discussed. The accuracy of these codes are assessed by comparison of the numerical solutions with experimental data. The effects of turbulence model, numerical dissipation, and grid refinement are presented. The overall efficiency of these codes are also assessed by examining their convergence rates, computational time per time step, and maximum allowable time step for time-accurate computations. Overall, the numerical results from both codes compared equally well with experimental data, however, the NSS code was found to be significantly more efficient than the F3D code.

Chaderjian, Neal M.↗
DOE OSTI2016

High-order hydrodynamic algorithms for exascale computing

Hydrodynamic algorithms are at the core of many laboratory missions ranging from simulating ICF implosions to climate modeling. The hydrodynamic algorithms commonly employed at the laboratory and in industry (1) typically lack requisite accuracy for complex multi- material vortical flows and (2) are not well suited for exascale computing due to poor data locality and poor FLOP/memory ratios. Exascale computing requires advances in both computer science and numerical algorithms. We propose to research the second requirement and create a new high-order hydrodynamic algorithm that has superior accuracy, excellent data locality, and excellent FLOP/memory ratios. This proposal will impact a broad range of research areas including numerical theory, discrete mathematics, vorticity evolution, gas dynamics, interface instability evolution, turbulent flows, fluid dynamics and shock driven flows. If successful, the proposed research has the potential to radically transform simulation capabilities and help position the laboratory for computing at the exascale.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Hardware Acceleration of Adaptive Neural Algorithms.

As tradit ional numerical computing has faced challenges, researchers have turned towards alternative computing approaches to reduce power - per - computation metrics and improve algorithm performance. Here, we describe an approach towards non - conventional computing that strengthens the connection between machine learning and neuroscience concepts. The Hardware Acceleration of Adaptive Neural Algorithms (HAANA) project ha s develop ed neural machine learning algorithms and hardware for applications in image processing and cybersecurity. While machine learning methods are effective at extracting relevant features from many types of data, the effectiveness of these algorithms degrades when subjected to real - world conditions. Our team has generated novel neural - inspired approa ches to improve the resiliency and adaptability of machine learning algorithms. In addition, we have also designed and fabricated hardware architectures and microelectronic devices specifically tuned towards the training and inference operations of neural - inspired algorithms. Finally, our multi - scale simulation framework allows us to assess the impact of microelectronic device properties on algorithm performance.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Parallel Multivariate Spatio-Temporal Clustering of Large Ecological Datasets on Hybrid Supercomputers

A proliferation of data from vast networks of remote sensing platforms (satellites, unmanned aircraft systems (UAS), airborne etc.), observational facilities (meteorological, eddy covariance etc.), state-of-the-art sensors, and simulation models offer unprecedented opportunities for scientific discovery. Unsupervised classification is a widely applied data mining approach to derive insights from such data. However, classification of very large data sets is a complex computational problem that requires efficient numerical algorithms and implementations on high performance computing (HPC) platforms. Additionally, increasing power, space, cooling and efficiency requirements has led to the deployment of hybrid supercomputing platforms with complex architectures and memory hierarchies like the Titan system at Oak Ridge National Laboratory. The advent of such accelerated computing architectures offers new challenges and opportunities for big data analytics in general and specifically, large scale cluster analysis in our case. Although there is an existing body of work on parallel cluster analysis, those approaches do not fully meet the needs imposed by the nature and size of our large data sets. Moreover, they had scaling limitations and were mostly limited to traditional distributed memory computing platforms. We present a parallel Multivariate Spatio-Temporal Clustering (MSTC) technique based on k-means cluster analysis that can target hybrid supercomputers like Titan. We developed a hybrid MPI, CUDA and OpenACC implementation that can utilize both CPU and GPU resources on computational nodes. We describe performance results on Titan that demonstrate the scalability and efficacy of our approach in processing large ecological data sets.

Sreepathi, Sarat↗