1,721,043 research outputs found

    On the Scalability of the Parallel Schwarz Method in One-Dimension

    No full text
    An algorithm is said to beweakly scalable if it can solve progressively larger problems with an increasing number of processors in a fixed amount of time. According to classical Schwarz theory, the parallel Schwarz method (PSM) is not scalable (see, e.g., [2, 7])

    Coarse-Graining ddCOSMO through an Interface between Tinker and the ddX Library

    No full text
    The domain decomposition conductor-like screening model is an efficient way to compute the solvation energy of solutes within a polarizable continuum medium in a linear scaling computational time. Despite its efficiency, the application to very large systems is still challenging. A possibility to further accelerate the algorithm is resorting to coarse-graining strategies. In this paper we present a preliminary interface between the molecular dynamics package Tinker and the ddX library. The interface was used to test a united atom coarse-graining strategy that allowed us to push ddCOSMO to its limits by computing solvation energies on systems with up to 7 million atoms. We first present benchmarks to find an optimal discretization, and then, we discuss the performance and results obtained with fine- and coarse-grained solvation energy calculations

    Grassmann Extrapolation of Density Matrices for Born-Oppenheimer Molecular Dynamics

    No full text
    Born-Oppenheimer molecular dynamics (BOMD) is a powerful but expensive technique. The main bottleneck in a density functional theory BOMD calculation is the solution to the Kohn-Sham (KS) equations that requires an iterative procedure that starts from a guess for the density matrix. Converged densities from previous points in the trajectory can be used to extrapolate a new guess; however, the nonlinear constraint that an idempotent density needs to satisfy makes the direct use of standard linear extrapolation techniques not possible. In this contribution, we introduce a locally bijective map between the manifold where the density is defined and its tangent space so that linear extrapolation can be performed in a vector space while, at the same time, retaining the correct physical properties of the extrapolated density using molecular descriptors. We apply the method to real-life, multiscale, polarizable QM/MM BOMD simulations, showing that sizeable performance gains can be achieved, especially when a tighter convergence to the KS equations is required

    An approximation strategy to compute accurate initial density matrices for repeated self-consistent field calculations at different geometries

    No full text
    Repeated computations on the same molecular system, but with different geometries, are often performed in quantum chemistry, for instance, in ab-initio molecular dynamics simulations or geometry optimisations. While many efficient strategies exist to provide a good guess for the self-consistent field procedure, little is known on how to efficiently exploit the abundance of information generated during the many computations. In this article, we present a strategy to provide an accurate initial guess for the density matrix, expanded in a set of localised basis functions, within the self-consistent field iterations for parametrised Hartree–Fock problems where the nuclear coordinates are changed along with a few user-specified collective variables, such as the molecule's normal modes. Our approach is based on an offline-stage where the Hartree–Fock eigenvalue problem is solved for some particular parameter values and an online-stage where the initial guess is computed very efficiently for any new parameter value. The method allows nonlinear approximations of density matrices, which belong to a non-linear manifold that is isomorphic to the Grassmann manifold, by mapping such a manifold onto the tangent space. Numerical tests on different amino acids show promising initial results

    Search Practices for Discontinuous Innovation: Scale Development and Construct Validation

    Full text link
    Managing innovation and particularly searching for new ideas in a steady state environment is really different than in discontinuous conditions where traditional practices and routines may prove ineffective. This paper reviews and empirically explores the field of search strategies and practices for discontinuous innovation and, for the first time, tests the validity of a "Discontinuous Innovation (DI) Search Capacity" construct. Based on a comprehensive literature review on the innovation search stage and on the evidence of more than 80 case studies reported by the Discontinuous Innovation Lab a questionnaire was developed and submitted to a 500 high tech firm sample. Four DI Search dimensions were identified, each consisting of a bundle of interrelated yet distinct practices. We empirically tested the DI Search Capacity and measured it as second-order construct by using the Structural Equation Modelling

    Going Beyond Counting First Authors in Author Co-citation Analysis

    Full text link
    The present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed

    Certified reduced basis methods for parametrized partial differential equations

    Full text link
    This book provides a thorough introduction to the mathematical and algorithmic aspects of certified reduced basis methods for parametrized partial differential equations. Central aspects ranging from model construction, error estimation and computational efficiency to empirical interpolation methods are discussed in detail for coercive problems. More advanced aspects associated with time-dependent problems, non-compliant and non-coercive problems and applications with geometric variation are also discussed as examples

    Variations on the Author

    Full text link
    “Variations on the Author” discusses two of Eduardo Coutinho’s recent films (Um Dia na Vida, from 2010, and Últimas Conversas, posthumously released in 2015) and their contribution to the general question of documentary authorship. The director’s filmography is characterized by a consistent yet self-effacing form of authorial self-inscription: Coutinho often features as an interviewer that rather than express opinions propels discourses; an interviewer that is good at listening. This mode of self-inscription characterizes him as an author who is not expressive but who is nonetheless markedly present on the screen. In Um Dia na Vida, however, Coutinho is completely absent form the image, while Últimas Conversas, on the contrary, includes a confessional prologue that moves the director from the margins to the center of his films. This article examines the ways in which these works stand out in the filmography of a director who offers new insights into the notion of cinematic authorship

    Appropriate Similarity Measures for Author Cocitation Analysis

    Full text link
    We provide a number of new insights into the methodological discussion about author cocitation analysis. We first argue that the use of the Pearson correlation for measuring the similarity between authors’ cocitation profiles is not very satisfactory. We then discuss what kind of similarity measures may be used as an alternative to the Pearson correlation. We consider three similarity measures in particular. One is the well-known cosine. The other two similarity measures have not been used before in the bibliometric literature. Finally, we show by means of an example that our findings have a high practical relevance.information science;Pearson correlation;cosine;similarity measure;author cocitation analysis
    corecore