Parallel approximate finite element inverses on symmetric multiprocessor systems

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A new parallel normalized optimized approximate inverse algorithm for computing explicitly approximate inverses, is introduced for symmetric multiprocessor (SMP) systems. The parallelization of the approximate inverse has been implemented by an antidiagonal motion, in order to overcome the data dependencies. The parallel normalized explicit approximate inverses are used in conjuction with parallel normalized explicit preconditioned conjugate gradient schemes, for the efficient solution of finite element sparse linear systems. The parallel design and implementation issues of the new algorithms are discussed and the parallel performance is presented, using OpenMP. The speedups tend to the upper theoretical bounds for all cases making approximate inverse preconditioning suitable for SMP systems. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Giannoutakis, K. M., & Gravvanis, G. A. (2008). Parallel approximate finite element inverses on symmetric multiprocessor systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5101 LNCS, pp. 925–934). https://doi.org/10.1007/978-3-540-69384-0_97

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