Coulomb-hole summations and energies for GW calculations with limited number of empty orbitals: a modified static remainder approach

Ab initio GW calculations are a standard method for computing the spectroscopic properties of many materials. The most computationally expensive part in conventional implementations of the method is the generation and summation over the large number of empty orbitals required to converge the electron self-energy. We propose a scheme to reduce the summation over empty states by the use of a modified static remainder approximation, which is simple to implement and yields accurate self-energies for both bulk and molecular systems requiring a small fraction of the typical number of empty orbitals.

Improved quasiparticle wave functions and mean field for G(0)W(0) calculations: Initialization with the COHSEX operator

The GW approximation to the electron self-energy has become a standard method for ab initio calculation of excited-state properties of condensed-matter systems. In many calculations, the G W self-energy operator, E, is taken to be diagonal in the density functional theory (DFT) Kohn-Sham basis within the G0 W0 scheme. However, there are known situations in which this diagonal Go Wo approximation starting from DFT is inadequate. We present two schemes to resolve such problems. The first, which we called sc-COHSEX-PG W, involves construction of an improved mean field using the static limit of GW, known as COHSEX (Coulomb hole and screened exchange), which is significantly simpler to treat than GW W. In this scheme, frequency-dependent self energy E(N), is constructed and taken to be diagonal in the COHSEX orbitals after the system is solved self-consistently within this formalism. The second method is called off diagonal-COHSEX G W (od-COHSEX-PG W). In this method, one does not self-consistently change the mean-field starting point but diagonalizes the COHSEX Hamiltonian within the Kohn-Sham basis to obtain quasiparticle wave functions and uses the resulting orbitals to construct the G W E in the diagonal form. We apply both methods to a molecular system, silane, and to two bulk systems, Si and Ge under pressure. For silane, both methods give good quasiparticle wave functions and energies. Both methods give good band gaps for bulk silicon and maintain good agreement with experiment. Further, the sc-COHSEX-PGW method solves the qualitatively incorrect DFT mean-field starting point (having a band overlap) in bulk Ge under pressure.

Compiler/Runtime Framework for Dynamic Dataflow Parallelization of Tiled Programs

Task-parallel languages are increasingly popular. Many of them provide expressive mechanisms for intertask synchronization. For example, OpenMP 4.0 will integrate data-driven execution semantics derived from the StarSs research language. Compared to the more restrictive data-parallel and fork-join concurrency models, the advanced features being introduced into task-parallelmodels in turn enable improved scalability through load balancing, memory latency hiding, mitigation of the pressure on memory bandwidth, and, as a side effect, reduced power consumption. In this article, we develop a systematic approach to compile loop nests into concurrent, dynamically constructed graphs of dependent tasks. We propose a simple and effective heuristic that selects the most profitable parallelization idiom for every dependence type and communication pattern. This heuristic enables the extraction of interband parallelism (cross-barrier parallelism) in a number of numerical computations that range from linear algebra to structured grids and image processing. The proposed static analysis and code generation alleviates the burden of a full-blown dependence resolver to track the readiness of tasks at runtime. We evaluate our approach and algorithms in the PPCG compiler, targeting OpenStream, a representative dataflow task-parallel language with explicit intertask dependences and a lightweight runtime. Experimental results demonstrate the effectiveness of the approach.

An estimate of the number of tropical tree species

The high species richness of tropical forests has long been recognized, yet there remains substantial uncertainty regarding the actual number of tropical tree species. Using a pantropical tree inventory database from closed canopy forests, consisting of 657,630 trees belonging to 11,371 species, we use a fitted value of Fisher's alpha and an approximate pantropical stem total to estimate the minimum number of tropical forest tree species to fall between similar to 40,000 and similar to 53,000, i.e., at the high end of previous estimates. Contrary to common assumption, the Indo-Pacific region was found to be as species-rich as the Neotropics, with both regions having a minimum of similar to 19,000-25,000 tree species. Continental Africa is relatively depauperate with a minimum of similar to 4,500-6,000 tree species. Very few species are shared among the African, American, and the Indo-Pacific regions. We provide a methodological framework for estimating species richness in trees that may help refine species richness estimates of tree-dependent taxa.

Action of Hopf on the twisted modular Hecke operator

Let Gamma subset of SL2(Z) be a principal congruence subgroup. For each sigma is an element of SL2(Z), we introduce the collection A(sigma)(Gamma) of modular Hecke operators twisted by sigma. Then, A(sigma)(Gamma) is a right A(Gamma)-module, where A(Gamma) is the modular Hecke algebra introduced by Connes and Moscovici. Using the action of a Hopf algebra h(0) on A(sigma)(Gamma), we define reduced Rankin-Cohen brackets on A(sigma)(Gamma). Moreover A(sigma)(Gamma) carries an action of H 1, where H 1 is the Hopf algebra of foliations of codimension 1. Finally, we consider operators between the levels A(sigma)(Gamma), sigma is an element of SL2(Z). We show that the action of these operators can be expressed in terms of a Hopf algebra h(Z).

SMO: An Integrated Approach to Intra-array and Inter-array Storage Optimization

The polyhedral model provides an expressive intermediate representation that is convenient for the analysis and subsequent transformation of affine loop nests. Several heuristics exist for achieving complex program transformations in this model. However, there is also considerable scope to utilize this model to tackle the problem of automatic memory footprint optimization. In this paper, we present a new automatic storage optimization technique which can be used to achieve both intra-array as well as inter-array storage reuse with a pre-determined schedule for the computation. Our approach works by finding statement-wise storage partitioning hyper planes that partition a unified global array space so that values with overlapping live ranges are not mapped to the same partition. Our heuristic is driven by a fourfold objective function which not only minimizes the dimensionality and storage requirements of arrays required for each high-level statement, but also maximizes inter statement storage reuse. The storage mappings obtained using our heuristic can be asymptotically better than those obtained by any existing technique. We implement our technique and demonstrate its practical impact by evaluating its effectiveness on several benchmarks chosen from the domains of image processing, stencil computations, and high-performance computing.