1990
DOI: 10.1090/s0025-5718-1990-1011442-x
|View full text |Cite
|
Sign up to set email alerts
|

Iterative methods for cyclically reduced nonselfadjoint linear systems

Abstract: Abstract. We study iterative methods for solving linear systems of the type arising from two-cyclic discretizations of non-self-adjoint two-dimensional elliptic partial differential equations. A prototype is the convection-diffusion equation. The methods consist of applying one step of cyclic reduction, resulting in a "reduced system" of half the order of the original discrete problem, combined with a reordering and a block iterative technique for solving the reduced system. For constant-coefficient problems, … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
8
0

Year Published

1993
1993
2013
2013

Publication Types

Select...
5

Relationship

1
4

Authors

Journals

citations
Cited by 24 publications
(8 citation statements)
references
References 27 publications
0
8
0
Order By: Relevance
“…In the early 1990s Elman and Golub offered a thorough analysis of the spectral properties and the convergence behavior of linear systems arising from a procedure of one step of cyclic reduction 8–10. Using red‐black ordering and eliminating all the unknowns corresponding to one of the two colors yields a linear system associated with a diamond‐shaped 9‐point computational molecule.…”
Section: Introductionmentioning
confidence: 99%
“…In the early 1990s Elman and Golub offered a thorough analysis of the spectral properties and the convergence behavior of linear systems arising from a procedure of one step of cyclic reduction 8–10. Using red‐black ordering and eliminating all the unknowns corresponding to one of the two colors yields a linear system associated with a diamond‐shaped 9‐point computational molecule.…”
Section: Introductionmentioning
confidence: 99%
“…We explore the effect of k-line and k-plane orderings on the convergence of iterative solvers applied to (7) and (8). For convenience, let us define k-line and k-plane orderings within the context of general block grid orderings.…”
Section: Block Grid Orderingsmentioning
confidence: 99%
“…A bound on the spectral radius of the 2D cyclically reduced matrix associated with the difference equation (3), with a diagonal one-line ordering strategy, is given by [8] …”
Section: Comparison Of Convergence Rates (2d)mentioning
confidence: 99%
See 2 more Smart Citations