Parallel subdomain-based preconditioner for the schur complement

0Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We present a new parallelizable preconditioner that is used as the local component of a two-level preconditioner similar to BPS. On 2D model problems that exhibit either high anisotropy or discontinuity, we demonstrate its attractive numerical behaviour and compare it with the regular BPS. To alleviate the construction cost of this new preconditioner, that requires the computation of the local Schur complements, we propose a cheap alternative based on Incomplete Cholesky factorization, that reduces the computational cost but retains the good numerical features of the preconditioner. © Springer-Verlag Berlin Heidelberg 1999.

Cite

CITATION STYLE

APA

Carvalho, L. M., & Giraud, L. (1999). Parallel subdomain-based preconditioner for the schur complement. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1685 LNCS, pp. 1032–1039). Springer Verlag. https://doi.org/10.1007/3-540-48311-x_144

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