scientific article; zbMATH DE number 434789
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].
- On some new approximate factorization methods for block tridiagonal matrices suitable for vector and parallel processors
- Block and full matrix ILU preconditioners for parallel finite element solvers
- Independent columns: A new parallel ILU preconditioner for the PCG method
- Parallel performance of block ILU preconditioners for a block-tridiagonal matrix
- Block ILU preconditioners for a nonsymmetric block-tridiagonal M-matrix
- Block ILU factorization preconditioners for a block-tridiagonal \(H\)-matrix
- Incomplete block LU preconditioners on slightly overlapping subdomains for a massively parallel computer
- Preconditioners based on strong subgraphs
- Experiments and recommendations for partitioning systems of equations
- A block compression algorithm for computing preconditioners
- Incomplete block-factorization preconditioners for solving three-dimensional elliptic difference equations on systolic processors∗∗∗
- scientific article; zbMATH DE number 1199800 (Why is no real title available?)
- An object-oriented framework for block preconditioning
- scientific article; zbMATH DE number 736355 (Why is no real title available?)
- Finding Exact and Approximate Block Structures for ILU Preconditioning
- Parallel block ILUT/ILDLT preconditioning for sparse eigenproblems and sparse linear systems
- scientific article; zbMATH DE number 2098242 (Why is no real title available?)
- Parallel block preconditioning based on SSOR and MILU
- Overlapping blocks by growing a partition with applications to preconditioning
- Block ILU preconditioned iterative methods for reduced linear systems
- Distributed block independent set algorithms and parallel multilevel ILU preconditioners
- Preconditioning systems arising from the KKR Green function method using block-circulant matrices
- Parallel implementation of efficient preconditioned linear solver for grid-based applications in chemical physics. I: Block Jacobi diagonalization
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)