• 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

    Convergence Analysis for the Multiplicative Schwarz Preconditioned Inexact Newton Algorithm

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    15m1028182.pdf
    Size:
    366.7Kb
    Format:
    PDF
    Description:
    Main article
    Download
    Type
    Article
    Authors
    Liu, Lulu cc
    Keyes, David E. cc
    KAUST Department
    Applied Mathematics and Computational Science Program
    Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
    Extreme Computing Research Center
    Date
    2016-10-26
    Online Publication Date
    2016-10-26
    Print Publication Date
    2016-01
    Permanent link to this record
    http://hdl.handle.net/10754/621850
    
    Metadata
    Show full item record
    Abstract
    The multiplicative Schwarz preconditioned inexact Newton (MSPIN) algorithm, based on decomposition by field type rather than by subdomain, was recently introduced to improve the convergence of systems with unbalanced nonlinearities. This paper provides a convergence analysis of the MSPIN algorithm. Under reasonable assumptions, it is shown that MSPIN is locally convergent, and desired superlinear or even quadratic convergence can be obtained when the forcing terms are picked suitably.
    Citation
    Liu L, Keyes DE (2016) Convergence Analysis for the Multiplicative Schwarz Preconditioned Inexact Newton Algorithm. SIAM Journal on Numerical Analysis 54: 3145–3166. Available: http://dx.doi.org/10.1137/15M1028182.
    Sponsors
    This work was supported by the Extreme Computing Research Center at KAUST and by the Aramco KAUST Master Research Agreement ORS 1438
    Publisher
    Society for Industrial & Applied Mathematics (SIAM)
    Journal
    SIAM Journal on Numerical Analysis
    DOI
    10.1137/15M1028182
    Additional Links
    http://epubs.siam.org/doi/10.1137/15M1028182
    ae974a485f413a2113503eed53cd6c53
    10.1137/15M1028182
    Scopus Count
    Collections
    Articles; Applied Mathematics and Computational Science Program; Extreme Computing Research Center; Computer, Electrical and Mathematical Science and Engineering (CEMSE) Division

    entitlement

     
    DSpace software copyright © 2002-2022  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.