Extending PSBLAS to build parallel schwarz preconditioners

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

Abstract

We describe some extensions to Parallel Sparse BLAS (PSBLAS), a library of routines providing basic Linear Algebra operations needed to build iterative sparse linear system solvers on distributed-memory parallel computers. We focus on the implementation of parallel Additive Schwarz preconditioners, widely used in the solution of linear systems arising from a variety of applications. We report a performance analysis of these PSBLAS-based preconditioners on test cases arising from automotive engine simulations. We also make a comparison with equivalent software from the well-known PETSc library. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Buttari, A., D’Ambra, P., Di Serafino, D., & Filippone, S. (2006). Extending PSBLAS to build parallel schwarz preconditioners. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3732 LNCS, pp. 593–602). https://doi.org/10.1007/11558958_71

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