File: node189.html

package info (click to toggle)
scalapack-doc 1.5-11
  • links: PTS
  • area: main
  • in suites: bullseye, buster, stretch
  • size: 10,336 kB
  • ctags: 4,931
  • sloc: makefile: 47; sh: 18
file content (633 lines) | stat: -rw-r--r-- 47,888 bytes parent folder | download | duplicates (4)
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
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
<!DOCTYPE HTML PUBLIC "-//IETF//DTD HTML 2.0//EN">
<!--Converted with LaTeX2HTML 96.1-h (September 30, 1996) by Nikos Drakos (nikos@cbl.leeds.ac.uk), CBLU, University of Leeds -->
<HTML>
<HEAD>
<TITLE>References</TITLE>
<META NAME="description" CONTENT="References">
<META NAME="keywords" CONTENT="slug">
<META NAME="resource-type" CONTENT="document">
<META NAME="distribution" CONTENT="global">
<LINK REL=STYLESHEET HREF="slug.css">
</HEAD>
<BODY LANG="EN" >
 <A NAME="tex2html4556" HREF="node190.html"><IMG WIDTH=37 HEIGHT=24 ALIGN=BOTTOM ALT="next" SRC="http://www.netlib.org/utk/icons/next_motif.gif"></A> <A NAME="tex2html4554" HREF="scalapack_slug.html"><IMG WIDTH=26 HEIGHT=24 ALIGN=BOTTOM ALT="up" SRC="http://www.netlib.org/utk/icons/up_motif.gif"></A> <A NAME="tex2html4548" HREF="node188.html"><IMG WIDTH=63 HEIGHT=24 ALIGN=BOTTOM ALT="previous" SRC="http://www.netlib.org/utk/icons/previous_motif.gif"></A> <A NAME="tex2html4558" HREF="node1.html"><IMG WIDTH=65 HEIGHT=24 ALIGN=BOTTOM ALT="contents" SRC="http://www.netlib.org/utk/icons/contents_motif.gif"></A> <A NAME="tex2html4559" HREF="node190.html"><IMG WIDTH=43 HEIGHT=24 ALIGN=BOTTOM ALT="index" SRC="http://www.netlib.org/utk/icons/index_motif.gif"></A> <BR>
<B> Next:</B> <A NAME="tex2html4557" HREF="node190.html">Index</A>
<B>Up:</B> <A NAME="tex2html4555" HREF="scalapack_slug.html">ScaLAPACK Users' Guide</A>
<B> Previous:</B> <A NAME="tex2html4549" HREF="node188.html">Notes</A>
<BR> <P>
 <P><A NAME="SECTIONREF"><H2>References</H2></A><P>
<DL COMPACT>
<DT><A NAME="aboelaze91a"><STRONG>1</STRONG></A><DD>
M.&nbsp;A<font size=-1><small>BOELAZE</small></font>, N.&nbsp;C<font size=-1><small>HRISOCHOIDES</small></font>, <font size=-1><small>AND</small></font> E.&nbsp;H<font size=-1><small>OUSTIS</small></font>, <EM>The Parallelization
  of Level 2 and 3 BLAS Operations on Distributed Memory Machines</EM>, Tech. Rep.
  CSD-TR-91-007, Purdue University, West Lafayette, IN, 1991.
<P>
<DT><A NAME="agarwal94b"><STRONG>2</STRONG></A><DD>
R.&nbsp;A<font size=-1><small>GARWAL</small></font>, F.&nbsp;G<font size=-1><small>USTAVSON</small></font>, <font size=-1><small>AND</small></font> M.&nbsp;Z<font size=-1><small>UBAIR</small></font>, <EM>Improving Performance of
  Linear Algebra Algorithms for Dense Matrices Using Algorithmic Prefetching</EM>,
  IBM J. Res. Dev., 38 (1994), pp.&nbsp;265-275.
<P>
<DT><A NAME="laug"><STRONG>3</STRONG></A><DD>
E.&nbsp;A<font size=-1><small>NDERSON</small></font>, Z.&nbsp;B<font size=-1><small>AI</small></font>, C.&nbsp;B<font size=-1><small>ISCHOF</small></font>, J.&nbsp;D<font size=-1><small>EMMEL</small></font>, J.&nbsp;D<font size=-1><small>ONGARRA</small></font>, J.&nbsp;D<font size=-1><small>U</small></font>&nbsp;C<font size=-1><small>ROZ</small></font>, A.&nbsp;G<font size=-1><small>REENBAUM</small></font>, S.&nbsp;H<font size=-1><small>AMMARLING</small></font>, A.&nbsp;M<font size=-1><small>C</small></font>K<font size=-1><small>ENNEY</small></font>, S.&nbsp;O<font size=-1><small>STROUCHOV</small></font>, <font size=-1><small>AND</small></font> D.&nbsp;S<font size=-1><small>ORENSEN</small></font>,
  <EM>LAPACK Users' Guide</EM>, Society for Industrial and Applied Mathematics,
  Philadelphia, PA, second&nbsp;ed., 1995.
<P>
<DT><A NAME="lawn20"><STRONG>4</STRONG></A><DD>
E.&nbsp;A<font size=-1><small>NDERSON</small></font>, Z.&nbsp;B<font size=-1><small>AI</small></font>, C.&nbsp;B<font size=-1><small>ISCHOF</small></font>, J.&nbsp;D<font size=-1><small>EMMEL</small></font>, J.&nbsp;D<font size=-1><small>ONGARRA</small></font>, J.&nbsp;D<font size=-1><small>U</small></font>&nbsp;C<font size=-1><small>ROZ</small></font>, A.&nbsp;G<font size=-1><small>REENBAUM</small></font>, S.&nbsp;H<font size=-1><small>AMMARLING</small></font>, A.&nbsp;M<font size=-1><small>C</small></font>K<font size=-1><small>ENNEY</small></font>, <font size=-1><small>AND</small></font> D.&nbsp;S<font size=-1><small>ORENSEN</small></font>, <EM>LAPACK: A
  portable linear algebra library for high-performance computers</EM>, Computer
  Science Dept. Technical Report CS-90-105, University of Tennessee,
  Knoxville, TN, May 1990.
