full
search.png

Search

close.png

Cancel

arrow
Volume 7, Issue 2
Some Domain Decomposition and Iterative Refinement Algorithms for Elliptic Finite Element Problems

Olof Widlund

J. Comp. Math., 7 (1989), pp. 200-208.

Published online: 1989-07

Preview Full PDF 2488 26318

Cited by

google scholar semantic scholar
Export citation
  • Abstract

In this contribution, we report on some results recently obtained in joint work with Maksymilian Dryja. We first study an additive variant of Schwarz' alternating algorithm and establish that a fast method of this kind can be devised which is optimal in the sense that the number of conjugate gradient iterations required, to reach a certain tolerance, is independent of the mesh size as well as the number of subregions.

  • Keywords

  • AMS Subject Headings

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • BibTex
  • RIS
  • TXT
@Article{JCM-7-200, author = {Olof Widlund}, title = {Some Domain Decomposition and Iterative Refinement Algorithms for Elliptic Finite Element Problems}, journal = {Journal of Computational Mathematics}, year = {1989}, volume = {7}, number = {2}, pages = {200--208}, abstract = {

In this contribution, we report on some results recently obtained in joint work with Maksymilian Dryja. We first study an additive variant of Schwarz' alternating algorithm and establish that a fast method of this kind can be devised which is optimal in the sense that the number of conjugate gradient iterations required, to reach a certain tolerance, is independent of the mesh size as well as the number of subregions.

}, issn = {1991-7139}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/jcm/9470.html} }
TY - JOUR T1 - Some Domain Decomposition and Iterative Refinement Algorithms for Elliptic Finite Element Problems AU - Olof Widlund JO - Journal of Computational Mathematics VL - 2 SP - 200 EP - 208 PY - 1989 DA - 1989/07 SN - 7 DO - http://doi.org/ UR - https://global-sci.org/intro/article_detail/jcm/9470.html KW - AB -

In this contribution, we report on some results recently obtained in joint work with Maksymilian Dryja. We first study an additive variant of Schwarz' alternating algorithm and establish that a fast method of this kind can be devised which is optimal in the sense that the number of conjugate gradient iterations required, to reach a certain tolerance, is independent of the mesh size as well as the number of subregions.

Olof Widlund. (1989). Some Domain Decomposition and Iterative Refinement Algorithms for Elliptic Finite Element Problems. Journal of Computational Mathematics. 7 (2). 200-208. doi:
Copy to clipboard
BibteX RIS TXT
The citation has been copied to your clipboard