Parallel solution of contact problems
From MaRDI portal
Recommendations
- Preconditioning by projectors in the solution of contact problems: A parallel implementation
- Solution of contact problems by FETI domain decomposition with natural coarse space projections
- A numerically scalable dual-primal substructuring method for the solution of contact problems. I: The frictionless case
- Parallel domain decomposition schemes for frictionless contact problems of elasticity
- scientific article; zbMATH DE number 1522835
Cited in
(22)- Unilateral contact problem for finite bodies -- parallel implementation
- Solution of frictional contact problems by an EBE preconditioner
- Solution of contact problems by FETI domain decomposition with natural coarse space projections
- Preconditioning by projectors in the solution of contact problems: A parallel implementation
- Parallel frictional contact algorithms and industrial applications
- A parallel two-sided contact algorithm in ALE3D
- Parallel contact algorithms for nonlinear implicit transient analysis
- A local contact detection technique for very large contact and self-contact problems: sequential and parallel implementations
- Total-FETI method for solving contact elasto-plastic problems
- Parallel domain decomposition schemes for frictionless contact problems of elasticity
- Parallel solution of contact shape optimization problems based on total FETI domain decomposition method
- scientific article; zbMATH DE number 554646 (Why is no real title available?)
- scientific article; zbMATH DE number 1981891 (Why is no real title available?)
- scientific article; zbMATH DE number 1522835 (Why is no real title available?)
- Fast Solving of Contact Problems on Complicated Geometries
- scientific article; zbMATH DE number 2114933 (Why is no real title available?)
- A parallel multigrid method for constrained minimization problems and its application to friction, contact, and obstacle problems
- Contact on Multiprocessor Environment: from Multicontact Problems to Multiscale Approaches
- Efficient contact solvers based on domain decomposition techniques.
- Projected AQIF Parallel Algorithm for Solving EHL Line and Point Contact Problems: Parallel Computing
- The FETI family of domain decomposition methods for inequality-constrained quadratic programming: application to contact problems with conforming and nonconforming interfaces
- A numerically scalable dual-primal substructuring method for the solution of contact problems. I: The frictionless case
This page was built for publication: Parallel solution of contact problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2717396)
