No label defined (Q3139624)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 434789
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 434789 |
Statements
31 August 1994
0 references
multiprocessor system
0 references
incomplete LU decomposition
0 references
preconditioners
0 references
iterative methods
0 references
block tridiagonal systems
0 references
parallel computer
0 references
divide and conquer methods
0 references
0.8734009265899658
0 references
0.8734009265899658
0 references
0.872398853302002
0 references
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].
0 references