We review our recent results concerning optimal algorithms for the numerical solution of both coercive and semi-coercive variational inequalities by combining dual-primal FETI algorithms with recent results for bound and equality constrained quadratic programming problems. The convergence bounds that guarantee the scalability of the algorithms are presented. These results are confirmed by numerical experiments.
CITATION STYLE
Dostál, Z., Horák, D., & Stefanica, D. (2007). An Overview of Scalable FETI-DP Algorithms for Variational Inequalities. Lecture Notes in Computational Science and Engineering. Springer Verlag. https://doi.org/10.1007/978-3-540-34469-8_24
Mendeley helps you to discover research relevant for your work.