• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • CEREMADE (UMR CNRS 7534)
  • CEREMADE : Publications
  • View Item
  •   BIRD Home
  • CEREMADE (UMR CNRS 7534)
  • CEREMADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail - No thumbnail

Compressive Wave Computation

Demanet, Laurent; Peyré, Gabriel (2011), Compressive Wave Computation, Foundations of Computational Mathematics, 11, 3, p. 257-303. http://dx.doi.org/10.1007/s10208-011-9085-5

Type
Article accepté pour publication ou publié
External document link
http://hal.archives-ouvertes.fr/hal-00368919/en/
Date
2011
Journal name
Foundations of Computational Mathematics
Volume
11
Number
3
Publisher
Springer
Pages
257-303
Publication identifier
http://dx.doi.org/10.1007/s10208-011-9085-5
Metadata
Show full item record
Author(s)
Demanet, Laurent
Peyré, Gabriel
Abstract (EN)
This paper considers large-scale simulations of wave propagation phenomena. We argue that it is possible to accurately compute a wavefield by decomposing it onto a largely incomplete set of eigenfunctions of the Helmholtz operator, chosen at random, and that this provides a natural way of parallelizing wave simulations for memory-intensive applications. This paper shows that L1-Helmholtz recovery makes sense for wave computation, and identifies a regime in which it is provably effective: the one-dimensional wave equation with coefficients of small bounded variation. Under suitable assumptions we show that the number of eigenfunctions needed to evolve a sparse wavefield defined on N points, accurately with very high probability, is bounded by C log(N) log(log(N)), where C is related to the desired accuracy and can be made to grow at a much slower rate than N when the solution is sparse. The PDE estimates that underlie this result are new to the authors' knowledge and may be of independent mathematical interest; they include an L1 estimate for the wave equation, an estimate of extension of eigenfunctions, and a bound for eigenvalue gaps in Sturm-Liouville problems. Numerical examples are presented in one spatial dimension and show that as few as 10 percents of all eigenfunctions can suffice for accurate results. Finally, we argue that the compressive viewpoint suggests a competitive parallel algorithm for an adjoint-state inversion method in reflection seismology.
Subjects / Keywords
wave equation; Compressed sampling; compressed sensing; sparsity; L1; compressive sensing

Related items

Showing items related by title and author.

  • Thumbnail
    Image Compression with Anisotropic Geodesic Triangulations 
    Bougleux, Sébastien; Peyré, Gabriel; Cohen, Laurent D. (2009) Communication / Conférence
  • Thumbnail
    Compression d'images par triangulation géodésique anisotrope 
    Bougleux, Sébastien; Peyré, Gabriel; Cohen, Laurent D. (2009) Communication / Conférence
  • Thumbnail
    Landmark-based Geodesic Computation for Heuristically Driven Path Planning 
    Peyré, Gabriel; Cohen, Laurent D. (2006) Communication / Conférence
  • Thumbnail
    Geodesic Computations for Fast and Accurate Surface Remeshing and Parameterization 
    Peyré, Gabriel; Cohen, Laurent D. (2005) Chapitre d'ouvrage
  • Thumbnail
    Geodesic Methods in Computer Vision and Graphics 
    Peyré, Gabriel; Péchaud, Mickaël; Keriven, Renaud; Cohen, Laurent D. (2010) Article accepté pour publication ou publié
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo