Search NASA⌕ Search

SEARCH · Search NASA

Results for “partitioned methods”

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 703 records · Page 39

Streamwise computation of duct flows

A computational method is presented to calculate momentum and energy transport in two-dimensional viscous compressible duct flows. The flow in the duct is partitioned into finite streams. The difference equations are then obtained by applying momentum and energy conservation principles directly to the individual streams. The method is applicable to laminar and turbulence flows.

Greywall, M. S.↗

Method for assessing coal-floor water-inrush risk based on the variable-weight model and unascertained measure theory

Water inrush from coal-seam floors greatly threatens mining safety in North China and is a complex process controlled by multiple factors. This study presents a mathematical assessment system for coal-floor water-inrush risk based on the variable-weight model (VWM) and unascertained measure theory (UMT). In contrast to the traditional constant-weight model (CWM), which assigns a fixed weight to each factor, the VWM varies with the factor-state value. The UMT employs the confidence principle, which is more effective in ordered partition problems than the maximum membership principle adopted in the former mathematical theory. The method is applied to the Datang Tashan Coal Mine in North China. First, eight main controlling factors are selected to construct the comprehensive evaluation index system. Subsequently, an incentive-penalty variable-weight model is built to calculate the variable weights of each factor. Then, the VWM-UMT model is established using the quantitative risk-grade divide of each factor according to the UMT. On this basis, the risk of coal-floor water inrush in Tashan Mine No. 8 is divided into five grades. For comparison, the CWM is also adopted for the risk assessment, and a differences distribution map is obtained between the two methods. Finally, the verification of water-inrush points indicates that the VWM-UMT model is powerful and more feasible and reasonable. The model has great potential and practical significance in future engineering applications.

01 COAL, LIGNITE, AND PEAT↗

Combinatorial approach to Mathieu and Lamé equations

Based on some recent progress on a relation between four dimensional super Yang-Mills gauge theory and quantum integrable system, we study the asymptotic spectrum of the quantum mechanical problems described by the Mathieu equation and the Lamé equation. The large momentum asymptotic expansion of the eigenvalue is related to the instanton partition function of supersymmetric gauge theories which can be evaluated by a combinatorial method. The electro-magnetic duality of gauge theory indicates that in the parameter space, there are three asymptotic expansions for the eigenvalue, and we confirm this fact by performing the Wentzel–Kramers–Brillouin (WKB) analysis in each asymptotic expansion region. The results presented here give some new perspective on the Floquet theory about periodic differential equation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A multiple-time-scale turbulence model based on variable partitioning of the turbulent kinetic energy spectrum

A multiple-time-scale turbulence model of a single point closure and a simplified split-spectrum method is presented. In the model, the effect of the ratio of the production rate to the dissipation rate on eddy viscosity is modeled by use of the multiple-time-scales and a variable partitioning of the turbulent kinetic energy spectrum. The concept of a variable partitioning of the turbulent kinetic energy spectrum and the rest of the model details are based on the previously reported algebraic stress turbulence model. Example problems considered include: a fully developed channel flow, a plane jet exhausting into a moving stream, a wall jet flow, and a weakly coupled wake-boundary layer interaction flow. The computational results compared favorably with those obtained by using the algebraic stress turbulence model as well as experimental data. The present turbulence model, as well as the algebraic stress turbulence model, yielded significantly improved computational results for the complex turbulent boundary layer flows, such as the wall jet flow and the wake boundary layer interaction flow, compared with available computational results obtained by using the standard kappa-epsilon turbulence model.

Kim, S.-W.↗

Self-organized topology of recurrence-based complex networks

With the rapid technological advancement, network is almost everywhere in our daily life. Network theory leads to a new way to investigate the dynamics of complex systems. As a result, many methods are proposed to construct a network from nonlinear time series, including the partition of state space, visibility graph, nearest neighbors, and recurrence approaches. However, most previous works focus on deriving the adjacency matrix to represent the complex network and extract new network-theoretic measures. Although the adjacency matrix provides connectivity information of nodes and edges, the network geometry can take variable forms. The research objective of this article is to develop a self-organizing approach to derive the steady geometric structure of a network from the adjacency matrix. We simulate the recurrence network as a physical system by treating the edges as springs and the nodes as electrically charged particles. Then, force-directed algorithms are developed to automatically organize the network geometry by minimizing the system energy. Further, a set of experiments were designed to investigate important factors (i.e., dynamical systems, network construction methods, force-model parameter, nonhomogeneous distribution) affecting this self-organizing process. Interestingly, experimental results show that the self-organized geometry recovers the attractor of a dynamical system that produced the adjacency matrix. This research addresses a question, i.e., “what is the self-organizing geometry of a recurrence network?” and provides a new way to reproduce the attractor or time series from the recurrence plot. As a result, novel network-theoretic measures (e.g., average path length and proximity ratio) can be achieved based on actual node-to-node distances in the self-organized network topology. The paper brings the physical models into the recurrence analysis and discloses the spatial geometry of recurrence networks.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A physics-motivated Centroidal Voronoi Particle domain decomposition method

