Skip to main content
SpringerLink
Log in

A Flexible 2-Level Neumann-Neumann Method for Structural Analysis Problems

  • Conference paper
  • First Online:
Parallel Processing and Applied Mathematics (PPAM 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2328))

Abstract

We discuss a new approach for the construction of the second-level Neumann-Neumann coarse space. Our method is based on an inexpensive and parallel analysis of the lower part spectrum of each subdomain stiffness matrix. We show that the method is flexible enough to converge fast on nonstandard decompositions and various types of finite elements used in structural analysis packages.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
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.

References

  1. P. E. Bjørstad, J. Koster, AND P. Krżyzanowski, Domain decomposition solvers for large scale industrial finite element problems, in Applied Parallel Computing. New Paradigms for HPC in Industry and Academia, T. Sorevik, F. Manne, R. Moe, and A. Gebremedhin, eds., vol. 1947 of Lecture Notes in Computer Science, Springer-Verlag, 2001, pp. 374–384. Proceedings of the 5th International Workshop, PARA2000 Bergen, Norway, June 18-20, 2000.

    Google Scholar 

  2. S. C. Brenner AND L.-y. Sung, Balancing domain decomposition for noncon-forming plate elements, Numer. Math., 83 (1999), pp. 25–52.

    Article  MathSciNet  MATH  Google Scholar 

  3. M. Brezina, C. Heberton, J. Mandel, AND P. Vanek, An iterative method with convergence rate chosen a priori, Tech. Report 140, University of Colorado in Denver, USA, April 1999. An earlier version has also been presented at the 1998 Copper Mountain Conference on Iterative Methods.

    Google Scholar 

  4. Y.-H. De ROECK AND P. Le TALLEC, Analysis and test of a local domain decomposition preconditioner, in Fourth International Symposium on Domain Decomposition Methods for Partial Differential Equations, R. Glowinski, Y. Kuznetsov, G. Meurant, J. Périaux, and O. Widlund, eds., SIAM, Philadelphia, PA, 1991, pp. 112–128.

    Google Scholar 

  5. M. Dryja AND O. B. Widlund, Additive Schwarz methods for elliptic finite element problems in three dimensions, in Fifth International Symposium on Domain Decomposition Methods for Partial Differential Equations (Norfolk, VA, 1991), SIAM, Philadelphia, PA, 1992, pp. 3–18.

    Google Scholar 

  6. -, Schwarz methods of Neumann-Neumann type for three-dimensional elliptic finite element problems, Comm. Pure Appl. Math., 48 (1995), pp. 121–155.

    Article  MathSciNet  MATH  Google Scholar 

  7. G. Karypis AND V. Kumar, METIS-Serial Graph Partitioning Algorithm. Available electronically via http://www-users.cs.umn.edu/~karypis/metis/metis.

  8. P. Le TALLEC, J. Mandel, AND M. Vidrascu, Balancing domain decomposition for plates, in Domain decomposition methods in scientific and engineering computing (University Park, PA, 1993), Amer. Math. Soc., Providence, RI, 1994, pp. 515–524.

    Chapter  Google Scholar 

  9. -, A Neumann-Neumann domain decomposition algorithm for solving plate and shell problems, SIAM J. Numer. Anal., 35 (1998), pp. 836–867.

    Article  MathSciNet  MATH  Google Scholar 

  10. J. Mandel, Balancing domain decomposition, Comm. Numer. Methods Engrg., 9 (1993), pp. 233–241.

    Article  MathSciNet  MATH  Google Scholar 

  11. J. Mandel AND M. Brezina, Balancing domain decomposition for problems with large jumps in coefficients, Math. Comp., 65 (1996), pp. 1387–1401.

    Article  MathSciNet  MATH  Google Scholar 

  12. J. Mandel AND P. Krzyżanowski, Robust Balancing Domain Decomposition, August 1999. Presentation at The Fifth US National Congress on Computational Mechanics, University of Colorado at Boulder, CO.

    Google Scholar 

  13. B. F. Smith, P. E. Bjørstad, AND W. D. Gropp, Domain decomposition, Cambridge University Press, Cambridge, 1996. Parallel multilevel methods for elliptic partial differential equations.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Informatics, University of Bergen, 5020, Bergen, Norway

    Petter E. Bjørstad

  2. Institute of Applied Mathematics, Warsaw University, Banacha 2, 02-097, Warszawa, Poland

    Piotr Krzyżanowski

Authors
  1. Petter E. Bjørstad
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Piotr Krzyżanowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Mathematics and Computer Science, Technical University of Czestochowa, Dabrowskiego 73, 42-200, Czestochowa, Poland

    Roman Wyrzykowski

  2. Computer Science Department, University of Tennessee, 122 Volunteer Blvd, Knoxville, TN, 37996-3450, USA

    Jack Dongarra

  3. Computer Science Department, Oklahoma State University, 700 N. Greenwood Ave., Tulsa, OK, 74106, USA

    Marcin Paprzycki

  4. DTU, UNI-C, Danish Computing Centre for Research and Education, Bldg. 304, 2800, Lyngby, Denmark

    Jerzy Waśniewski

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bjørstad, P.E., Krzyżanowski, P. (2002). A Flexible 2-Level Neumann-Neumann Method for Structural Analysis Problems. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2001. Lecture Notes in Computer Science, vol 2328. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48086-2_43

Download citation

  • DOI: https://doi.org/10.1007/3-540-48086-2_43

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43792-5

  • Online ISBN: 978-3-540-48086-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation