IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-642-25707-0_6.html
   My bibliography  Save this book chapter

A Domain Decomposition Method for Strongly Mixed Boundary Value Problems for the Poisson Equation

In: Modeling, Simulation and Optimization of Complex Processes

Author

Listed:
  • Dang Quang A

    (Institute of Information Technology)

  • Vu Vinh Quang

    (Thai Nguyen University, Faculty of Information Technology)

Abstract

Recently we proposed a domain decomposition method (DDM) for solving a Dirichlet problem for a second order elliptic equation, where differently from other DDMs, the value of the normal derivative on an interface is updated from iteration to iteration. In this paper we develop a method for solving strongly mixed boundary value problems (BVPs), where boundary conditions are of different type on different sides of a rectangle and the transmission of boundary conditions occurs not only in vertices but also in one or several inner points of a side of the rectangle. Such mixed problems often arise in mechanics and physics. Our method reduces these strongly mixed BVPs to sequences of weakly mixed problems for the Poisson equation in the sense that on each side of the rectangle there is given only one type of boundary condition, which are easily solved by a program package, constructed recently by Vu (see [13]). The detailed investigation of the convergence of the method for a model problem is carried out. After that the method is applied to a problem of semiconductors. The convergence of the method is proved and numerical experiments confirm the efficiency of the method.

Suggested Citation

  • Dang Quang A & Vu Vinh Quang, 2012. "A Domain Decomposition Method for Strongly Mixed Boundary Value Problems for the Poisson Equation," Springer Books, in: Hans Georg Bock & Xuan Phu Hoang & Rolf Rannacher & Johannes P. Schlöder (ed.), Modeling, Simulation and Optimization of Complex Processes, edition 127, pages 65-75, Springer.
    • Handle: RePEc:spr:sprchp:978-3-642-25707-0_6
    DOI: 10.1007/978-3-642-25707-0_6
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;

    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:sprchp:978-3-642-25707-0_6. 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.