In this paper, we propose a novel domain decomposition method for large-scale simulations in continuum mechanics by merging the concepts of Centroidal Voronoi Tessellation (CVT) and Voronoi Particle dynamics (VP). The CVT is introduced to achieve a high-level compactness of the partitioning subdomains by the Lloyd algorithm which monotonically decreases the CVT energy. The number of computational elements between neighboring partitioning subdomains, which scales the communication effort for parallel simulations, is optimized implicitly as the generated partitioning subdomains are convex and simply connected with small aspect-ratios. Moreover, Voronoi Particle dynamics employing physical analogy with a tailored equation of state is developed, which relaxes the particle system towards the target partition with good load balance. Since the equilibrium is computed by an iterative approach, the partitioning subdomains exhibit locality and the incremental property. Numerical experiments reveal that the proposed Centroidal Voronoi Particle (CVP) based algorithm produces high-quality partitioning with high efficiency, independently of computational-element types. Thus it can be used for a wide range of applications in computational science and engineering.

97 MATHEMATICS AND COMPUTING↗

A High-Order Eulerian–Lagrangian Runge–Kutta Finite Volume (EL–RK–FV) Method for Scalar Nonlinear Conservation Laws

Abstract We present a class of high-order Eulerian–Lagrangian Runge–Kutta finite volume methods that can numerically solve Burgers’ equation with shock formations, which could be extended to general scalar conservation laws. Eulerian–Lagrangian (EL) and semi-Lagrangian (SL) methods have recently seen increased development and have become a staple for allowing large time-stepping sizes. Yet, maintaining relatively large time-stepping sizes post shock formation remains quite challenging. Our proposed scheme integrates the partial differential equation on a space-time region partitioned by linear approximations to the characteristics determined by the Rankine–Hugoniot jump condition. We trace the characteristics forward in time and present a merging procedure for the mesh cells to handle intersecting characteristics due to shocks. Following this partitioning, we write the equation in a time-differential form and evolve with Runge–Kutta methods in a method-of-lines fashion. High-resolution methods such as ENO and WENO-AO schemes are used for spatial reconstruction. Extension to higher dimensions is done via dimensional splitting. Numerical experiments demonstrate our scheme’s high-order accuracy and ability to sharply capture post-shock solutions with large time-stepping sizes.

Chen, Jiajie↗

Improved image decompression for reduced transform coding artifacts

The perceived quality of images reconstructed from low bit rate compression is severely degraded by the appearance of transform coding artifacts. This paper proposes a method for producing higher quality reconstructed images based on a stochastic model for the image data. Quantization (scalar or vector) partitions the transform coefficient space and maps all points in a partition cell to a representative reconstruction point, usually taken as the centroid of the cell. The proposed image estimation technique selects the reconstruction point within the quantization partition cell which results in a reconstructed image which best fits a non-Gaussian Markov random field (MRF) image model. This approach results in a convex constrained optimization problem which can be solved iteratively. At each iteration, the gradient projection method is used to update the estimate based on the image model. In the transform domain, the resulting coefficient reconstruction points are projected to the particular quantization partition cells defined by the compressed image. Experimental results will be shown for images compressed using scalar quantization of block DCT and using vector quantization of subband wavelet transform. The proposed image decompression provides a reconstructed image with reduced visibility of transform coding artifacts and superior perceived quality.

Orourke, Thomas P.↗

Optimized recursion relation for the computation of partition functions in the superconfiguration approach

Partition functions of a canonical ensemble of non-interacting bound electrons are a key ingredient of the super-transition-array approach to the computation of radiative opacity. A few years ago, we published a robust and stable recursion relation for the calculation of such partition functions. In this work, we propose an optimization of the latter method and explain how to implement it in practice. The formalism relies on the evaluation of elementary symmetric polynomials, which opens the way to further improvements.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

GPU-based implementations of the noniterative regularized-CCSD(T) corrections: applications to strongly correlated systems

The details of the Graphical Processing Unit (GPU) implementation of the most compu- tationally intensive (T)-part of the recently introduced regularized CCSD(T) (Reg-CCSD(T)) method [K. Kowalski, M.Valiev 131, 234107 (2010)] for calculating electronic energies of strongly interacting systems are discussed. Parallel tests performed for several molecular systems show very good scalability of the triples part of the Reg-CCSD(T) approach. We also discuss the performance of the Reg-CCSD(T) GPU implementation as a function of the parameters defining the partitioning of the spinorbital domain (tiling structure). The accuracy of the Reg-CCSD(T) method is illustrated on two examples: the NiO2 molecule and open-shell Spiro cation (5,5’(4H,4H’)-spirobi[cyclopenta[c]pyrrole]2,2’,6,6’-tetrahydro cation), which is a frequently used model to study electron transfer processes. It is demonstrated that a simple regularization of the cluster amplitudes used in the non-iterative corrections accounting for the effect of triply excited configurations significantly improves the accuracies of groundstate energies in the presence of strong quasidegeneracy effects. For NiO2 we compare the Reg-CCSD(T) results with the CCSDT energies, whereas for Spiro cation we compare Reg-CCSD(T) results with the energies obtained with completely renormalized CCSD(T) method.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Unsupervised learning of representative local atomic arrangements in molecular dynamics data

Molecular dynamics (MD) simulations present a data-mining challenge, given that they can generate a considerable amount of data but often rely on limited or biased human interpretation to examine their information content. By not asking the right questions of MD data we may miss critical information hidden within it. Here we combine dimensionality reduction (UMAP) and unsupervised hierarchical clustering (HDBSCAN) to quantitatively characterize prevalent coordination environments of chemical species within MD data. By focusing on local coordination, we significantly reduce the amount of data to be analyzed by extracting all distinct molecular formulas within a given coordination sphere. We then efficiently combine UMAP and HDBSCAN with alignment or shape-matching algorithms to partition these formulas into structural isomer families indicating their relative populations. The method was employed to reveal details of cation coordination in electrolytes based on molecular liquids.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A master equation simulation for the • OH + CH 3 OH reaction

A combined (fixed-J) two-dimensional master-equation / semi-classical transition state theory / variational Rice-Ramsperger-Kassel-Marcus (2DME/SCTST/vRRKM) approach has been used to compute reaction rate coefficients of •OH with CH 3 OH over a wide range of temperatures (10 - 2500 K) and pressures (10 -1 -10 4 Torr) based on a potential energy surface that has been constructed using a modification of the HEAT thermochemical protocol. The calculated results show that the title reaction is nearly pressure-independent when T > 250 K, but depends strongly on pressure at lower temperatures. Also, the preferred mechanism and rate constants are found to be very sensitive to temperature. The reaction pathway CH 3 OH + • OH → CH 3 O • + H 2 O proceeds exclusively through tunneling at exceedingly low temperatures (T ≤50 K) typical of those established in interstellar environments. In this regime, the rate constant is found to increase with decreasing temperature, which agrees with low-temperature experimental results. The thermodynamically favored reaction pathway CH 3 OH + • OH → • CH 2 OH + H 2 O becomes dominant at higher temperatures (T ≥ 200 K), such as those found in Earth’s atmosphere as well as combustion environments. By modifying the ab initio barrier heights slightly, experimental rate constants from 200 to 1250 K can be satisfactorily reproduced.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Spatial variations in the spectral index of polarized synchrotron emission in the 9 yr WMAP sky maps

We estimate the spectral index, β, of polarized synchrotron emission as observed in the 9 yr Wilkinson Microwave Anisotropy Probe sky maps using two methods, linear regression ({sup T}-T plot{sup )} and maximum likelihood. We partition the sky into 24 disjoint sky regions and evaluate the spectral index for all polarization angles between 0° and 85° in steps of 5°. Averaging over polarization angles, we derive a mean spectral index of β{sup all-sky} = –2.99 ± 0.01 in the frequency range of 23-33 GHz. We find that the synchrotron spectral index steepens by 0.14 from low to high Galactic latitudes, in agreement with previous studies, with mean spectral indices of β{sup plane} = –2.98 ± 0.01 and β{sup high-lat} = –3.12 ± 0.04. In addition, we find a significant longitudinal variation along the Galactic plane with a steeper spectral index toward the Galactic center and anticenter than toward the Galactic spiral arms. This can be well modeled by an offset sinusoidal, β(l) = –2.85 + 0.17sin (2l – 90°). Finally, we study synchrotron emission in the BICEP2 field, in an attempt to understand whether the claimed detection of large-scale B-mode polarization could be explained in terms of synchrotron contamination. Adopting a spectral index of β = –3.12, typical for high Galactic latitudes, we find that the most likely bias corresponds to about 2% of the reported signal (r = 0.003). The flattest index allowed by the data in this region is β = –2.5, and under the assumption of a straight power-law frequency spectrum, we find that synchrotron emission can account for at most 20% of the reported BICEP2 signal.

79 ASTRONOMY AND ASTROPHYSICS↗

EVIDENCE FOR THE UNIVERSALITY OF PROPERTIES OF RED-SEQUENCE GALAXIES IN X-RAY- AND RED-SEQUENCE-SELECTED CLUSTERS AT z ∼ 1

We study the slope, intercept, and scatter of the color–magnitude and color–mass relations for a sample of 10 infrared red-sequence-selected clusters at z ∼ 1. The quiescent galaxies in these clusters formed the bulk of their stars above z ≳ 3 with an age spread Δt ≳ 1 Gyr. We compare UVJ color–color and spectroscopic-based galaxy selection techniques, and find a 15% difference in the galaxy populations classified as quiescent by these methods. We compare the color–magnitude relations from our red-sequence selected sample with X-ray- and photometric-redshift-selected cluster samples of similar mass and redshift. Within uncertainties, we are unable to detect any difference in the ages and star formation histories of quiescent cluster members in clusters selected by different methods, suggesting that the dominant quenching mechanism is insensitive to cluster baryon partitioning at z ∼ 1.

79 ASTRONOMY AND ASTROPHYSICS↗

A Scalable Parallel Algorithm for Large-Scale Protein Sequence Homology Detection

Protein sequence homology detection is a fundamental problem in computational molecular biology, with a pervasive application in nearly all analyses that aim to structurally and functionally characterize protein molecules. While detecting homology between two protein sequences is computationally inexpensive, detecting pairwise homology at a large-scale becomes prohibitive, requiring millions of CPU hours. Yet, there is currently no efficient method available to parallelize this kernel. In this paper, we present the key characteristics that make this problem particularly hard to parallelize, and then propose a new parallel algorithm that is suited for large-scale protein sequence data. Our method, called pGraph, is designed using a hierarchical multiple-master multiple-worker model, where the processor space is partitioned into subgroups and the hierarchy helps in ensuring the workload is load balanced fashion despite the inherent irregularity that may originate in the input. Experimental evaluation demonstrates that our method scales linearly on all input sizes tested (up to 640K sequences) on a 1,024 node supercomputer. In addition to demonstrating strong scaling, we present an extensive study of the various components of the system and related parametric studies.

59 BASIC BIOLOGICAL SCIENCES↗

Multilevel Combinatorial Optimization across Quantum Architectures

Emerging quantum processors provide an opportunity to explore new approaches for solving traditional problems in the post Moore’s law supercomputing era. However, the limited number of qubits makes it infeasible to tackle massive real-world datasets directly in the near future, leading to new challenges in utilizing these quantum processors for practical purposes. Furthermore, hybrid quantum-classical algorithms that leverage both quantum and classical types of devices are considered as one of the main strategies to apply quantum computing to large-scale problems. In this article, we advocate the use of multilevel frameworks for combinatorial optimization as a promising general paradigm for designing hybrid quantum-classical algorithms. To demonstrate this approach, we apply this method to two well-known combinatorial optimization problems, namely, the Graph Partitioning Problem, and the Community Detection Problem. We develop hybrid multilevel solvers with quantum local search on D-Wave’s quantum annealer and IBM’s gate-model based quantum processor. We carry out experiments on graphs that are orders of magnitude larger than the current quantum hardware size, and we observe results comparable to state-of-the-art solvers in terms of quality of the solution.

97 MATHEMATICS AND COMPUTING↗

Futility

The Futility package contains the following: 1) Definition of the size of integers and real numbers; 2) A generic Unit test harness; 3) Definitions for some basic extensions to the Fortran language: arbitrary length strings, a parameter list construct, exception handlers, command line processor, timers; 4) Geometry definitions: point, line, plane, box, cylinder, polyhedron; 5) File wrapper functions: standard Fortran input/output files, Fortran binary files, HDF5 files; 6) Parallel wrapper functions: MPI, and Open MP abstraction layers, partitioning algorithms; 7) Math utilities: BLAS, Matrix and Vector definitions, Linear Solver methods and wrappers for other TPLs (PETSC, MKL, etc), preconditioner classes; 8) Misc: random number generator, water saturation properties, sorting algorithms.

Collins, BenjaminS.↗