Parallel sums and adaptive BDDC deluxe

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

Abstract

There has recently been a considerable activity in developing adaptive methods for the selection of primal constraints for BDDC algorithms and, in particular, for BDDC deluxe variants. The primal constraints of a BDDC or FETI-DP algorithm provide the global, coarse part of such a preconditioner and are of crucial importance for obtaining rapid convergence of these preconditioned conjugate gradient methods for the case of many subdomains.

Cite

CITATION STYLE

APA

Widlund, O. B., & Calvo, J. G. (2017). Parallel sums and adaptive BDDC deluxe. In Lecture Notes in Computational Science and Engineering (Vol. 116, pp. 277–284). Springer Verlag. https://doi.org/10.1007/978-3-319-52389-7_28

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