33
Views
8
CrossRef citations to date
0
Altmetric
Original Articles

Parallelizable restarted iterative methods for nonsymmetric linear systems. II: parallel implementation

&
Pages 269-290 | Received 09 Jun 1991, Published online: 19 Mar 2007
 

Abstract

In Part I we defined several new algorithms which gave the same iterates as the standard GMRES algorithm but require less computational expense when implemented on scalar and vector computers. In this paper, we demonstrate that the new algorithms are even more economical than the standard algorithms when applied to several other computer architectures: machines with distributed memory, machine which use local cache memory, and machines for which it is desired to use disk memory or solid state disk memory to solve the given problem. The increased efficiency is due to a reduction in the number of memory transfers required by the algorithms. In this paper we describe how these algorithms are implemented in order to obtain the improved performance. Numerical comparisons of the algorithms are given on several representative computers.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.