Search NASA⌕ Search

SEARCH · Search NASA

Results for “partitioned 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 361 records · Page 20

Research in Computational Astrobiology

We report on several projects in the field of computational astrobiology, which is devoted to advancing our understanding of the origin, evolution and distribution of life in the Universe using theoretical and computational tools. Research projects included modifying existing computer simulation codes to use efficient, multiple time step algorithms, statistical methods for analysis of astrophysical data via optimal partitioning methods, electronic structure calculations on water-nuclei acid complexes, incorporation of structural information into genomic sequence analysis methods and calculations of shock-induced formation of polycylic aromatic hydrocarbon compounds.

Chaban, Galina↗

A Scalable Distributed Louvain Algorithm for Large-Scale Graph Community Detection

We present a new distributed community detection algorithm for large graphs based on the Louvain method. We exploit a distributed delegate partitioning to ensure the workload and communication balancing among processors. In addition, we design a new heuristic strategy to carefully coordinate the community constitution in a distributed environment, and ensure the convergence of the distributed clustering algorithm. Our intensive experimental study has demonstrated the scalability and the correctness of our algorithm with various large-scale real-world and synthetic graph datasets using up to 32,768 processors.

Computer Science↗

Hierarchical Clock Synchronization in MPI

We present a new distributed community detection algorithm for large graphs based on the Louvain method. We exploit a distributed delegate partitioning to ensure the workload and communication balancing among processors. In addition, we design a new heuristic strategy to carefully coordinate the community constitution in a distributed environment, and ensure the convergence of the distributed clustering algorithm. Our intensive experimental study has demonstrated the scalability and the correctness of our algorithm with various large-scale real-world and synthetic graph datasets using up to 32,768 processors

Computer Science↗

Hierarchical and Parallelizable Direct Volume Rendering for Irregular and Multiple Grids

A general volume rendering technique is described that efficiently produces images of excellent quality from data defined over irregular grids having a wide variety of formats. Rendering is done in software, eliminating the need for special graphics hardware, as well as any artifacts associated with graphics hardware. Images of volumes with about one million cells can be produced in one to several minutes on a workstation with a 150 MHz processor. A significant advantage of this method for applications such as computational fluid dynamics is that it can process multiple intersecting grids. Such grids present problems for most current volume rendering techniques. Also, the wide range of cell sizes (by a factor of 10,000 or more), which is typical of such applications, does not present difficulties, as it does for many techniques. A spatial hierarchical organization makes it possible to access data from a restricted region efficiently. The tree has greater depth in regions of greater detail, determined by the number of cells in the region. It also makes it possible to render useful 'preview' images very quickly (about one second for one-million-cell grids) by displaying each region associated with a tree node as one cell. Previews show enough detail to navigate effectively in very large data sets. The algorithmic techniques include use of a kappa-d tree, with prefix-order partitioning of triangles, to reduce the number of primitives that must be processed for one rendering, coarse-grain parallelism for a shared-memory MIMD architecture, a new perspective transformation that achieves greater numerical accuracy, and a scanline algorithm with depth sorting and a new clipping technique.

Wilhelms, Jane↗

Quantum algorithms for Gibbs sampling and hitting-time estimation

In this paper, we present quantum algorithms for solving two problems regarding stochastic processes. The first algorithm prepares the thermal Gibbs state of a quantum system and runs in time almost linear in √Nβ/Ζ and polynomial in log(1/ϵ), where N is the Hilbert space dimension, β is the inverse temperature, Ζ is the partition function, and ϵ is the desired precision of the output state. Our quantum algorithm exponentially improves the dependence on 1/ϵ and quadratically improves the dependence on β of known quantum algorithms for this problem. The second algorithm estimates the hitting time of a Markov chain. For a sparse stochastic matrix Ρ, it runs in time almost linear in 1/(ϵΔ 3/2 ), where ϵ is the absolute precision in the estimation and Δ is a parameter determined by Ρ, and whose inverse is an upper bound of the hitting time. Our quantum algorithm quadratically improves the dependence on 1/ϵ and 1/Δ of the analog classical algorithm for hitting-time estimation. Finally, both algorithms use tools recently developed in the context of Hamiltonian simulation, spectral gap amplification, and solving linear systems of equations.

97 MATHEMATICS AND COMPUTING↗

A scalable geometric multigrid solver for nonsymmetric elliptic systems with application to variable-density flows

A geometric multigrid algorithm is introduced for solving nonsymmetric linear systems resulting from the discretization of the variable density Navier–Stokes equations on nonuniform structured rectilinear grids and high-Reynolds number flows. The restriction operation is defined such that the resulting system on the coarser grids is symmetric, thereby allowing for the use of efficient smoother algorithms. To achieve an optimal rate of convergence, the sequence of interpolation and restriction operations are determined through a dynamic procedure. A parallel partitioning strategy is introduced to minimize communication while maintaining the load balance between all processors. To test the proposed algorithm, we consider two cases: 1) homogeneous isotropic turbulence discretized on uniform grids and 2) turbulent duct flow discretized on stretched grids. Testing the algorithm on systems with up to a billion unknowns shows that the cost varies linearly with the number of unknowns. This O (N) behavior confirms the robustness of the proposed multigrid method regarding ill-conditioning of large systems characteristic of multiscale high-Reynolds number turbulent flows. The robustness of our method to density variations is established by considering cases where density varies sharply in space by a factor of up to 104, showing its applicability to two-phase flow problems. Strong and weak scalability studies are carried out, employing up to 30,000 processors, to examine the parallel performance of our implementation. Excellent scalability of our solver is shown for a granularity as low as 104 to 105 unknowns per processor. At its tested peak throughput, it solves approximately 4 billion unknowns per second employing over 16,000 processors with a parallel efficiency higher than 50%.

Computer Science↗

Metropolis-style random sampling of quantum gates for the estimation of low-energy observables

In this work, we propose a quantum algorithm to compute low-energy expectation values of a quantum Hamiltonian by sampling a partition function associated with the average energy of that Hamiltonian. For any given quantum circuit-Hamiltonian pair, there is an associated average energy. The sampling is done through an accept/reject Metropolis-style algorithm on the quantum gates of the circuit itself. Observables calculated under the canonical ensemble from these samples of circuits are extrapolated from higher energies to the ground state.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A Clustering-based biased Monte Carlo Approach to Protein Titration Curve Prediction

We develop and implement a novel approach to computing the ensemble averages in systems characterized by pair-wise interactions between the entities. Methods involving full enumeration of the configuration space result in exponential complexity. Sampling methods such as Markov Chain Monte Carlo (MCMC) algorithms have been proposed to tackle the exponential complexity of these problems. In certain scenarios where significant energetic coupling exists between the entities, the accuracy of the such algorithms can be diminished. We propose a strategy to improve the accuracy of the MCMC runs by taking advantage of the cluster structure in the interaction energy matrix. We propose two different schemes for performing the biased MCMC runs on the partitioned systems and show that they are valid MCMC schemes. We then apply these algorithms to the problem of computing the protonation fractions and hence the titration curves of titratable protein residues that constitute a given protein. We leverage both synthesized and real-world systems and show the improved performance of our biased MCMC methods when compared to the regular MCMC method.

Visweswara Sathanur, Arun↗

Ergodic theory and visualization. II. Fourier mesochronic plots visualize (quasi)periodic sets

