lxsd / fvn

Blame view

fvn_sparse/AMD/Doc/AMD_UserGuide.bib 2.44 KB
edit raw normal view history
422234dc3   daniau   git-svn-id: https... 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
 
  @string{SIREV       = "{SIAM} Review"}
  @string{SIMAX       = "{SIAM} J. Matrix Anal. Applic."}
  @string{SIAMJSC     = "{SIAM} J. Sci. Comput."}
  @string{TOMS        = "{ACM} Trans. Math. Softw."}
  
  @article{schu:01,
  	author    = {J. Schulze},
  	title     = {Towards a tighter coupling of bottom-up and top-down sparse matrix ordering methods},
  	journal   = {BIT},
  	volume    = {41},
  	number    = {4},
  	pages     = "800--841",
  	year      = {2001}
  	}
  
  @article{GeorgeLiu89,
  	author={George, A. and Liu, J. W. H.},
  	year={1989},
  	title={The Evolution of the Minimum Degree Ordering Algorithm},
  	journal=SIREV,
  	volume={31},
  	number={1},
  	pages={1--19}}
  
  @article{AmestoyDavisDuff96,
  	author={Amestoy, P. R. and Davis, T. A. and Duff, I. S.},
  	title={An approximate minimum degree ordering algorithm},
  	journal=SIMAX,
  	year={1996}
  	,volume={17}
  	,number={4}
  	,pages={886-905}
  	}
  
  @article{AmestoyDavisDuff04,
  	author={Amestoy, P. R. and Davis, T. A. and Duff, I. S.},
  	title={Algorithm 837: An approximate minimum degree ordering algorithm},
  	journal=TOMS,
  	year={2004}
  	,volume={30}
  	,number={3}
  	,pages={381-388}
  	}
  
  @misc{hsl:2002,
   author = {HSL},
    title = "{HSL} 2002: {A} collection of {F}ortran codes for large
             scale scientific computation",
    note = {{\tt www.cse.clrc.ac.uk/nag/hsl}},
    year = 2002}
  
  
  @article{RothbergEisenstat98,
  	author={Rothberg, E. and Eisenstat, S. C.},
  	title={Node selection strategies for bottom-up sparse matrix orderings},
  	journal=SIMAX,
  	year={1998}
  	,volume={19}
  	,number={3}
  	,pages={682-695}
  	}
  
  @article{KarypisKumar98e,
  	author={Karypis, G. and Kumar, V.},
  	title={A fast and high quality multilevel scheme for partitioning irregular graphs},
  	journal=SIAMJSC,
  	year={1998}
  	,volume={20}
  	,pages={359-392}
  	}
  
  @article{Chaco,
  	author={B. Hendrickson and E. Rothberg},
  	title={Improving the runtime and quality of nested dissection ordering},
  	journal=SIAMJSC,
  	year={1999}
  	,volume={20}
  	,pages={468--489}
  	}
  
  @article{PellegriniRomanAmestoy00,
  	author={Pellegrini, F. and Roman, J. and Amestoy, P.},
  	title={Hybridizing nested dissection and halo approximate minimum degree for efficient sparse matrix ordering},
  	journal={Concurrency: Practice and Experience},
  	year={2000}
  	,volume={12}
  	,pages={68-84}
  	}
  
  @article{DavisGilbertLarimoreNg04,
  	author={Davis, T. A. and Gilbert, J. R. and Larimore, S. I. and Ng, E. G.},
  	title={A column approximate minimum degree ordering algorithm},
  	journal=TOMS,
  	year={2004}
  	,volume={30}
  	,pages={353-376}
  	}