An Overview of Scalable FETI-DP Algorithms for Variational Inequalities

4Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

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

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free