We present an application and analysis of a visualization method for measure-preserving dynamical systems introduced by I. Mezić and A. Banaszuk [Physica D 197, 101 (2004)], based on frequency analysis and Koopman operator theory. This extends our earlier work on visualization of ergodic partition [Z. Levnajić and I. Mezić, Chaos 20, 033114 (2010)]. Our method employs the concept of Fourier time average [I. Mezić and A. Banaszuk, Physica D 197, 101 (2004)], and is realized as a computational algorithms for visualization of periodic and quasi-periodic sets in the phase space. The complement of periodic phase space partition contains chaotic zone, and we show how to identify it. The range of method's applicability is illustrated using well-known Chirikov standard map, while its potential in illuminating higher-dimensional dynamics is presented by studying the Froeschlé map and the Extended Standard Map.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

HRSSA – Efficient hybrid stochastic simulation for spatially homogeneous biochemical reaction networks

This paper introduces HRSSA (Hybrid Rejection-based Stochastic Simulation Algorithm), a new efficient hybrid stochastic simulation algorithm for spatially homogeneous biochemical reaction networks. HRSSA is built on top of RSSA, an exact stochastic simulation algorithm which relies on propensity bounds to select next reaction firings and to reduce the average number of reaction propensity updates needed during the simulation. HRSSA exploits the computational advantage of propensity bounds to manage time-varying transition propensities and to apply dynamic partitioning of reactions, which constitute the two most significant bottlenecks of hybrid simulation. A comprehensive set of simulation benchmarks is provided for evaluating performance and accuracy of HRSSA against other state of the art algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A monolithic mass tracking formulation for bubbles in incompressible flow

We devise a novel method for treating bubbles in incompressible flow that relies on the conservative advection of bubble mass and an associated equation of state in order to determine pressure boundary conditions inside each bubble. We show that executing this algorithm in a traditional manner leads to stability issues similar to those seen for partitioned methods for solid–fluid coupling. Therefore, we reformulate the problem monolithically. This is accomplished by first proposing a new fully monolithic approach to coupling incompressible flow to fully nonlinear compressible flow including the effects of shocks and rarefactions, and then subsequently making a number of simplifying assumptions on the air flow removing not only the nonlinearities but also the spatial variations of both the density and the pressure. The resulting algorithm is quite robust, has been shown to converge to known solutions for test problems, and has been shown to be quite effective on more realistic problems including those with multiple bubbles, merging and pinching, etc. Notably, this approach departs from a standard two-phase incompressible flow model where the air flow preserves its volume despite potentially large forces and pressure differentials in the surrounding incompressible fluid that should change its volume. Our bubbles readily change volume according to an isothermal equation of state.

97 MATHEMATICS AND COMPUTING↗

An algorithm for computing chlorophyll-a concentrations using a dual-frequency fluorosensor

An algorithm to be used on data from a dual-frequency fluorosensor (i.e. one using two wavelengths for excitation of chlorophyll-a fluorescence) to compute total chlorophyll-a concentration and to partition that chlorophyll between two color groups present in a mixed phytoplankton population is described. The algorithm is based on laboratory and field-testing experience gained with the airborne lidar oceanographic probing experiment fluorosensor.

Campbell, J. W.↗

Coherency-Based Detection Algorithm for Synchrophasor Cyberattacks

The wide area monitoring system (WAMS) is critical for power system situational awareness, but represents a growing cybersecurity vulnerability. Malicious adversaries may seek to compromise one or more PMUs in order to effect control decisions that unnecessarily disrupt typical grid operations. One example of a particularly pernicious attack vector is the spoofing or replaying of a fault event using one or more compromised PMUs. This work documents the development and validation of a coherency-based cyberattack detection algorithm that integrates a sliding-window singular value decomposition (SVD) with physics-based partitioning analysis to achieve accurate classification of events. Special consideration is given to discerning a sophisticated fault-replay or fault spoofing attack from actual faults. A software-based cybersecurity testbed has been developed for rigorous testing of the algorithm. The algorithm is further validated using simulated synchrophasor datasets obtained from a MinniWECC 63-bus test system. Results show that the algorithm can successfully detect fault-replay attacks even when over half of the PMUs are compromised.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Some Experiences with Nonoverlapping Schur Complement Parallel Preconditioning for CFD Calculations

