IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v61y2003i3p347-357.html
   My bibliography  Save this article

Scalability and FETI based algorithm for large discretized variational inequalities

Author

Listed:
  • Dostál, Zdeněk
  • Horák, David

Abstract

The point of this paper is to review recent theoretical and experimental results related to scalability of the FETI based domain decomposition algorithm that was proposed recently by Dostál, Friedlander, Santos and Gomes for numerical solution of discretized variational inequalities. After briefly describing the basic algorithm with a “natural coarse grid” and its implementation, we review theoretical results that indicate a kind of optimality of the algorithm, namely that the number of iterations that are necessary to complete some parts of the algorithm is bounded independently of the discretization parameter. Then, we give some results of numerical experiments with parallel solution of a model problem discretized by up to more than eight million of nodal variables to give an evidence of both numerical and parallel scalability of the algorithm presented.

Suggested Citation

  • Dostál, Zdeněk & Horák, David, 2003. "Scalability and FETI based algorithm for large discretized variational inequalities," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 61(3), pages 347-357.
    • Handle: RePEc:eee:matcom:v:61:y:2003:i:3:p:347-357
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475402000885
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Dostál, Zdeněk & Horák, David & Vlach, Oldřich, 2007. "FETI-based algorithms for modelling of fibrous composite materials with debonding," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 76(1), pages 57-64.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:matcom:v:61:y:2003:i:3:p:347-357. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.