IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v117y2002i1p117-12910.1023-a1021517422210.html
   My bibliography  Save this article

Preconditioning by Projectors in the Solution of Contact Problems: A Parallel Implementation

Author

Listed:
  • Z. Dostál
  • A. Friedlander
  • F.A.M. Gomes
  • S.A. Santos

Abstract

A non-overlapping domain decomposition algorithm of the Neumann–Neumann type for solving contact problems of elasticity is presented. Using the duality theory of convex programming, the discretized problem turns into a quadratic one with equality and bound constraints. The dual problem is modified by orthogonal projectors to the natural coarse space. The resulting problem is solved by an augmented Lagrangian algorithm. The projectors ensure an optimal convergence rate for the solution of the auxiliary linear problems by the preconditioned conjugate gradient method. Relevant aspects on the numerical linear algebra of these problems are presented, together with an efficient parallel implementation of the method. Copyright Kluwer Academic Publishers 2002

Suggested Citation

  • Z. Dostál & A. Friedlander & F.A.M. Gomes & S.A. Santos, 2002. "Preconditioning by Projectors in the Solution of Contact Problems: A Parallel Implementation," Annals of Operations Research, Springer, vol. 117(1), pages 117-129, November.
    • Handle: RePEc:spr:annopr:v:117:y:2002:i:1:p:117-129:10.1023/a:1021517422210
    DOI: 10.1023/A:1021517422210
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1021517422210
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1021517422210?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    More about this item

    Keywords

    contact problems; parallel computation;

    Statistics

    Access and download statistics

    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:spr:annopr:v:117:y:2002:i:1:p:117-129:10.1023/a:1021517422210. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.