Title:       Convergence of the multigrid V-cycle algorithms for
             second order boundary value problems without full 
             elliptic regularity

Author:      Susanne C. Brenner

Published:   Mathematics of Computation
             posted on November 19, 2001, PII S 0025-5718(01)01361-8
             v. 71 (2002), 507-525 

Abstract:    The contraction number of the multigrid $V$-cycle algorithm 
             applied to second order elliptic boundary value problems is shown
             to improve with the increase of the number of smoothing steps, 
             without assuming full elliptic regularity.  As a consequence, the 
             $V$-cycle convergence result of Braess and Hackbusch is
             generalized to problems without full elliptic regularity.


Presented at: 

- Finite Element Circus, University of Texas at Austin,
  February 25-26, 2000

- Numerical Analysis Seminar, Warsaw University, October 26, 2000

- Oberseminar, Universität Leipzig, November 2, 2000

- 10th Copper Mountain Conference on Multigrid methods,  April 1-6, 2001

- Schnelle Löser für partielle Differentialgleichungen, 
  Oberwolfach, Germany, May 27-June 2, 2001

- 19th Biennial Conference on Numerical Analysis,
  Dundee, Scotland, June 26-29, 2001

- AMS meeting, Chattanooga, Tennessee, October 5-6, 2001 

- Workshop on Foundations of Numerical Algorithms for PDEs,
  Foundations of Computational Mathematics (FoCM) Conference,
  University of Minnesota, August 5-7, 2002

- Illinois Institute of Technology, January 30, 2004

- University of Houston, April 2, 2004

- Institute of Computational Mathematics, Chinese Academy of Science,
  Beijing, PRC, September 7, 2004