Proceedings of the 1969 24th National Conference on - 1969
DOI: 10.1145/800195.805928
|View full text |Cite
|
Sign up to set email alerts
|

Reducing the bandwidth of sparse symmetric matrices

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
643
0
13

Year Published

1998
1998
2011
2011

Publication Types

Select...
5
3
2

Relationship

0
10

Authors

Journals

citations
Cited by 1,085 publications
(658 citation statements)
references
References 12 publications
2
643
0
13
Order By: Relevance
“…Reordering, therefore, can improve the quality of incomplete factorization. χMD uses either original, Minimum degree (Tinney and Walker, 1967) or Reverse Cuthill-McKee orderings (Cuthill and McKee, 1969;George, 1971).…”
Section: Brief Outline Of Theorymentioning
confidence: 99%
“…Reordering, therefore, can improve the quality of incomplete factorization. χMD uses either original, Minimum degree (Tinney and Walker, 1967) or Reverse Cuthill-McKee orderings (Cuthill and McKee, 1969;George, 1971).…”
Section: Brief Outline Of Theorymentioning
confidence: 99%
“…To optimize cache usage, it is possible to use, for example, the Reverse Cuthill McKee (RCMK) reordering heuristic [14,9]. As shown in Figure 3, the RCMK tries to compress data around the matrix-diagonal, which improves cache-hit when sequentially retrieving data.…”
Section: Reordering For Better Cache Optimalitymentioning
confidence: 99%
“…In our experiments we make a comparison between two common reordering methods. The first method is the symmetric reverse CuthillMcKee reordering (SYMRCM) [6] and the second method is the approximate minimum degree (AMD) reordering [7].…”
Section: Short Review On Ilu Preconditionersmentioning
confidence: 99%