File: ldl.bib

package info (click to toggle)
ufsparse 1.2-7
  • links: PTS
  • area: main
  • in suites: etch, etch-m68k
  • size: 27,536 kB
  • ctags: 5,848
  • sloc: ansic: 89,328; makefile: 4,721; fortran: 1,991; csh: 207; sed: 162; awk: 33; java: 30; sh: 8
file content (148 lines) | stat: -rw-r--r-- 3,591 bytes parent folder | download
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
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
@string{TOMS        = "{ACM} Trans. Math. Softw."}
@string{SIMAX       = "{SIAM} J. Matrix Anal. Applic."}
@string{SIAMJSC     = "{SIAM} J. Sci. Comput."}
@string{SIAMJSSC    = "{SIAM} J. Sci. Statist. Comput."}

@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{AmestoyDavisDuff03,
	author={Amestoy, P. R. and Davis, T. A. and Duff, I. S.},
	title={Algorithm 837: {AMD}, an approximate minimum degree ordering algorithm},
	journal=TOMS,
	year={2004}
	,volume={30}
	,number={3}
	,pages={381-388}}

@article{Davis05,
	author={Davis, T. A},
	title={Algorithm 8xx: a concise sparse Cholesky package},
	journal=TOMS,
	year={2005}
	,pages={(to appear)}
	}

@article{GeorgeLiu79,
	author={George, A. and Liu, J. W. H.},
	month={Jun.},
	year={1979},
	title={The Design of a User Interface for a Sparse Matrix Package},
	journal=TOMS,
	annote={f},
	volume={5},
	number={2},
	pages={139-162},
	keywords={software user interface SPARSPAK}}

@book{GeorgeLiu,
	author={George, A. and Liu, J. W. H.},
	year={1981},
	title={Computer Solution of Large Sparse Positive Definite Systems},
	address={Englewood Cliffs, New Jersey},
	publisher={Prentice-Hall},
	keywords={ positive definite systems},
	annote={sh}
	}

@article{GilbertMolerSchreiber,
	author={Gilbert, J. R. and Moler, C. and Schreiber, R.},
	title={Sparse matrices in {MATLAB}:  design and implementation},
	journal=SIMAX,
	year={1992}
	,volume={13}
	,number={1}
	,pages={333-356}
	,annote={f}
	}

@article{GilbertNgPeyton94,
	author={Gilbert, J. R. and Ng, E. G. and Peyton, B. W.},
	title={An efficient algorithm to compute row and column counts for sparse {C}holesky factorization},
	journal=SIMAX,
	year={1994}
	,volume={15}
	,number={4}
	,pages={1075-1091}
	,annote={f}
	}

@article{GilbertPeierls88,
	author={Gilbert, J. R. and Peierls, T.},
	year={1988},
	title={Sparse Partial Pivoting in Time Proportional to Arithmetic Operations},
	journal=SIAMJSSC,
	annote={f},
	volume={9},
	pages={862-874},
	keywords={316 partial pivoting, graph algorithms}}

@article{Liu86c,
	author={Liu, J. W. H.},
	month={Jun.},
	year={1986},
	title={A Compact Row Storage Scheme for {C}holesky Factors Using Elimination Trees},
	journal=TOMS,
	volume={12},
	number={2},
	pages={127-148},
	annote={f. previously Report CS-84-02, Dept. Computer Science, York University (1984)}}

@article{Liu90a,
	author={Liu, J. W. H.},
	title={The Role of Elimination Trees in Sparse Factorization},
	journal=SIMAX,
	year={1990}
	,volume={11}
	,number={1}
	,pages={134-172}
	,annote={f}
	}

@article{Liu91,
	author={Liu, J. W. H.},
	title={A generalized envelope method for sparse factorization by rows},
	journal=TOMS,
	year={1991}
	,volume={17}
	,number={1}
	,pages={112-129}
	,annote={f}
	}

@article{NgPeyton93,
	author={Ng, E. G. and Peyton, B. W.},
	title={A supernodal {Cholesky} factorization algorithm for shared-memory multiprocessors},
	journal=SIAMJSC,
	year={1993}
	,volume={14}
	,pages={761-769}
	,annote={f}
	}

@article{RothbergGupta91,
	author={Rothberg, E. and Gupta, A.},
	title={Efficient sparse matrix factorization on high-performance workstations - {E}xploiting the memory hierarchy},
	journal=TOMS,
	year={1991}
	,volume={17}
	,number={3}
	,pages={313-334}
	,annote={f}
	}

@techreport{Stewart03,
	author={Stewart, G. W.},
	title={Building an old-fashioned sparse solver},
	institution={Univ. Maryland (www.umd.cs.edu/$\sim$stewart)},
	year={2003}
	,annote={f}
	}