• Login
    View Item 
    •   Shocker Open Access Repository Home
    • Fairmount College of Liberal Arts and Sciences
    • Mathematics, Statistics, and Physics
    • MATH Research Publications
    • View Item
    •   Shocker Open Access Repository Home
    • Fairmount College of Liberal Arts and Sciences
    • Mathematics, Statistics, and Physics
    • MATH Research Publications
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    A fast local level set method for inverse gravimetry

    View/Open
    Isakov_2011 (1.444Mb)
    Date
    2011
    Author
    Isakov, Victor
    Leung, Shingyu
    Qian, Jianliang
    Metadata
    Show full item record
    Citation
    Isakov V., Leung S., and Qian J. 2011. "A fast local level set method for inverse gravimetry". Communications in Computational Physics. 10 (4): 1044-1070.
    Abstract
    We propose a fast local level set method for the inverse problem of gravimetry. The theoretical foundation for our approach is based on the following uniqueness result: if an open set D is star-shaped or x(3)-convex with respect to its center of gravity, then its exterior potential uniquely determines the open set D. To achieve this purpose constructively, the first challenge is how to parametrize this open set D as its boundary may have a variety of possible shapes. To describe those different shapes we propose to use a level-set function to parametrize the unknown boundary of this open set. The second challenge is how to deal with the issue of partial data as gravimetric measurements are only made on a part of a given reference domain a To overcome this difficulty, we propose a linear numerical continuation approach based on the single layer representation to find potentials on the boundary of some artificial domain containing the unknown set D. The third challenge is how to speed up the level set inversion process. Based on some features of the underlying inverse gravimetry problem such as the potential density being constant inside the unknown domain, we propose a novel numerical approach which is able to take advantage of these features so that the computational speed is accelerated by an order of magnitude. We carry out numerical experiments for both two- and three-dimensional cases to demonstrate the effectiveness of the new algorithm.
    Description
    Click on the DOI link to access the article (may not be free).
    URI
    http://hdl.handle.net/10057/4486
    http://dx.doi.org/10.4208/cicp.100710.021210a
    Collections
    • MATH Research Publications

    Browse

    All of Shocker Open Access RepositoryCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsBy TypeThis CollectionBy Issue DateAuthorsTitlesSubjectsBy Type

    My Account

    LoginRegister

    Statistics

    Most Popular ItemsStatistics by CountryMost Popular Authors

    DSpace software copyright © 2002-2023  DuraSpace
    DSpace Express is a service operated by 
    Atmire NV