Abstract
AbstractWe present a new algorithm for numerical solution of contactproblems without friction. The method is based on enhancing conjugate projector preconditioning into the standard conjugate gradient method for the solution of quadratic programming problems with inequality constraints. We show that the algorithm is correct and discuss the efficiency of the algorithm. The relation of the algorithm to the domain decomposition methods is also explained. The paper is supplied with numerical experiment.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have