52 research outputs found

    Topology and the Cosmic Microwave Background

    Get PDF
    Nature abhors an infinity. The limits of general relativity are often signaled by infinities: infinite curvature as in the center of a black hole, the infinite energy of the singular big bang. We might be inclined to add an infinite universe to the list of intolerable infinities. Theories that move beyond general relativity naturally treat space as finite. In this review we discuss the mathematics of finite spaces and our aspirations to observe the finite extent of the universe in the cosmic background radiation.Comment: Hilarioulsy forgot to remove comments to myself in previous version. Reference added. Submitted to Physics Report

    SANDIA REPORT Statistical Coarse-Graining of Molecular Dynamics into Peridynamics NOTICE: Statistical Coarse-Graining of Molecular Dynamics into Peridynamics

    No full text
    Abstract This paper describes an elegant statistical coarse-graining of molecular dynamics at finite temperature into peridynamics, a continuum theory. Peridynamics is an efficient alternative to molecular dynamics enabling dynamics at larger length and time scales. In direct analogy with molecular dynamics, peridynamics uses a nonlocal model of force and does not employ stress/strain relationships germane to classical continuum mechanics. In contrast with classical continuum mechanics, the peridynamic representation of a system of linear springs and masses is shown to have the same dispersion relation as the original spring-mass system. 3

    Compiler Blockability of Dense Matrix Factorizations

    No full text
    Recent architectural advances have made memory accesses a significant bottleneck for computational problems. Even though cache memory helps in some cases, it fails to alleviate the bottleneck for problems with large working sets. As a result, scientists are forced to restructure their codes by hand to reduce the working-set size to fit a particular machine. Unfortunately, these hand optimizations create machine-specific code that is not portable across multiple architectures without a significant loss in performance or a significant effort to re-optimize the code. It is the thesis of this paper that most of the hand optimizations performed on matrix factorization codes are unnecessary because they can and should be performed by the compiler. It is better for the programmer to express algorithms in a machine-independent form and allow the compiler to handle the machine-dependent details. This gives the algorithms portability across architectures and removes the error-prone, expensive an..
    corecore