Search NASA⌕ Search

SEARCH · Search NASA

Results for “generalized algorithm”

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 1,495 records · Page 83

ZONAL FLOWS AND LONG-LIVED AXISYMMETRIC PRESSURE BUMPS IN MAGNETOROTATIONAL TURBULENCE

We study the behavior of magnetorotational turbulence in shearing box simulations with a radial and azimuthal extent up to 10 scale heights. Maxwell and Reynolds stresses are found to increase by more than a factor of 2 when increasing the box size beyond two scale heights in the radial direction. Further increase of the box size has little or no effect on the statistical properties of the turbulence. An inverse cascade excites magnetic field structures at the largest scales of the box. The corresponding 10% variation in the Maxwell stress launches a zonal flow of alternating sub- and super-Keplerian velocity. This, in turn, generates a banded density structure in geostrophic balance between pressure and Coriolis forces. We present a simplified model for the appearance of zonal flows, in which stochastic forcing by the magnetic tension on short timescales creates zonal flow structures with lifetimes of several tens of orbits. We experiment with various improved shearing box algorithms to reduce the numerical diffusivity introduced by the supersonic shear flow. While a standard finite difference advection scheme shows signs of a suppression of turbulent activity near the edges of the box, this problem is eliminated by a new method where the Keplerian shear advection is advanced in time by interpolation in Fourier space.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The Changing Paradigm of Data Intensive Computing

Data intensive computing facilitates human understanding of complex problems that must process massive amounts of data. Through the development of new classes of software, algorithms and hardware, data intensive applications provide timely and meaningful analytical results in response to exponentially growing data complexity and associated analysis requirements. This paper considers some of the application drivers for the evolution of data intensive computing from storage centric to analysis centric requirements.

97 MATHEMATICS AND COMPUTING↗

A Cooperative Control Algorithm for Camera Based Observational Systems

Over the last several years, there has been considerable growth in camera based observation systems for a variety of safety, scientific, and recreational applications. In order to improve the effectiveness of these systems, we frequently desire the ability to increase the number of observed objects, but solving this problem is not as simple as adding more cameras. Quite often, there are economic or physical restrictions that prevent us from adding additional cameras to the system. As a result, we require methods that coordinate the tracking of objects between multiple cameras in an optimal way. In order to accomplish this goal, we present a new cooperative control algorithm for a camera based observational system. Specifically, we present a receding horizon control where we model the underlying optimal control problem as a mixed integer linear program. The benefit of this design is that we can coordinate the actions between each camera while simultaneously respecting its kinematics. In addition, we further improve the quality of our solution by coupling our algorithm with a Kalman filter. Through this integration, we not only add a predictive component to our control, but we use the uncertainty estimates provided by the filter to encourage the system to periodically observe any outliers in the observed area. This combined approach allows us to intelligently observe the entire region of interest in an effective and thorough manner.

99 GENERAL AND MISCELLANEOUS↗

Toward Parallel Document Clustering

A key challenge to automated clustering of documents in large text corpora is the high cost of comparing documents in a multimillion dimensional document space. The Anchors Hierarchy is a fast data structure and algorithm for localizing data based on a triangle inequality obeying distance metric, the algorithm strives to minimize the number of distance calculations needed to cluster the documents into “anchors” around reference documents called “pivots”. We extend the original algorithm to increase the amount of available parallelism and consider two implementations: a complex data structure which affords efficient searching, and a simple data structure which requires repeated sorting. The sorting implementation is integrated with a text corpora “Bag of Words” program and initial performance results of end-to-end a document processing workflow are reported.

99 GENERAL AND MISCELLANEOUS↗

Prompt optical observations of GRBs with 'Pi of the Sky' system

The 'Pi of the Sky' prototype apparatus observed prompt optical emission from extremely bright GRB080319B since the very beginning of the gamma emission. The burst occurred at redshift z = 0.937 and set the record of optical luminosity reaching 5.3 mag. The position of the burst was observed before, during and after the explosion by several telescopes and unprecedented coverage of optical light curve has been achieved. The combination of these unique optical data with simultaneous gamma-ray observations provides a powerful diagnostic tool for the physics of the GRB explosion within seconds of its start. The 'Pi of the Sky' prototype, working since 2004 in Las Campanas Observatory in Chile, consists of 2 cameras observing same 20 deg. x 20 deg. fields in the sky with time resolution of 10 seconds. The prototype reacts to GCN alerts, but it has also its own algorithm for identification of optical flashes. The final system covering field of view of Swift or Fermi satellite will consist of 2 arrays of 16 cameras installed in a distance of about 100 km. The system is currently under construction. It will be a powerful tool for early optical observations of GRBs, allowing for optical observation of GRBs before, during and after the gamma emission. With the on-line data analysis in real time, it will identify short optical flashes autonomously and will be able to distribute this information among the community. In this contribution the general idea of the final version of the experiment and the most interesting results from the prototype are presented.

79 ASTRONOMY AND ASTROPHYSICS↗

DSMC moving-boundary algorithms for simulating MEMS geometries with opening and closing gaps.

Moving-boundary algorithms for the Direct Simulation Monte Carlo (DSMC) method are investigated for a microbeam that moves toward and away from a parallel substrate. The simpler but analogous one-dimensional situation of a piston moving between two parallel walls is investigated using two moving-boundary algorithms. In the first, molecules are reflected rigorously from the moving piston by performing the reflections in the piston frame of reference. In the second, molecules are reflected approximately from the moving piston by moving the piston and subsequently moving all molecules and reflecting them from the moving piston at its new or old position.

99 GENERAL AND MISCELLANEOUS↗

On the spin separation of algebraic two-component relativistic Hamiltonians

The separation of the spin-free and spin-dependent terms of a given relativistic Hamiltonian is usually facilitated by the Dirac identity. However, this is no longer possible for the recently developed exact two-component relativistic Hamiltonians derived from the matrix representation of the Dirac equation in a kinetically balanced basis. This stems from the fact that the decoupling matrix does not have an explicit form. To resolve this formal difficulty, we first define the spin-dependent term as the difference between a two-component Hamiltonian corresponding to the full Dirac equation and its one-component counterpart corresponding to the spin-free Dirac equation. The series expansion of the spin-dependent term is then developed in two different ways. One is in the spirit of the Douglas-Kroll-Hess (DKH) transformation and the other is based on the perturbative expansion of a two-component Hamiltonian of fixed structure, either the two-step Barysz-Sadlej-Snijders (BSS) or the one-step exact two-component (X2C) form. The algorithms for constructing arbitrary order terms are proposed for both schemes and their convergence patterns are assessed numerically. Truncating the expansions to finite orders leads naturally to a sequence of novel spin-dependent Hamiltonians. In particular, the order-by-order distinctions among the DKH, BSS, and X2C approaches can nicely be revealed. The well-known Pauli, zeroth-order regular approximation, and DKH1 spin-dependent Hamiltonians can also be recovered naturally by appropriately approximating the decoupling and renormalization matrices. On the practical side, the sf-X2C+so-DKH3 Hamiltonian, together with appropriately constructed generally contracted basis sets, is most promising for accounting for relativistic effects in two steps, first spin-free and then spin-dependent, with the latter applied either perturbatively or variationally.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Sampling graphs with a prescribed joint degree distribution using Markov Chains.

One of the most influential results in network analysis is that many natural networks exhibit a power-law or log-normal degree distribution. This has inspired numerous generative models that match this property. However, more recent work has shown that while these generative models do have the right degree distribution, they are not good models for real life networks due to their differences on other important metrics like conductance. We believe this is, in part, because many of these real-world networks have very different joint degree distributions, i.e. the probability that a randomly selected edge will be between nodes of degree k and l. Assortativity is a sufficient statistic of the joint degree distribution, and it has been previously noted that social networks tend to be assortative, while biological and technological networks tend to be disassortative. We suggest that the joint degree distribution of graphs is an interesting avenue of study for further research into network structure. We provide a simple greedy algorithm for constructing simple graphs from a given joint degree distribution, and a Monte Carlo Markov Chain method for sampling them. We also show that the state space of simple graphs with a fixed degree distribution is connected via endpoint switches. We empirically evaluate the mixing time of this Markov Chain by using experiments based on the autocorrelation of each edge.

99 GENERAL AND MISCELLANEOUS↗

A Highly Parallel Implementation of K-Means for Multithreaded Architecture

