Skip to main content
SpringerLink
Log in

Schwarz alternating and iterative refinement methods for mixed formulations of elliptic problems, part I: Algorithms and numerical results

  • Published:
Numerische Mathematik Aims and scope Submit manuscript

Summary

We describe sequential and parallel algorithms based on the Schwarz alternating method for the solution of mixed finite element discretizations of elliptic problems using the Raviart-Thomas finite element spaces. These lead to symmetric indefinite linear systems and the algorithms have some similarities with the traditional block Gauss-Seidel or block Jacobi methods with overlapping blocks. The indefiniteness requires special treatment. The sub-blocks used in the algorithm correspond to problems on a coarse grid and some overlapping subdomains and is based on a similar partition used in an algorithm of Dryja and Widlund for standard elliptic problems. If there is sufficient overlap between the subdomains, the algorithm converges with a rate independent of the mesh size, the number of subdomains and discontinuities of the coefficients. Extensions of the above algorithms to the case of local grid refinement is also described. Convergence theory for these algorithms will be presented in a subsequent paper.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bramble, J.H., Pasciak, J.E., Wang, J., Xu, J. (1991): Convergence estimates for product iterative methods with applications to domain decomposition. Math. Comput.57, 1–21

    Google Scholar 

  2. Brezzi, F., Fortin, M. (1991): Mixed and hybrid finite element methods. Springer, Berlin Heidelberg New York

    Google Scholar 

  3. Cai, X.C., Widlund, O.B. (1992): Domain decomposition algorithms for indefinite elliptic problems. SIAM J. Sci. Stat. Comput.13

  4. Concus, P., Golub, G.H., Meurant, G. (1985): Block preconditioning for the conjugate gradient method. SIAM J. Sci. Stat. Comput.6, 220–252

    Google Scholar 

  5. Cowsar, L.E., Wheeler, M.F. (1991): Parallel domain decomposition method for mixed finite elements for elliptic partial differential equations. In: R. Glowinski, Y.A. Kuznetsov, G. Meurant, J. Periaux, O.B. Widlund. Proceedings of the Fourth International Symposium on Domain Decomposition Methods for Partial Differential Equations, SIAM, Philadelphia

    Google Scholar 

  6. Dryja, M., Widlund, O.B. (1989): Some Domain Decomposition Algorithms for Elliptic Problems. In: D.M. Young, Jr. ed., Proceedings of the Conference on Iterative Methods for Large Linear Systems held in Austin, Texas, October 1988, to celebrate the Sixty-fifth Birthday of D.M. Young, Jr., Academic Press, Orlando

    Google Scholar 

  7. Ewing, R.E., Lazarov, R.D., Russel, T.F., Vassilevski, P.S. (1990): Local refinement via domain decomposition techniques for mixed finite element methods with rectangular Raviart-Thomas elements, In: T. Chan, R. Glowinski, J. Périaux, O. Widlund eds., Domain Decomposition Methods, SIAM, Philadelphia

    Google Scholar 

  8. Ewing, R.E., Wang, J. (1991): Analysis of the Schwarz algorithm for mixed finite element methods, Math. Modelling26(6), 739–756

    Google Scholar 

  9. Fortin, M., Aboulaich, R. (1988): Schwarz's Decomposition method for incompressible flow problems, In: R. Glowinski, G.H. Golub, G.A. Meurant, J. Périaux eds., First International Symposium on Domain Decomposition Methods for Partial Differential Equations, SIAM, Philadelphia

  10. Girault, V., Raviart, P.A. (1986): Finite element approximation of the Navier-Stokes equations: theory and algorithms. Springer, Berlin Heidelberg New York

    Google Scholar 

  11. Glowinski, R., Kinton, W., Wheeler, M.F. (1990): Acceleration of domain decomposition algorithms for mixed finite elements by multi-level methods. In: T.F. Chan, R. Glowinski, J. Périaux, O.B. Widlund eds., Third International Symposium on Domain Decomposition Methods for Partial Differential Equations. pp. 263–289, SIAM, Philadelphia

    Google Scholar 

  12. Glowinski, R., Le Tallec, P. (1990): Augmented lagrangian methods. SIAM

  13. Glowinski, R., Wheeler, M.F. (1988): Domain decomposition and mixed finite element methods for elliptic problems, In: R. Glowinski, G.H. Golub, G.A. Meurant, J. Périaux eds., First International Symposium on Domain Decomposition Methods for Partial Differential Equations, SIAM, Philadelphia

  14. Golub, G.H., Van Loan, C.F. (1989): Matrix computations, Johns Hopkins University Press, Second Edition

  15. Greenbaum, A., Li, C., Han, Z.C. (1989): Parallelizing preconditioned conjugate gradient algorithms. In: Comput. Phys. Commun.53, 295–309

  16. Hart, L., McCormick, S. (1987): Asynchronous multilevel adaptive methods for solving partial differential equations on multiprocessors: computational analysis. Comput. Math. Group. University of Colorado, Denver, (Submitted to Parallel Computing)

  17. Lions, P.L. (1978): Interprétation stochastique de la méthode alternée de schwarz. Academic Press, Paris,268, 325–328

    Google Scholar 

  18. Lions, P.L. (1988): On the Schwarz alternating method. I., In: R. Glowinski, G.H. Golub, G.A. Meurant, J. Périaux eds., First International Symposium on Domain Decomposition Methods for Partial Differential Equations, SIAM, Philadelphia

  19. Lions, P.L. (1989): On the Schwarz alternating method. II. In: T. Chan, R. Glowinski, J. Périaux, O. Widlund eds., Domain Decomposition Methods, SIAM, Philadelphia

    Google Scholar 

  20. Mandel, J., McCormick, S. (1989): Iterative solution of elliptic equations with refinement: the two-level case. In: T. Chan, R. Glowinski, J. Périaux, O. Widlund eds., Domain Decomposition Methods, SIAM, Philadelphia

    Google Scholar 

  21. Mathew, T.P. (1992): Schwarz alternating and iterative refinement methods for mixed formulations of elliptic problems, Part II: Theory65

  22. Mathew, T.P. (1989): Domain decomposition and iterative refinement methods for mixed finite element discretizations of elliptic problems. Computer Science Department, Courant Institute of Mathematical Sciences,463 Courant Institute doctoral dissertation

  23. McCormick, S., Thomas, J. (1986): The fast adaptive composite grid (FAC) method for elliptic equations. Math. Comput,46 (1/4), 439–456.

    Google Scholar 

  24. Meijerink, J.A., Van der Vorst, H.A. (1977): An iterative method for linear systems of which the coefficient matrix is a symmetric M-matrix. Math. Comput.31(137), 148–162

    Google Scholar 

  25. Miller, K. (1965): Numerical analogs of the Schwarz alternating procedure. Numer. Math.7, 91–103.

    Google Scholar 

  26. Raviart, P.A., Thomas, J.M. (1975): A mixed finite element method for 2-nd order elliptic problems. In: A. Dold, B. Eckmann eds., Mathematical aspects of finite element methods. Lecture Notes of Mathematics,606 Springer, Berlin Heidelberg New York

    Google Scholar 

  27. Roberts, J.E., Thomas, J.-M. (1991): Mixed and hybrid methods. In: P.G. Ciarlet, J.L. Lions eds., Handbook of numerical analysis, Vol. II—finite element methods, Part I, pp. 523–639, North-Holland, Amsterdam

    Google Scholar 

  28. Rusten, T., Winther, R. (1990): A preconditioned iterative method for saddle point problems. SIAM J. Sci. Stat. Comput., Proceedings of Copper Mountain Conference on Iterative Methods

  29. Schwarz, H.A. (1890): Gesammelete Mathematische Abhandlungen,2, 133–143, Springer, Berlin Heidelberg New York, First published in Vierteljahrsschrift der Naturforschenden Gesellschaft in Zürich, (1870)15, 272–286.

    Google Scholar 

  30. Tang, W.P. (1988): Schwarz splitting and template operators. Ph.D. Thesis, Department of Computer Science, Stanford

    Google Scholar 

  31. Temam, R. (1977): Navier-Stokes equations, North Holland

  32. Wheeler, M.F., Gonzalez, R. (1984): Mixed finite element methods for petroleum reservoir engineering problems, In: R. Glowinski, J.L. Lions. eds., Computing methods in applied sciences and engineering, VI, pp. 639–658, North-Holland, New York

    Google Scholar 

  33. Widlund, O.B. (1989): Optimal iterative refinement methods, Department of Computer Science, Courant Institute. In: T. Chan, R. Glowinski, J. Périaux, O. Widlund eds., Domain decomposition methods, SIAM, Philadelphia

    Google Scholar 

Download references

Author information

Author notes

  1. Tarek P. Mathew

    Present address: Department of Mathematics, University of Wyoming, 82071-3036, Laramie, WY, USA

Authors and Affiliations

  1. Department of Mathematics, University of California at Los Angeles, 90024-1555, Los Angeles, CA, USA

    Tarek P. Mathew

Authors
  1. Tarek P. Mathew
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work was supported in part by the National Science Foundation under Grant NSF-CCR-8903003, while the author was a graduate student at New York University, and in part by the Army Research Office under Grant DAAL 03-91-G-0150, while the author was a Visiting Assistant Researcher at UCLA

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mathew, T.P. Schwarz alternating and iterative refinement methods for mixed formulations of elliptic problems, part I: Algorithms and numerical results. Numer. Math. 65, 445–468 (1993). https://doi.org/10.1007/BF01385762

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01385762

Mathematics Subject Classification (1991)

Search

Navigation