Skip to main content

Parallelisierung und Vorkonditionierung des CG-Verfahrens durch Gebietszerlegung

  • Chapter
Numerische Algorithmen auf Transputer-Systemen

Part of the book series: Teubner Skripten zur Numerik ((TSN))

Zusammenfassung

Gebietszerlegungstechniken eröffnen eine Vielzahl von Möglichkeiten zur Entwicklung paralleler Lösungsstrategien für Finite-Elemente (F.E.) Gleichungen großer Dimension. Die auf der nichtüberlappenden Gebietszerlegung beruhende F.É. Substrukturtechnik und die damit verbundene Datenverteilung führt zu einer Parallelisierung des CG-Verfahrens, die sich besonders für Mehrprozessorrechner mit lokalem Speicher und Botschaftenaustausch über Links eignet. Für diese parallelisierte Version des CG-Verfahrens werden im vorliegenden Beitrag vier verschiedene Vorkonditionierungen vorgeschlagen, mit denen die Konvergenz des CG-Verfahrens erheblich beschleunigt werden kann, ohne daß im Vergleich zur nichtvorkonditionierten Variante zusätzliche Kommunikation entsteht. Die auf einem Transputerhypercube durchgeführten numerischen Experimente zeigen die Effektivität der vorgeschlagenen Vorkonditionierungen.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.95
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literatur

  1. Ove Axelsson and P. S. Vassilevski. Construction of variable-step preconditioners for inner-outer iteration methods. In Proceedings of the IMACS, 1991. Brussels, April 2–4, 1991.

    Google Scholar 

  2. E. Bänsch. Local mesh refinement in 2 and 3 dimensions. Techni-cal Report SFB256, Rhein. Friedrich-Wilhelm-Univ. Bonn, 1989.

    Google Scholar 

  3. C. Börgers. The Neumann-Dirichlet domain decomposition me-thod with inexact solvers on the subdomains. Numer. Math, 55 (2): 123–136, 1989.

    Article  MathSciNet  MATH  Google Scholar 

  4. B. E. Bjorstad, R. Moe, and M. Skogen. Parallel domain decom-position and iterative refinement algorithms. In [Hac91], pages 28–46, 1991.

    Google Scholar 

  5. J. H. Bramble, J. E. Pasciak, and A. H. Schatz. The construction of preconditioners for elliptic problems by substructuring. i-iv. Math. Comp., 47,:103–234, 1986

    Google Scholar 

  6. J. H. Bramble, J. E. Pasciak, and A. H. Schatz. The construction of preconditioners for elliptic problems by substructuring. i-iv. Math. Comp., 49, 1–16, 1987

    Article  MathSciNet  MATH  Google Scholar 

  7. J. H. Bramble, J. E. Pasciak, and A. H. Schatz. The construction of preconditioners for elliptic problems by substructuring. i-iv. Math. Comp., 51,: 415–430, 1988

    MathSciNet  MATH  Google Scholar 

  8. J. H. Bramble, J. E. Pasciak, and A. H. Schatz. The construction of preconditioners for elliptic problems by substructuring. i-iv. Math. Comp., 53: 1–24, 1989.

    MathSciNet  MATH  Google Scholar 

  9. J. H. Bramble, J. E. Pasciak, and J. Xu. Parallel multilevel pre-conditioners. Math. Comp., 1990.

    Google Scholar 

  10. Tony F. Chan, R. Glowinski, J. Périaux, and O. B. Widlund, editors. Second International Symposium on Domain Decomposition Methods for Partial Differential Equations, Philadelphia, 1989. SIAM. Los Angeles, California, January 14–16, 1988.

    Google Scholar 

  11. Tony F. Chan, R. Glowinski, J. Périaux, and O. B. Widlund, editors. Third International Symposium on Domain Decomposition Methods for Partial Differential Equations, Philadelphia, 1990. SIAM. Houston, March 20–22, 1989.

    Google Scholar 

  12. Ph. Ciarlet. The finite element method for elliptic pro-blems. North-Holland Publishing Company, Amsterdam-New York-Oxford, 1978.

    Google Scholar 

  13. M. Dryja and O. B. Widlund. An additive variant of Schwarz alternating method for the case of many subregions. Technical Report 339, Department of Computer Science, Courant Institute, New York, 1987. also Ultracomputer Note 131.

    Google Scholar 

  14. M. Dryja and O. B. Widlund. Towards a unified theory of domain decomposition algorithms for elliptic problems. In [CGPW901, pages 3–21. SIAM, Philadelphia, 1990.

    Google Scholar 

  15. M. Dryja and O. B. Widlund. Multilevel additive methods for elliptic finite element problems. In [Hac91], pages 58–69, 1991.

    Google Scholar 

  16. R. Glowinski, G. H. Golub, G. A. Meurant, and J. Périaux, editors. First International Symposium on Domain Decomposition Methods for Partial Differential Equations, Philadelphia, 1988. SIAM. Paris, January 1987.

    Google Scholar 

  17. Gerhard Globisch and Ulrich Langer. On the use of multigrid pre-conditioners in a multigrid software package. In Sabine Hengst, editor, Proceedings of the “4-th Multigrid Seminar”held at Unterwirbach, GDR, May 2–6, 1989,pages 105–134, Berlin, 1990. Academy of Science. Report-Nr. R-MATH-03/90.

    Google Scholar 

  18. W. Hackbusch, editor. Parallel Algorithms for Partial Differential Equations, Braunschweig, 1991. Vieweg. Proceedings of the Sixth GAMM-Seminar, Kiel, January 19–21, 1990.

    Google Scholar 

  19. Gundolf Haase and Ulrich Langer. The non-overlapping do-main decomposition multiplicative Schwarz method. Preprint, TU Chemnitz, 1991. Eingereicht.

    Google Scholar 

  20. Gundolf Haase and Ulrich Langer. On the use of multigrid pre-conditioners in the domain decomposition method. In [Hac91], pages 101–110, 1991.

    Google Scholar 

  21. Gundolf Haase, Ulrich Langer, and Arnd Meyer. A new approach to the Dirichlet decomposition method. In Sabine Hengst, editor, Proceedings of the “5-th Multigrid Seminar”held at Eberswalde, GDR, May 14–18, 1990,pages 1–59, Berlin, 1990. Academy of Science. Report-Nr. R-MATH-09/90.

    Google Scholar 

  22. Gundolf Haase, Ulrich Langer, and Arnd Meyer. Domain decom-position preconditioners with inexact subdomain solvers. Preprint 192, TU Chemnitz, 1991. Appears in the “Journal of Numerical Linear Algebra with Applications”.

    Google Scholar 

  23. Michael Jung and Ulrich Langer. Applications of multilevel me-thods to practical problems. Surveys on Mathematics for Industry. eingereicht.

    Google Scholar 

  24. K. H. Law. A parallel finite element solution method. Computer and Structures, 23 (6): 845–858, 1989.

    Article  Google Scholar 

  25. P. L. Lions. On the Schwarz alternating method I, In [GGMP88],pages 1–42, 202–223. 1988

    Google Scholar 

  26. P. L. Lions. On the Schwarz alternating method II, [CGPW89],pages 47–70, SIAM, Philadelphia, 1989

    Google Scholar 

  27. P. L. Lions. On the Schwarz alternating method III. [CGPW90],pages 47–70, SIAM, Philadelphia, 1990

    Google Scholar 

  28. Arnd Meyer. A parallel preconditioned conjugate gradient me-thod using domain decomposition and inexact solvers on each subdomain. Computing, 45: 217–234, 1990.

    Article  MathSciNet  MATH  Google Scholar 

  29. J. S. Przemieniecki. Matrix structural analysis of substructures. AIAA J., 1: 138–147, 1963.

    Article  Google Scholar 

  30. H. A. Schwarz. Ober einige Abbildungsaufgaben. Gesammelte Ma-themathische Abhandlungen, volume 2. Springer, Bonn, 1890. First published in “Vierteljahresschrift der Naturforschenden Gesellschaft in Zürich” 1870, v. 15, pp 272–286.

    Google Scholar 

  31. A. A. Samarski and E. S. Nikolaev. Numerical methods for grid equations. Vol. II: Iterative Methods. Birkhäuser-Verlag, BaselBoston-Berlin, 1989.

    Book  Google Scholar 

  32. S. L. Sobolev. The Schwarz algorithm in the theory of elasticity. Dokl. Acad. Nauk USSR, 4: 243–246, 1936.

    Google Scholar 

  33. J. Xu. Iterative methods by space decomposition and subspace correction: A unifying approach. Technical Report AM67, Department of Mathematics, Penn State University, 1990.

    Google Scholar 

  34. H. Yserentant. Hierarchical basis give conjugate gradient type me-thods a multigrid speed of convergence. Appl. Math. and Comp., 19: 347–358, 1986.

    Article  MathSciNet  MATH  Google Scholar 

  35. H. Yserentant. On the multi-level splitting of finite element spaces. Numer. Math., 49 (4): 379–412, 1986.

    Article  MathSciNet  MATH  Google Scholar 

  36. H. Yserentant. Two preconditioners on the multi-level-splitting of finite element spaces. Numer. Math., 58: 163–184, 1990.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1993 B. G. Teubner Stuttgart

About this chapter

Cite this chapter

Haase, G., Langer, U., Meyer, A. (1993). Parallelisierung und Vorkonditionierung des CG-Verfahrens durch Gebietszerlegung. In: Bader, G., Rannacher, R., Wittum, G. (eds) Numerische Algorithmen auf Transputer-Systemen. Teubner Skripten zur Numerik. Vieweg+Teubner Verlag, Wiesbaden. https://doi.org/10.1007/978-3-322-94760-4_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-322-94760-4_6

  • Publisher Name: Vieweg+Teubner Verlag, Wiesbaden

  • Print ISBN: 978-3-519-02716-4

  • Online ISBN: 978-3-322-94760-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics