Abstract
The recently introduced circulant block-factorization preconditioners are studied in this paper. The general approach is first formulated for the case of block-tridiagonal sparse matrices. Then an estimate of the condition number of the preconditioned matrix for a model anisotropic Dirichlet boundary value problem is derived in the form κ < √2ε(n + 1) + 2, where N = n2 is the size of the discrete problem, and ε stands for the ratio of the anisotropy. Various numerical tests demonstrating the behavior of the circulant block-factorization preconditioners for anisotropic problems are presented.
Original language | English (US) |
---|---|
Pages (from-to) | 245-258 |
Number of pages | 14 |
Journal | Computing (Vienna/New York) |
Volume | 58 |
Issue number | 3 |
DOIs | |
State | Published - 1997 |
All Science Journal Classification (ASJC) codes
- Software
- Theoretical Computer Science
- Numerical Analysis
- Computer Science Applications
- Computational Theory and Mathematics
- Computational Mathematics