Next Lecture
Wednesday, November 4, 2015, 10:00
Scalable algorithms for the solution of contact problems
with 10e9 unknowns
Faculty of Electrical Engineering and Computer Science, VŠB - Technical University of Ostrava
Abstract: An overview of the theoretical results on optimal algorithms for the solution of special problems of quadratic programming and QCQP will be given together with the adaptation of TFETI domain decomposition method for the solution of contact problems. Then will be presented a short summary of theoretical results showing the asymptotically linear complexity of the presented algorithms for frictionless, Tresca, and transient problems. The theoretical results will be illustrated by the solution of large real world contact problems and academic problems discretized by over 10e9 variables.