Skip to main content
SpringerLink
Log in

Scalable FETI Algorithms for Frictionless Contact Problems

  • Conference paper
Domain Decomposition Methods in Science and Engineering XVII

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

We review our FETI based domain decomposition algorithms for the solution of 2D and 3D frictionless contact problems of elasticity and related theoretical results. We consider both cases of restrained and unrestrained bodies. The scalability of the presented algorithms is demonstrated on the solution of 2D and 3D benchmarks.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. Avery, G. Rebel, M. Lesoinne, and C. Farhat. A numerically scalable dual-primal substructuring method for the solution of contact problems. I: the frictionless case. Comput. Methods Appl. Mech. Engrg., 193(23–26):2403–2426, 2004.

    Article  MATH  Google Scholar 

  2. D. P. Bertsekas. Nonlinear Optimization. Athena Scientific - Nashua, 1999.

    Google Scholar 

  3. Z. Dostál. Inexact semimonotonic augmented Lagrangians with optimal feasibility convergence for convex bound and equality constrained quadratic programming. SIAM J. Numer. Anal., 43(1):96–115, 2005.

    Article  MATH  MathSciNet  Google Scholar 

  4. Z. Dostál. An optimal algorithm for bound and equality constrained quadratic programming problems with bounded spectrum. Computing, 78:311–328, 2006.

    Article  MATH  MathSciNet  Google Scholar 

  5. Z. Dostál and D. Horák. Scalability and FETI based algorithm for large discretized variational inequalities. Math. Comput. Simulation, 61:347–357, 2003.

    Article  MATH  MathSciNet  Google Scholar 

  6. Z. Dostál and D. Horák. Theoretically supported scalable FETI for numerical solution of variational inequalities. SIAM J. Numer. Anal., 2006. In press.

    Google Scholar 

  7. Z. Dostál, D. Horák, and R. Kučera. Total FETI - an easier implementable variant of the FETI method for numerical solution of elliptic PDE. Comm. Numer. Methods Engrg., 2006. In press.

    Google Scholar 

  8. Z. Dostál, D. Horák, R. Kučera, V. Vondrák, J. Haslinger, J. Dobiáš, and S. Pták. FETI based algorithms for contact problems: scalability, large displacements and 3d coulomb friction. Comput. Methods Appl. Mech. Engrg., 194(2–5):395–409, 2005.

    Article  MATH  MathSciNet  Google Scholar 

  9. Z. Dostál, D. Horák, and D. Stefanica. A scalable FETI-DP algorithm for a coercive variational inequality. Appl. Numer. Math., 54(3–4):378–390, 2005.

    Article  MATH  MathSciNet  Google Scholar 

  10. Z. Dostál, D. Horák, and D. Stefanica. A scalable FETI–DP algorithm for semi-coercive variational inequalities. Comput. Methods Appl. Mech. Engrg., 2006. In press.

    Google Scholar 

  11. Z. Dostál and J. Schöberl. Minimizing quadratic functions subject to bound constraints with the rate of convergence and finite termination. Comput. Optim. Appl., 30:23–43, 2005.

    Article  MATH  MathSciNet  Google Scholar 

  12. D. Dureisseix and C. Farhat. A numerically scalable domain decomposition method for solution of frictionless contact problems. Internat. J. Numer. Methods Engrg., 50(12):2643–2666, 2001.

    Article  MATH  Google Scholar 

  13. C. Farhat, M. Lesoinne, P. LeTallec, K. Pierson, and D. Rixen. FETI-DP: A dual–prime unified FETI method. I: A faster alternative to the two–level FETI method. Internat. J. Numer. Methods Engrg., 50(7):1523–1544, 2001.

    Article  MATH  MathSciNet  Google Scholar 

  14. C. Farhat, J. Mandel, and F.-X. Roux. Optimal convergence properties of the FETI domain decomposition method. Comput. Methods Appl. Mech. Engrg., 115:365–387, 1994.

    Article  MathSciNet  Google Scholar 

  15. C. Farhat and F.-X. Roux. An unconventional domain decomposition method for an efficient parallel solution of large-scale finite element systems. SIAM J. Sci. Statist. Comput., 13:379–396, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  16. R. Kornhuber. Adaptive monotone multigrid methods for nonlinear variational problems. Teubner - Verlag Stuttgart, 1997.

    MATH  Google Scholar 

  17. J. Mandel and R. Tezaur. On the convergence of a Dual-Primal substructuring method. Numer. Math., 88:543–558, 2001.

    Article  MATH  MathSciNet  Google Scholar 

  18. A. Toselli and O. B. Widlund. Domain Decomposition Methods - Algorithms and Theory. Springer - Verlag Berlin Heidelberg, 2005.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics, VŠSB-Technical University of Ostrava, and Center of Intelligent Systems and Structures, CISS - Institute of Thermomechanics AVČR, 17. listopadu 15, Ostrava-Poruba, 708 33, Czech Republic

    Zdeněk Dostál (Faculty of Electrical Engineering and Computer Science), Vít Vondrák (Faculty of Electrical Engineering and Computer Science) & David Horák (Faculty of Electrical Engineering and Computer Science)

  2. Department of Mechanical Engineering and Institute for Computational and Mathematical Engineering, Stanford University, Stanford, CA, 94305, USA

    Charbel Farhat & Philip Avery

Authors
  1. Zdeněk Dostál
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vít Vondrák
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. David Horák
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Charbel Farhat
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Philip Avery
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Computational Mathematics, Johannes Kepler University Linz, Altenbergerstr. 69, 4040, Linz, Austria

    Ulrich Langer  & Walter Zulehner  & 

  2. Institute of Analysis and Scientific Computing — CMCS, Ecole Polytechnique Fédérale de Lausanne EPFL SB IACS CMCS Bâtiment MA, Station 8, 1015, Lausanne, Switzerland

    Marco Discacciati

  3. Department of Applied Physics and Applied Mathematics, Columbia University, 500 W. 120th Street, MC 4701, 10027, New York, NY, USA

    David E. Keyes

  4. Courant Institute of Mathematical Sciences, New York University, 251 Mercer Street, New York, NY 10012-1185, USA

    Olof B. Widlund

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dostál, Z., Vondrák, V., Horák, D., Farhat, C., Avery, P. (2008). Scalable FETI Algorithms for Frictionless Contact Problems. In: Langer, U., Discacciati, M., Keyes, D.E., Widlund, O.B., Zulehner, W. (eds) Domain Decomposition Methods in Science and Engineering XVII. Lecture Notes in Computational Science and Engineering, vol 60. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75199-1_30

Download citation

Publish with us

Policies and ethics

Search

Navigation