scientific article; zbMATH DE number 434789

From MaRDI portal
Publication:3139624





A purely algebraic approach to compute preconditioners in iterative methods for the solution of block tridiagonal systems \(TY=C\) on a parallel computer is discussed. The preconditioners are constructed in such a way that communication between different processors is avoided, while at the same time a good preconditioner is obtained. The first step is to repartition the system into a new system with the number of blocks equal to the number of processors. The partitioning is based on low rank modifications which generalize the approaches used in divide and conquer methods. The optimal choice of matrices defining the partition is posed here as an open problem. Two possible preconditioning approaches are compared using model problems. For the entire collection see [Zbl 0778.00025].




Cited in
(23)








This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3139624)