• Login
    View Item 
    •   Home
    • Office of Sponsored Research (OSR)
    • KAUST Funded Research
    • Publications Acknowledging KAUST Support
    • View Item
    •   Home
    • Office of Sponsored Research (OSR)
    • KAUST Funded Research
    • Publications Acknowledging KAUST Support
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of KAUSTCommunitiesIssue DateSubmit DateThis CollectionIssue DateSubmit Date

    My Account

    Login

    Quick Links

    Open Access PolicyORCID LibguideTheses and Dissertations LibguideSubmit an Item

    Statistics

    Display statistics

    Convergence analysis of variational and non-variational multigrid algorithms for the Laplace-Beltrami operator

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Type
    Article
    Authors
    Bonito, Andrea
    Pasciak, Joseph E.
    KAUST Grant Number
    KUS-C1-016-04
    Date
    2012-09-01
    Permanent link to this record
    http://hdl.handle.net/10754/597872
    
    Metadata
    Show full item record
    Abstract
    We design and analyze variational and non-variational multigrid algorithms for the Laplace-Beltrami operator on a smooth and closed surface. In both cases, a uniform convergence for the V -cycle algorithm is obtained provided the surface geometry is captured well enough by the coarsest grid. The main argument hinges on a perturbation analysis from an auxiliary variational algorithm defined directly on the smooth surface. In addition, the vanishing mean value constraint is imposed on each level, thereby avoiding singular quadratic forms without adding additional computational cost. Numerical results supporting our analysis are reported. In particular, the algorithms perform well even when applied to surfaces with a large aspect ratio. © 2011 American Mathematical Society.
    Citation
    Bonito A, Pasciak JE (2012) Convergence analysis of variational and non-variational multigrid algorithms for the Laplace-Beltrami operator. Math Comp 81: 1263–1288. Available: http://dx.doi.org/10.1090/s0025-5718-2011-02551-2.
    Sponsors
    This work was supported in part by award number KUS-C1-016-04 made by KingAbdulla University of Science and Technology (KAUST). The first author was alsosupported in part by the National Science Foundation through Grant DMS-0914977while the second was also supported in part by the National Science Foundationthrough Grant DMS-0609544.
    Publisher
    American Mathematical Society (AMS)
    Journal
    Mathematics of Computation
    DOI
    10.1090/s0025-5718-2011-02551-2
    ae974a485f413a2113503eed53cd6c53
    10.1090/s0025-5718-2011-02551-2
    Scopus Count
    Collections
    Publications Acknowledging KAUST Support

    entitlement

     
    DSpace software copyright © 2002-2023  DuraSpace
    Quick Guide | Contact Us | KAUST University Library
    Open Repository is a service hosted by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items. For anonymous users the allowed maximum amount is 50 search results.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.