Scalable algorithms for contact problems
frictiongradient methodsLagrangian methodlinear elasticityparallel solutionsplasticityscalable algorithmsshape optimizationtransient contact problems
Boundary value problems for second-order elliptic systems (35J57) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Research exposition (monographs, survey articles) pertaining to mechanics of deformable solids (74-02) Classical linear elasticity (74B05) Friction in solid mechanics (74M10) Contact in solid mechanics (74M15)
The main purpose of book is to present effective scalable algorithms for the solution of multibody contact problems of linear elasticity, including the problems with friction and dynamic contacts. The presentation of the algorithms starts from the formulation of contact problems of elasticity (Chapter 1), briefly describes their discretization and the properties of the discretized problems, concludes with the analysis, numerical experiments. The book is arranged into four parts, the first of which (Chapters 2--4) reviews some well-known facts of linear algebra, optimization and functional analysis. The second part (Chapters 5--9) is concerned with the algorithms for minimizing a quadratic function subject to linear equality constraints and/or convex separable constraints. The description of the algorithms starting with the conjugate gradient method (Chapter 5) for unconstrained optimization and the results on gradient projection (Chapter 6). Chapters 7 and 8 describe Modified Proportioning with Gradient Projections for minimizing strictly convex quadratic functions subject to separable constraints and its adaptation Modified Proportioning with Reduced Gradient Projections for bound constrained problems. Chapter 9 combines the algorithms for solving problems with separable constraints and a variant of the augmented Lagrangian method in order to minimize a convex quadratic function subject to separable and equality constraints. The third part (Chapters 10--16) includes the scalable algorithms for solving multibody frictionless contact problems, contact problems with friction, and transient contact problems. Chapter 10 presents the basic ideas of the scalable algorithms in a simplified setting of multidomain scalar variational inequalities. Chapters 11--13 develop the ideas presented in Chapter 10 to the solution of multibody frictionless contact problems, contact problems with friction, and transient contact problems. Chapter 14 extends the results of Chapters 10 and 11 to solving the problems discretized by the boundary element methods in the framework of Total Boundary Element Tearing and Interconnecting method. Chapters 15 and 16 extend the results of Chapters 10--14 to solving the problems with varying coefficients and/or with non-penetration conditions implemented by mortars. The last part begins with Chapters 17 and 18 dealing with the extension of the optimality results to some applications, in particular to contact shape optimization and contact problems with plasticity. The book is completed by Chapter 19 on massively parallel implementation and parallel scalability. The methods presented in the book can be used for solving many problems, as demonstrated by the numerical results. The book can serve as an introductory text for anybody interested in contact problems. Graduate students and researchers in mechanical engineering, computational engineering, and applied mathematics, also will find this book of big value and interest.
- A scalable TFETI based algorithm for 2D and 3D frictionless contact problems
- Scalable TFETI algorithm for the solution of multibody contact problems of elasticity
- Engineering Multibody Contact Problems Solved by Scalable TBETI
- Scalable FETI algorithms for frictionless contact problems
- Numerical methods in contact mechanics
- 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
- 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
- Towards an efficient augmented Lagrangian method for convex quadratic programming
- A Robin algorithm for unilateral contact problems
- Conjugate gradient-type algorithms for frictional multi-contact problems: applications to granular materials
- Highly scalable hybrid domain decomposition method for the solution of huge scalar variational inequalities
- 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
- Contact mechanical algorithms
- scientific article; zbMATH DE number 554646 (Why is no real title available?)
- Numerical methods in contact mechanics
- Improved approximation algorithms for box contact representations
- 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.
- Robust PRESB preconditioning of a 3-dimensional space-time finite element method for parabolic problems
- Scalable hybrid TFETI-DP methods for large boundary variational inequalities
- Application of the conjugate gradient method for solving unilateral discrete contact problems for an elastic half-space
- Solution to a coupled problem of thermomechanical contact of fuel elements
- Hybrid TBETI domain decomposition for huge 2D scalar variational inequalities
This page was built for publication: Scalable algorithms for contact problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q345423)