We present a parallel implementation of the popular k-means clustering algorithm for massively multithreaded computer systems, as well as a parallelized version of the KKZ seed selection algorithm. We demonstrate that as system size increases, sequential seed selection can become a bottleneck. We also present an early attempt at parallelizing k-means that highlights critical performance issues when programming massively multithreaded systems. For our case studies, we used data collected from electric power simulations and run on the Cray XMT.

99 GENERAL AND MISCELLANEOUS↗

An Evaluation of Database Solutions to Spatial Object Association

Object association is a common problem encountered in many applications. Spatial object association, also referred to as crossmatch of spatial datasets, is the problem of identifying and comparing objects in two datasets based on their positions in a common spatial coordinate system--one of the datasets may correspond to a catalog of objects observed over time in a multi-dimensional domain; the other dataset may consist of objects observed in a snapshot of the domain at a time point. The use of database management systems to the solve the object association problem provides portability across different platforms and also greater flexibility. Increasing dataset sizes in today's applications, however, have made object association a data/compute-intensive problem that requires targeted optimizations for efficient execution. In this work, we investigate how database-based crossmatch algorithms can be deployed on different database system architectures and evaluate the deployments to understand the impact of architectural choices on crossmatch performance and associated trade-offs. We investigate the execution of two crossmatch algorithms on (1) a parallel database system with active disk style processing capabilities, (2) a high-throughput network database (MySQL Cluster), and (3) shared-nothing databases with replication. We have conducted our study in the context of a large-scale astronomy application with real use-case scenarios.

99 GENERAL AND MISCELLANEOUS↗

Leveraging Anderson Acceleration for improved convergence of iterative solutions to transport systems

In this note we demonstrate that using Anderson Acceleration (AA) in place of a standard Picard iteration can not only increase the convergence rate but also make the iteration more robust for two transport applications. We also compare the convergence acceleration provided by AA to that provided by moment-based acceleration methods. Additionally, we demonstrate that those two acceleration methods can be used together in a nested fashion. We begin by describing the AA algorithm. At this point, we will describe two application problems, one from neutronics and one from plasma physics, on which we will apply AA. We provide computational results which highlight the benefits of using AA, namely that we can compute solutions using fewer function evaluations, larger time-steps, and achieve a more robust iteration.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum Algorithms for Representation-Theoretic Multiplicities

Kostka, Littlewood-Richardson, Plethysm, and Kronecker coefficients are the multiplicities of irreducible representations in the decomposition of representations of the symmetric group that play an important role in representation theory, geometric complexity, and algebraic combinatorics. We give quantum algorithms for computing these coefficients whenever the ratio of dimensions of the representations is polynomial. We show that there is an efficient classical algorithm for computing the Kostka numbers under this restriction and conjecture the existence of an analogous algorithm for the Littlewood-Richardson coefficients. We argue why such classical algorithm does not straightforwardly work for the Plethysm and Kronecker coefficients and conjecture that our quantum algorithms lead to superpolynomial speedups. The conjecture about Kronecker coefficients was disproved by Panova [Polynomial time classical versus quantum algorithms for representation theoretic multiplicities, arXiv:2502.20253] with a classical algorithm which, if optimal, points to a 𝒪⁡(𝑛 4+2⁢𝑘 ) vs $\tilde{Ω}$⁡(𝑛 4⁢𝑘 2 +1 ) polynomial gap in quantum vs classical computational complexity for an integer parameter 𝑘.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Parallel octree-based hexahedral mesh generation for eulerian to lagrangian conversion.

Computational simulation must often be performed on domains where materials are represented as scalar quantities or volume fractions at cell centers of an octree-based grid. Common examples include bio-medical, geotechnical or shock physics calculations where interface boundaries are represented only as discrete statistical approximations. In this work, we introduce new methods for generating Lagrangian computational meshes from Eulerian-based data. We focus specifically on shock physics problems that are relevant to ASC codes such as CTH and Alegra. New procedures for generating all-hexahedral finite element meshes from volume fraction data are introduced. A new primal-contouring approach is introduced for defining a geometric domain. New methods for refinement, node smoothing, resolving non-manifold conditions and defining geometry are also introduced as well as an extension of the algorithm to handle tetrahedral meshes. We also describe new scalable MPI-based implementations of these procedures. We describe a new software module, Sculptor, which has been developed for use as an embedded component of CTH. We also describe its interface and its use within the mesh generation code, CUBIT. Several examples are shown to illustrate the capabilities of Sculptor.

99 GENERAL AND MISCELLANEOUS↗

Scalable in-memory RDFS closure on billions of triples.

We present an RDFS closure algorithm, specifically designed and implemented on the Cray XMT supercomputer, that obtains inference rates of 13 million inferences per second on the largest system configuration we used. The Cray XMT, with its large global memory (4TB for our experiments), permits the construction of a conceptually straightforward algorithm, fundamentally a series of operations on a shared hash table. Each thread is given a partition of triple data to process, a dedicated copy of the ontology to apply to the data, and a reference to the hash table into which it inserts inferred triples. The global nature of the hash table allows the algorithm to avoid a common obstacle for distributed memory machines: the creation of duplicate triples. On LUBM data sets ranging between 1.3 billion and 5.3 billion triples, we obtain nearly linear speedup except for two portions: file I/O, which can be ameliorated with the additional service nodes, and data structure initialization, which requires nearly constant time for runs involving 32 processors or more.

99 GENERAL AND MISCELLANEOUS↗

Locality-Aware Parallel Process Mapping for Multi-Core HPC Systems

High Performance Computing (HPC) systems are composed of servers containing an ever-increasing number of cores. With such high processor core counts, non-uniform memory access (NUMA) architectures are almost universally used to reduce inter-processor and memory communication bottlenecks by distributing processors and memory throughout a server-internal networking topology. Application studies have shown that the tuning of processes placement in a server s NUMA networking topology to the application can have a dramatic impact on performance. The performance implications are magnified when running a parallel job across multiple server nodes, especially with large scale HPC applications. This paper presents the Locality-Aware Mapping Algorithm (LAMA) for distributing the individual processes of a parallel application across processing resources in an HPC system, paying particular attention to the internal server NUMA topologies. The algorithm is able to support both homogeneous and heterogeneous hardware systems, and dynamically adapts to the available hardware and user-specified process layout at run-time. As implemented in Open MPI, the LAMA provides 362,880 mapping permutations and is able to naturally scale out to additional hardware resources as they become available in future architectures.

99 GENERAL AND MISCELLANEOUS↗

A calibrated Monte Carlo approach to quantify the impacts of misorientation and different driving forces on texture development

A calibrated Monte Carlo (cMC) approach, which quantifies grain boundary kinetics within a generic setting, is presented. The influence of misorientation is captured by adding a scaling coefficient in the spin flipping probability equation, while the contribution of different driving forces is weighted using a partition function. The calibration process relies on the established parametric links between Monte Carlo (MC) and sharp-interface models. The cMC algorithm quantifies microstructural evolution under complex thermomechanical environments and remedies some of the difficulties associated with conventional MC models. After validation, the cMC approach is applied to quantify the texture development of polycrystalline materials with influences of misorientation and inhomogeneous bulk energy across grain boundaries. The results are in good agreement with theory and experiments.

99 GENERAL AND MISCELLANEOUS↗

Aggregation Processes on Networks: Deterministic Equations, Stochastic Model and Numerical Simulation

We introduce an infinite system of equations modeling the time evolution of the growth process of a network. The nodes are characterized by their degree k(set-membership sign)N and a fitness parameter f(set-membership sign)[0,h]. Every new node which emerges becomes a fitness f' according to a given distribution P and attaches to an existing node with fitness f and degree k at rate fA{sub k}, where A{sub k} are positive coefficients, growing sub-linearly in k. If the parameter f takes only one value, the dynamics of this process can be described by a variant of the Becker-Doering equations, where the l growth of the size of clusters of size k occurs only with increment 1. In contrast l to the established Becker-Doering equations, the system considered here is nonconservative, since mass (i.e. links) is continuously added. Nevertheless, it has the property of linearity, which is a natural consequence of the process which is being modeled. The purpose of this paper is to construct a solution of the system based on a stochastic approximation algorithm, which allows also a numerical simulation in order to get insight into its qualitative behaviour. In particular we show analytically and numerically the property of Bose-Einstein condensation, which was observed in the literature on random graphs and which can be described as an emergence of a huge cluster which captures a macroscopic fraction of the total link density.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