Skip to main content

On Domain Decomposition Algorithms for Contact Problems with Tresca Friction

  • Conference paper
  • First Online:
Domain Decomposition Methods in Science and Engineering XIX

Part of the book series: Lecture Notes in Computational Science and Engineering ((LNCSE,volume 78))

Abstract

Development of numerical methods for the solution of contact problems is a challenging task whose difficulty lies in the non-linear conditions for non-penetration and friction. Recently, many authors proposed to use various numerical algorithms combined with multigrid or domain decomposition techniques; see, e.g., the primal-dual active set algorithm [8], the non-smooth multiscale method [10], or the augmented Lagrangian based algorithm [3]. Another alternative consists in the formulation of suitable iterations solving the elasticity equations for each sub-body separately with certain boundary conditions [5]. In [1], the authors proposed a Dirichlet-Neumann algorithm which takes into account the natural interface for frictionless contact problems. Another improvement has led to a Neumann–Neumann algorithm in which they added two Neumann sub-problems in order to ensure the continuity of normal stresses [2]. Later, various numerical implementations of this approach was given in [7, 9].

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 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
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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.

Bibliography

  1. G. Bayada, J. Sabil, and T. Sassi. Neumann-Dirichlet algorithm for unilateral contact problems: Convergence results. C.R. Acad. Sci. Paris, Ser.I, 335:381–386, 2002.

    MATH  MathSciNet  Google Scholar 

  2. G. Bayada, J. Sabil, and T. Sassi. A Neumann–Neumann domain decomposition algorithm for the Signorini problem. Appl. Math. Lett., 17:1153–1159, 2004.

    Article  MATH  MathSciNet  Google Scholar 

  3. Z. Dostál, T. Kozubek, P. Horyl, T. Brzobohatý, and A. Markopoulos. Scalable TFETI algorithm for two dimensional multibody contact problems with friction. J. Comput. Appl. Math. (accepted), 2010.

    Google Scholar 

  4. Z. Dostál and J. Schőberl. Minimizing quadratic functions over non-negative cone with the rate of convergence and finite termination. Comput. Optim. Appl., 30(1):23–44, 2005.

    Article  MATH  MathSciNet  Google Scholar 

  5. C. Eck and B.I. Wohlmuth. Convergence of a contact-Neumann iteration for the solution of two-body contact problems. Math. Mod. Meth. Appl. Sci., 13(8):1103–1118, 2003.

    Article  MATH  MathSciNet  Google Scholar 

  6. J. Haslinger, I. Hlaváček, and J. Nečas. Numerical methods for unilateral problems in solid mechanics. In P.G. Ciarlet and J.L. Lions, editors, Handbook of Numerical Analysis, pp. 313–485. Elsevier Science, Amsterdam, 1996.

    Google Scholar 

  7. J. Haslinger, R. Kučera, and T. Sassi. A domain decomposition algorithm for contact problems: analysis and implementation. Math. Model. Nat. Phenom., 1:123–146, 2009.

    Article  Google Scholar 

  8. S. Hueber, G. Stadler, and B.I. Wohlmuth. A primal-dual active set algorithm for three-dimensional contact problems with Coulomb friction. SIAM J. Sci. Comput., 30(2):527–596, 2008.

    Article  MathSciNet  Google Scholar 

  9. M.A. Ipopa. Domain Decomposition Algorithms for Contact Problems: Convergence and Numerical Nimulations. PhD thesis, University of Caen, Caen 2008.

    Google Scholar 

  10. R. Krause. A non-smooth multiscale method for solving frictional two-body contact problems in 2D and 3D with multigrid efficiency. SIAM J. Sci. Comput., 31(2):1399–1423, 2009.

    Article  MATH  MathSciNet  Google Scholar 

  11. R. Kučera. Convergence rate of an optimization algorithm for minimizing quadratic functions with separable convex constraints. SIAM J. Optim., 19(2):846–862, 2008.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Acknowledgments

The third author acknowledges the support of the projectMSM 6198910027 of the Ministry of Education of the Czech Republic and of the project GAČR 101/08/0574 of the Grant Agency of the Czech Republic.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Julien Riton .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Riton, J., Sassi, T., Kučera, R. (2011). On Domain Decomposition Algorithms for Contact Problems with Tresca Friction. In: Huang, Y., Kornhuber, R., Widlund, O., Xu, J. (eds) Domain Decomposition Methods in Science and Engineering XIX. Lecture Notes in Computational Science and Engineering, vol 78. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11304-8_42

Download citation

Publish with us

Policies and ethics