## Abstract

An efficient preconditioning algorithm is presented for solving linear systems for which the matrix exhibits a certain sparse block structure, such as PDEs in two or more dimensions. From the set of all matrices orthogonally similar to the original - subject to the constraint that blocks of the transformation are proportional to the identity - the most block-diagonally dominant member is determined. The diagonal blocks of this new matrix are then taken as the preconditioner. Constructing the preconditioner is computationally inexpensive, and fully parallelizable. Moreover, the sparsity pattern is preserved under the transformation, and for the scattering applications arising in molecular and chemical physics, it is shown that most of the computation need be performed only once for a large number of linear system solves. Results are summarized for two such systems, for which the total CPU effort was reduced by almost two orders of magnitude.

Original language | English |
---|---|

Pages (from-to) | 715-726 |

Number of pages | 12 |

Journal | Numerical Linear Algebra with Applications |

Volume | 7 |

Issue number | 7-8 |

DOIs | |

State | Published - 2000 |

## Keywords

- Block Jacobi
- Block partitioned
- Chemical physics
- Elliptic PDE
- Krylov method
- Molecular scattering
- Plane rotation
- Preconditioning
- Sparse matrix
- Structured sparsity