In this work we consider solving matrices which arise from the discretization of advection-diffusion field equations on arbitrary triangulated domains using stabilized numerical methods. The talk will discuss several candidate matrix preconditioning algorithms based on the 2 x 2 block factorization induced by an apriori partitioning of the triangulated domain. Application of the 2 x 2 block preconditioner requires the formation and inversion of the Schur complement submatrix. We consider several strategies for simplifying this task: incomplete Schur complement factorizations, drop tolerance element filling, Schur complement probing, and localized Schur complement inversion. Numerical results will be shown comparing performance and efficiency of these approximations. The matrix preconditioner has also been embedded into a Newton algorithm for solving the nonlinear Euler and Navier-Stokes equations governing compressible flow. The remainder of the talk will show numerous examples in CFD to demonstrate the efficiency and robustness of the techniques.

Barth, Timothy J.↗

A study of fluid-structure interaction on overlapping grids with a focus on flexible beams

Fluid-structure interaction problems appear in many areas of science and engineering. Adequately understanding these problems is crucial to the study of such disciplines as aeroelastic flutter, wind turbine performance, implosions and explosions, and hemodynamics, to name a few. One technique to explore these problems is the use of numerical simulations. Although methods for the accurate and efficient numerical simulation of many problems involving only flexible structures or those involving only fluids have existed for a long time, the simulation of coupled problems, in which a flexible structure (or structures) interact with fluids remains challenging. The source of the difficulty with these problems is the construction of schemes for the coupling between the fluid and the solid that are both accurate and stable. There are two general approaches to designing a coupling procedure. In the first, the so-called monolithic approach, a single solver is implemented that handles both the fluid equations and the solid equations in a single framework. In this scheme, the solver handles the fluid and solid equations simultaneously, resulting in a strong coupling between the two. The second approach, named the partitioned approach, handles the fluid and structure domains separately. Whereas in the monolithic scheme there is a single solver for both the fluid and the structure, in the partitioned scheme there are separate solvers for the fluid and the structure. This separation heavily restricts the communication and coordination that can occur between the two solvers. Typically the only communication done in these schemes is through the application of boundary conditions (where the fluid applies a boundary condition on the fluid, and the solid one (or more) on the fluid). This makes the implementation of partitioned schemes easy, especially because they can take advantage of existing algorithms and software developed for the simulation of fluid flow or computational mechanics. However, they have a weakness – accuracy and stability are much harder to achieve. Stability is a particular problem for these schemes, as they are prone to the so-called added-mass effect.

97 MATHEMATICS AND COMPUTING↗

Pattern recognition in the satellite temperature retrieval problem

Pattern recognition procedures have been developed in order to improve the first-guess fields for satellite temperature retrievals. The first procedure is used to select one or more historical radiosonde temperature profiles as analog estimates of ambient thermal structure. The second procedure is used to organize a priori data into shape-coherent pattern libraries using structural information inherent in the data itself. On the basis of independent tests of about 800 temperature retrievals, it was found that: (1) the pattern recognition techniques reduced first-guess profile errors by nearly 50 percent in comparison with traditional partitioning schemes; and (2) with regression and physical-iterative retrieval algorithms, however, the effect of pattern recognition on temperature retrieval error was insignificant. Analysis of individual retrieval errors showed that poor retrievals may outweigh the potential benefits of both pattern recognition techniques.

Thompson, O. E.↗

Mathematical model partitioning and packing for parallel computer calculation

This paper deals with the development of multiprocessor simulations from a serial set of ordinary differential equations describing a physical system. The identification of computational parallelism within the model equations is discussed. A technique is presented for identifying this parallelism and for partitioning the equations for parallel solution on a multiprocessor. Next, an algorithm which packs the equations into a minimum number of processors is described. The results of applying the packing algorithm to a turboshaft engine model are presented.

Arpasi, Dale J.↗