416 research outputs found

    Two-Dimensional Calcium Release

    Get PDF

    An Analytical Framework to Describe the Interactions Between Individuals and a Continuum

    Full text link
    We consider a discrete set of individual agents interacting with a continuum. Examples might be a predator facing a huge group of preys, or a few shepherd dogs driving a herd of sheeps. Analytically, these situations can be described through a system of ordinary differential equations coupled with a scalar conservation law in several space dimensions. This paper provides a complete well posedness theory for the resulting Cauchy problem. A few applications are considered in detail and numerical integrations are provided

    Steady and Stable: Numerical Investigations of Nonlinear Partial Differential Equations

    Full text link
    Excerpt: Mathematics is a language which can describe patterns in everyday life as well as abstract concepts existing only in our minds. Patterns exist in data, functions, and sets constructed around a common theme, but the most tangible patterns are visual. Visual demonstrations can help undergraduate students connect to abstract concepts in advanced mathematical courses. The study of partial differential equations, in particular, benefits from numerical analysis and simulation

    Numerical approximation of the Euler-Poisson-Boltzmann model in the quasineutral limit

    Get PDF
    This paper analyzes various schemes for the Euler-Poisson-Boltzmann (EPB) model of plasma physics. This model consists of the pressureless gas dynamics equations coupled with the Poisson equation and where the Boltzmann relation relates the potential to the electron density. If the quasi-neutral assumption is made, the Poisson equation is replaced by the constraint of zero local charge and the model reduces to the Isothermal Compressible Euler (ICE) model. We compare a numerical strategy based on the EPB model to a strategy using a reformulation (called REPB formulation). The REPB scheme captures the quasi-neutral limit more accurately

    Adaptive Mesh Refinement for Characteristic Grids

    Full text link
    I consider techniques for Berger-Oliger adaptive mesh refinement (AMR) when numerically solving partial differential equations with wave-like solutions, using characteristic (double-null) grids. Such AMR algorithms are naturally recursive, and the best-known past Berger-Oliger characteristic AMR algorithm, that of Pretorius & Lehner (J. Comp. Phys. 198 (2004), 10), recurses on individual "diamond" characteristic grid cells. This leads to the use of fine-grained memory management, with individual grid cells kept in 2-dimensional linked lists at each refinement level. This complicates the implementation and adds overhead in both space and time. Here I describe a Berger-Oliger characteristic AMR algorithm which instead recurses on null \emph{slices}. This algorithm is very similar to the usual Cauchy Berger-Oliger algorithm, and uses relatively coarse-grained memory management, allowing entire null slices to be stored in contiguous arrays in memory. The algorithm is very efficient in both space and time. I describe discretizations yielding both 2nd and 4th order global accuracy. My code implementing the algorithm described here is included in the electronic supplementary materials accompanying this paper, and is freely available to other researchers under the terms of the GNU general public license.Comment: 37 pages, 15 figures (40 eps figure files, 8 of them color; all are viewable ok in black-and-white), 1 mpeg movie, uses Springer-Verlag svjour3 document class, includes C++ source code. Changes from v1: revised in response to referee comments: many references added, new figure added to better explain the algorithm, other small changes, C++ code updated to latest versio

    Projected SO(5) Hamiltonian for Cuprates and Its Applications

    Full text link
    The projected SO(5) (pSO(5)) Hamiltonian incorporates the quantum spin and superconducting fluctuations of underdoped cuprates in terms of four bosons moving on a coarse grained lattice. A simple mean field approximation can explain some key feautures of the experimental phase diagram: (i) The Mott transition between antiferromagnet and superconductor, (ii) The increase of T_c and superfluid stiffness with hole concentration x and (iii) The increase of antiferromagnetic resonance energy as sqrt{x-x_c} in the superconducting phase. We apply this theory to explain the ``two gaps'' problem found in underdoped cuprate Superconductor-Normal- Superconductor junctions. In particular we explain the sharp subgap Andreev peaks of the differential resistance, as signatures of the antiferromagnetic resonance (the magnon mass gap). A critical test of this theory is proposed. The tunneling charge, as measured by shot noise, should change by increments of Delta Q= 2e at the Andreev peaks, rather than by Delta Q=e as in conventional superconductors.Comment: 3 EPS figure

    First-order quasilinear canonical representation of the characteristic formulation of the Einstein equations

    Full text link
    We prescribe a choice of 18 variables in all that casts the equations of the fully nonlinear characteristic formulation of general relativity in first--order quasi-linear canonical form. At the analytical level, a formulation of this type allows us to make concrete statements about existence of solutions. In addition, it offers concrete advantages for numerical applications as it now becomes possible to incorporate advanced numerical techniques for first order systems, which had thus far not been applicable to the characteristic problem of the Einstein equations, as well as in providing a framework for a unified treatment of the vacuum and matter problems. This is of relevance to the accurate simulation of gravitational waves emitted in astrophysical scenarios such as stellar core collapse.Comment: revtex4, 7 pages, text and references added, typos corrected, to appear in Phys. Rev.

    Meshfree finite differences for vector Poisson and pressure Poisson equations with electric boundary conditions

    Full text link
    We demonstrate how meshfree finite difference methods can be applied to solve vector Poisson problems with electric boundary conditions. In these, the tangential velocity and the incompressibility of the vector field are prescribed at the boundary. Even on irregular domains with only convex corners, canonical nodal-based finite elements may converge to the wrong solution due to a version of the Babuska paradox. In turn, straightforward meshfree finite differences converge to the true solution, and even high-order accuracy can be achieved in a simple fashion. The methodology is then extended to a specific pressure Poisson equation reformulation of the Navier-Stokes equations that possesses the same type of boundary conditions. The resulting numerical approach is second order accurate and allows for a simple switching between an explicit and implicit treatment of the viscosity terms.Comment: 19 pages, 7 figure

    Three-points interfacial quadrature for geometrical source terms on nonuniform grids

    Get PDF
    International audienceThis paper deals with numerical (finite volume) approximations, on nonuniform meshes, for ordinary differential equations with parameter-dependent fields. Appropriate discretizations are constructed over the space of parameters, in order to guarantee the consistency in presence of variable cells' size, for which LpL^p-error estimates, 1≀p<+∞1\le p < +\infty, are proven. Besides, a suitable notion of (weak) regularity for nonuniform meshes is introduced in the most general case, to compensate possibly reduced consistency conditions, and the optimality of the convergence rates with respect to the regularity assumptions on the problem's data is precisely discussed. This analysis attempts to provide a basic theoretical framework for the numerical simulation on unstructured grids (also generated by adaptive algorithms) of a wide class of mathematical models for real systems (geophysical flows, biological and chemical processes, population dynamics)
    • 

    corecore