Parallel Algorithms for the Generalized Stokes Problem

  • Ahmed Sameh
  • Vivek Sarin
Conference paper

Abstract

The generalized Stokes problem leads, in turn, to saddle-point problems that are normally solved via an Uzawa- or projection-type method. We introduce a new approach for handling such problems in which we avoid solving the pressure unknowns first and also avoid computing orthogonal projections in the process of obtaining velocity unknowns. This approach eliminates difficult computations that are associated with problems on irregular domains. We point out similarities with the projection scheme, and show that the proposed approach provides a way of preconditioning projection methods.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Bank, R.E., Welfert, B.D., and Yserentant, H. A Class of Iterative Methods for Solving Saddle Point Problems. Numer. Math. 56, 645–666(1990).MathSciNetMATHCrossRefGoogle Scholar
  2. [2]
    Quarteroni, A. Domain Decomposition Techniques for Stokes Equations. SIAM First Intnl. Symp. on Domain Decomposition Methods for Partial Differential Equations. Edited by R. Glowinski, G.H. Golub, G.A. Meurant and J. Periaux (1988).Google Scholar
  3. [3]
    Sameh, A. and Wisniewski, J.A. A Trace Minimization Algorithm for the Generalized Eigenvalue Problem. SIAM. Numer. Anal., Vol. 19, No. 6, 1243–1259, 1982.MathSciNetMATHCrossRefGoogle Scholar
  4. [4]
    Lou, F.G., Sameh, A. and Sarin, V. An Augmentation Method for Solving Saddle-Point Problems. Tech Report, Univ. of Minnesota.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Ahmed Sameh
    • 1
  • Vivek Sarin
    • 2
  1. 1.Dept. of Computer ScienceUniv. of MinnesotaMinneapolisUSA
  2. 2.Dept. of Computer ScienceUniv. of IllinoisUrbana-ChampaignUSA

Personalised recommendations