Lower Bounds in Domain Decomposition

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

Abstract

An important indicator of the efficiency of a domain decomposition preconditioner is the condition number of the preconditioned system. Upper bounds for the condition numbers of the preconditioned systems have been the focus of most analyses in domain decomposition [21, 20, 23]. However, in order to have a fair comparison of two preconditioners, the sharpness of the respective upper bounds must first be established, which means that we need to derive lower bounds for the condition numbers of the preconditioned systems.

Cite

CITATION STYLE

APA

Brenner, S. C. (2007). Lower Bounds in Domain Decomposition. Lecture Notes in Computational Science and Engineering, 55, 27–39. https://doi.org/10.1007/978-3-540-34469-8_3

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