Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

A Multilevel Algorithm for Mixed Problems

R. Verfürth
SIAM Journal on Numerical Analysis
Vol. 21, No. 2 (Apr., 1984), pp. 264-271
Stable URL: http://www.jstor.org/stable/2157300
Page Count: 8
  • Subscribe ($19.50)
  • Cite this Item
A Multilevel Algorithm for Mixed Problems
Preview not available

Abstract

We describe a multilevel algorithm for the numerical solution of symmetric indefinite problems which arise, e.g. from mixed finite element approximations of the Stokes equation. The main difficulty, besides the indefiniteness, is the lack of regularity of the solution of the corresponding continuous problem. This is overcome by introducing a scale of mesh-dependent norms. The convergence rate of the described algorithm is bounded independently of the meshsize. For convenience we only discuss Jacobi relaxation as smoothing operator in detail. In the last section we comment on Lanczos-type smoothing procedures.

Page Thumbnails

  • Thumbnail: Page 
264
    264
  • Thumbnail: Page 
265
    265
  • Thumbnail: Page 
266
    266
  • Thumbnail: Page 
267
    267
  • Thumbnail: Page 
268
    268
  • Thumbnail: Page 
269
    269
  • Thumbnail: Page 
270
    270
  • Thumbnail: Page 
271
    271