Scalable algorithms for contact problems
From MaRDI portal
Publication:345423
DOI10.1007/978-1-4939-6834-3zbMath1383.74002OpenAlexW2581154570MaRDI QIDQ345423
Vít Vondrák, Marie Sadowská, Tomáš Kozubek, Zdeněk Dostál
Publication date: 1 December 2016
Published in: Advances in Mechanics and Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4939-6834-3
linear elasticityfrictionLagrangian methodgradient methodsshape optimizationplasticityscalable algorithmsparallel solutionstransient contact problems
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (13)
Scalable preconditioning for the stabilized contact mechanics problem ⋮ On the spectrum of Schur complements of 2D elastic clusters joined by rigid edge modes and hybrid domain decomposition ⋮ Highly scalable hybrid domain decomposition method for the solution of huge scalar variational inequalities ⋮ Towards an efficient augmented Lagrangian method for convex quadratic programming ⋮ A descent scheme for thick elastic curves with self-contact and container constraints ⋮ Solution of 3D contact shape optimization problems with Coulomb friction based on TFETI. ⋮ Hybrid TFETI domain decomposition with the clusters joined by faces' rigid modes for solving huge 3D elastic problems ⋮ Application of the conjugate gradient method to solving discrete contact problems for an elastic half-plane ⋮ Algorithm for solving discrete contact problems for an elastic strip ⋮ Algorithm for solving discrete contact problems for an elastic layer ⋮ An accelerated augmented Lagrangian algorithm with adaptive orthogonalization strategy for bound and equality constrained quadratic programming and its application to large-scale contact problems of elasticity ⋮ Schur complement spectral bounds for large hybrid FETI-DP clusters and huge three-dimensional scalar problems ⋮ On the convergence properties of scaled gradient projection methods with non-monotone Armijo-like line searches
This page was built for publication: Scalable algorithms for contact problems
