Show simple item record

dc.contributor.authorIwasato, K.
dc.contributor.authorFujino, S.
dc.description.abstractWe consider Krylov subspace methods for solving a linear system of equations on parallel computer with distributed memory. For speed-up of parallel computation, it is necessary to shorten the communication time among processors. However, in paral- lelized Krylov subspace methods, global synchronization points for inner products cause increment of communication time. Thus, we created the strategy for reduction of synchro- nization points of parallel Krylov subspace methods. We transform the computation of parameter βk to reduce the number of synchronization points of various Krylov subspace methods per one iteration. In this paper, we apply this strategy to three-term recurrence and propose parallel BiCGMisR method as the effective solver suited to parallel computer with distributed memory. Furthermore, through several numerical experiments, we make clear that parallel BiCGMisR method outperforms other methods from the viewpoints of both elapsed time and speed-up on parallel computer with distributed memory.
dc.format.extent8 p.
dc.subjectÀrees temàtiques de la UPC::Informàtica::Arquitectura de computadors::Arquitectures paral·leles
dc.subject.lcshParallel processing (Electronic computers)--Mathematics
dc.subject.otherParallel computing
dc.subject.otherBiCGMisR method
dc.titleParallelization of BiCGMisR method with cache-cache elements preconditioning
dc.typeConference lecture
dc.subject.lemacProcessament en paral·lel (Ordinadors)
dc.rights.accessOpen Access
upcommons.citation.contributorCOMPLAS XIII
upcommons.citation.publicationNameCOMPLAS XIII : proceedings of the XIII International Conference on Computational Plasticity : fundamentals and applications

Files in this item


This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder