92,556 research outputs found

    Numerical Homogenization of the Acoustic Wave Equations with a Continuum of Scales

    Get PDF
    In this paper, we consider numerical homogenization of acoustic wave equations with heterogeneous coefficients, namely, when the bulk modulus and the density of the medium are only bounded. We show that under a Cordes type condition the second order derivatives of the solution with respect to harmonic coordinates are L2L^2 (instead H−1H^{-1} with respect to Euclidean coordinates) and the solution itself is in L∞(0,T,H2(Ω))L^{\infty}(0,T,H^2(\Omega)) (instead of L∞(0,T,H1(Ω))L^{\infty}(0,T,H^1(\Omega)) with respect to Euclidean coordinates). Then, we propose an implicit time stepping method to solve the resulted linear system on coarse spatial scales, and present error estimates of the method. It follows that by pre-computing the associated harmonic coordinates, it is possible to numerically homogenize the wave equation without assumptions of scale separation or ergodicity.Comment: 27 pages, 4 figures, Submitte

    Why Delannoy numbers?

    Full text link
    This article is not a research paper, but a little note on the history of combinatorics: We present here a tentative short biography of Henri Delannoy, and a survey of his most notable works. This answers to the question raised in the title, as these works are related to lattice paths enumeration, to the so-called Delannoy numbers, and were the first general way to solve Ballot-like problems. These numbers appear in probabilistic game theory, alignments of DNA sequences, tiling problems, temporal representation models, analysis of algorithms and combinatorial structures.Comment: Presented to the conference "Lattice Paths Combinatorics and Discrete Distributions" (Athens, June 5-7, 2002) and to appear in the Journal of Statistical Planning and Inference

    A Digital Signature Scheme for Long-Term Security

    Full text link
    In this paper we propose a signature scheme based on two intractable problems, namely the integer factorization problem and the discrete logarithm problem for elliptic curves. It is suitable for applications requiring long-term security and provides a more efficient solution than the existing ones
    • …
    corecore