IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v330y2018icp65-76.html
   My bibliography  Save this article

A two level algorithm for an obstacle problem

Author

Listed:
  • Wang, Fei
  • Eichholz, Joseph
  • Han, Weimin

Abstract

Due to the inequality feature of the obstacle problem, the standard quadratic finite element method for solving the problem can only achieve an error bound of the form O(N−3/4+ϵ),N being the total number of degrees of freedom, and ϵ > 0 arbitrary. To achieve a better error bound, the key lies in how to capture the free boundary accurately. In this paper, we propose a two level algorithm for solving the obstacle problem. The first part of the algorithm is through the use of the linear elements on a quasi-uniform mesh. Then information on the approximate free boundary from the linear element solution is used in the construction of a quadratic finite element method. Under some assumptions, it is shown that the numerical solution from the two level algorithm is expected to have a nearly optimal error bound of O(N−1+ϵ), ϵ > 0 arbitrary. Such an expected convergence order is observed numerically in numerical examples.

Suggested Citation

  • Wang, Fei & Eichholz, Joseph & Han, Weimin, 2018. "A two level algorithm for an obstacle problem," Applied Mathematics and Computation, Elsevier, vol. 330(C), pages 65-76.
    • Handle: RePEc:eee:apmaco:v:330:y:2018:i:c:p:65-76
    DOI: 10.1016/j.amc.2018.02.030
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300318301322
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2018.02.030?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.

    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:apmaco:v:330:y:2018:i:c:p:65-76. 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: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.