Advertisement

Multigrid Becomes a Competitive Algorithm for some 3D Device Simulation Problems

  • J. Fuhrmann
  • K. Gärtner

Abstract

For situations where Gummel’s decoupling scheme is applicable a multigrid algorithm for the continuity equations fully consistent with the usual ScharfetterGummel discretization can be used to solve the van Roosbroeck equations. The main problems for applying a multigrid algorithm are that discrete spaces are not nested in the usual sense for the refined grids because of the ScharfetterGummel discretization and that problem coefficients vary strongly. Transforming the equations to symmetric form and applying a block MILU decomposition based on the coarse-fine splitting of the discrete spaces with a perturbed Schur complement defines the prolongation and restriction operators. The transformation back to the original variables is possible. Coarse grid matrices are M-matrices.

Keywords

Coarse Grid Multigrid Method Domain Decomposition Method Competitive Algorithm Multigrid Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    O. Axelsson and P. S. Vassilevski. Algebraic multilevel preconditioning methods, III. preprint, Cath. Univ. Dept. of Math., Nijmegen, 1990. Report 9045.CrossRefGoogle Scholar
  2. [2]
    J.H. Bramble, J.E. Pasciak, and J. Xu. The analysis of multigrid algorithms with nonnested spaces or noniherited quadratic forms. Math. of Comp., 56:1–34, 1991.MathSciNetMATHCrossRefGoogle Scholar
  3. [3]
    W. Dahmen and L. Elsner. Algebraic multigrid methods and the Schur complement. In W. Hackbusch, editor, Robust Multigrid-Methods, volume 23 of Notes on numerical fluid mechanics, pages 58–69. Vieweg, Braunschweig, 1989.Google Scholar
  4. [4]
    J. Fuhrmann. On the convergence of algebraically defined multigrid methods. preprint no.3, Institut für Angewandte Analysis and Stochastik Berlin, 1992.Google Scholar
  5. [5]
    J. Fuhrmann and K. Gärtner. A multigrid method for the solution of a convection - diffusion equation with rapidly varying coefficients. In [8].Google Scholar
  6. [6]
    J. Fuhrmann and K. Gärtner. Incomplete factorizations and linear multigrid algorithms for the semiconductor device equations. In R. Beauwens and P. de Groen, editors, Proccedings of the IMACS international symposium on iterative methods in linear algebra, pages 493–503, Amsterdam, 1992. Elsevier.Google Scholar
  7. [7]
    G. Haase, U. Langer, and A. Meyer. The approximate Dirichlet domain decomposition method. part I: An algebraic approach. Computing, 47:137–151, 1991.MathSciNetMATHCrossRefGoogle Scholar
  8. [8]
    W. Hackbusch and U. Trottenberg, editors. Proceedings of the Third European Multigrid Conference October 1 - 4, 1990, Bonn, Germany, volume 98 of ISNM, Basel, 1991. Birkhäuser Verlag.MATHGoogle Scholar
  9. [9]
    Yu. A. Kuznetsov. Multigrid domain decomposition methods. In T.F. Chan, R. Glowinski, J. Periaux, and O.B. Widlund, editors, Proceedings of the Third International Symposium on Domain Decomposition Methods for Partial Differential Equations, Houston, Texas, March 20–22, 1989, pages 290–313, Philadelphia, 1990. SIAM.Google Scholar
  10. [10]
    C. Popa. ILU decomposition for coarse grid correction step on algebraic multigrid. In Hackbusch and Trottenberg [8].Google Scholar
  11. [11]
    J.W. Ruge and K. Stüben. Algebraic multigrid. In S. McCormick, editor, Multigrid methods, volume 4 of Frontiers in Applied Mathematics, chapter 4, pages 73–130. SIAM, Philadelphia, 1987.Google Scholar

Copyright information

© Springer-Verlag Wien 1993

Authors and Affiliations

  • J. Fuhrmann
    • 1
  • K. Gärtner
    • 2
  1. 1.Institute for Applied Analysis and StochasticsBerlinGermany
  2. 2.Interdisciplinary Project Center for SupercomputingETH-Zürich ETH-ZentrumZürichSwitzerland

Personalised recommendations