Skip to main content
Conference Proceedings

Partitioning and blocking issues for a parallel incomplete factorization

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2007) 4699 LNCS 929-937
DOI: 10.1007/978-3-540-75755-9_110
0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The purpose of this work is to provide a method which exploits the parallel blockwise algorithmic approach used in the framework of high performance sparse direct solvers in order to develop robust and efficient preconditioners based on a parallel incomplete factorization. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Hénon, P., Ramet, P., & Roman, J. (2007). Partitioning and blocking issues for a parallel incomplete factorization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4699 LNCS, pp. 929–937). Springer Verlag. https://doi.org/10.1007/978-3-540-75755-9_110

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