(Also LAPACK Working Note #20).
<P>
<DT><A NAME="lawn31"><STRONG>5</STRONG></A><DD>
E.&nbsp;A<font size=-1><small>NDERSON</small></font>, Z.&nbsp;B<font size=-1><small>AI</small></font>, <font size=-1><small>AND</small></font> J.&nbsp;D<font size=-1><small>ONGARRA</small></font>, <EM>Generalized QR factorization
  and its applications</EM>, Linear Algebra and Its Applications, 162-164 (1992),
  pp.&nbsp;243-273.
(Also LAPACK Working Note #31).
<P>
<DT><A NAME="angus90a"><STRONG>6</STRONG></A><DD>
I.&nbsp;A<font size=-1><small>NGUS</small></font>, G.&nbsp;F<font size=-1><small>OX</small></font>, J.&nbsp;K<font size=-1><small>IM</small></font>, <font size=-1><small>AND</small></font> D.&nbsp;W<font size=-1><small>ALKER</small></font>, <EM>Solving Problems on
  Concurrent Processors: Software for Concurrent Processors</EM>, vol.&nbsp;2, Prentice
  Hall, Englewood Cliffs, N.J, 1990.
<P>
<DT><A NAME="ieee754"><STRONG>7</STRONG></A><DD>
ANSI/IEEE, <EM>
  IEEE&nbsp;Standard&nbsp;for&nbsp;Binary&nbsp;Floating&nbsp;Point&nbsp;Arithmetic</EM>, New York, Std
  754-1985&nbsp;ed., 1985.
<P>
<DT><A NAME="ieee854"><STRONG>8</STRONG></A><DD>
height 2pt depth -1.6pt width 23pt, <EM>
  IEEE&nbsp;Standard&nbsp;for&nbsp;Radix&nbsp;Independent&nbsp;Floating&nbsp;Point&nbsp;Arithmetic</EM>, New
  York, Std 854-1987&nbsp;ed., 1987.
<P>
<DT><A NAME="ariolidemmelduff"><STRONG>9</STRONG></A><DD>
M.&nbsp;A<font size=-1><small>RIOLI</small></font>, J.&nbsp;W. D<font size=-1><small>EMMEL</small></font>, <font size=-1><small>AND</small></font> I.&nbsp;S. D<font size=-1><small>UFF</small></font>, <EM>Solving sparse linear
  systems with sparse backward error</EM>, SIAM J. Matrix Anal. Appl., 10 (1989),
  pp.&nbsp;165-190.
<P>
<DT><A NAME="ashcraft90a"><STRONG>10</STRONG></A><DD>
C.&nbsp;A<font size=-1><small>SHCRAFT</small></font>, <EM>The Distributed Solution of Linear Systems Using the
  Torus-wrap Data mapping</EM>, Tech. Rep. ECA-TR-147, Boeing Computer Services,
  Seattle, WA, 1990.
<P>
<DT><A NAME="bai92a"><STRONG>11</STRONG></A><DD>
Z.&nbsp;B<font size=-1><small>AI</small></font> <font size=-1><small>AND</small></font> J.&nbsp;D<font size=-1><small>EMMEL</small></font>, <EM>Design of a parallel nonsymmetric
  eigenroutine toolbox, Part I</EM>, in Proceedings of the Sixth SIAM
  Conference on Parallel Processing for Scientific Computing, SIAM, 1993,
  pp.&nbsp;391-398.
<P>
<DT><A NAME="baidemmel97"><STRONG>12</STRONG></A><DD>
Z.&nbsp;B<font size=-1><small>AI</small></font> <font size=-1><small>AND</small></font> J.&nbsp;D<font size=-1><small>EMMEL</small></font>, <EM>Using the matrix sign function to compute
  invariant subspaces</EM>, SIAM J. Matrix Anal. Appl, x (1997), p.&nbsp;xxx.
to appear.
<P>
<DT><A NAME="lawn91"><STRONG>13</STRONG></A><DD>
Z.&nbsp;B<font size=-1><small>AI</small></font>, J.&nbsp;D<font size=-1><small>EMMEL</small></font>, J.&nbsp;D<font size=-1><small>ONGARRA</small></font>, A.&nbsp;P<font size=-1><small>ETITET</small></font>, H.&nbsp;R<font size=-1><small>OBINSON</small></font>, <font size=-1><small>AND</small></font> K.&nbsp;S<font size=-1><small>TANLEY</small></font>,
  <EM>The spectral decomposition of nonsymmetric matrices on distributed
  memory computers</EM>, Computer Science Dept. Technical Report
  CS-95-273, University of Tennessee, Knoxville, TN, 1995.
(Also LAPACK Working Note No. 91), To appear in SIAM J. Sci.
  Stat. Comput.
<P>
<DT><A NAME="baidemmel92a"><STRONG>14</STRONG></A><DD>
Z.&nbsp;B<font size=-1><small>AI</small></font> <font size=-1><small>AND</small></font> J.&nbsp;W. D<font size=-1><small>EMMEL</small></font>, <EM>Design of a parallel nonsymmetric
  eigenroutine toolbox, Part I</EM>, in Proceedings of the Sixth SIAM
  Conference on Parallel Processing for Scientific Computing, R.&nbsp;F.&nbsp;<EM>et
  al</EM>. Sincovec, ed., Philadelphia, PA, 1993, Society for Industrial and
  Applied Mathematics, pp.&nbsp;391-398.
Long version available as Computer Science Report CSD-92-718,
  University of California, Berkeley, 1992.
<P>
<DT><A NAME="barlowdemmel"><STRONG>15</STRONG></A><DD>
J.&nbsp;B<font size=-1><small>ARLOW</small></font> <font size=-1><small>AND</small></font> J.&nbsp;D<font size=-1><small>EMMEL</small></font>, <EM>Computing accurate eigensystems of scaled
  diagonally dominant matrices</EM>, SIAM J. Num. Anal., 27 (1990), pp.&nbsp;762-791.
(Also LAPACK Working Note #7).
<P>
<DT><A NAME="lawn111"><STRONG>16</STRONG></A><DD>
J.&nbsp;B<font size=-1><small>ILMES</small></font>, K.&nbsp;A<font size=-1><small>SANOVIC</small></font>, J.&nbsp;D<font size=-1><small>EMMEL</small></font>, D.&nbsp;L<font size=-1><small>AM</small></font>, <font size=-1><small>AND</small></font> C.&nbsp;C<font size=-1><small>HIN</small></font>, <EM>Optimizing
  matrix multiply using PHiPAC: A portable, high-performance, ANSI C
  coding methodology</EM>, Computer Science Dept. Technical Report
  CS-96-326, University of Tennessee, Knoxville, TN, 1996.
(Also LAPACK Working Note #111).
<P>
<DT><A NAME="BV89"><STRONG>17</STRONG></A><DD>
R.&nbsp;H. B<font size=-1><small>ISSELING</small></font> <font size=-1><small>AND</small></font> J.&nbsp;G.&nbsp;G. <font size=-1><small>VAN</small></font> <font size=-1><small>DE</small></font> V<font size=-1><small>ORST</small></font>, <EM>Parallel LU
  decomposition on a transputer network</EM>, in Lecture Notes in Computer Science,
  Number 384, G.&nbsp;A. van Zee and J.&nbsp;G.&nbsp;G. van de Vorst, eds.,
  Springer-Verlag, 1989, pp.&nbsp;61-77.
<P>
<DT><A NAME="blackford96a"><STRONG>18</STRONG></A><DD>
L.&nbsp;S. B<font size=-1><small>LACKFORD</small></font>, J.&nbsp;C<font size=-1><small>HOI</small></font>, A.&nbsp;C<font size=-1><small>LEARY</small></font>, J.&nbsp;D<font size=-1><small>EMMEL</small></font>, I.&nbsp;D<font size=-1><small>HILLON</small></font>, J.&nbsp;J. D<font size=-1><small>ONGARRA</small></font>, S.&nbsp;H<font size=-1><small>AMMARLING</small></font>, G.&nbsp;H<font size=-1><small>ENRY</small></font>, A.&nbsp;P<font size=-1><small>ETITET</small></font>, K.&nbsp;S<font size=-1><small>TANLEY</small></font>, D.&nbsp;W. W<font size=-1><small>ALKER</small></font>, <font size=-1><small>AND</small></font> R.&nbsp;C. W<font size=-1><small>HALEY</small></font>, <EM>ScaLAPACK: A portable linear algebra library for
  distributed memory computers - design issues and performance</EM>, in Proceedings
  of Supercomputing '96, Sponsored by ACM SIGARCH and IEEE Computer Society,
  1996.
(ACM Order Number: 415962, IEEE Computer Society Press Order Number:
  RS00126. http://www.supercomp.org/sc96/proceedings/).
<P>
<DT><A NAME="lawn112"><STRONG>19</STRONG></A><DD>
L.&nbsp;S. B<font size=-1><small>LACKFORD</small></font>, A.&nbsp;C<font size=-1><small>LEARY</small></font>, J.&nbsp;D<font size=-1><small>EMMEL</small></font>, I.&nbsp;D<font size=-1><small>HILLON</small></font>, J.&nbsp;D<font size=-1><small>ONGARRA</small></font>, S.&nbsp;H<font size=-1><small>AMMARLING</small></font>, A.&nbsp;P<font size=-1><small>ETITET</small></font>, H.&nbsp;R<font size=-1><small>EN</small></font>, K.&nbsp;S<font size=-1><small>TANLEY</small></font>, <font size=-1><small>AND</small></font> R.&nbsp;C. W<font size=-1><small>HALEY</small></font>, <EM>
  Practical experience in the dangers of heterogeneous computing</EM>, Computer
  Science Dept. Technical Report CS-96-330, University of Tennessee,
  Knoxville, TN, July 1996.
(Also LAPACK Working Note #112), to appear ACM Trans. Math. Softw.,
  1997.
<P>
<DT><A NAME="brent92a"><STRONG>20</STRONG></A><DD>
R.&nbsp;B<font size=-1><small>RENT</small></font>, <EM>The LINPACK Benchmark on the AP 1000</EM>, in Frontiers,
  1992, McLean, VA, 1992, pp.&nbsp;128-135.
<P>
<DT><A NAME="brent93a"><STRONG>21</STRONG></A><DD>
R.&nbsp;B<font size=-1><small>RENT</small></font> <font size=-1><small>AND</small></font> P.&nbsp;S<font size=-1><small>TRAZDINS</small></font>, <EM>Implementation of BLAS Level 3 and
  LINPACK Benchmark on the AP1000</EM>, Fujitsu Scientific and Technical Journal,
  5 (1993), pp.&nbsp;61-70.
<P>
<DT><A NAME="netlib1"><STRONG>22</STRONG></A><DD>
S.&nbsp;B<font size=-1><small>ROWNE</small></font>, J.&nbsp;D<font size=-1><small>ONGARRA</small></font>, S.&nbsp;G<font size=-1><small>REEN</small></font>, E.&nbsp;G<font size=-1><small>ROSSE</small></font>, K.&nbsp;M<font size=-1><small>OORE</small></font>, T.&nbsp;R<font size=-1><small>OWAN</small></font>, <font size=-1><small>AND</small></font> R.&nbsp;W<font size=-1><small>ADE</small></font>, <EM>Netlib services and resources (rev. 1)</EM>, Computer Science
  Dept. Technical Report CS-94-222, University of Tennessee, Knoxville,
  TN, 1994.
<P>
<DT><A NAME="netlib2"><STRONG>23</STRONG></A><DD>
S.&nbsp;B<font size=-1><small>ROWNE</small></font>, J.&nbsp;D<font size=-1><small>ONGARRA</small></font>, E.&nbsp;G<font size=-1><small>ROSSE</small></font>, <font size=-1><small>AND</small></font> T.&nbsp;R<font size=-1><small>OWAN</small></font>, <EM>The netlib
  mathematical software repository</EM>, D-Lib Magazine (www.dlib.org),  (1995).
<P>
<DT><A NAME="lawn93"><STRONG>24</STRONG></A><DD>
J.&nbsp;C<font size=-1><small>HOI</small></font>, J.&nbsp;D<font size=-1><small>EMMEL</small></font>, I.&nbsp;D<font size=-1><small>HILLON</small></font>, J.&nbsp;D<font size=-1><small>ONGARRA</small></font>, S.&nbsp;O<font size=-1><small>STROUCHOV</small></font>, A.&nbsp;P<font size=-1><small>ETITET</small></font>, K.&nbsp;S<font size=-1><small>TANLEY</small></font>, D.&nbsp;W<font size=-1><small>ALKER</small></font>, <font size=-1><small>AND</small></font> R.&nbsp;C. W<font size=-1><small>HALEY</small></font>, <EM>Installation guide for
  ScaLAPACK</EM>, Computer Science Dept. Technical Report CS-95-280,
  University of Tennessee, Knoxville, TN, March 1995.
(Also LAPACK Working Note #93).
<P>
<DT><A NAME="lawn95"><STRONG>25</STRONG></A><DD>
height 2pt depth -1.6pt width 23pt, <EM>ScaLAPACK: A
  portable linear algebra library for distributed memory computers - design
  issues and performance</EM>, Computer Science Dept. Technical Report
  CS-95-283, University of Tennessee, Knoxville, TN, March 1995.
(Also LAPACK Working Note #95).
<P>
<DT><A NAME="lawn100"><STRONG>26</STRONG></A><DD>
J.&nbsp;C<font size=-1><small>HOI</small></font>, J.&nbsp;D<font size=-1><small>ONGARRA</small></font>, S.&nbsp;O<font size=-1><small>STROUCHOV</small></font>, A.&nbsp;P<font size=-1><small>ETITET</small></font>, D.&nbsp;W<font size=-1><small>ALKER</small></font>, <font size=-1><small>AND</small></font> R.&nbsp;C. W<font size=-1><small>HALEY</small></font>, <EM>A proposal for a set of parallel basic linear algebra
  subprograms</EM>, Computer Science Dept. Technical Report CS-95-292,
  University of Tennessee, Knoxville, TN, May 1995.
(Also LAPACK Working Note #100).
<P>
<DT><A NAME="lawn55"><STRONG>27</STRONG></A><DD>
J.&nbsp;C<font size=-1><small>HOI</small></font>, J.&nbsp;D<font size=-1><small>ONGARRA</small></font>, R.&nbsp;P<font size=-1><small>OZO</small></font>, <font size=-1><small>AND</small></font> D.&nbsp;W<font size=-1><small>ALKER</small></font>, <EM>ScaLAPACK: A
  scalable linear algebra library for distributed memory concurrent computers</EM>,
  in Proceedings of the Fourth Symposium on the Frontiers of Massively Parallel
  Computation, McLean, Virginia, 1992, IEEE Computer Society Press,
  pp.&nbsp;120-127.
(Also LAPACK Working Note #55).
<P>
<DT><A NAME="lawn92"><STRONG>28</STRONG></A><DD>
J.&nbsp;C<font size=-1><small>HOI</small></font>, J.&nbsp;D<font size=-1><small>ONGARRA</small></font>, <font size=-1><small>AND</small></font> D.&nbsp;W<font size=-1><small>ALKER</small></font>, <EM>The design of a parallel dense
  linear algebra software library: Reduction to Hessenberg, tridiagonal and
  bidiagonal form</EM>, Numerical Algorithms, 10 (1995), pp.&nbsp;379-399.
(Also LAPACK Working Note #92).
<P>
<DT><A NAME="choi94a"><STRONG>29</STRONG></A><DD>
J.&nbsp;C<font size=-1><small>HOI</small></font>, J.&nbsp;D<font size=-1><small>ONGARRA</small></font>, <font size=-1><small>AND</small></font> D.&nbsp;W<font size=-1><small>ALKER</small></font>, <EM>PB-BLAS: A Set of Parallel
  Block Basic Linear Algebra Subroutines</EM>, Concurrency: Practice and
  Experience, 8 (1996), pp.&nbsp;517-535.
<P>
<DT><A NAME="chtchelkanova95a"><STRONG>30</STRONG></A><DD>
A.&nbsp;C<font size=-1><small>HTCHELKANOVA</small></font>, J.&nbsp;G<font size=-1><small>UNNELS</small></font>, G.&nbsp;M<font size=-1><small>ORROW</small></font>, J.&nbsp;O<font size=-1><small>VERFELT</small></font>, <font size=-1><small>AND</small></font> R.&nbsp;<font size=-1><small>VAN</small></font>&nbsp;<font size=-1><small>DE</small></font> G<font size=-1><small>EIJN</small></font>, <EM>Parallel Implementation of BLAS: General Techniques for Level 3
  BLAS</EM>, Tech. Rep. TR95-49, Department of Computer Sciences, UT-Austin, 1995.
Submitted to Concurrency: Practice and Experience.
<P>
<DT><A NAME="chu90a"><STRONG>31</STRONG></A><DD>
E.&nbsp;C<font size=-1><small>HU</small></font> <font size=-1><small>AND</small></font> A.&nbsp;G<font size=-1><small>EORGE</small></font>, <EM>QR Factorization of a Dense Matrix on a
  Hypercube Multiprocessor</EM>, SIAM Journal on Scientific and Statistical
  Computing, 11 (1990), pp.&nbsp;990-1028.
<P>
<DT><A NAME="lawn125"><STRONG>32</STRONG></A><DD>
A.&nbsp;C<font size=-1><small>LEARY</small></font> <font size=-1><small>AND</small></font> J.&nbsp;D<font size=-1><small>ONGARRA</small></font>, <EM>Implementation in scalapack of
  divide-and-conquer algorithms for banded and tridiagonal linear systems</EM>,
  Computer Science Dept. Technical Report CS-97-358, University of
  Tennessee, Knoxville, TN, April 1997.
(Also LAPACK Working Note #125).
<P>
<DT><A NAME="cosnard86a"><STRONG>33</STRONG></A><DD>
M.&nbsp;C<font size=-1><small>OSNARD</small></font>, Y.&nbsp;R<font size=-1><small>OBERT</small></font>, P.&nbsp;Q<font size=-1><small>UINTON</small></font>, <font size=-1><small>AND</small></font> M.&nbsp;T<font size=-1><small>CHUENTE</small></font>, eds., <EM>Parallel
  Algorithms and Architectures</EM>, North-Holland, 1986.
<P>
<DT><A NAME="berkeleynow"><STRONG>34</STRONG></A><DD>
D.&nbsp;E. C<font size=-1><small>ULLER</small></font>, A.&nbsp;A<font size=-1><small>RPACI</small></font>-D<font size=-1><small>USSEAU</small></font>, R.&nbsp;A<font size=-1><small>RPACI</small></font>-D<font size=-1><small>USSEAU</small></font>, B.&nbsp;C<font size=-1><small>HUN</small></font>, S.&nbsp;L<font size=-1><small>UMETTA</small></font>, A.&nbsp;M<font size=-1><small>AINWARING</small></font>, R.&nbsp;M<font size=-1><small>ARTIN</small></font>, C.&nbsp;Y<font size=-1><small>OSHIKAWA</small></font>, <font size=-1><small>AND</small></font> F.&nbsp;W<font size=-1><small>ONG</small></font>, <EM>Parallel computing
  on the Berkeley NOW</EM>.
To appear in JSPP'97 (9th Joint Symposium on Parallel Processing),
  Kobe, Japan, 1997.
<P>
<DT><A NAME="dayde94a"><STRONG>35</STRONG></A><DD>
M.&nbsp;D<font size=-1><small>AYDE</small></font>, I.&nbsp;D<font size=-1><small>UFF</small></font>, <font size=-1><small>AND</small></font> A.&nbsp;P<font size=-1><small>ETITET</small></font>, <EM>A Parallel Block Implementation
  of Level 3 BLAS for MIMD Vector Processors</EM>, ACM Trans. Math. Softw., 20
  (1994), pp.&nbsp;178-193.
<P>
<DT><A NAME="demoorvandooren92"><STRONG>36</STRONG></A><DD>
B.&nbsp;D<font size=-1><small>E</small></font>&nbsp;M<font size=-1><small>OOR</small></font> <font size=-1><small>AND</small></font> P.&nbsp;V<font size=-1><small>AN</small></font>&nbsp;D<font size=-1><small>OOREN</small></font>, <EM>Generalization of the singular value
  and QR decompositions</EM>, SIAM J. Matrix Anal. Appl., 13 (1992),
  pp.&nbsp;993-1014.
<P>
<DT><A NAME="demmel84"><STRONG>37</STRONG></A><DD>
J.&nbsp;D<font size=-1><small>EMMEL</small></font>, <EM>Underflow and the reliability of numerical software</EM>,
  SIAM J. Sci. Stat. Comput., 5 (1984), pp.&nbsp;887-919.
<P>
<DT><A NAME="demmelMA221"><STRONG>38</STRONG></A><DD>
height 2pt depth -1.6pt width 23pt, <EM>Applied Numerical
  Linear Algebra</EM>, SIAM, 1996.
to appear.
<P>
<DT><A NAME="demmeleisenstatgilbertliliu"><STRONG>39</STRONG></A><DD>
J.&nbsp;D<font size=-1><small>EMMEL</small></font>, S.&nbsp;E<font size=-1><small>ISENSTAT</small></font>, J.&nbsp;G<font size=-1><small>ILBERT</small></font>, X.&nbsp;L<font size=-1><small>I</small></font>, <font size=-1><small>AND</small></font> J.&nbsp;W.&nbsp;H. L<font size=-1><small>IU</small></font>, <EM>A
  supernodal approach to sparse partial pivoting</EM>, Technical Report
  UCB//CSD-95-883, UC Berkeley Computer Science Division, September 1995.
to appear in SIAM J. Mat. Anal. Appl.
<P>
<DT><A NAME="lawn86"><STRONG>40</STRONG></A><DD>
J.&nbsp;D<font size=-1><small>EMMEL</small></font> <font size=-1><small>AND</small></font> K.&nbsp;S<font size=-1><small>TANLEY</small></font>, <EM>The performance of finding eigenvalues and
  eigenvectors of dense symmetric matrices on distributed memory computers</EM>,
  Computer Science Dept. Technical Report CS-94-254, University of
  Tennessee, Knoxville, TN, September 1994.
(Also LAPACK Working Note #86).
<P>
<DT><A NAME="shm_superlu97"><STRONG>41</STRONG></A><DD>
J.&nbsp;W. D<font size=-1><small>EMMEL</small></font>, J.&nbsp;R. G<font size=-1><small>ILBERT</small></font>, <font size=-1><small>AND</small></font> X.&nbsp;S. L<font size=-1><small>I</small></font>, <EM>An asynchronous parallel
  supernodal algorithm for sparse Gaussian elimination</EM>, February 1997.
Submitted to SIAM J. Matrix Anal. Appl., special issue on Sparse and
  Structured Matrix Computations and Their Applications (Also LAPACK Working
  Note 124).
<P>
<DT><A NAME="demmelli93"><STRONG>42</STRONG></A><DD>
J.&nbsp;W. D<font size=-1><small>EMMEL</small></font> <font size=-1><small>AND</small></font> X.&nbsp;L<font size=-1><small>I</small></font>, <EM>Faster numerical algorithms via exception
  handling</EM>, IEEE Trans. Comp., 43 (1994), pp.&nbsp;983-992.
(Also LAPACK Working Note #59).
<P>
<DT><A NAME="dhillon97_1"><STRONG>43</STRONG></A><DD>
I.&nbsp;S. D<font size=-1><small>HILLON</small></font>, <EM>Current inverse iteration software can fail</EM>,
  (1997).
Submitted for publication.
<P>
<DT><A NAME="dhillonthesis"><STRONG>44</STRONG></A><DD>
height 2pt depth -1.6pt width 23pt, <EM>A Stable <IMG WIDTH=42 HEIGHT=30 ALIGN=MIDDLE ALT="tex2html_wrap_inline18127" SRC="img557.gif">
  Algorithm for the Symmetric Tridiagonal Eigenproblem</EM>, PhD thesis, University
  of California, Berkeley, CA, May 1997.
<P>
<DT><A NAME="dhillonparlett97"><STRONG>45</STRONG></A><DD>
I.&nbsp;S. D<font size=-1><small>HILLON</small></font> <font size=-1><small>AND</small></font> B.&nbsp;P<font size=-1><small>ARLETT</small></font>, <EM>Orthogonal eigenvectors without
  Gram-Schmidt</EM>,  (1997).
draft.
<P>
<DT><A NAME="dunigan96a"><STRONG>46</STRONG></A><DD>
J.&nbsp;D<font size=-1><small>ONGARRA</small></font> <font size=-1><small>AND</small></font> T.&nbsp;D<font size=-1><small>UNIGAN</small></font>, <EM>Message-passing performance of various
  computers</EM>, Tech. Rep. ORNL/TM-13006, Oak Ridge National Laboratory, Oak
  Ridge, TN, 1996.
Submitted and accepted to Concurrency: Practice and Experience.
<P>
<DT><A NAME="lawn110"><STRONG>47</STRONG></A><DD>
J.&nbsp;D<font size=-1><small>ONGARRA</small></font>, S.&nbsp;H<font size=-1><small>AMMARLING</small></font>, <font size=-1><small>AND</small></font> D.&nbsp;W<font size=-1><small>ALKER</small></font>, <EM>Key Concepts for Parallel
  Out-Of-Core LU Factorization</EM>, Society for Industrial and Applied
  Mathematics, Philadelphia, PA, 1996.
(Also LAPACK Working Note #110).
<P>
<DT><A NAME="henry97a"><STRONG>48</STRONG></A><DD>
J.&nbsp;D<font size=-1><small>ONGARRA</small></font>, G.&nbsp;H<font size=-1><small>ENRY</small></font>, <font size=-1><small>AND</small></font> D.&nbsp;W<font size=-1><small>ATKINS</small></font>, <EM>A distributed memory
  implementation of the nonsymmetric QR algorithm</EM>, in Proceedings of the
  Eighth SIAM Conference on Parallel Processing for Scientific Computing,
  Philadelphia, PA, 1997, Society for Industrial and Applied Mathematics.
<P>
<DT><A NAME="DPRT95"><STRONG>49</STRONG></A><DD>
J.&nbsp;D<font size=-1><small>ONGARRA</small></font>, C.&nbsp;R<font size=-1><small>ANDRIAMARO</small></font>, L.&nbsp;P<font size=-1><small>RYLLI</small></font>, <font size=-1><small>AND</small></font> B.&nbsp;T<font size=-1><small>OURANCHEAU</small></font>, <EM>Array
  redistribution in ScaLAPACK using PVM</EM>, in EuroPVM users' group,
  Hermes, 1995.
<P>
<DT><A NAME="lawn37"><STRONG>50</STRONG></A><DD>
J.&nbsp;D<font size=-1><small>ONGARRA</small></font> <font size=-1><small>AND</small></font> R.&nbsp;<font size=-1><small>VAN</small></font>&nbsp;<font size=-1><small>DE</small></font> G<font size=-1><small>EIJN</small></font>, <EM>Two dimensional basic linear
  algebra communication subprograms</EM>, Computer Science Dept. Technical
  Report CS-91-138, University of Tennessee, Knoxville, TN, 1991.
(Also LAPACK Working Note #37).
<P>
<DT><A NAME="lawn43"><STRONG>51</STRONG></A><DD>
J.&nbsp;D<font size=-1><small>ONGARRA</small></font>, R.&nbsp;<font size=-1><small>VAN</small></font>&nbsp;<font size=-1><small>DE</small></font> G<font size=-1><small>EIJN</small></font>, <font size=-1><small>AND</small></font> D.&nbsp;W<font size=-1><small>ALKER</small></font>, <EM>Scalability issues in
  the design of a library for dense linear algebra</EM>, Journal of Parallel and
  Distributed Computing, 22 (1994), pp.&nbsp;523-537.
(Also LAPACK Working Note #43).
<P>
<DT><A NAME="blacs"><STRONG>52</STRONG></A><DD>
J.&nbsp;D<font size=-1><small>ONGARRA</small></font>, R.&nbsp;<font size=-1><small>VAN</small></font>&nbsp;<font size=-1><small>DE</small></font> G<font size=-1><small>EIJN</small></font>, <font size=-1><small>AND</small></font> R.&nbsp;C. W<font size=-1><small>HALEY</small></font>, <EM>Two dimensional
  basic linear algebra communication subprograms</EM>, in Environments and Tools
  for Parallel Scientific Computing, Advances in Parallel Computing,
  J.&nbsp;Dongarra and B.&nbsp;Tourancheau, eds., vol.&nbsp;6, Elsevier Science Publishers
  B.V., 1993, pp.&nbsp;31-40.
<P>
<DT><A NAME="dongarra95a"><STRONG>53</STRONG></A><DD>
J.&nbsp;D<font size=-1><small>ONGARRA</small></font> <font size=-1><small>AND</small></font> D.&nbsp;W<font size=-1><small>ALKER</small></font>, <EM>Software libraries for linear algebra
  computations on high performance computers</EM>, SIAM Review, 37 (1995),
  pp.&nbsp;151-180.
<P>
<DT><A NAME="lawn94"><STRONG>54</STRONG></A><DD>
J.&nbsp;D<font size=-1><small>ONGARRA</small></font> <font size=-1><small>AND</small></font> R.&nbsp;C. W<font size=-1><small>HALEY</small></font>, <EM>A user's guide to the BLACS v1.1</EM>,
  Computer Science Dept. Technical Report CS-95-281, University of
  Tennessee, Knoxville, TN, 1995.
(Also LAPACK Working Note #94).
<P>
<DT><A NAME="lawn118"><STRONG>55</STRONG></A><DD>
J.&nbsp;J. D<font size=-1><small>ONGARRA</small></font> <font size=-1><small>AND</small></font> E.&nbsp;F. D'A<font size=-1><small>ZEVEDO</small></font>, <EM>The design and implementation of
  the parallel out-of-core ScaLAPACK LU, QR, and Cholesky factorization
  routines</EM>, Department of Computer Science Technical Report
  CS-97-347, University of Tennessee, Knoxville, TN, 1997.
(Also LAPACK Working Note 118).
<P>
<DT><A NAME="blas3alg"><STRONG>56</STRONG></A><DD>
J.&nbsp;J. D<font size=-1><small>ONGARRA</small></font>, J.&nbsp;D<font size=-1><small>U</small></font>&nbsp;C<font size=-1><small>ROZ</small></font>, I.&nbsp;S. D<font size=-1><small>UFF</small></font>, <font size=-1><small>AND</small></font> S.&nbsp;H<font size=-1><small>AMMARLING</small></font>, <EM>Algorithm
  679: A set of Level 3 Basic Linear Algebra Subprograms</EM>, ACM
  Trans. Math. Soft., 16 (1990), pp.&nbsp;18-28.
<P>
<DT><A NAME="blas3"><STRONG>57</STRONG></A><DD>
height 2pt depth -1.6pt width 23pt, <EM>A set of Level 3
  Basic Linear Algebra Subprograms</EM>, ACM Trans. Math. Soft., 16
  (1990), pp.&nbsp;1-17.
<P>
<DT><A NAME="blas2alg"><STRONG>58</STRONG></A><DD>
J.&nbsp;J. D<font size=-1><small>ONGARRA</small></font>, J.&nbsp;D<font size=-1><small>U</small></font>&nbsp;C<font size=-1><small>ROZ</small></font>, S.&nbsp;H<font size=-1><small>AMMARLING</small></font>, <font size=-1><small>AND</small></font> R.&nbsp;J. H<font size=-1><small>ANSON</small></font>, <EM>
  Algorithm 656: An extended set of FORTRAN Basic Linear Algebra
  Subroutines</EM>, ACM Trans. Math. Soft., 14 (1988), pp.&nbsp;18-32.
<P>
<DT><A NAME="blas2"><STRONG>59</STRONG></A><DD>
height 2pt depth -1.6pt width 23pt, <EM>An extended set of
  FORTRAN basic linear algebra subroutines</EM>, ACM Trans. Math. Soft., 14
  (1988), pp.&nbsp;1-17.
<P>
<DT><A NAME="Dongarra87e"><STRONG>60</STRONG></A><DD>
J.&nbsp;J. D<font size=-1><small>ONGARRA</small></font> <font size=-1><small>AND</small></font> E.&nbsp;G<font size=-1><small>ROSSE</small></font>, <EM>Distribution of mathematical software
  via electronic mail</EM>, Communications of the ACM, 30 (1987), pp.&nbsp;403-407.
<P>
<DT><A NAME="dongarra92a"><STRONG>61</STRONG></A><DD>
J.&nbsp;J. D<font size=-1><small>ONGARRA</small></font>, R.&nbsp;<font size=-1><small>VAN</small></font>&nbsp;<font size=-1><small>DE</small></font> G<font size=-1><small>EIJN</small></font>, <font size=-1><small>AND</small></font> D.&nbsp;W. W<font size=-1><small>ALKER</small></font>, <EM>A look at
  scalable dense linear algebra libraries</EM>, in Proceedings of the Scalable
  High-Performance Computing Conference, IEEE, ed., IEEE Publishers, 1992,
  pp.&nbsp;372-379.
<P>
<DT><A NAME="lapwn27"><STRONG>62</STRONG></A><DD>
J.&nbsp;D<font size=-1><small>U</small></font>&nbsp;C<font size=-1><small>ROZ</small></font> <font size=-1><small>AND</small></font> N.&nbsp;J. H<font size=-1><small>IGHAM</small></font>, <EM>Stability of methods for matrix
  inversion</EM>, IMA J. Numer. Anal., 12 (1992), pp.&nbsp;1-19.
(Also LAPACK Working Note #27).
<P>
<DT><A NAME="falgout93a"><STRONG>63</STRONG></A><DD>
R.&nbsp;F<font size=-1><small>ALGOUT</small></font>, A.&nbsp;S<font size=-1><small>KJELLUM</small></font>, S.&nbsp;S<font size=-1><small>MITH</small></font>, <font size=-1><small>AND</small></font> C.&nbsp;S<font size=-1><small>TILL</small></font>, <EM>The Multicomputer
  Toolbox Approach to Concurrent BLAS and LACS</EM>, in Proceedings of the
  Scalable High Performance Computing Conference SHPCC-92, IEEE Computer
  Society Press, 1992.
<P>
<DT><A NAME="mpi"><STRONG>64</STRONG></A><DD>
M.&nbsp;P.&nbsp;I. F<font size=-1><small>ORUM</small></font>, <EM>MPI: A message passing interface standard</EM>,
  International Journal of Supercomputer Applications and High Performance
  Computing, 8 (1994), pp.&nbsp;3-4.
Special issue on MPI. Also available electronically, the URL is
  <TT>ftp://www.netlib.org/mpi/mpi-report.ps </TT>.
<P>
<DT><A NAME="fox88ab"><STRONG>65</STRONG></A><DD>
G.&nbsp;F<font size=-1><small>OX</small></font>, M.&nbsp;J<font size=-1><small>OHNSON</small></font>, G.&nbsp;L<font size=-1><small>YZENGA</small></font>, S.&nbsp;O<font size=-1><small>TTO</small></font>, J.&nbsp;S<font size=-1><small>ALMON</small></font>, <font size=-1><small>AND</small></font> D.&nbsp;W<font size=-1><small>ALKER</small></font>, <EM>
  Solving Problems on Concurrent Processors, Volume 1</EM>, Prentice-Hall,
  Englewood Cliffs, NJ, 1988.
<P>
<DT><A NAME="fox94wm"><STRONG>66</STRONG></A><DD>
G.&nbsp;F<font size=-1><small>OX</small></font>, R.&nbsp;W<font size=-1><small>ILLIAMS</small></font>, <font size=-1><small>AND</small></font> P.&nbsp;M<font size=-1><small>ESSINA</small></font>, <EM>Parallel Computing Works!</EM>,
  Morgan Kaufmann Publishers, Inc., San Francisco, CA, 1994.
<P>
<DT><A NAME="FP:92"><STRONG>67</STRONG></A><DD>
T.&nbsp;L. F<font size=-1><small>REEMAN</small></font> <font size=-1><small>AND</small></font> C.&nbsp;P<font size=-1><small>HILLIPS</small></font>, <EM>Parallel Numerical Algorithms</EM>,
  Prentice-Hall, Hemel Hempstead, Hertfordshire, UK, 1992.
<P>
<DT><A NAME="pvm"><STRONG>68</STRONG></A><DD>
A.&nbsp;G<font size=-1><small>EIST</small></font>, A.&nbsp;B<font size=-1><small>EGUELIN</small></font>, J.&nbsp;D<font size=-1><small>ONGARRA</small></font>, W.&nbsp;J<font size=-1><small>IANG</small></font>, R.&nbsp;M<font size=-1><small>ANCHEK</small></font>, <font size=-1><small>AND</small></font> V.&nbsp;S<font size=-1><small>UNDERAM</small></font>, <EM>PVM: Parallel Virtual Machine. A Users' Guide and
  Tutorial for Networked Parallel Computing</EM>, MIT Press, Cambridge, MA, 1994.
<P>
<DT><A NAME="geist88a"><STRONG>69</STRONG></A><DD>
G.&nbsp;G<font size=-1><small>EIST</small></font> <font size=-1><small>AND</small></font> C.&nbsp;R<font size=-1><small>OMINE</small></font>, <EM>LU factorization algorithms on distributed
  memory multiprocessor architectures</EM>, SIAM J. Sci. Stat. Comput., 9 (1988),
  pp.&nbsp;639-649.
<P>
<DT><A NAME="golub89a"><STRONG>70</STRONG></A><DD>
G.&nbsp;G<font size=-1><small>OLUB</small></font> <font size=-1><small>AND</small></font> C.&nbsp;<font size=-1><small>VAN</small></font> L<font size=-1><small>OAN</small></font>, <EM>Matrix Computations</EM>, Johns-Hopkins,
  Baltimore, second&nbsp;ed., 1989.
<P>
<DT><A NAME="GVL2"><STRONG>71</STRONG></A><DD>
G.&nbsp;G<font size=-1><small>OLUB</small></font> <font size=-1><small>AND</small></font> C.&nbsp;F. V<font size=-1><small>AN</small></font>&nbsp;L<font size=-1><small>OAN</small></font>, <EM>Matrix Computations</EM>, Johns Hopkins
  University Press, Baltimore, MD, third&nbsp;ed., 1996.
<P>
<DT><A NAME="hager"><STRONG>72</STRONG></A><DD>
W.&nbsp;W. H<font size=-1><small>AGER</small></font>, <EM>Condition estimators</EM>, SIAM J. Sci. Stat. Comput., 5
  (1984), pp.&nbsp;311-316.
<P>
<DT><A NAME="hammarling86"><STRONG>73</STRONG></A><DD>
S.&nbsp;H<font size=-1><small>AMMARLING</small></font>, <EM>The numerical solution of the general
  Gauss-Markov linear model</EM>, in Mathematics in Signal Processing,
  T.&nbsp;S.&nbsp;<EM>et al.</EM>. Durani, ed., Clarendon Press, Oxford, UK, 1986.
<P>
<DT><A NAME="blas0"><STRONG>74</STRONG></A><DD>
R.&nbsp;H<font size=-1><small>ANSON</small></font>, F.&nbsp;K<font size=-1><small>ROGH</small></font>, <font size=-1><small>AND</small></font> C.&nbsp;L<font size=-1><small>AWSON</small></font>, <EM>A proposal for standard linear
  algebra subprograms</EM>, ACM SIGNUM Newsl., 8 (1973).
<P>
<DT><A NAME="hatcher91a"><STRONG>75</STRONG></A><DD>
P.&nbsp;H<font size=-1><small>ATCHER</small></font> <font size=-1><small>AND</small></font> M.&nbsp;Q<font size=-1><small>UINN</small></font>, <EM>Data-Parallel Programming On MIMD
  Computers</EM>, The MIT Press, Cambridge, Massachusetts, 1991.
<P>
<DT><A NAME="hendrickson94a"><STRONG>76</STRONG></A><DD>
B.&nbsp;H<font size=-1><small>ENDRICKSON</small></font> <font size=-1><small>AND</small></font> D.&nbsp;W<font size=-1><small>OMBLE</small></font>, <EM>The torus-wrap mapping for dense
  matrix calculations on massively parallel computers</EM>, SIAM J. Sci. Stat.
  Comput., 15 (1994), pp.&nbsp;1201-1226.
<P>
<DT><A NAME="gregthesis"><STRONG>77</STRONG></A><DD>
G.&nbsp;H<font size=-1><small>ENRY</small></font>, <EM>Improving Data Re-Use in Eigenvalue-Related Computations</EM>,
  PhD thesis, Cornell University, Ithaca, NY, January 1994.
<P>
<DT><A NAME="lawn79"><STRONG>78</STRONG></A><DD>
G.&nbsp;H<font size=-1><small>ENRY</small></font> <font size=-1><small>AND</small></font> R.&nbsp;V<font size=-1><small>AN</small></font>&nbsp;<font size=-1><small>DE</small></font> G<font size=-1><small>EIJN</small></font>, <EM>Parallelizing the QR algorithm for
  the unsymmetric algebraic eigenvalue problem: Myths and reality</EM>, SIAM J.
  Sci. Comput., 17 (1996), pp.&nbsp;870-883.
(Also LAPACK Working Note 79).
<P>
<DT><A NAME="lawn121"><STRONG>79</STRONG></A><DD>
G.&nbsp;H<font size=-1><small>ENRY</small></font>, D.&nbsp;W<font size=-1><small>ATKINS</small></font>, <font size=-1><small>AND</small></font> J.&nbsp;D<font size=-1><small>ONGARRA</small></font>, <EM>A parallel implementation of
  the nonsymmetric QR algorithm for distributed memory architectures</EM>,
  Computer Science Dept. Technical Report CS-97-352, University of
  Tennessee, Knoxville, TN, March 1997.
(Also LAPACK Working Note # 121).
<P>
<DT><A NAME="higham1"><STRONG>80</STRONG></A><DD>
N.&nbsp;J. H<font size=-1><small>IGHAM</small></font>, <EM>A survey of condition number estimation for triangular
  matrices</EM>, SIAM Review, 29 (1987), pp.&nbsp;575-596.
<P>
<DT><A NAME="nick2"><STRONG>81</STRONG></A><DD>
height 2pt depth -1.6pt width 23pt, <EM>FORTRAN codes for
  estimating the one-norm of a real or complex matrix, with applications to
  condition estimation</EM>, ACM Trans. Math. Softw., 14 (1988), pp.&nbsp;381-396.
<P>
<DT><A NAME="higham90"><STRONG>82</STRONG></A><DD>
height 2pt depth -1.6pt width 23pt, <EM>Experience with a
  matrix norm estimator</EM>, SIAM J. Sci. Stat. Comput., 11 (1990),
  pp.&nbsp;804-809.
<P>
<DT><A NAME="higham93"><STRONG>83</STRONG></A><DD>
height 2pt depth -1.6pt width 23pt, <EM>Perturbation theory
  and backward error for <I>AX</I>-<I>XB</I>=<I>C</I></EM>, BIT, 33 (1993), pp.&nbsp;124-136.
<P>
<DT><A NAME="higham96"><STRONG>84</STRONG></A><DD>
height 2pt depth -1.6pt width 23pt, <EM>Accuracy and
  Stability of Numerical Algorithms</EM>, Society for Industrial and Applied
  Mathematics, Philadelphia, PA, 1996.
<P>
<DT><A NAME="huss94a"><STRONG>85</STRONG></A><DD>
S.&nbsp;H<font size=-1><small>USS</small></font>-L<font size=-1><small>EDERMAN</small></font>, E.&nbsp;J<font size=-1><small>ACOBSON</small></font>, A.&nbsp;T<font size=-1><small>SAO</small></font>, <font size=-1><small>AND</small></font> G.&nbsp;Z<font size=-1><small>HANG</small></font>, <EM>Matrix
  Multiplication on the Intel Touchstone DELTA</EM>, Concurrency: Practice and
  Experience, 6 (1994), pp.&nbsp;571-594.
<P>
<DT><A NAME="huss93a"><STRONG>86</STRONG></A><DD>
S.&nbsp;H<font size=-1><small>USS</small></font>-L<font size=-1><small>EDERMAN</small></font>, A.&nbsp;T<font size=-1><small>SAO</small></font>, <font size=-1><small>AND</small></font> G.&nbsp;Z<font size=-1><small>HANG</small></font>, <EM>A parallel implementation
  of the invariant subspace decomposition algorithm for dense symmetric
  matrices</EM>, in Proceedings of the Sixth SIAM Conference on Parallel
  Processing for Scientific Computing, SIAM, 1993, pp.&nbsp;367-374.
<P>
<DT><A NAME="hwang93a"><STRONG>87</STRONG></A><DD>
K.&nbsp;H<font size=-1><small>WANG</small></font>, <EM>Advanced Computer Architecture: Parallelism, Scalability,
  Programmability</EM>, McGraw-Hill, 1993.
<P>
<DT><A NAME="ibm1"><STRONG>88</STRONG></A><DD>
IBM C<font size=-1><small>ORPORATION</small></font>, <EM>IBM RS6000</EM>, 1996.
 (URL = <TT>http://www.rs6000.ibm.com/</TT>).
<P>
<DT><A NAME="intel"><STRONG>89</STRONG></A><DD>
I<font size=-1><small>NTEL</small></font> C<font size=-1><small>ORPORATION</small></font>, <EM>Intel Supercomputer Technical Publications
  Home Page</EM>, 1995.
 (URL = <TT>http://www.ssd.intel.com/pubs.html</TT>).
<P>
<DT><A NAME="kagstrom95b"><STRONG>90</STRONG></A><DD>
B.&nbsp;K&#229;<font size=-1><small>GSTR</small></font>f<ont size=-1><small>O</small></font><font size=-1><small>M</small></font>, P.&nbsp;L<font size=-1><small>ING</small></font>, <font size=-1><small>AND</small></font> C.&nbsp;V. L<font size=-1><small>OAN</small></font>, <EM>GEMM-based level 3
  BLAS: High-performance model implementations and performance evaluation
  benchmark</EM>, Tech. Rep. UMINF 95-18, Department of Computing Science, Ume&#229;
  University, 1995.
Submitted to ACM Trans. Math. Softw.
<P>
<DT><A NAME="hpf"><STRONG>91</STRONG></A><DD>
C.&nbsp;K<font size=-1><small>OEBEL</small></font>, D.&nbsp;L<font size=-1><small>OVEMAN</small></font>, R.&nbsp;S<font size=-1><small>CHREIBER</small></font>, G.&nbsp;S<font size=-1><small>TEELE</small></font>, <font size=-1><small>AND</small></font> M.&nbsp;Z<font size=-1><small>OSEL</small></font>, <EM>The
  High Performance Fortran Handbook</EM>, MIT Press, Cambridge, Massachusetts,
  1994.
<P>
<DT><A NAME="kumar94a"><STRONG>92</STRONG></A><DD>
V.&nbsp;K<font size=-1><small>UMAR</small></font>, A.&nbsp;G<font size=-1><small>RAMA</small></font>, A.&nbsp;G<font size=-1><small>UPTA</small></font>, <font size=-1><small>AND</small></font> G.&nbsp;K<font size=-1><small>ARYPIS</small></font>, <EM>Introduction to
  Parallel Computing - Design and Analysis of Algorithms</EM>, The
  Benjamin/Cummings Publishing Company, Inc., Redwood City, CA, 1994.
<P>
<DT><A NAME="blas1"><STRONG>93</STRONG></A><DD>
C.&nbsp;L. L<font size=-1><small>AWSON</small></font>, R.&nbsp;J. H<font size=-1><small>ANSON</small></font>, D.&nbsp;K<font size=-1><small>INCAID</small></font>, <font size=-1><small>AND</small></font> F.&nbsp;T. K<font size=-1><small>ROGH</small></font>, <EM>Basic
  linear algebra subprograms for Fortran usage</EM>, ACM Trans. Math. Soft., 5
  (1979), pp.&nbsp;308-323.
<P>
<DT><A NAME="lawn72"><STRONG>94</STRONG></A><DD>
R.&nbsp;L<font size=-1><small>EHOUCQ</small></font>, <EM>The computation of elementary unitary matrices</EM>,
  Computer Science Dept. Technical Report CS-94-233, University of
  Tennessee, Knoxville, TN, 1994.
(Also LAPACK Working Note 72).
<P>
<DT><A NAME="lewis92"><STRONG>95</STRONG></A><DD>
T.&nbsp;L<font size=-1><small>EWIS</small></font> <font size=-1><small>AND</small></font> H.&nbsp;E<font size=-1><small>L</small></font>-R<font size=-1><small>EWINI</small></font>, <EM>Introduction to Parallel Computing</EM>,
  Prentice-Hall, Inc., Englewood Cliffs, NJ, 1992.
<P>
<DT><A NAME="xiaoyelithesis"><STRONG>96</STRONG></A><DD>
X.&nbsp;L<font size=-1><small>I</small></font>, <EM>Sparse Gaussian Elimination on High Performance Computers</EM>,
  PhD thesis, Computer Science Division, Department of Electrical Engineering
  and Computer Science, University of California, Berkeley, CA, September 1996.
<P>
<DT><A NAME="lichtenstein93a"><STRONG>97</STRONG></A><DD>
W.&nbsp;L<font size=-1><small>ICHTENSTEIN</small></font> <font size=-1><small>AND</small></font> S.&nbsp;L. J<font size=-1><small>OHNSSON</small></font>, <EM>Block-cyclic dense linear
  algebra</EM>, SIAM J. Sci. Stat. Comput., 14 (1993), pp.&nbsp;1259-1288.
<P>
<DT><A NAME="am2"><STRONG>98</STRONG></A><DD>
A.&nbsp;M<font size=-1><small>AINWARING</small></font> <font size=-1><small>AND</small></font> D.&nbsp;E. C<font size=-1><small>ULLER</small></font>, <EM>Active message applications
  programming interface and communication subsystem organization</EM>, Tech. Rep.
  UCB CSD-96-918, University of California at Berkeley, Berkeley, CA, October
  1996.
<P>
<DT><A NAME="pacheco97"><STRONG>99</STRONG></A><DD>
P.&nbsp;P<font size=-1><small>ACHECO</small></font>, <EM>Parallel Programming with MPI</EM>, Morgan Kaufmann
  Publishers, Inc., San Francisco, CA, 1997.
<P>
<DT><A NAME="paige90"><STRONG>100</STRONG></A><DD>
C.&nbsp;P<font size=-1><small>AIGE</small></font>, <EM>Some aspects of generalized QR factorization</EM>, in
  Reliable Numerical Computations, M.&nbsp;Cox and S.&nbsp;Hammarling, eds., Clarendon
  Press, 1990.
<P>
<DT><A NAME="parl80"><STRONG>101</STRONG></A><DD>
B.&nbsp;P<font size=-1><small>ARLETT</small></font>, <EM>The Symmetric Eigenvalue Problem</EM>, Prentice-Hall,
  Englewood Cliffs, NJ, 1980.
<P>
<DT><A NAME="parlett96"><STRONG>102</STRONG></A><DD>
height 2pt depth -1.6pt width 23pt, <EM>The construction of
  orthogonal eigenvectors for tight clusters by use of submatrices</EM>, Center for
  Pure and Applied Mathematics PAM-664, University of California, Berkeley, CA,
  January 1996.
submitted to SIMAX.
<P>
<DT><A NAME="parlettdhillon96"><STRONG>103</STRONG></A><DD>
B.&nbsp;P<font size=-1><small>ARLETT</small></font> <font size=-1><small>AND</small></font> I.&nbsp;D<font size=-1><small>HILLON</small></font>, <EM>On Fernando's method to find the most
  redundant equation in a tridiagonal system</EM>, Linear Algebra and Its
  Applications,  (1996).
to appear.
<P>
<DT><A NAME="petitet96a"><STRONG>104</STRONG></A><DD>
A.&nbsp;P<font size=-1><small>ETITET</small></font>, <EM>Algorithmic Redistribution Methods for Block Cyclic
  Decompositions</EM>, PhD thesis, University of Tennessee, Knoxville, TN, 1996.
<P>
<DT><A NAME="Toolpack"><STRONG>105</STRONG></A><DD>
<font size=-1><small>E</small></font>.&nbsp;P<font size=-1><small>OLLICINI</small></font>, A.&nbsp;A., <EM>Using Toolpack Software Tools</EM>, 1989.
<P>
<DT><A NAME="PT96a"><STRONG>106</STRONG></A><DD>
L.&nbsp;P<font size=-1><small>RYLLI</small></font> <font size=-1><small>AND</small></font> B.&nbsp;T<font size=-1><small>OURANCHEAU</small></font>, <EM>Efficient block cyclic data
  redistribution</EM>, in EUROPAR'96, vol.&nbsp;1 of Lecture Notes in Computer Science,
  Springer-Verlag, 1996, pp.&nbsp;155-165.
<P>
<DT><A NAME="PT97"><STRONG>107</STRONG></A><DD>
height 2pt depth -1.6pt width 23pt, <EM>Efficient block
  cyclic array redistribution</EM>, Journal of Parallel and Distributed Computing,
  (1997).
To appear.
<P>
<DT><A NAME="schreiber87a"><STRONG>108</STRONG></A><DD>
R.&nbsp;S<font size=-1><small>CHREIBER</small></font> <font size=-1><small>AND</small></font> C.&nbsp;F. V<font size=-1><small>AN</small></font>&nbsp;L<font size=-1><small>OAN</small></font>, <EM>A storage efficient WY
  representation for products of Householder transformations</EM>, SIAM J. Sci.
  Stat. Comput., 10 (1989), pp.&nbsp;53-57.
<P>
<DT><A NAME="ugpetsc"><STRONG>109</STRONG></A><DD>
B.&nbsp;S<font size=-1><small>MITH</small></font>, W.&nbsp;G<font size=-1><small>ROPP</small></font>, <font size=-1><small>AND</small></font> L.&nbsp;C<font size=-1><small>URFMAN</small></font>&nbsp;M<font size=-1><small>C</small></font>I<font size=-1><small>NNES</small></font>, <EM>PETSc 2.0 users
  manual</EM>, Technical Report ANL-95/11, Argonne National Laboratory,
  Argonne, IL, 1995.
(Available by anonymous ftp from <TT>ftp.mcs.anl.gov</TT>).
<P>
<DT><A NAME="SOHWD:96"><STRONG>110</STRONG></A><DD>
M.&nbsp;S<font size=-1><small>NIR</small></font>, S.&nbsp;W. O<font size=-1><small>TTO</small></font>, S.&nbsp;H<font size=-1><small>USS</small></font>-L<font size=-1><small>EDERMAN</small></font>, D.&nbsp;W. W<font size=-1><small>ALKER</small></font>, <font size=-1><small>AND</small></font> J.&nbsp;J. D<font size=-1><small>ONGARRA</small></font>,
  <EM>MPI: The Complete Reference</EM>, MIT Press, Cambridge, MA, 1996.
<P>
<DT><A NAME="SunSoft:XDR"><STRONG>111</STRONG></A><DD>
S<font size=-1><small>UN</small></font>S<font size=-1><small>OFT</small></font>, <EM>The XDR Protocol Specification. Appendix A of ``Network
  Interfaces Programmer's Guide''</EM>, SunSoft, 1993.
<P>
<DT><A NAME="velde94a"><STRONG>112</STRONG></A><DD>
E.&nbsp;<font size=-1><small>VAN</small></font>&nbsp;<font size=-1><small>DE</small></font> V<font size=-1><small>ELDE</small></font>, <EM>Concurrent Scientific Computing</EM>, no.&nbsp;16 in Texts
  in Applied Mathematics, Springer-Verlag, 1994.
<P>
<DT><A NAME="lawn73"><STRONG>113</STRONG></A><DD>
R.&nbsp;C. W<font size=-1><small>HALEY</small></font>, <EM>Basic linear algebra communication subprograms:
  Analysis and implementation across multiple parallel architectures</EM>,
  Computer Science Dept. Technical Report CS-94-234, University of
  Tennessee, Knoxville, TN, May 1994.
(Also LAPACK Working Note 73).
<P>
<DT><A NAME="wilkinson1"><STRONG>114</STRONG></A><DD>
J.&nbsp;H. W<font size=-1><small>ILKINSON</small></font>, <EM>The Algebraic Eigenvalue Problem</EM>, Oxford
  University Press, Oxford, UK, 1965.
</DL>
<P>
<BR> <HR>
<P><ADDRESS>
<I>Susan Blackford <BR>
Tue May 13 09:21:01 EDT 1997</I>
</ADDRESS>
</BODY>
</HTML>