Contact Problem with Friction

Zdeněk Dostál ()
Additional contact information
Zdeněk Dostál: VŠB - Technical University Ostrava

Chapter Chapter 14 in Optimal Quadratic Programming and QCQP Algorithms with Applications, 2025, pp 319-331 from Springer

Abstract: Abstract We briefly review the formulation and discretization of contact problem with friction. Then, we apply the domain decomposition method to generate a class of separable and equality-constrained QP problems with a uniformly bounded spectrum. The experiments show linear complexity and a stable number of outer iterations for the problem dimensions ranging from half a million to more than eleven million. We also provide results for yielding clamp connection.

Date: 2025
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-031-95167-1_14

Ordering information: This item can be ordered from
http://www.springer.com/9783031951671

DOI: 10.1007/978-3-031-95167-1_14

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().