Noa Marom, Physics & Engineering Physics, Tulane
"Structure Matters More Than Size: Tuning the Electronic Properties of TiO2 Clusters"
Atomic clusters comprising up to few tens of atoms offer exciting prospects for designing nano-catalysts, owing to their high reactivity and the strong dependence of their electronic properties on their size and structure. Quantum mechanical atomistic simulations may be used for computer-aided design of cluster-based nano-catalysts.
The vast majority of computational studies of clusters have focused on finding their global minimum structure, using various global optimization techniques. However, the most stable structures of atomic clusters are not necessarily optimal for catalysis. Rather, the presence of an active site may enhance the reactivity and/or selectivity of a cluster-based nano-catalyst. The presence of such an active site may be associated with certain electronic properties. For example, clusters with a high electron affinity or a low ionization potential would be more likely to accept or donate an electron.
We use a basin hopping algorithm based on density functional theory (DFT) in combination with many-body perturbation theory to show that photoemission spectroscopy (PES) experiments on (TiO2)2-10 anions select for clusters with a high electron affinity, rather than the most stable isomers. We then develop a suite of property-based genetic algorithms (GA) tailored to optimize for low-energy (EGA), high vertical electron affinity (VEA-GA), and low vertical ionization potential (VIP-GA). Analysis of the best structures found by the VEA-GA and VIP-GA reveals structure-property relations and explains the absence of the expected size trends. A high VEA is associated with a large number of dangling O atoms. A low VIP is associated with a low connectivity between dangling O atoms. These structural features become less probable with increasing cluster size, explaining why some smaller clusters have higher VEAs, lower VIPs, and narrower fundamental gaps than larger clusters.
 N. Marom, M. Kim, and J. R. Chelikowsky, Phys. Rev. Lett. 108, 106801 (2012)
 N. Marom, J. E. Moussa, X. Ren, A. Tkatchenko, and J. R. Chelikowsky, Phys. Rev. B 84, 245115 (2011)
 S. Bhattacharya, B. H. Sonin, C. J. Jumonville, L. M. Ghiringhelli, N. Marom, to be published
Nicole Gasparini, Earth and Environmental Sciences, Tulane University
"Landlab: An open-source landscape evolution model"
The Landlab project creates an environment in which scientists can build a numerical landscape model without having to code all of the individual components. Landscape models compute flows of mass, such as water, sediment, glacial ice, volcanic material, or landslide debris, across a gridded terrain surface. Landscape models have a number of commonalities, such as operating on a grid of points and routing material across the grid. Scientists who want to use a landscape model often build their own unique model from the ground up, re-coding the basic building blocks of their landscape model rather than taking advantage of codes that have already been written.
Whereas the end result may be novel software programs, many person-hours are lost rewriting existing code, and the resulting software is often idiosyncratic and not able to interact with programs written by other scientists in the community. This individuality in software programs leads to lost opportunity for exploring an even wider array of scientific questions than those which can be addressed using a single model. The Landlab project seeks to eliminate these redundancies and lost opportunities by creating a user- and developer-friendly numerical landscape modeling environment which provides scientists with the fundamental building blocks needed for modeling landscape processes. The model code is written in Python, an open-source language that is a relatively easy language for casual programmers to learn.
Howard Elman, Computer Science and Institute for Advanced Computer Studies, University of Marylandhttps://www.cs.umd.edu/users/elman/
We consider new computational methods for solving partial differential equations (PDEs) when components of the problem such as diffusion coefficients or boundary conditions are not known with certainty but instead are represented as random fields. In recent years, several computational techniques have been developed for such models that offer potential for improved efficiencies compared with traditional Monte-Carlo methods. These include stochastic Galerkin methods, which use an augmented weak formulation of the PDE derived from averaging with respect to expected value, and stochastic collocation methods, which use a set of samples relatively small in cardinality that captures the character of the solution space. We give an overview of the relative advantages of these two methods and present efficient computational algorithms for solving the algebraic systems that arise from them. In addition, we show that these algorithms can be combined with techniques of reduced-order modeling to significantly enhance efficiency with essentially no loss of accuracy.
Center for Computational Science, Stanley Thomas Hall 402, New Orleans, LA 70118 firstname.lastname@example.org