Abstract | ||
---|---|---|
We consider two-line and two-plane orderings for a convection–diffusion model problem in two and three dimensions, respectively. These strategies are aimed at introducing dense diagonal blocks, at the price of a slight increase of the bandwidth of the matrix, compared to natural lexicographic ordering. Comprehensive convergence analysis is performed for the block Jacobi scheme. We then move to consider a two-step preconditioning technique, and analyze the numerical properties of the linear systems that are solved in each step of the iterative process. For the 3-dimensional problem this approach is a viable alternative to the Incomplete LU approach, and may be easier to implement in parallel environments. The analysis is illustrated and validated by numerical examples. |
Year | DOI | Venue |
---|---|---|
2002 | 10.1023/A:1016030016985 | Numerical Algorithms |
Keywords | Field | DocType |
sparse linear systems,discretization of PDEs,orderings,convergence of iterative solvers | Diagonal,Tensor product,Convergence (routing),Mathematical optimization,Algebra,Linear system,Iterative and incremental development,Mathematical analysis,Matrix (mathematics),Bandwidth (signal processing),Lexicographical order,Mathematics | Journal |
Volume | Issue | ISSN |
30 | 2 | 1572-9265 |
Citations | PageRank | References |
3 | 1.09 | 4 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Gene H. Golub | 1 | 2558 | 856.07 |
CHEN GREIF | 2 | 321 | 43.63 |
James M. Varah | 3 | 91 | 24.37 |