• Login
    View Item 
    •   Home
    • Research
    • Articles
    • View Item
    •   Home
    • Research
    • Articles
    • 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

    Multi-index Stochastic Collocation Convergence Rates for Random PDEs with Parametric Regularity

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Type
    Article
    Authors
    Haji Ali, Abdul Lateef cc
    Nobile, Fabio
    Tamellini, Lorenzo
    Tempone, Raul cc
    KAUST Department
    Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
    Applied Mathematics and Computational Science Program
    KAUST Grant Number
    CRG3 Award Ref: 2281
    Date
    2016-08-26
    Online Publication Date
    2016-08-26
    Print Publication Date
    2016-12
    Permanent link to this record
    http://hdl.handle.net/10754/622220
    
    Metadata
    Show full item record
    Abstract
    We analyze the recent Multi-index Stochastic Collocation (MISC) method for computing statistics of the solution of a partial differential equation (PDE) with random data, where the random coefficient is parametrized by means of a countable sequence of terms in a suitable expansion. MISC is a combination technique based on mixed differences of spatial approximations and quadratures over the space of random data, and naturally, the error analysis uses the joint regularity of the solution with respect to both the variables in the physical domain and parametric variables. In MISC, the number of problem solutions performed at each discretization level is not determined by balancing the spatial and stochastic components of the error, but rather by suitably extending the knapsack-problem approach employed in the construction of the quasi-optimal sparse-grids and Multi-index Monte Carlo methods, i.e., we use a greedy optimization procedure to select the most effective mixed differences to include in the MISC estimator. We apply our theoretical estimates to a linear elliptic PDE in which the log-diffusion coefficient is modeled as a random field, with a covariance similar to a Matérn model, whose realizations have spatial regularity determined by a scalar parameter. We conduct a complexity analysis based on a summability argument showing algebraic rates of convergence with respect to the overall computational work. The rate of convergence depends on the smoothness parameter, the physical dimensionality and the efficiency of the linear solver. Numerical experiments show the effectiveness of MISC in this infinite dimensional setting compared with the Multi-index Monte Carlo method and compare the convergence rate against the rates predicted in our theoretical analysis. © 2016 SFoCM
    Citation
    Haji-Ali A-L, Nobile F, Tamellini L, Tempone R (2016) Multi-index Stochastic Collocation Convergence Rates for Random PDEs with Parametric Regularity. Foundations of Computational Mathematics 16: 1555–1605. Available: http://dx.doi.org/10.1007/s10208-016-9327-7.
    Sponsors
    F. Nobile and L. Tamellini received support from the Center for ADvanced MOdeling Science (CADMOS) and partial support by the Swiss National Science Foundation under the Project No. 140574 “Efficient numerical methods for flow and transport phenomena in heterogeneous random porous media”. L. Tamellini also received support from the Gruppo Nazionale Calcolo Scientifico - Istituto Nazionale di Alta Matematica “Francesco Severi” (GNCS-INDAM). R. Tempone is a member of the KAUST Strategic Research Initiative, Center for Uncertainty Quantification in Computational Sciences and Engineering. R. Tempone received support from the KAUST CRG3 Award Ref: 2281.
    Publisher
    Springer Nature
    Journal
    Foundations of Computational Mathematics
    DOI
    10.1007/s10208-016-9327-7
    arXiv
    1511.05393
    Additional Links
    http://link.springer.com/article/10.1007%2Fs10208-016-9327-7
    ae974a485f413a2113503eed53cd6c53
    10.1007/s10208-016-9327-7
    Scopus Count
    Collections
    Articles; Applied Mathematics and Computational Science Program; Computer, Electrical and Mathematical Science and Engineering (CEMSE) Division

    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.