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 163 records · Page 9
All sourcesNASA NTRSDOE OSTI
NASA NTRS1985

On the numerical computation of nonlinear force-free magnetic fields

An algorithm has been developed to extrapolate nonlinear force-free magnetic fields from a source surface, given the proper boundary conditions. The results of this work; describing the mathematical formalism that was developed, the numerical techniques employed, and the stability criteria developed for these numerical schemes are presented. An analytical solution is used for a test case; the results show that the computational accuracy for the case of a nonlinear force-free magnetic field was on the order of a few percent ( 5%).

Wu, S. T.↗
NASA NTRS1992

The design and implementation of a parallel unstructured Euler solver using software primitives

This paper is concerned with the implementation of a 3D unstructured-grid Euler-solver on massively parallel distributed-memory computer architectures. The goal is to minimize solution time by achieving high computational rates with a numerically efficient algorithm. An unstructured multigrid algorithm with an edge-based data-structure has been adopted, and a number of optimizations have been devised and implemented in order to accelerate the parallel computational rates. The implementation is carried out by creating a set of software tools, which ease the implementation of computational problems on parallel architecture machines by relieving the user of the low-level machine specific issues. The quantitative effect of the various optimizations are demonstrated, and we show that the combined effect of these optimizations leads to roughly a factor of three performance improvement. The overall solution efficiency is compared with that obtained on the CRAY-YMP vector supercomputer.

Das, R.↗
NASA NTRS1989

Parallel language constructs for tensor product computations on loosely coupled architectures

A set of language primitives designed to allow the specification of parallel numerical algorithms at a higher level is described. The authors focus on tensor product array computations, a simple but important class of numerical algorithms. They consider first the problem of programming one-dimensional kernel routines, such as parallel tridiagonal solvers, and then look at how such parallel kernels can be combined to form parallel tensor product algorithms.

Mehrotra, Piyush↗
NASA NTRS1990

On the numerical computation of nonlinear force-free magnetic fields

An algorithm has been developed to extrapolate nonlinear force-free magnetic fields from the photosphere, given the proper boundary conditions. This paper presents the results of this work, describing the mathematical formalism that was developed, the numerical techniques employed, and comments on the stability criteria and accuracy developed for these numerical schemes. An analytical solution is used for a benchmark test; the results show that the computational accuracy for the case of a nonlinear force-free magnetic field was on the order of a few percent (less than 5 percent). This newly developed scheme was applied to analyze a solar vector magnetogram, and the results were compared with the results deduced from the classical potential field method. The comparison shows that additional physical features of the vector magnetogram were revealed in the nonlinear force-free case.

Wu, S. T.↗
NASA NTRS1992

Global transformation of rotation matrices to Euler parameters

A global algorithm for transforming rotation matrices to Euler parameters is presented. Although it has no apparent computational or numerical advantage over the known algorithms, it elucidates the relationship between the rotation matrix form and the Euler parameter form. It employs the singular-value decomposition, a numerically ideal algorithm involving orthogonal transformations. Attitude parameterization is reviewed and an analytical framework is provided.

Paielli, Russell A.↗
NASA NTRS1998

A Polynomial Time, Numerically Stable Integer Relation Algorithm

