25 research outputs found

    Metal-Poor Stars and the Chemical Enrichment of the Universe

    Full text link
    Metal-poor stars hold the key to our understanding of the origin of the elements and the chemical evolution of the Universe. This chapter describes the process of discovery of these rare stars, the manner in which their surface abundances (produced in supernovae and other evolved stars) are determined from the analysis of their spectra, and the interpretation of their abundance patterns to elucidate questions of origin and evolution. More generally, studies of these stars contribute to other fundamental areas that include nuclear astrophysics, conditions at the earliest times, the nature of the first stars, and the formation and evolution of galaxies -- including our own Milky Way. We illustrate this with results from studies of lithium formed during the Big Bang; of stars dated to within ~1 Gyr of that event; of the most metal-poor stars, with abundance signatures very different from all other stars; and of the build-up of the elements over the first several Gyr. The combination of abundance and kinematic signatures constrains how the Milky Way formed, while recent discoveries of extremely metal-poor stars in the Milky Way's dwarf galaxy satellites constrain the hierarchical build-up of its stellar halo from small dark-matter dominated systems. [abridged]Comment: Book chapter, emulated version, 34 pages; number of references are limited by publisher; to appear in Vol. 5 of textbook "Planets, Stars and Stellar Systems", by Springer, in 201

    PARALLEL HIGH-ORDER INTEGRATORS

    No full text
    In this work we discuss a class of defect correctio n methods which is easily adapted to create parallel time integrators for multicore architectures and is ideally suited for developing methods which can be order adaptive in time. The method is based on integral deferred correction (IDC), which was itself motivated by spectral deferred correction by Dutt, Greengard, and Rokhlin [BIT, 40 (2000), pp. 241-266]. The method presented here is a revised formulation of explicit IDC, dubbed revisionist IDC (RIDC), which can achieve pth-order accuracy in "wall-clock time" comparable to a single forward Euler simulation on problems where the time to evaluate the right-hand side of a system of differential equations is greater than latency costs of interprocessor communication, such as in the case of the N-body problem. The key idea is to rewrit e the defect correction framework so that, after initial start-up costs, each correction loop can be lagged behind the previous correction loop in a manner that facilitates running the predictor and M = p - 1 correctors in parallel on an interval which has K steps, where K p. We prove that given an rth-order Runge-Kutta method in both the prediction and M correction loops of RIDC, then the method is order r X (M +1). The parallelization in RIDC uses a small number of cores (the number of processors used is limited by the order one wants to achieve). Using a four-core CPU, it is natural to think about fourth-order RIDC built with forward Euler, or eighth-order RIDC construct ed with second-order Runge-Kutta. Numerical tests on an N-body simulation show that RIDC met hods can be significantly faster than popular Runge-Kutta methods such as the classical fourth-ord er Runge-Kutta scheme. In a PDE setting, one can imagine coupling RIDC time integrators with parallel spatial evaluators, thereby increasing the parallelization. The ideas behind RIDC extend to implicit and semi-implicit IDC and have high potential in this area. © 2010 Society for Industrial and Applied Mathematics

    A Parallel Solver for the Time-Periodic Navier–Stokes Equations

    No full text
    We investigate parallel algorithms for the solution of the Navier–Stokes equations in space-time. For periodic solutions, the discretized problem can be written as a large non-linear system of equations. This system of equations is solved by a Newton iteration. The Newton correction is computed using a preconditioned GMRES solver. The parallel performance of the algorithm is illustrated
    corecore