Let x = (x1, x2...,xn be a vector of real numbers. X is said to possess an integer relation if there exist integers a(sub i) not all zero such that a1x1 + a2x2 + ... a(sub n)Xn = 0. Beginning in 1977 several algorithms (with proofs) have been discovered to recover the a(sub i) given x. The most efficient of these existing integer relation algorithms (in terms of run time and the precision required of the input) has the drawback of being very unstable numerically. It often requires a numeric precision level in the thousands of digits to reliably recover relations in modest-sized test problems. We present here a new algorithm for finding integer relations, which we have named the "PSLQ" algorithm. It is proved in this paper that the PSLQ algorithm terminates with a relation in a number of iterations that is bounded by a polynomial in it. Because this algorithm employs a numerically stable matrix reduction procedure, it is free from the numerical difficulties, that plague other integer relation algorithms. Furthermore, its stability admits an efficient implementation with lower run times oil average than other algorithms currently in Use. Finally, this stability can be used to prove that relation bounds obtained from computer runs using this algorithm are numerically accurate.

Ferguson, Helaman R. P.↗
DOE OSTI2020

The parallelism motifs of genomic data analysis

Genomic datasets are growing dramatically as the cost of sequencing continues to decline and small sequencing devices become available. Enormous community databases store and share these data with the research community, but some of these genomic data analysis problems require large-scale computational platforms to meet both the memory and computational requirements. These applications differ from scientific simulations that dominate the workload on high-end parallel systems today and place different requirements on programming support, software libraries and parallel architectural design. For example, they involve irregular communication patterns such as asynchronous updates to shared data structures. We consider several problems in high-performance genomics analysis, including alignment, profiling, clustering and assembly for both single genomes and metagenomes. We identify some of the common computational patterns or ‘motifs’ that help inform parallelization strategies and compare our motifs to some of the established lists, arguing that at least two key patterns, sorting and hashing, are missing. This article is part of a discussion meeting issue ‘Numerical algorithms for high-performance computational science’.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2016

Exploiting Multiple Levels of Parallelism in Sparse Matrix-Matrix Multiplication

Sparse matrix-matrix multiplication (or SpGEMM) is a key primitive for many high-performance graph algorithms as well as for some linear solvers, such as algebraic multigrid. The scaling of existing parallel implementations of SpGEMM is heavily bound by communication. Even though 3D (or 2.5D) algorithms have been proposed and theoretically analyzed in the flat MPI model on Erdös-Rényi matrices, those algorithms had not been implemented in practice and their complexities had not been analyzed for the general case. In this work, we present the first implementation of the 3D SpGEMM formulation that exploits multiple (intranode and internode) levels of parallelism, achieving significant speedups over the state-of-the-art publicly available codes at all levels of concurrencies. We extensively evaluate our implementation and identify bottlenecks that should be subject to further research.

2.5D algorithms↗
DOE OSTI2022

State preparation and evolution in quantum computing: a perspective from Hamiltonian moments

Quantum algorithms on the noisy intermediate-scale quantum (NISQ) devices are expected to simulate quan- tum systems that are classically intractable to demonstrate quantum advantages. However, the non-negligible gate error on the NISQ devices impedes the conventional quantum algorithms to be implemented. Practical strategies usually exploit hybrid quantum-classical quantum algorithms to demonstrate potentially useful ap- plications of quantum computing in the NISQ era. Among the numerous hybrid quantum-classical algorithms, recent efforts highlight the development of quantum algorithms based upon quantum computed Hamiltonian moments, ?f|Hˆn|f? (n = 1, 2, · · · ), with respect to quantum state |f?. In this tutorial, we will give a brief review of these quantum algorithms with focuses on the typical ways of computing Hamiltonian moments using quantum hardware and improving the accuracy of the estimated state energies based on the quantum computed moments. Furthermore, we will present a tutorial to show how we can measure and compute the Hamiltonian moments of a four-site Heisenberg model, and compute the energy and magnetization of the model utilizing the imaginary time evolution in the real IBM-Q NISQ hardware environment. Along this line, we will further discuss some practical issues associated with these algorithms. We will conclude this tutorial review by overviewing some possible developments and applications in this direction in the near future.

Aulicino, Joseph C.↗
DOE OSTI2012

Controlled Nonlinear Stochastic Delay Equations: Part I: Modeling and Approximations

This two-part paper deals with 'foundational' issues that have not been previously considered in the modeling and numerical optimization of nonlinear stochastic delay systems. There are 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. There are two basic and interconnected themes for these models. The first, dealt with in this part, concerns the definition of admissible control. The classical definition of an admissible control as a nonanticipative relaxed control is inadequate for these models and needs to be extended. This is needed for the convergence proofs of numerical approximations for optimal controls as well as to have a well-defined model. It is shown that the new classes of admissible controls do not enlarge the range of the value functions, is closed (together with the associated paths) under weak convergence, and is approximatable by ordinary controls. The second theme, dealt with in Part II, concerns transportation equation representations, and their role in the development of numerical algorithms with much reduced memory and computational requirements.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1978

Transonic lifting line theory - Numerical procedure for shock-free flows

An algorithm for computing transonic lifting-line theory without shocks is presented; the numerical procedure relies on two-dimensional analyses developed to solve inviscid flow equations for slender airfoils. From a series of solutions to two-dimensional problems in which span effects appear parametrically, the three-dimensional potential field characterization is obtained. Numerical results are given for a lifting wing with an elliptic (spanwise) distribution of chord and a NACA-0012 cross section (a freestream Mach number of 0.63 and an angle of attack of 2 deg are assumed).

Small, R. D.↗
DOE OSTI2011

Iterative Algorithms for Ptychographic Phase Retrieval

Ptychography promises diffraction limited resolution without the need for high resolution lenses. To achieve high resolution one has to solve the phase problem for many partially overlapping frames. Here we review some of the existing methods for solving ptychographic phase retrieval problem from a numerical analysis point of view, and propose alternative methods based on numerical optimization.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1985

An Eigensystem Realization Algorithm for Application to Modal Testing

Important features of the Eigensystem Realization Algorithm (ERA) are summarized as follows: (1) from the computational standpoint, the algorithm is attractive, since only simple numerical operations are needed; (2) the computational procedure is numerically stable; (3) the structural dynamics requirements for modal parameter identification and the control design requirements for a reduced-state space model are satisfied; (4) data from more than one test can be used simultaneously to efficiently identify the closely spaced eigenvalues; and (5) no restrictions on number of measurements are imposed.

Juang, J. N.↗
NASA NTRS1995

Evaluation of numerical schemes for the analysis of sound generation by blade-gust interaction

In this investigation three different numerical algorithms have been utilized to compute the flow about a flat plate in the presence of a transverse gust described by a sinusoidal disturbance. The three schemes include the MacCormack explicit finite difference scheme which is second order accurate in both time and space, the Gottlieb and Turkel modification of MacCormack's scheme which is fourth order accurate in space and second order accurate in time, (referred to as the 2-4 scheme), and a two step scheme developed by Bayliss et al. which has second order temporal accuracy and sixth order spatial accuracy (a 2-6 scheme). The flow field results are obtained with these schemes by using the same code with the only difference being the implementation of the respective solution algorithms. The problem is set up so that the sinusoidal disturbance is imposed at the surface of the flat plate as a surface boundary condition. Thus the problem is treated as scattering problem. The computed results include the time average of the acoustic pressure squared along grid lines five points away from the boundaries; distribution throughout the computational domain is monitored at various times. The numerical results are compared with an exact solution obtained by Atassi, Dusey, and Davis.

Scott, J. N.↗
DOE OSTI2019

High-fidelity kinetic modeling of plasmas in Z-pinch and pulsed power configurations (18-ERD-048)

Plasma dynamics can be strongly influenced by fine-scale kinetic physics, which is not captured by standard fluid treatments, is challenging to simulate, and is poorly understood. The aim of this research was to investigate the fundamental fine-scale properties of collisionless plasmas in Z-pinch and pulsed power configurations by deploying novel noisefree high-accuracy computational algorithms. Significant advances were achieved through the development of robust numerical capabilities to exploit axisymmetry in kinetic simulations, the development of new methodologies to construct kinetic equilibria, and the theoretical and computational study of kinetic sheared-flow-driven transport in pulsed power systems. These new capabilities shed light on the anisotropies that can develop in Z-pinches and the transport processes that can lead to parasitic currents in pulsed power inertial confinement fusion experiments. The use of cutting-edge massively-parallel numerical algorithms to address outstanding scientific questions in plasma physics advances the mission of Lawrence Livermore National Laboratory in the areas of high energy density science and high performance computing. By bringing together kinetic theory, high-order numerical methods, high performance computing, and experimental applications, this research advances the state of the art in plasma physics modeling.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2016

A Posteriori Error Analysis of Two-Stage Computation Methods with Application to Efficient Discretization and the Parareal Algorithm

We consider numerical methods for initial value problems that employ a two stage approach consisting of solution on a relatively coarse discretization followed by solution on a relatively fine discretization. Examples include adaptive error control, parallel-in-time solution schemes, and efficient solution of adjoint problems for computing a posteriori error estimates. We describe a general formulation of two stage computations then perform a general a posteriori error analysis based on computable residuals and solution of an adjoint problem. The analysis accommodates various variations in the two stage computation and in formulation of the adjoint problems. We apply the analysis to compute “dual-weighted” a posteriori error estimates, to develop novel algorithms for efficient solution that take into account cancellation of error, and to the Parareal Algorithm. We test the various results using several numerical examples.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1977

Halo orbit station keeping for International Sun-Earth Explorer-C /ISEE-C/

The ISEE-C spacecraft must be kept close to an unstable 'halo' orbit with a series of discrete orbital maneuvers set at intervals at least one month apart. A numerical algorithm has been developed to compute a velocity correction at any point on the trajectory which will minimize the distance between the satellite orbit and the nominal halo path. This algorithm is used to generate a number of station keeping histories with fixed time intervals between maneuvers to ascertain bounds on fuel cost, tightness of fit to nominal path and expected duration between thrust applications. The difference between a third order analytic representation of the halo orbit and a numerically improved nominal path as a reference orbit in the station keeping scheme is investigated as well as the distinction between a tight control and a loose control. A simulation of an operational approach to station keeping is also presented which shows that intermittant propulsive maneuvers can be used to control the spacecraft with very modest fuel expenditure.

Heuberger, H.↗
DOE OSTI2021

A survey of numerical linear algebra methods utilizing mixed-precision arithmetic

The efficient utilization of mixed-precision numerical linear algebra algorithms can offer attractive acceleration to scientific computing applications. Especially with the hardware integration of low-precision special-function units designed for machine learning applications, the traditional numerical algorithms community urgently needs to reconsider the floating point formats used in the distinct operations to efficiently leverage the available compute power. In this study, we provide a comprehensive survey of mixed-precision numerical linear algebra routines, including the underlying concepts, theoretical background, and experimental results for both dense and sparse linear algebra problems.

97 MATHEMATICS AND COMPUTING↗