\begin{thebibliography}{M999}

\bibitem[A67]{A67}
{Aasen, J. O.}
\newblock On the reduction of a symmetric matrix to tridiagonal form.
\newblock {\em BIT}, 11:233--242, 1971.

\bibitem[A59]{A59}
{Abadie, J.}, editor.
\newblock {\em Nonlinear Programming}.
\newblock North-Holland, 1967.

\bibitem[A38]{A38}
{Abramowitz, M.} and {Stegun, I. A.}, editors.
\newblock {\em Handbook of Mathematical Functions}.
\newblock Dover Publications, 1964.

\bibitem[A44]{A44}
{ACM}.
\newblock {Special Issue}~: {Programming}.
\newblock {ACM Computing Surveys, 6(4)}, 1974.

\bibitem[A41]{A41}
{Acton, F. S.}
\newblock {\em Numerical Methods That Work}.
\newblock Harper and Row, 1970.

\bibitem[A1]{A1}
{Adler, I.}, {Karmarkar, N.}, {Resende, M. G. C.}, and {Veiga, G.}
\newblock Data structures and programming techniques for the implementation of
  {Karmarkar's} algorithm for linear programming.
\newblock {\em ORSA J. Computing}, 1(2):84--106, 1989.

\bibitem[A82]{A82}
{Adler, I.}, {Karp, R. M.}, and {Shamir, R.}
\newblock A simplex variant solving an $m$ x $d$ linear program in
  ${O}(min(m^2,d^2))$ expected number of pivot steps.
\newblock {\em J. Complexity}, 3:372--387, 1987.

\bibitem[A85]{A85}
{Adler, I.}, {Resende, M. G. C.}, {Veiga, G.}, and {Karmarkar, N.}
\newblock An implementation of {Karmarkar's} algorithm for linear programming.
\newblock {\em Math. Programming}, 44:297--335, 1989.
\newblock (Errata in {Math. Programming, 50, page 415, 1991}).

\bibitem[A45]{A45}
{Agerwala, T.} and {Cocke, J.}
\newblock High performance reduced instruction set processors.
\newblock {Tech. Report}, IBM, 1987.

\bibitem[A87]{A87}
{Ahlberg, H. H.}, {Nilson, E.}, and {Walsh, J. L.}, editors.
\newblock {\em The Theory of Splines and Their Applications}.
\newblock Academic Press, 1967.

\bibitem[A61]{A61}
{Aho, A. V.}, {Garey, M. R.}, and {Ullmann, J. D.}
\newblock The transitive reduction of a directed graph.
\newblock {\em SIAM J. Comput.}, 1:131--137, 1972.

\bibitem[A22]{A22}
{Aho, A. V.}, {Hopcroft, J. E.}, and {Ullman, J. D.}
\newblock {\em The Design and Analysis of Computer Algorithms}.
\newblock Addison-Wesley, 1974.

\bibitem[A23]{A23}
{Aho, A. V.}, {Hopcroft, J. E.}, and {Ullman, J. D.}
\newblock {\em Data Structures and Algorithms}.
\newblock Addison-Wesley, 1983.

\bibitem[A62]{A62}
{Aho, A. V.}, {Hopcroft, J. E.}, and {Ullmann, J. D.}
\newblock On finding lowest common ancestors in trees.
\newblock {\em SIAM J. Comput.}, 5:115--132, 1976.

\bibitem[A21]{A21}
{Aho, A. V.}, {Sethi, R.}, and {Ullman, J. D.}
\newblock {\em Compilers~: Principles, Techniques and Tools}.
\newblock Addison-Wesley, 1986.

\bibitem[A24]{A24}
{Aho, A. V.} and {Ullman, J. D.}
\newblock {\em The Theory of Parsing, Translation and Compiling, volume {2}~:
  Compiling}.
\newblock Prentice-Hall, 1973.

\bibitem[A43]{A43}
{Aho, A. V.} and {Ullman, J. D.}
\newblock {\em Principles of Compiler Design}.
\newblock Prentice-Hall, 1977.

\bibitem[A36]{A36}
{Akl, S. G.}
\newblock {\em Parallel Sorting Algorithms}.
\newblock Academic Press, 1985.

\bibitem[A35]{A35}
{Akl, S. G.}
\newblock {\em The Design and Analysis of Parallel Algorithms}.
\newblock Prentice-Hall, 1989.

\bibitem[A37]{A37}
{Akl, S. G.} and {Lyons, K. A.}
\newblock {\em Parallel Computational Geometry}.
\newblock Prentice-Hall, 1993.

\bibitem[A106]{A106}
{Al-Bassam, S.} and {El-Rewini, H.}
\newblock Processor allocation for hypercubes.
\newblock {\em J. of Parallel and Distributed Computing}, 16:394--401, 1992.

\bibitem[A72]{A72}
{Alaghband, G.}
\newblock Parallel pivoting combined with parallel reduction.
\newblock {Tech. Report} 87-75, ICASE, NASA Langley Research Center, Hampton,
  1987.

\bibitem[A73]{A73}
{Alaghband, G.}
\newblock {\em Multiprocessor Sparse {LU} Decomposition with Controlled
  Fill-in}.
\newblock PhD thesis, Univ. of Colorado, Boulder, 1988.

\bibitem[A30]{A30}
{Alaghband, G.}
\newblock Parallel pivoting combined with parallel reduction and fill-in
  control.
\newblock {\em Parallel Computing}, 11:201--221, 1989.

\bibitem[A29]{A29}
{Alaghband, G.}
\newblock Parallel sparse matrix solution and performance.
\newblock {\em Parallel Computing}, 21:1407--1430, 1995.

\bibitem[A69]{A69}
{Alaghband, G.} and {Jordan, H. F.}
\newblock Parallelization of the {MA28} sparse matrix package for the {HEP}.
\newblock {Tech. Report} CSDG-83-3, Dept. of Electrical and Computer Eng.,
  Univ. of Colorado, Boulder, 1983.

\bibitem[A32]{A32}
{Alaghband, G.} and {Jordan, H. F.}
\newblock Parallelizing a sparse matrix package.
\newblock {Tech. Report} CSDG-83-3, Computer System Design Group, Electrical
  and Computer Eng. Dept., Univ. of Colorado, 1983.

\bibitem[A70]{A70}
{Alaghband, G.} and {Jordan, H. F.}
\newblock Multiprocessor sparse {L/U} decomposition with controlled fill-in.
\newblock {Tech. Report} 85-48, ICASE, NASA Langley Research Center, Hampton,
  1985.

\bibitem[A71]{A71}
{Alaghband, G.} and {Jordan, H. F.}
\newblock Sparse {Gaussian} elimination with controlled fill-in on a shared
  memory multiprocessor.
\newblock {Tech. Report} ECSE 86-1-5, Dept. of Electrical and Computer Eng.,
  Univ. of Colorado, 1986.

\bibitem[A31]{A31}
{Alaghband, G.} and {Jordan, H. F.}
\newblock Sparse {Gaussian} elimination with controlled fill-in on a shared
  memory multiprocessor.
\newblock {\em IEEE Trans. Comput.}, C-38(11):1539--1557, 1989.

\bibitem[A81]{A81}
{Alavi, Y.}, {Chung, F. R. K.}, {Graham, R. L.}, and {Hsu, F.}, editors.
\newblock {\em Graph Theory, Combinatorics, Algorithms, and Applications, Proc.
  Conference held at San Francisco State University, 1989}.
\newblock SIAM Publications, 1991.

\bibitem[A27]{A27}
{Alfeld, P.} and {Eyre, D. J.}
\newblock Algorithm 701~: {GOLIATH}, {A} software system for the exact analysis
  of rectangular rank-deficient sparse rational linear systems.
\newblock {\em ACM Trans. Math. Software}, 17(4):519--532, 1991.

\bibitem[A26]{A26}
{Alfeld, P.} and {Eyre, D. J.}
\newblock The exact analysis of sparse rectangular linear systems.
\newblock {\em ACM Trans. Math. Software}, 17(4):502--518, 1991.

\bibitem[A86]{A86}
{Allen, R. H.}
\newblock Fast computer aided analysis of nonlinear electronic circuits.
\newblock In {\em Proc. Cornell Conference on Computerized Electronics}, pages
  326--345, Ithaca, 1969. Cornell Univ.

\bibitem[A19]{A19}
{Almasi, G. S.} and {Gottlieb, A.}
\newblock {\em Highly Parallel Computing}.
\newblock The Benjamin/Cummings Publishing Co., 1989.

\bibitem[A107]{A107}
{Alpern, B.} and {Carter, L.}
\newblock Performance programming~: {A} science waiting to happen.
\newblock In {Vishkin, U.}, editor, {\em Developing a Computer Science Agenda
  for High-Performance Computing}. ACM Press, 1994.

\bibitem[A108]{A108}
{Alpern, B.} and {Carter, L.}
\newblock Is scalability relevant~?~: {A} look at sparse matrix-vector product.
\newblock In {\em Proc. $7^{th}$ SIAM Conference on Parallel Processing}, San
  Francisco, 1995.

\bibitem[A109]{A109}
{Alpern, B.} and {Carter, L.}
\newblock Message compression for high performance.
\newblock In {\em Proc. $7^{th}$ SIAM Conference on Parallel Processing}, San
  Francisco, 1995.

\bibitem[A112]{A112}
{Alpern, B.} and {Carter, L.}
\newblock The myth of scalable high performance.
\newblock {Tech. Report}, Computer Science and Eng. Dept., San Diego
  Supercomputer Center, Univ. of California, San Diego, 1995.

\bibitem[A113]{A113}
{Alpern, B.}, {Carter, L.}, {Feig, E.}, and {Selker, T.}
\newblock The uniform memory hierarchy model of computation.
\newblock {Tech. Report}, IBM Thomas J. Watson Research Center, Yorktown
  Heights, 1992.

\bibitem[A110]{A110}
{Alpern, B.}, {Carter, L.}, and {Ferrante, J.}
\newblock Modeling parallel computers as memory hierarchies.
\newblock In {\em Proc. Programming Models for Massively Parallel Computers},
  1993.

\bibitem[A111]{A111}
{Alpern, B.}, {Carter, L.}, and {Selker, T.}
\newblock Visualizing computer memory architectures.
\newblock In {\em IEEE Visualization '90 Conference}, 1990.

\bibitem[A15]{A15}
{Alsa\c c, O.}, {Stott, B.}, and {Tinney, W. F.}
\newblock Sparsity-oriented compensation methods for modified network
  solutions.
\newblock {\em IEEE Trans. Power Apparatus and Systems}, PAS-102(5):1050--1060,
  1983.

\bibitem[A93]{A93}
{Alvarado, F. L.}
\newblock Computational complexity in power systems.
\newblock {\em IEEE Trans. Power Apparatus and Systems}, PAS-95(4):1028--1037,
  1976.

\bibitem[A5]{A5}
{Alvarado, F. L.}
\newblock A note on sorting sparse matrices.
\newblock {\em Proc. of the IEEE}, 67(9):1362--1363, 1979.

\bibitem[A54]{A54}
{Alvarado, F. L.}
\newblock Parallel solution of transient problems by trapezoidal integration.
\newblock {\em IEEE Trans. Power Apparatus and Systems}, PAS-98:1080--1090,
  1979.

\bibitem[A7]{A7}
{Alvarado, F. L.}
\newblock Manipulation and visualization of sparse matrices.
\newblock {\em ORSA J. Computing}, 2(2):186--207, 1990.

\bibitem[A3]{A3}
{Alvarado, F. L.}
\newblock Sparse matrix technology for power system computer applications.
\newblock Technical report, Univ. of Wisconsin, Madison, 1990.
\newblock (Presented at {IEEE} {Winter Power Meeting}).

\bibitem[A48]{A48}
{Alvarado, F. L.} and {Enns, M. K.}
\newblock Blocked sparse matrices in electric power systems.
\newblock {Paper} A-76-362-4, Univ. of Wisconsin, Madison, 1976.
\newblock (Presented at {IEEE} {Summer Power Meeting, Portland}).

\bibitem[A96]{A96}
{Alvarado, F. L.}, {Enns, M. K.}, and {Tinney, W. F.}
\newblock Sparsity enhancement in mutually coupled networks.
\newblock {\em IEEE Trans. Power Apparatus and Systems}, PAS-103:1582--1509,
  1984.

\bibitem[A95]{A95}
{Alvarado, F. L.}, {Mong, S. K.}, and {Enns, M. K.}
\newblock A fault program with macros, monitors and direct compensation in
  mutual groups.
\newblock {\em IEEE Trans. Power Apparatus and Systems}, PAS-104:1109--1120,
  1985.

\bibitem[A94]{A94}
{Alvarado, F. L.}, {Reitan, D. K.}, and {Bahari-Kashani, M.}
\newblock Sparsity in diakoptic algorithms.
\newblock {\em IEEE Trans. Power Apparatus and Systems}, PAS-96(5):1450--1459,
  1977.

\bibitem[A4]{A4}
{Alvarado, F. L.} and {Schreiber, R.}
\newblock Optimal parallel solution of sparse triangular systems.
\newblock {Contractor Report} CR-188872, NASA, 1990.

\bibitem[A65]{A65}
{Alvarado, F. L.} and {Schreiber, R.}
\newblock Optimal parallel solution of sparse triangular systems.
\newblock {\em SIAM J. Sci. and Stat. Comput.}, 14:446--460, 1993.

\bibitem[A46]{A46}
{Alvarado, F. L.} and {Tinney, W. F.}
\newblock State estimation using augmented block matrices.
\newblock {Paper} 90-WM-241-0-PWRS, Univ. of Wisconsin, Madison, 1990.
\newblock (Presented at {IEEE} {Winter Power Meeting}).

\bibitem[A2]{A2}
{Alvarado, F. L.}, {Tinney, W. F.}, and {Enns, M. K.}
\newblock Sparse matrix inverse factors.
\newblock {Paper} 88-SM-728-8, Univ. of Wisconsin, Madison, 1988.
\newblock (Presented at {IEEE} {Summer Power Meeting, Portland}, to be
  published at {IEEE} {Trans. Power Systems, 1990}).

\bibitem[A6]{A6}
{Alvarado, F. L.}, {Yu, D. C.}, and {Betancourt, R.}
\newblock Ordering schemes for partitioned sparse inverses.
\newblock Technical report, Univ. of Wisconsin, Madison, 1989.
\newblock (Presented at {SIAM Symposium on Sparse Matrices}, Salishan Lodge,
  Oregon).

\bibitem[A53]{A53}
{Alvarado, F. L.}, {Yu, D. C.}, and {Betancourt, R.}
\newblock Partitioned sparse ${A}^{-1}$ methods.
\newblock {\em IEEE Trans. Power Systems}, PWRS-5(2):452--459, 1990.

\bibitem[A88]{A88}
{Alway, G. G.} and {Martin, D. W.}
\newblock An algorithm for reducing the bandwidth of a matrix of symmetric
  configuration.
\newblock {\em Computing J.}, 8:264--272, 1965.

\bibitem[A74]{A74}
{Amano, H.}, {Boku, T.}, {Kudoh, T.}, and {Aiso, H.}
\newblock A new version of the sparse matrix solving machine.
\newblock In {\em Proc. $12^{th}$ International Symposium on Computer
  Architecture}, pages 100--107, 1985.

\bibitem[A79]{A79}
{Amdahl, G. M.}
\newblock The validity of the single processor approach to achieving large
  scale computing capabilities.
\newblock {\em AFIPS Conf. Proc.}, 30:483--485, 1967.

\bibitem[A80]{A80}
{Amdahl, G. M.}
\newblock Limits of expectation.
\newblock {\em Int. J. of Supercomputer Appl.}, 2(1):88--97, 1988.

\bibitem[A100]{A100}
{Amdahl, G. M.}, {Blaauw, G. A.}, and {Brooks, F. P. Jr.}
\newblock Architecture of the {IBM System/360}.
\newblock {\em IBM J. of Research and Development}, 8(2):87--101, 1964.

\bibitem[A57]{A57}
{American Standards Association, Inc.}
\newblock {\em X3.9 1966 American National Standard {FORTRAN}}, 1966.

\bibitem[A58]{A58}
{American Standards Association, Inc.}
\newblock {\em X3.9 1978 American National Standard {FORTRAN}}, 1978.

\bibitem[A89]{A89}
{Ames, W. F.}, editor.
\newblock {\em Nonlinear Partial Differential Equations in Engineering}.
\newblock Academic Press, 1965.

\bibitem[A18]{A18}
{Amestoy, P. R.}
\newblock Vectorization of a multiprocessor multifrontal code.
\newblock {\em Int. J. of Supercomputer Appl.}, 3(3):41--59, 1989.

\bibitem[A76]{A76}
{Amestoy, P. R.}
\newblock {\em Factorization of Large Sparse Matrices Based on a Multifrontal
  Approach in a of Multiprocessor Environment}.
\newblock PhD thesis, CERFACS, Toulouse, 1991.
\newblock ({Report TH-PA-91-2}).

\bibitem[A77]{A77}
{Amestoy, P. R.} and {Duff, I. S.}
\newblock Memory allocation issues in sparse multiprocessor multifrontal
  methods.
\newblock {\em Int. J. of Supercomputer Appl.}, 7:64--82, 1993.

\bibitem[A115]{A115}
{Amestoy, P. R.} and {Duff, I. S.}
\newblock {MUPS}~: {A} parallel package for solving sparse unsymmetric sets of
  linear equations.
\newblock {Tech. Report}, CERFACS, 1994.

\bibitem[A51]{A51}
{Amorim, C. L.}
\newblock Simulated performance of a class of vector processors.
\newblock In {Kartashev, L. P.} and {Kartashev, S. I.}, editors, {\em Proc.
  $2^{nd}$ International Conference on Supercomputing}, pages 350--358, 1987.

\bibitem[A49]{A49}
{Amorim, C. L.}, {Citro, R.}, {Souza, A. F.}, and {Chaves Filho, E. M.}
\newblock O sistema de computa\c c\~ao paralela {NCP} {I}.
\newblock In {\em Anais do V Simp\'osio Brasileiro de Arquitetura de
  Computadores e Processamento de Alto Desempenho -- XIII Congresso da
  Sociedade Brasileira de Computa\c c\~ao}, pages 89--102, 1993.

\bibitem[A33]{A33}
{Andersen, J.}, {Mitra, G.}, and {Parkinson, D.}
\newblock The scheduling of sparse matrix-vector multiplication on a massively
  parallel {DAP} computer.
\newblock {\em Parallel Computing}, 18:675--697, 1992.

\bibitem[A84]{A84}
{Anderson, D. W.}, {Sparacio, F. J.}, and {Tomasulo, R. M.}
\newblock The {IBM 360 Model 91}~: {Machine} philosophy and instruction
  handling.
\newblock {\em IBM J. of Research and Development}, 11(1):8--24, 1967.

\bibitem[A17]{A17}
{Anderson, E.}, {Bai, Z.}, {Bischof, C.}, {Demmel, J.}, {Dongarra, J. J.}, {Du
  Croz, J.}, {Greenbaum, A.}, {Hammarling, S.}, {McKenney, A.}, {Ostrouchov,
  S.}, and {Sorensen, D. C.}
\newblock {\em {LAPACK} ``{User's Guide}''}.
\newblock SIAM Publications, $2^{nd}$ edition, 1995.

\bibitem[A66]{A66}
{Anderson, E.} and {Saad, Y.}
\newblock Solving sparse triangular linear systems on parallel computers.
\newblock {\em Internat. J. High Speed Comput.}, 1:73--95, 1989.

\bibitem[A92]{A92}
{Anderson, J. P.}
\newblock Program structures for parallel processing.
\newblock {\em Comm. ACM}, 8:786--788, 1965.

\bibitem[A99]{A99}
{Andrews, H. C.}
\newblock Degrees of freedom and modular structure in matrix multiplications.
\newblock {\em IEEE Trans. Comput.}, C-20:133--141, 1971.

\bibitem[A28]{A28}
{Angelaccio, M.} and {Colajanni, M.}
\newblock Subcube matrix decomposition~: {A} unifying view for {LU}
  factorization on multicomputers.
\newblock {\em Parallel Computing}, 20:257--270, 1994.

\bibitem[A97]{A97}
{Anon}.
\newblock {\em Modern Computing Methods}, volume~16 of {\em Notes in Applied
  Science}.
\newblock Her Majesty's Stationery Office, London, 1961.

\bibitem[A114]{A114}
{Anon}.
\newblock {\em Harwell Subroutine Library~: {A} Catalogue of Subroutines
  ({Release 11})}.
\newblock Theoretical Studies Department, AEA Industrial Technology, 1993.

\bibitem[A8]{A8}
{Arantes, R. D.}
\newblock An hybrid approach by symbolic processing for the efficient solution
  of sparse linear systems with static structure specially applicable to
  interior point methods for linear programming.
\newblock {Tech. Report} 102/91, CEPEL Electric Energy Research Center, Rio de
  Janeiro, 1990.
\newblock (in Portuguese).

\bibitem[A25]{A25}
{Arantes, R. D.}
\newblock Symbolic methodologies for the efficient solution of sparse linear
  systems with static structure.
\newblock Master's thesis, Systems and Computation Engineering Dept., COPPE /
  Federal University of Rio de Janeiro, Rio de Janeiro, Brazil, 1994.
\newblock (in Portuguese).

\bibitem[A121]{A121}
{Arantes, R. D.}
\newblock New methodologies for the solution of sparse positive definite linear
  systems.
\newblock In {\em Annals of XIX National Congress of Computational and Applied
  Mathematics}, pages 419--420, Goi\^ania, Brazil, 1996.
\newblock (in Portuguese).

\bibitem[A120]{A120}
{Arantes, R. D.}
\newblock {\em Structural Codifications for the Scalar Solution of Sparse
  Symmetric Positive Definite Linear Systems}.
\newblock PhD thesis, Systems and Computation Engineering Dept., COPPE /
  Federal University of Rio de Janeiro, Rio de Janeiro, Brazil, 1996.
\newblock (in Portuguese).

\bibitem[A123]{A123}
{Arantes, R. D.}
\newblock Code orderings for the solution of sparse positive definite linear
  systems, September 1997.
\newblock (Talk to be presented at the II Pan American Workshop on Applied and
  Computational Mathematics).

\bibitem[A122]{A122}
{Arantes, R. D.}
\newblock Implicit reorderings for the scalar solution of sparse positive
  definite linear systems, February 1997.
\newblock (Talk presented at the 2nd Summer School of the Brazilian National
  Laboratory for Scientific Computation).

\bibitem[A50]{A50}
{Arantes, R. D.} and {Amorim, C. L.}
\newblock Parallel solution of sparse systems of linear equations.
\newblock In {\em Annals of V Brazilian Symposium of Computer Architectures and
  High Performance Computing -- XIII Congress of the Brazilian Computing
  Society}, pages 202--216, Florian\'opolis, Brazil, 1993.
\newblock (in Portuguese).

\bibitem[A40]{A40}
{Arden, B. W.}
\newblock {\em An Introduction to Digital Computing}.
\newblock Addison-Wesley, 1963.

\bibitem[A39]{A39}
{Arden, B. W.} and {Astill, K. N.}
\newblock {\em Numerical Algorithms~: Origins and Applications}.
\newblock Addison-Wesley, 1970.

\bibitem[A102]{A102}
{Argyris, J. H.}, editor.
\newblock {\em Energy Theorems and Structural Analysis}.
\newblock Butterworths, London, 1960.

\bibitem[A90]{A90}
{Argyris, J. H.}, editor.
\newblock {\em Recent Advances in Matrix Methods of Structural Analysis}.
\newblock Macmillan, New York, 1964.

\bibitem[A16]{A16}
{Arioli, M.}, {Demmel, J. W.}, and {Duff, I. S.}
\newblock Solving sparse linear systems with sparse backward error.
\newblock {Tech. Report} CSS-214, Computer Science and Systems Division, AERE,
  Harwell Laboratory, Didcot, England, 1988.
\newblock ({Published at SIAM J. Matrix Anal. Appl. 10(2):165--190, 1989}).

\bibitem[A68]{A68}
{Arioli, M.} and {Duff, I. S.}
\newblock Experiments tearing large sparse systems.
\newblock {Tech. Report} CSS-217, Computer Science and Systems Division, AERE,
  Harwell Laboratory, Didcot, England, 1988.
\newblock (To be published at {Proc. of Advances in Numerical Computation},
  from {National Propulsion Laboratory, 1987} in the memory of {James
  Wilkinson}).

\bibitem[A78]{A78}
{Arioli, M.}, {Duff, I. S.}, {Noailles, J.}, and {Ruiz, D.}
\newblock A block projection method for sparse matrices.
\newblock {\em SIAM J. Sci. and Stat. Comput.}, 13:47--70, 1990.

\bibitem[A42]{A42}
{Arioli, M.}, {Duff, I. S.}, and {Rijk, P. P. M.}
\newblock On the augmented system approach to sparse least-squares problem.
\newblock {\em Numer. Math.}, 55:667--684, 1989.

\bibitem[A55]{A55}
{Armijo, L.}
\newblock Minimization of functions having {Lipschitz-continuous} first partial
  derivatives.
\newblock {\em Pacific J. Math.}, 16:1--3, 1980.

\bibitem[A101]{A101}
{Armstrong, B. A.}
\newblock Near minimal matrix profiles and wavefronts for testing nodal
  resequencing algorithms.
\newblock {\em Int. J. Numer. Meth. Eng.}, 21:1785--1790, 1986.

\bibitem[A103]{A103}
{Arnborg, S.}
\newblock Efficient algorithms for combinatorial problems on graphs with
  bounded decomposability~: {A} survey.
\newblock {\em BIT}, 25:2--23, 1985.

\bibitem[A104]{A104}
{Arnborg, S.}, {Corneil, D. G.}, and {Proskurowski, A.}
\newblock Complexity of finding embebdings in a k-tree.
\newblock {\em SIAM J. Alg. and Discr. Meth.}, 8:277--284, 1987.

\bibitem[A105]{A105}
{Arnborg, S.}, {Lagergren, J.}, and {Seese, D.}
\newblock Easy problems for tree-decomposable graphs.
\newblock {\em J. of Algorithms}, 12:308--340, 1991.

\bibitem[A91]{A91}
{ASCE}.
\newblock {Extensive Bibliography on the use of Digital Computers in Structural
  Engineering}.
\newblock {J. Amer. Soc. Civil Engrs., Structural Division, 89, pp. 461--491},
  1963.

\bibitem[A14]{A14}
{Ashcraft, C.}
\newblock A vector implementation of the multifrontal method for large sparse
  symmetric positive definite linear systems.
\newblock {Tech. Report} ETA-TR-51, Engineering Technology Applications (ETA)
  Division, Boeing Computer Services, Seattle, Washington, 1987.

\bibitem[A60]{A60}
{Ashcraft, C.}
\newblock {\em The Aggregate Model for the Factorization of Symmetric Positive
  Definite Matrices}.
\newblock PhD thesis, Dept. of Computer Science, Yale Univ., New Haven, 1990.

\bibitem[A34]{A34}
{Ashcraft, C.}
\newblock The domain/segment partition for the factorization of sparse
  symmetric positive definite matrices.
\newblock {Tech. Report} ECA-TR-148, Engineering Computing and Analysis (ECA)
  Division, Boeing Computer Services, Seattle, Washington, 1990.

\bibitem[A117]{A117}
{Ashcraft, C.}
\newblock Compressed graphs and the minimum degree algorithm.
\newblock {\em SIAM J. Sci. and Stat. Comput.}, 1995.
\newblock ({Tech. Report BCS-TECH-93-024, Boeing Computer Services, To be
  published}).

\bibitem[A13]{A13}
{Ashcraft, C.}, {Eisenstat, S. C.}, and {Liu, J. W. H.}
\newblock A fan-in algorithm for distributed sparse numerical factorization.
\newblock {\em SIAM J. Sci. and Stat. Comput.}, 11(3):593--599, 1990.

\bibitem[A10]{A10}
{Ashcraft, C.}, {Eisenstat, S. C.}, {Liu, J. W. H.}, {Peyton, B.}, and
  {Sherman, A. H.}
\newblock A compute-ahead implementation of the fan-in sparse distributed
  factorization scheme.
\newblock {Tech. Report} ORNL-TM-11496, Oak Ridge National Laboratory, 1990.

\bibitem[A9]{A9}
{Ashcraft, C.}, {Eisenstat, S. C.}, {Liu, J. W. H.}, and {Sherman, A. H.}
\newblock A comparison of 3 column-based distributed sparse factorization
  schemes.
\newblock {Tech. Report} YALEU-DCS-RR-810, Dept. of Computer Science, Yale
  Univ., 1990.

\bibitem[A11]{A11}
{Ashcraft, C.} and {Grimes, R. G.}
\newblock The influence of relaxed supernode partitions on the multifrontal
  method.
\newblock {\em ACM Trans. Math. Software}, 15(4):291--309, 1989.

\bibitem[A12]{A12}
{Ashcraft, C.}, {Grimes, R. G.}, {Lewis, J. G.}, {Peyton, B. W.}, and {Simon,
  H. D.}
\newblock Progress in sparse matrix methods for large linear systems on vector
  supercomputers.
\newblock {\em Int. J. of Supercomputer Appl.}, 1(4):10--30, 1987.

\bibitem[A75]{A75}
{Ashcraft, C.}, {Lewis, J. G.}, and {Peyton, B. W.}
\newblock A supernodal implementation of general sparse factorization for
  vector computers.
\newblock {Tech. Report} ETA-TR-52, ETA Division, Boeing Computer Services,
  Seattle, Washington, 1987.

\bibitem[A119]{A119}
{Ashcraft, C.} and {Liu, J. W. H.}
\newblock Generalized nested dissection~: {Some} recent progress.
\newblock In {\em Proc. $5^{th}$ SIAM Conf. on Applied Linear Algebra},
  Snowbird, Utah, 1994.

\bibitem[A118]{A118}
{Ashcraft, C.} and {Liu, J. W. H.}
\newblock A partition improvement algorithm for generalized nested dissection.
\newblock {Tech. Report} BCS-TECH-94-020, Boeing Computer Services, Seattle,
  1994.

\bibitem[A116]{A116}
{Ashcraft, C.} and {Liu, J. W. H.}
\newblock Using domain decomposition to find graph bisectors.
\newblock {Tech. Report} CS-95-08, Dept. of Computer Science, York Univ., North
  York, Ontario, 1995.

\bibitem[A64]{A64}
{Aspvall, B.} and {Gilbert, J. R.}
\newblock Graph coloring using eigenvalue decomposition.
\newblock {\em SIAM J. Alg. and Discr. Methods}, 5:526--538, 1984.

\bibitem[A63]{A63}
{Aspvall, B.} and {Stone, R. E.}
\newblock {Khachiyan's} linear programming algorithm.
\newblock {\em J. Algorithms}, 1:1--13, 1980.

\bibitem[A20]{A20}
{Atkinson, K. E.}
\newblock {\em An Introduction to Numerical Analysis}.
\newblock John Wiley \& Sons, 1978.

\bibitem[A98]{A98}
{Atkinson, L. V.}
\newblock Hashing matrix subscripts.
\newblock {\em BIT}, 15:328--330, 1975.

\bibitem[A56]{A56}
{Avriel, M.}
\newblock {\em Nonlinear Programming~: Analysis and Methods}.
\newblock Prentice-Hall, 1976.

\bibitem[A52]{A52}
{Aykanat, C.}, {Ozguner, F.}, {Ercal, F.}, and {Sadayapan, P.}
\newblock Iterative algorithms for solution of large sparse systems of linear
  equations on hypercubes.
\newblock {\em IEEE Trans. Comput.}, C-37(12), 1988.

\bibitem[A47]{A47}
{Azevedo, G. P.}
\newblock Uma nova estrat\'egia para a solu\c c\~ao de problemas de estima\c
  c\~ao de estado com restri\c c\~oes de igualdade.
\newblock Master's thesis, COPPE/UFRJ, 1989.

\bibitem[B33]{B33}
{Baase, S.}
\newblock {\em Computer Algorithms}.
\newblock Addison-Wesley, $2^{nd}$ edition, 1985.

\bibitem[B141]{B141}
{Bacher, R.} and {Tinney, W. F.}
\newblock Faster local power flow solutions~: {The} zero mismatch approach.
\newblock {\em IEEE Trans. Power Systems}, PWRS-4(4):1345--1354, 1989.

\bibitem[B40]{B40}
{Backus, J.}
\newblock The history of {FORTRAN} {I}, {II}, and {III}.
\newblock {\em Annals of the History of Computing}, 1:21--37, 1979.

\bibitem[B14]{B14}
{Bailey, D. H.}
\newblock Extra high speed matrix multiplication on the {CRAY-2}.
\newblock {\em SIAM J. Sci. and Stat. Comput.}, 9:603--607, 1988.

\bibitem[B105]{B105}
{Bailey, D. H.}, {Bj{\o }rstad, P. E.}, {Gilbert, J. R.}, {Mascagni, M. D.},
  {Schreiber, R.}, {Simon, H. D.}, {Torczon, V. J.}, and {Watson, L. T.},
  editors.
\newblock {\em Proc. $7^{th}$ {SIAM} Conference on Parallel Processing for
  Scientific Computing}.
\newblock SIAM Publications, 1995.

\bibitem[B15]{B15}
{Bailey, D. H.}, {Lee, K.}, and {Simon, H. D.}
\newblock Using {Strassen's} algorithm to accelerate the solution of linear
  systems.
\newblock ({Manuscript}), 1990.

\bibitem[B112]{B112}
{Baker, J. M.}
\newblock A note on multiplying {Boolean} matrices.
\newblock {\em Comm. ACM}, 5:102, 1962.

\bibitem[B166]{B166}
{Bakoglu, H. B.}, {Grohoski, G. F.}, {Thatcher, L. E.}, {Kahle, J. A.}, {Moore,
  C. R.}, {Tuttle, D. P.}, {Maule, W. E.}, {Hardell, W. R.}, {Hicks, D. A.},
  {Nguyen phu, M.}, {Montoye, R. K.}, {Glover, W. T.}, and {Dhawan, S.}
\newblock Ibm second-generation {RISC} machine organization.
\newblock In {\em Proc. International Conference on Computer Design}, pages
  138--142. IEEE, 1989.

\bibitem[B152]{B152}
{Bank, R. E.}
\newblock {FORTRAN} implementation of marching algorithms.
\newblock {Tech. Report} TR-17-75, Center for Research in Computing Technology,
  Harvard Univ., Cambridge, 1975.

\bibitem[B120]{B120}
{Bank, R. E.}
\newblock {\em Marching Algorithms for Elliptic Boundary Value Problems}.
\newblock PhD thesis, Harvard Univ., 1975.

\bibitem[B117]{B117}
{Bank, R. E.}
\newblock Marching algorithms and block {Gaussian} elimination.
\newblock In {Bunch, J. R.} and {Rose, D. J.}, editors, {\em Sparse Matrix
  Computations}. Academic Press, 1976.

\bibitem[B104]{B104}
{Bank, R. E.}
\newblock {\em {PLTMG}~: A Software Package for Solving Elliptic Partial
  Differential Equations, ``{User's Guide}'' 7.0}.
\newblock SIAM Publications, 1994.

\bibitem[B116]{B116}
{Bank, R. E.} and {Rose, D. J.}
\newblock Marching algorithms for elliptic boundary value problems -- {I}~:
  {The} constant coefficient case.
\newblock {\em SIAM J. Numer. Anal.}

\bibitem[B115]{B115}
{Bank, R. E.} and {Rose, D. J.}
\newblock An ${O}(n^2)$ method for solving constant coefficient boundary value
  problems in two dimensions.
\newblock {\em SIAM J. Numer. Anal.}

\bibitem[B2]{B2}
{Bank, R. E.} and {Rose, D. J.}
\newblock On the complexity of sparse {Gaussian} elimination via bordering.
\newblock {\em SIAM J. Sci. and Stat. Comput.}, 11(1):145--160, 1990.

\bibitem[B1]{B1}
{Bank, R. E.} and {Smith, R. K.}
\newblock General sparse elimination requires no permanent integer storage.
\newblock {\em SIAM J. Sci. and Stat. Comput.}, 8(4):574--584, 1987.

\bibitem[B44]{B44}
{Barbosa, V. C.}, {Fernandes, E. S. T.}, and {Amorim, C. L.}
\newblock Perspectivas em processamento paralelo para computa\c c\~ao cient\'\i
  fica.
\newblock {\em Pesquisa Operacional}, 8(1):20--40, 1988.

\bibitem[B60]{B60}
{Barbosa, V. C.} and {Lima, P. M. V.}
\newblock On the distributed parallel simulation of {Hopfield's} neural
  networks.
\newblock {\em Software Practice and Experience}, 20(10):967--983, 1990.

\bibitem[B64]{B64}
{Bard, Y.}
\newblock {\em Nonlinear Parameter Estimation}.
\newblock Academic Press, 1970.

\bibitem[B3]{B3}
{Barker, V. A.}
\newblock {\em Course in Advanced Sparse Matrix Techniques~: {Copenhagen}
  1976}, volume 572 of {\em Lecture Notes in Mathematics}.
\newblock Springer-Verlag, 1977.

\bibitem[B138]{B138}
{Barnes, G. H.}, {Brown, R. M.}, {Kato, M.}, {Kuck. D. J.}, {Slonick, D. L.},
  and {Stokes, R. A.}
\newblock The {ILLIAC IV} computer.
\newblock {\em IEEE Trans. Comput.}, C-17:746--757, 1968.

\bibitem[B11]{B11}
{Barret, R.}, {Berry, M.}, {Chan, T.}, {Demmel, J.}, {Donato, J.}, {Dongarra,
  J.}, {Eijkhout, V.}, {Romine, C.}, and {van der Vorst, H.}
\newblock {\em Templates for the Solution of Linear Systems~: Building Blocks
  for Iterative Methods}.
\newblock SIAM Publications, 1993.

\bibitem[B86]{B86}
{Barret, W. W.}, {Johnson, C. R.}, {Olesky, D. D.}, and {van den Driessche, P.}
\newblock Inherited matrix entries~: {Principal} submatrices of the inverse.
\newblock {\em SIAM J. Alg. and Discr. Methods}, 8:313--322, 1987.

\bibitem[B139]{B139}
{Barron, D. W.}, editor.
\newblock {\em Recursive Techniques in Programming}.
\newblock American Elsevier, 1968.

\bibitem[B136]{B136}
{Barron, D. W.} and {Swinnerton-Dyer, H. P. F.}
\newblock Solution of simultaneous linear equations using a magnetic tape
  store.
\newblock {\em Computing J.}, 3:28--33, 1960.

\bibitem[B124]{B124}
{Bartels, R. H.}
\newblock A stabilization of the simplex method.
\newblock {\em Numer. Math.}, 16:414--434, 1971.

\bibitem[B123]{B123}
{Bartels, R. H.} and {Golub, G. H.}
\newblock The simplex method of linear programming using {LU} decomposition.
\newblock {\em Comm. ACM}, 12:266--268, 1969.

\bibitem[B70]{B70}
{Bartholomew-Biggs, M. C.}
\newblock Recursive quadratic programming methods for nonlinear constraints.
\newblock In {Powell, M. J. D.}, editor, {\em Nonlinear Optimization 1981}.
  Academic Press, 1982.

\bibitem[B84]{B84}
{Barwell, V.} and {George, A.}
\newblock A comparison of algorithms for solving symmetric indefinite systems
  of linear equations.
\newblock {\em ACM Trans. Math. Software}, 2:242--251, 1976.

\bibitem[B125]{B125}
{Baskow. T. R.}, editor.
\newblock {\em Engineering Applications of Digital Computers}.
\newblock Academic Press, 1968.

\bibitem[B154]{B154}
{Baty, J. P.} and {Stewart, K. L.}
\newblock Dissection of structures.
\newblock {\em J. Struct. Div. ASCE}, 5:217--232, 1967.

\bibitem[B155]{B155}
{Baty, J. P.} and {Stewart, K. L.}
\newblock Organization of network equations using dissection theory.
\newblock In {Reid, J. K.}, editor, {\em Large Sparse Sets of Linear
  Equations}, pages 169--190. Academic Press, 1971.

\bibitem[B100]{B100}
{Bau, D.} and {Trefethen, L. N.}
\newblock {\em Numerical Linear Algebra}.
\newblock SIAM Publications, 1996.
\newblock (To be published).

\bibitem[B132]{B132}
{Bauer, F. L.}
\newblock Optimally scaled matrices.
\newblock {\em Numer. Math.}, 5:73--87, 1963.

\bibitem[B133]{B133}
{Bauer, F. L.}
\newblock Remarks on optimally scaled matrices.
\newblock {\em Numer. Math.}, 13:1--3, 1969.

\bibitem[B17]{B17}
{Bauer, F. L.} et~al.
\newblock {\em Compiler Construction, An Advanced Course}, volume~21 of {\em
  Lecture Notes in Computer Science}.
\newblock Springer-Verlag, 1974.

\bibitem[B52]{B52}
{Baumann, R.}
\newblock Some new aspects on load-flow calculation -- {I}~: {Impedance} matrix
  generation controlled by network topology.
\newblock In {\em Power System Computation Conference}, Stockholm, 1966.

\bibitem[B169]{B169}
{Bayer, D. A.} and {Lagarias, J. C.}
\newblock The nonlinear geometry of linear programming -- {I}~: Affine and
  projective scaling trajectories.
\newblock {\em Trans. of the American Math. Soc.}, 314:499--526, 1989.

\bibitem[B50]{B50}
{Bayer, D. A.} and {Lagarias, J. C.}
\newblock The nonlinear geometry of linear programming -- {II}~: {Legendre}
  transform coordinates.
\newblock {\em Trans. of the American Math. Soc.}, 314:527--581, 1989.

\bibitem[B63]{B63}
{Bayer, R.} and {McCreight}.
\newblock Organization and maintenance of large ordered indexes.
\newblock {\em Acta Informatica}, 1:173--189, 1972.

\bibitem[B77]{B77}
{Beale, E. M. L.}
\newblock {\em Nonlinear Programming using a General Mathematical Programming
  System}.
\newblock Design and Implementation of Optimization Software. Stijthoff and
  Noordhoff, Holland, 1978.

\bibitem[B65]{B65}
{Beale, F.}
\newblock Numerical methods.
\newblock In {Abadie, J.}, editor, {\em Nonlinear Programming}. North-Holland,
  1967.

\bibitem[B172]{B172}
{Beasley, J. E.}
\newblock An {SST}-based algorithm for the {Steiner} problem in graphs.
\newblock {\em Networks}, 19:1--16, 1989.

\bibitem[B135]{B135}
{Belady, L. A.}
\newblock A study of replacement algorithms for a virtual-storage computer.
\newblock {\em IBM Systems Journal}, 5:78--101, 1966.

\bibitem[B156]{B156}
{Belady, L. A.} and {Kuehner, C. J.}
\newblock Dynamic space-sharing computer systems.
\newblock {\em Comm. ACM}, 12:282--285, 1969.

\bibitem[B168]{B168}
{Bell, C. G.}, {Cady, R.}, {McFarland, H.}, {DeLagi, B.}, {O'Laughlin, J.},
  {Noonan, R.}, and {Wulf, W.}
\newblock A new architecture for mini-computers~: {The} {DEC PDP-11}.
\newblock In {\em Proc. {AFIPS} {SJCC}}, pages 657--675, 1970.

\bibitem[B167]{B167}
{Bell, C. G.} and {Newell, A.}, editors.
\newblock {\em Computer Structures~: {Readings} and Examples}.
\newblock McGraw-Hill, 1971.

\bibitem[B39]{B39}
{Bell, E. T.}
\newblock {\em Men of Mathematics}.
\newblock Simon and Schuster, 1975.

\bibitem[B80]{B80}
{BELL Labs.}
\newblock {BELL System Tech. Journal}, 57(6), part 2, 1978.
\newblock ({Special Issue} devoted to {UNIX}).

\bibitem[B146]{B146}
{Bellman, R.}
\newblock Dynamic programming treatment of the traveling salesman problem.
\newblock {\em J. ACM}, 9, 1962.

\bibitem[B102]{B102}
{Bellman, R.}
\newblock {\em Introduction to Matrix Analysis}.
\newblock SIAM Publications, 1995.
\newblock ({First edition by McGraw-Hill, 1960}).

\bibitem[B111]{B111}
{Bellman, R.}, {Cooke, K. L.}, and {Lockett, J. A.}
\newblock {\em Algorithms, Graphs and Computers}.
\newblock Academic Press, 1970.

\bibitem[B145]{B145}
{Bellmore, M.} and {Nemhauser, G. L.}
\newblock The traveling salesman problem~: {A} survey.
\newblock {\em Operations Res.}, 16:538--558, 1968.

\bibitem[B18]{B18}
{Ben-Ari, M.}
\newblock {\em Principles of Concurrent Programming}.
\newblock Prentice-Hall, 1982.

\bibitem[B34]{B34}
{Bender, C. M.} and {Orszag, S. A.}, editors.
\newblock {\em Advanced Mathematical Methods for Scientists and Engineers}.
\newblock McGraw-Hill, 1978.

\bibitem[B110]{B110}
{Benders, J. F.}
\newblock Partitioning procedures for solving mixed-variable programming
  problems.
\newblock {\em Numer. Math.}, 4:238--252, 1962.

\bibitem[B9]{B9}
{Benner, R.}, {Montry, G.}, and {Weigand, G.}
\newblock Concurrent multifrontal methods~: {Shared} memory, cache and
  frontwidth issues.
\newblock {\em Int. J. of Supercomputer Appl.}, 1(3):26--44, 1987.

\bibitem[B127]{B127}
{Bennet, J. M.}
\newblock Triangular factors of modified matrices.
\newblock {\em Numer. Math.}, 7:216--221, 1965.

\bibitem[B58]{B58}
{Bentley, J. L.}
\newblock {\em Writing Efficient Programs}.
\newblock Prentice-Hall, 1982.

\bibitem[B21]{B21}
{Bentley, J. L.}
\newblock {\em Programming Pearls}.
\newblock Addison-Wesley, 1986.

\bibitem[B59]{B59}
{Bentley, J. L.}
\newblock More {P}rogramming {P}earls, 1988.

\bibitem[B79]{B79}
{Bentley, J. L.}, {Weide, B. W.}, and {Yao, A. C.}
\newblock Optimal expected-time algorithms for closest point problems.
\newblock {\em ACM Trans. Math. Software}, 6:563--580, 1980.

\bibitem[B23]{B23}
{Berge, C.}
\newblock {\em The Theory of Graphs and its Applications}.
\newblock John Wiley \& Sons, 1962.

\bibitem[B164]{B164}
{Berge, C.}, editor.
\newblock {\em The Theory of Graphs, International Symposium}, Rome, 1967.
  Dunod.

\bibitem[B22]{B22}
{Berge, C.}
\newblock {\em Graphs and Hypergraphs}.
\newblock North-Holland, 1973.

\bibitem[B178]{B178}
{Berger, A.}, {Mulvey, J.}, {Rothberg, E.}, and {Vanderbei, R.}
\newblock Solving multistage stochastic programs using tree dissection.
\newblock {Tech. Report} SOR-97-07, Program in Statistics and Operations
  Research, Princeton Univ., New Jersey, 1995.

\bibitem[B87]{B87}
{Berman, P.} and {Schnitger, G.}
\newblock On the performance of the minimum degree ordering for {Gaussian}
  elimination.
\newblock {\em SIAM J. Matrix Anal. and Appl.}, 11:83--88, 1990.

\bibitem[B95]{B95}
{Berry, M.}
\newblock A {FORTRAN-77} software library for the sparse singular value
  decomposition.
\newblock {Tech. Report} CS-92-159, Univ. of Tennessee, Knoxville, 1992.

\bibitem[B96]{B96}
{Berry, M.}
\newblock {SVDPACKC}~: version 1.0 ``{User's Guide}''.
\newblock {Tech. Report} CS-93-194, Univ. of Tennessee, Knoxville, 1993.

\bibitem[B97]{B97}
{Berry, M.}
\newblock A survey of public-domain {Lanczos}-based software.
\newblock In {Brown, J. D.}, {Chu, M. T.}, {Ellison, D. C.}, and {Plemmons, R.
  J.}, editors, {\em Proc. of the {Cornelius} {Lanczos} International Centenary
  Conference, Rayleigh, 1993}, pages 332--334. SIAM Publications, 1994.

\bibitem[B91]{B91}
{Berry, R. D.}
\newblock An optimal ordering of electronic circuit equations for a sparse
  matrix solution.
\newblock {\em IEEE Trans. Circuit Theory}, CT-18:139--145, 1971.

\bibitem[B66]{B66}
{Bertsekas, D. P.}
\newblock On penalty and multiplier methods for constrained optimization.
\newblock {\em SIAM J. Control and Optim.}, 14:216--235, 1976.

\bibitem[B67]{B67}
{Bertsekas, D. P.}
\newblock On the {Goldstein-Levitin-Polyak} gradient projection method.
\newblock {\em IEEE Trans. Automatic Control}, 21:174--184, 1976.

\bibitem[B68]{B68}
{Bertsekas, D. P.}
\newblock {\em Constrained Optimization and Lagrange Multiplier Methods}.
\newblock Academic Press, 1982.

\bibitem[B69]{B69}
{Bertsekas, D. P.}
\newblock Projected {Newton} methods for optimization problems with simple
  constraints.
\newblock {\em SIAM J. Control and Optim.}, 20(2):221--246, 1982.

\bibitem[B46]{B46}
{Bertsekas, D. P.} and {Eckstein, J.}
\newblock Dual coordinate step methods for linear network flow problems.
\newblock {\em Math. Programming}, 42(2):203--244, 1988.

\bibitem[B13]{B13}
{Bertsekas, D. P.} and {Tsitsiklis, J. N.}
\newblock {\em Parallel and Distributed Computation -- {N}umerical Methods}.
\newblock Prentice Hall, 1989.

\bibitem[B8]{B8}
{Betancourt, R.}
\newblock An efficient heuristic ordering algorithm for partial matrix
  refactorization.
\newblock {\em IEEE Trans. Power Systems}, PWRS-3(3):1181--1187, 1988.

\bibitem[B82]{B82}
{Bhat, M. V.}, {Habash, W. G.}, {Liu, J. W. H.}, {Nguyen, V. N.}, and {Peeters,
  M. F.}
\newblock A note on nested dissection for regular grids.
\newblock {\em SIAM J. Matrix Anal. and Appl.}, 14(1):253--258, 1993.

\bibitem[B131]{B131}
{Bickley, W. G.} and {McNamee, J.}
\newblock Matrix and other direct methods for the solution of systems of linear
  difference equations.
\newblock {\em Philos. Trans. Royal Soc. London, series A}, 252:69--131, 1960.

\bibitem[B29]{B29}
{Bik, A. J. C.} and {Wijshoff, H. A. G.}
\newblock Compilation techniques for sparse matrix computations.
\newblock In {\em ACM International Conference on Supercomputing}, Tokyo, 1993.

\bibitem[B51]{B51}
{Birge, J. R.}, {Freund, R. M.}, and {Vanderbei, R. J.}
\newblock Prior reduced fill-in in solving equations in interior point
  algorithms.
\newblock {\em Operations Res. Letters}, 11:195--198, 1992.

\bibitem[B89]{B89}
{Birkhoff, G.} and {George, A.}
\newblock Elimination by nested dissection.
\newblock In {Traub, J. F.}, editor, {\em Complexity of Sequential and Parallel
  Numerical Algorithms}. Academic Press, 1973.

\bibitem[B129]{B129}
{Birkhoff, G.} and {Varga, R. S.}
\newblock Implicit alternating direction methods.
\newblock {\em Trans. Amer. Math. Soc.}, 92:13--24, 1959.

\bibitem[B153]{B153}
{Birkhoff, G.} and {Varga, R. S.}, editors.
\newblock {\em Numerical Solution of Field Problems in Continuum Physics}.
\newblock American Math. Soc., Providence, 1970.

\bibitem[B128]{B128}
{Birkhoff, G.}, {Varga, R. S.}, and {Young, D. M.}
\newblock Alternating direction implicit method.
\newblock In {\em Advances in Computers, volume {3}}, pages 189--273. Academic
  Press, 1962.

\bibitem[B130]{B130}
{Birkhoff, G.}, {Young, D. M.}, and {Zarantonello, E. H.}
\newblock Numerical methods in conformal mapping.
\newblock In {Abadie, J.}, editor, {\em Proc. of the Symposium Applied
  Mathematics, volume {4}}, pages 117--140. McGraw-Hill, 1953.

\bibitem[B173]{B173}
{Bischof, C. H.}, {Carle, A.}, {Khademi, P.}, and {Maurer, A.}
\newblock The {ADIFOR} 2.0 system for the automatic differentiation of {FORTRAN
  77} programs.
\newblock {Tech. Report} CPRC-TR-94-491, Center for Research on Parallel
  Computation, Rice Univ., Houston, Texas, 1994.

\bibitem[B30]{B30}
{Bischof, C. H.} and {Dongarra, J. J.}
\newblock A project for developing a linear algebra library for
  high-performance computers.
\newblock {Tech. Report} MCS-P-105-0989, Argonne National Laboratory, 1989.

\bibitem[B93]{B93}
{Bischof, C. H.} and {Hovland, P.}
\newblock Using {ADIFOR} to compute dense and sparse {Jacobians}.
\newblock {Tech. Memorandum} ANL-MCS-TM-158, Mathematics and Computer Science
  Division, Argonne National Laboratory, 1991.
\newblock ({ADIFOR} {Working Note} \# 2).

\bibitem[B98]{B98}
{Bischof, C. H.}, {Lewis, J. G.}, and {Pierce, D. J.}
\newblock Incremental condition estimation for sparse matrices.
\newblock {\em SIAM J. Matrix Anal. Appl.}, 11:644--659, 1990.

\bibitem[B99]{B99}
{Bischof, C. H.}, {Pan, C. T.}, and {Tang, P. T. P.}
\newblock A {Cholesky} up-and-downdating algorithm for systolic and {SIMD}
  architectures.
\newblock {\em SIAM J. Sci. and Stat. Comput.}, 1992.
\newblock (To be published).

\bibitem[B174]{B174}
{Bisseling, R.}, {Doup, T.}, and {Loyens, L.}
\newblock A parallel interior point algorithm for linear programming on a
  network of transputers.
\newblock {\em Annals of Oper. Res.}, 43:51--86, 1993.

\bibitem[B49]{B49}
{Bixby, R. E.}
\newblock Implementing the simplex method~: {The} initial basis.
\newblock {\em ORSA J. Computing}, 4(3):267--284, 1992.

\bibitem[B25]{B25}
{Bixby, R. E.}
\newblock Progress in linear programming.
\newblock {\em ORSA J. Computing}, 6(1):15--22, 1994.

\bibitem[B47]{B47}
{Bixby, R. E.}, {Dennis, J. E. Jr.}, and {Wu, Z.}
\newblock Solving nonlinear integer programs with a subgradient approach on
  parallel computers.
\newblock {\em SIAM News}, 25(4):1, 18--19, 1992.

\bibitem[B48]{B48}
{Bixby, R. E.}, {Gregory, J. W.}, {Lustig, I. J.}, {Marsten, R. E.}, and
  {Shanno, D. F.}
\newblock Very large-scale linear programming~: {A} case study in combining
  interior point and simplex methods.
\newblock {\em Operations Res.}, 40:885--897, 1992.

\bibitem[B94]{B94}
{Bj{\o }rstad, P. E.}
\newblock A large scale, sparse, secondary storage, direct linear equation
  solver for structural analysis and its implementation on vector and parallel
  architectures.
\newblock {\em Parallel Computing}, 5:3--12, 1987.

\bibitem[B163]{B163}
{Bj{\"o}rck, A.}
\newblock Solving linear least squares problems by {Gram-Schmidt}
  orthogonalization.
\newblock {\em BIT}, 7:1--21, 1967.

\bibitem[B162]{B162}
{Bj{\"o}rck, A.}
\newblock Methods for sparse least squares problems.
\newblock In {Bunch, J. R.} and {Rose, D. J.}, editors, {\em Sparse Matrix
  Computations}. Academic Press, 1976.

\bibitem[B71]{B71}
{Bj{\"o}rck, A.}
\newblock A direct method for sparse least squares problems with lower and
  upper bounds.
\newblock {\em Numer. Math.}, 54:19--32, 1988.

\bibitem[B88]{B88}
{Bj{\"o}rck, A.}
\newblock A note on scaling in the augmented system methods.
\newblock (Unpublished Manuscript), 1991.

\bibitem[B101]{B101}
{Bj{\"o}rck, A.}
\newblock {\em Numerical Methods for Least Squares Problems}.
\newblock SIAM Publications, 1996.
\newblock (To be published).

\bibitem[B54]{B54}
{Bj{\"o}rck, A.} and {Duff, I. S.}
\newblock A direct method for the solution of sparse linear least squares
  problems.
\newblock {Tech. Report}, AERE, Harwell Laboratory, 1979.
\newblock (To be published at {Lin. Alg. Appl.}).

\bibitem[B92]{B92}
{Bj{\"o}rck, A.}, {Plemmons, R. J.}, and {Schneider, H.}, editors.
\newblock {\em Large Scale Matrix Problems}.
\newblock North-Holland, 1981.

\bibitem[B31]{B31}
{Blair, J. R. S.} and {Peyton, B. W.}
\newblock On finding minimum-diameter clique trees.
\newblock {Tech. Report} ORNL-TM-11850, Oak Ridge National Laboratory, 1991.

\bibitem[B107]{B107}
{Bloch, E.}
\newblock The engineering design of the {STRETCH} computer.
\newblock In {\em Proc. Fall Joint Computer Conference}, pages 48--59, 1959.

\bibitem[B26]{B26}
{Blum, L.}
\newblock Lectures on a theory of computation and complexity over the reals (or
  an arbitrary ring).
\newblock {Tech. Report} TR-89-065, International Computer Science Institute,
  Berkeley, 1989.

\bibitem[B106]{B106}
{Blum, L.}, {Shub, M.}, and {Smale, S.}
\newblock On a theory of computation and complexity over the real numbers~:
  {NP}-completeness, recursive functions and universal machines.
\newblock {\em Bull. AMS}, 21(1):1--46, 1989.

\bibitem[B151]{B151}
{Bodewig, E.}
\newblock {\em Matrix Calculus}.
\newblock Amsterdam, $2^{nd}$ edition, 1959.

\bibitem[B83]{B83}
{Bodlaender, H.}, {Gilbert, J. R.}, {Hafsteinsson, H.}, and {Kloks, T.}
\newblock Approximating treewidth, pathwidth, frontsize, and minimum
  elimination tree height.
\newblock {Tech. Report} CSL-90-10, XEROX Palo Alto Research Center, 1990.
\newblock (To be published at {J. Algorithms}).

\bibitem[B175]{B175}
{Bodlaender, H. L.}
\newblock Polynomial algorithms for graph isomorphism and chromatic index on
  partial k-trees.
\newblock {\em J. of Algorithms}, 11:631--644, 1990.

\bibitem[B177]{B177}
{Bodlaender, H. L.}
\newblock A linear time algorithm for finding tree-decompositions of small
  treewidth.
\newblock In {\em Proc. $25^{th}$ Annual Symposium on Theory of Computing},
  pages 226--234. ACM Press, 1993.

\bibitem[B176]{B176}
{Bodlaender, H. L.} and {M{\"o}hring, R. H.}
\newblock The pathwidth and treewidth of cographs.
\newblock {\em SIAM J. Alg. and Discr. Meth.}, 6:181--188, 1993.

\bibitem[B12]{B12}
{Boggs, P. T.}, {Byrd, R. H.}, and {Schnabel, R. B.}, editors.
\newblock {\em Numerical Optimization 1984}.
\newblock SIAM Publications, 1985.

\bibitem[B41]{B41}
{Boisvert, R. F.}, {Howe, S. E.}, and {Kahaner, D. K.}
\newblock The guide to available mathematical software.
\newblock {Tech. Report} PB-84-171305, National Technical Information Service,
  Virginia, 1984.

\bibitem[B24]{B24}
{Bondy, J. A.} and {Murty, U. S. R.}
\newblock {\em Graph Theory with Applications}.
\newblock North-Holland, 1976.

\bibitem[B81]{B81}
{Boom, H. J.} and {De Jong, E.}
\newblock A critical comparison of several programming language
  implementations.
\newblock {\em Software Practice and Experience}, 10(6):435--473, 1980.

\bibitem[B150]{B150}
{Booth, A. D.}
\newblock {\em Numerical Methods}.
\newblock Butterworths, London, 1955.

\bibitem[B170]{B170}
{Boothby}.
\newblock {\em Introduction to Differentiable Manifolds and Riemannian
  Geometry}.
\newblock Academic Press, 1975.

\bibitem[B147]{B147}
{Boothroyd, J.}
\newblock Algorithm 302~: {Transpose} vector stored array.
\newblock {\em Comm. ACM}, 10(5):292--293, 1967.

\bibitem[B62]{B62}
{Borges, C. L. T.}
\newblock Investiga\c c\~ao do desempenho de m\'etodos de solu\c c\~ao do fluxo
  de pot\^encia para processamento paralelo e vetorial.
\newblock Master's thesis, COPPE/UFRJ, 1991.

\bibitem[B61]{B61}
{Borgwardt, K.}
\newblock {\em The Simplex Method~: A Probabilistic Analysis}.
\newblock Springer-Verlag, 1987.

\bibitem[B28]{B28}
{Borosh, I.} and {Fraenkel, A. S.}
\newblock Exact solution of linear equations with rational coefficients by
  congruence techniques.
\newblock {\em Math. of Computation}, 20(93):107--112, 1966.

\bibitem[B171]{B171}
{Borovkov, K. A.}
\newblock {\em Russian-English English-Russian Dictionary on Probability,
  Statistics and Combinatorics}.
\newblock SIAM Publications, 1994.

\bibitem[B142]{B142}
{Bowdler, H. J.}, {Martin, R. S.}, {Peters, G.}, and {Wilkinson, J. H.}
\newblock Solution of real and complex systems of linear equations.
\newblock {\em Numer. Math.}, 8:217--234, 1966.

\bibitem[B38]{B38}
{Boyer, C. B.}
\newblock {\em A History of Mathematics}.
\newblock John Wiley \& Sons, 1968.

\bibitem[B148]{B148}
{Brameller, A.}, {Allan, R. N.}, and {Haman, Y. M.}
\newblock {\em Sparsity}.
\newblock Pittman Press, New York, 1976.

\bibitem[B165]{B165}
{Brandon, D. M. Jr.}
\newblock {\em {IMP} -- ``{General Manual}'', {A} General Simulator for
  Multivariate Differential or Algebraic Systems}.
\newblock Chemical Engineering Dept., Univ. of Connecticut, Storrs, 1972.

\bibitem[B160]{B160}
{Brandon, D. M. Jr.}
\newblock The implementation and use of sparse matrix techniques in general
  simulation programs.
\newblock {\em Computing J.}, 17:165--170, 1974.

\bibitem[B137]{B137}
{Branin, F. H. Jr.}, {Hall, L. V.}, {Suez, J.}, {Carlitz, R. M.}, and {Chen, T.
  C.}
\newblock An interpretative program for matrix arithmetic.
\newblock {\em IBM Systems Journal}, 4:2--24, 1965.

\bibitem[B32]{B32}
{Brassard, G.} and {Bratley, P.}
\newblock {\em Algorithmics~: Theory and Practice}.
\newblock Prentice-Hall, 1988.

\bibitem[B42]{B42}
{Bratley, P.}, {Fox, B. L.}, and {Schrage, L.}
\newblock {\em A Guide to Simulation}.
\newblock Springer-Verlag, 1987.

\bibitem[B159]{B159}
{Brawn, B. S.}, {Gustavson, F. G.}, and {Mankin, E. S.}
\newblock Sorting in a paging environment.
\newblock {\em Comm. ACM}, 13:483--494, 1970.

\bibitem[B72]{B72}
{Brayton, R. K.} and {Cullum, J.}
\newblock An algorithm for minimizing a differentiable function subject to box
  constraints and errors.
\newblock {\em Journal Optim. Theory Appl.}, 29(4):521--558, 1979.

\bibitem[B4]{B4}
{Brayton, R. K.}, {Gustavson, F. G.}, and {Willoughby, R. A.}
\newblock Some results on sparse matrices.
\newblock {\em Math. of Computation}, 24:937--954, 1970.
\newblock ({Originally in Tech. Report RC-2332, IBM Research Center, Yorktown
  Heights, New York, 1969}).

\bibitem[B53]{B53}
{Bree, D. Jr.}
\newblock Some remarks on the application of graph theory to the solution of
  sparse systems of linear equations.
\newblock {Internal Publication}, Bonneville Power Administration, 1964.

\bibitem[B113]{B113}
{Bree, D. Jr.}
\newblock {\em Some Remarks on the Application of Graph Theory to the Solution
  of Sparse Systems of Linear Equations}.
\newblock PhD thesis, Mathematics Dept., Princeton Univ., New Jersey, 1965.

\bibitem[B16]{B16}
{Brent, R. P.}
\newblock Algorithms for matrix multiplication.
\newblock {Tech. Report} CS-157, Computer Science Dept., Stanford Univ., 1970.

\bibitem[B36]{B36}
{Brent, R. P.}
\newblock {\em Algorithms for Minimization Without Derivatives}.
\newblock Prentice-Hall, 1973.

\bibitem[B181]{B181}
{Briggs, P.}
\newblock {\em Register Allocation via Graph Coloring}.
\newblock PhD thesis, Dept. of Computer Science, Rice Univ., 1992.

\bibitem[B43]{B43}
{Briggs, W. L.}
\newblock {\em A Multigrid Tutorial}.
\newblock SIAM Publications, 1987.

\bibitem[B103]{B103}
{Briggs, W. L.}
\newblock {\em The DFT~: An Owner's Manual for the Discrete Fourier Transform}.
\newblock SIAM Publications, 1995.

\bibitem[B37]{B37}
{Brigham, O.}
\newblock {\em The Fast Fourier Transform}.
\newblock Prentice-Hall, 1974.

\bibitem[H63]{H63}
{Brinch Hansen, P.}
\newblock {\em The Architecture of Concurrent Programs}.
\newblock Prentice-Hall, 1977.

\bibitem[B19]{B19}
{Brink, J.} and {Spillman, R.}
\newblock {\em Computer Architecture and {VAX} Assembly Language Programming}.
\newblock The Benjamin/Cummings Co., 1987.

\bibitem[B122]{B122}
{Brooks, D. F.} and {Brotton, D. M.}
\newblock Computer system for analysis of large frameworks.
\newblock {\em Journal ASCE, Structural Division}, 94:1--23, 1968.

\bibitem[B140]{B140}
{Brooks, F. P. Jr.}
\newblock Mass memory in computer systems.
\newblock {\em IEEE Trans.}, MAG-5:635--639, 1969.

\bibitem[B126]{B126}
{Brown, D. C.}
\newblock A unified lunar control network.
\newblock {\em Photogrammetric Engineering}, 34:1272--1292, 1968.

\bibitem[B143]{B143}
{Brown, R. J.} and {Tinney, W. F.}
\newblock Digital solutions for large scale power networks.
\newblock {\em IEEE Trans. Power Apparatus and Systems}, PAS-76(3):347, 1957.

\bibitem[B144]{B144}
{Brown, W. S.}
\newblock An operating environment for dynamic-recursive computer programming
  systems.
\newblock {\em Comm. ACM}, 8(6):371--377, 1965.

\bibitem[B10]{B10}
{Browne, J.}, {Dongarra, J.}, {Karp, A. H.}, {Kennedy, K.}, and {Kuck, D.}
\newblock 1988 {Gordon Bell} prize.
\newblock {\em IEEE Software}, 6:78--85, 1989.
\newblock ({Special Report}).

\bibitem[B114]{B114}
{Broyden, C. G.}
\newblock A new method of solving nonlinear simultaneous equations.
\newblock {\em Computing J.}, 12:94--99, 1969.

\bibitem[B180]{B180}
{Brualdi, R. A.} and {Ryser, H. J.}
\newblock {\em Combinatorial Matrix Theory}.
\newblock Cambridge Univ. Press, 1991.

\bibitem[B179]{B179}
{Brualdi, R. A.} and {Shader, B. L.}
\newblock Strong {Hall} matrices.
\newblock IMA Preprint Series 909, Institute for Mathematics and Its
  Applications, Univ. of Minnesota, 1991.

\bibitem[B20]{B20}
{Bruce, W. H.}
\newblock {\em Recursive Programming Techniques}.
\newblock Addison-Wesley, 1975.

\bibitem[B108]{B108}
{Bucholtz, W.}, editor.
\newblock {\em Planning a Computer System~: Project {STRETCH}}.
\newblock McGraw-Hill, 1962.

\bibitem[B149]{B149}
{Buckingham, R. A.}
\newblock {\em Numerical Methods}.
\newblock Pittman Press, London, 1957.

\bibitem[B109]{B109}
{Bunch, J. R.}
\newblock {\em On Direct Methods for Solving Symmetric Systems of Linear
  Equations}.
\newblock PhD thesis, Univ. of California, Berkeley, 1969.

\bibitem[B6]{B6}
{Bunch, J. R.}
\newblock Analysis of sparse elimination.
\newblock {\em SIAM J. Numer. Anal.}, 11:847--873, 1974.

\bibitem[B55]{B55}
{Bunch, J. R.}
\newblock Partial pivoting strategies for symmetric matrices.
\newblock {\em SIAM J. Numer. Anal.}, 11:521--528, 1974.

\bibitem[B119]{B119}
{Bunch, J. R.}
\newblock Block methods for solving sparse linear systems.
\newblock In {Bunch, J. R.} and {Rose, D. J.}, editors, {\em Sparse Matrix
  Computations}. Academic Press, 1976.

\bibitem[B90]{B90}
{Bunch, J. R.} and {Hopcroft, J. E.}
\newblock Triangular factorization and inversion by fast matrix multiplication.
\newblock {\em Math. Comp.}, 28:231--236, 1974.

\bibitem[B85]{B85}
{Bunch, J. R.} and {Kaufman, L.}
\newblock Some stable methods for calculating inertia and solving symmetric
  indefinite systems of linear equations.
\newblock {\em Math. of Computation}, 31:163--179, 1977.

\bibitem[B56]{B56}
{Bunch, J. R.}, {Kaufman, L.}, and {Parlett, B. N.}
\newblock Decomposition of a symmetric matrix.
\newblock {\em Numer. Math.}, 27:95--110, 1976.

\bibitem[B7]{B7}
{Bunch, J. R.} and {Parlett, B. N.}
\newblock Direct methods for solving symmetric indefinite systems of linear
  equations.
\newblock {\em SIAM J. Numer. Anal.}, 8:639--655, 1971.

\bibitem[B118]{B118}
{Bunch, J. R.} and {Rose, D. J.}
\newblock Partitioning, tearing and modification of sparse linear systems.
\newblock {\em J. Math. Anal. Appl.}, 48:574--593, 1974.

\bibitem[B5]{B5}
{Bunch, J. R.} and {Rose, D. J.}
\newblock {\em Sparse Matrix Computations}.
\newblock Academic Press, 1976.

\bibitem[B27]{B27}
{Buoni, J. J.}, {Farrel, P. A.}, and {Ruttan, A.}
\newblock Algorithms for {LU} decomposition on a shared memory multiprocessor.
\newblock {\em Parallel Computing}, 19:925--937, 1993.

\bibitem[B74]{B74}
{Burke, J.} and {Mor\'e, J.}
\newblock On the identification of active constraints.
\newblock {\em SIAM J. Numer. Anal.}, 25:1197--1211, 1988.

\bibitem[B73]{B73}
{Burke, J.}, {Mor\'e, J.}, and {Toraldo, G.}
\newblock Convergence properties of trust region methods for linear and convex
  constraints.
\newblock {Tech. Report} ANL-MCS-TM-116, Argonne National Laboratory, Argonne,
  Illinois, 1988.

\bibitem[B57]{B57}
{Busacker, R. G.} and {Saaty, T. L.}
\newblock {\em Finite Graphs and Their Networks~: An Introduction with
  Applications}.
\newblock McGraw-Hill, 1965.

\bibitem[B158]{B158}
{Busing, W. R.} and {Levy, H. A.}
\newblock A procedure for inverting large symmetric matrices.
\newblock {\em Comm. ACM}, 8:445--446, 1962.

\bibitem[B134]{B134}
{Businger, P. A.}
\newblock Matrices which can be optimally scaled.
\newblock {\em Numer. Math.}, 12:346--348, 1968.

\bibitem[B121]{B121}
{Businger, P. A.} and {Golub, G. H.}
\newblock Linear least-squares solutions by householder transformations.
\newblock {\em Numer. Math.}, 7:269--276, 1965.

\bibitem[B78]{B78}
{Buzby, B. R.}
\newblock {\em Techniques and Experience Solving Really Big Nonlinear
  Programs}.
\newblock Optimization Methods. English Universities Press, 1974.

\bibitem[B75]{B75}
{Byrd, R. H.}, {Schnabel, R. B.}, and {Shultz, G. A.}
\newblock A trust region algorithm for nonlinearly constrained optimization.
\newblock {Tech. Report} CU-CS-313-85, Dept. of Computer Science, Univ. of
  Colorado at Boulder, Boulder, Colorado, 1985.

\bibitem[B76]{B76}
{Byrd, R. H.}, {Schnabel, R. B.}, and {Shultz, G. A.}
\newblock Approximate solution of the trust region problem by minimization over
  two-dimensional subspaces.
\newblock {\em Math. Programming}, 40:247--263, 1988.

\bibitem[B45]{B45}
{Byrd, R. H.}, {Schnabel, R. B.}, and {Shultz, G. A.}
\newblock Parallel quasi-{Newton} methods for unconstrained optimization.
\newblock {\em Math. Programming}, 42(2):273--306, 1988.

\bibitem[B161]{B161}
{Byrnes, F. D.}
\newblock A program for the direct solution of matrix equations.
\newblock {Tech. Report}, Bonneville Power Administration, Portland, 1967.

\bibitem[C22]{C22}
{Cabay, S.} and {Lam, T. P. L.}
\newblock Congruence techniques for the exact solution of integer systems of
  linear equations.
\newblock {\em ACM Trans. Math. Software}, 3(4):386--397, 1977.

\bibitem[C23]{C23}
{Cabay, S.} and {Lam, T. P. L.}
\newblock {ESOLVE}~: {Congruence} techniques for the exact solution of integer
  systems of linear equations.
\newblock {\em ACM Trans. Math. Software}, 3(4):404--410, 1977.

\bibitem[C49]{C49}
{Cabral, R. G.}
\newblock Avalia\c c\~ao do desempenho do m\'etodo dos gradientes conjugados em
  multiprocessadores com arquitetura hiperc\'ubica.
\newblock Master's thesis, COPPE/UFRJ, 1991.

\bibitem[C46]{C46}
{Cabral, R. G.} and {Kaskurewicz, E.}
\newblock Uma implementa\c c\~ao do m\'etodo dos gradientes conjugados em
  multiprocessadores com arquitetura hiperc\'ubica.
\newblock In {\em Anais do V Simp\'osio Brasileiro de Arquitetura de
  Computadores e Processamento de Alto Desempenho -- XIII Congresso da
  Sociedade Brasileira de Computa\c c\~ao}, pages 412--425, 1993.

\bibitem[C48]{C48}
{C\'aceres, E. N.}
\newblock Algoritmos paralelos para problemas em grafos.
\newblock Master's thesis, COPPE/UFRJ, 1992.

\bibitem[C45]{C45}
{C\'aceres, E. N.} and {Szwarficter, J. L.}
\newblock Cliques maximais em grafos c\'\i rculo.
\newblock In {\em Anais do V Simp\'osio Brasileiro de Arquitetura de
  Computadores e Processamento de Alto Desempenho -- XIII Congresso da
  Sociedade Brasileira de Computa\c c\~ao}, pages 398--411, 1993.

\bibitem[C135]{C135}
{Cachard, F.}
\newblock Logiciel numerique associ\'e \`a une mod\'elisation de syst\`emes
  informatiques, 1981.
\newblock {Th\`ese, Univ. Scientifique et M\'edicale de Grenoble, et l'Institut
  National Polytechnique de Grenoble}.

\bibitem[C96]{C96}
{Calahan, D. A.}
\newblock {\em Computer Aided Network Design}.
\newblock McGraw-Hill, 1968.

\bibitem[C98]{C98}
{Calahan, D. A.}
\newblock Switching circuit optimization.
\newblock In {\em Proc. Cornell Conference on Computerized Electronics}, pages
  282--292, Ithaca, 1969. Cornell Univ.

\bibitem[C24]{C24}
{Calahan, D. A.}
\newblock Parallel solution of sparse simultaneous linear equation.
\newblock In {\em Proc. $11^{th}$ Annual Allerton Conference on Circuits and
  System Theory}, pages 729--738, 1973.

\bibitem[C75]{C75}
{Calahan, D. A.}
\newblock A block-oriented sparse equation solver for the {CRAY-1}.
\newblock In {\em Proc. 1979 International Conference on Parallel Processing},
  pages 116--123, 1979.

\bibitem[C76]{C76}
{Calahan, D. A.}
\newblock Vectorized sparse elimination.
\newblock In {\em Proc. of Scientific Computer Information Exchange Meeting},
  Livermore, 1979.

\bibitem[C77]{C77}
{Calahan, D. A.}
\newblock Multi-level vectorized sparse solution of {LSI} circuits.
\newblock In {\em Proc. {IEEE} Conference on Circuits and Computers}, pages
  976--979, Rye, New York, 1980.

\bibitem[C78]{C78}
{Calahan, D. A.}
\newblock Direct solution of linear equations on the {CRAY-1}.
\newblock {\em CRAY Channels}, 3:1--5, 1981.

\bibitem[C79]{C79}
{Calahan, D. A.}
\newblock Performance of linear algebra codes on the {CRAY-1}.
\newblock {\em SPE Journal}, pages 558--564, 1981.

\bibitem[C80]{C80}
{Calahan, D. A.}
\newblock High performance banded and profile equation-solvers for the
  {CRAY-1}~: {The} unsymmetric case.
\newblock {Tech. Report} 160, Systems Eng. Laboratory, Univ. of Michigan, 1982.

\bibitem[C81]{C81}
{Calahan, D. A.}
\newblock Influence of task granularity on vector multiprocessor performance.
\newblock In {\em Proc. 1984 International Conference on Parallel Processing},
  pages 278--284, 1984.

\bibitem[C82]{C82}
{Calahan, D. A.}
\newblock Task granularity studies on a many-processor {CRAY X-MP}.
\newblock {\em Parallel Computing}, 2:109--118, 1985.

\bibitem[C83]{C83}
{Calahan, D. A.}
\newblock Block-oriented, local-memory-based linear equation solution on the
  {CRAY-2}~: {Uniprocessor} algorithms.
\newblock In {\em Proc. 1986 International Conference on Parallel Processing},
  pages 375--378, 1986.

\bibitem[C112]{C112}
{Calahan, D. A.} and {Ames, W. G.}
\newblock Vector processors~: {Models} and applications.
\newblock {\em IEEE Trans. Circuits and Systems}, CAS-26(9):715--726, 1979.

\bibitem[C72]{C72}
{Calahan, D. A.}, {Dongarra, J. J.}, and {Levine, D.}
\newblock Vectorizing compilers~: {A} test suite and results.
\newblock In {\em Supercomputer '88}, pages 98--105. IEEE Press, 1988.

\bibitem[C137]{C137}
{Calahan, D. A.}, {Dongarra, J. J.}, and {Levine, D.}
\newblock Vectorizing compilers~: {A} test suite and results.
\newblock In {\em Supercomputing '88}, pages 409--426, Orlando, 1988. ACM/IEEE.

\bibitem[C121]{C121}
{Calahan, D. A.} and {Grapes, T. E.}
\newblock Description of a sparse matrix compiler with applications.
\newblock {Tech. Report} AFORS-TR-71-2676, Systems Engineering Lab., Univ.
  Michigan, Ann Arbor, 1971.

\bibitem[C123]{C123}
{Calahan, D. A.} and {McCalla, W. J.}
\newblock Eigenvalue methods for sparse matrices.
\newblock In {Rose, D. J.} and {Willoughby, R. A.}, editors, {\em Sparse
  Matrices and Their Applications}, pages 25--30. Plenum Press, New York, 1972.

\bibitem[C122]{C122}
{Calahan, D. A.} and {Schlansker, M. S.}
\newblock Addendum to sparse matrix compiler manual.
\newblock {Tech. Report} AFORS-TR-72-1973, Systems Engineering Lab., Univ.
  Michigan, Ann Arbor, 1972.

\bibitem[C52]{C52}
{Calamai, P.} and {Mor\'e, J.}
\newblock Projected gradient methods for linearly constrained problems.
\newblock {\em Math. Programming}, 39:93--116, 1987.

\bibitem[C39]{C39}
{Campagnolo, J. M.}, {Martins, N.}, and {Falc\~ao, D. M.}
\newblock An efficient and robust eigenvalue method for small-signal stability
  assessment using parallel processing.
\newblock {Paper} 94-SM-558-7-PWRS, Centro de Pesquisas em Energia El\'etrica
  (CEPEL), Rio de Janeiro, 1994.
\newblock (Presented at {IEEE} {Winter Power Meeting}).

\bibitem[C38]{C38}
{Campagnolo, J. M.}, {Martins, N.}, and {Falc\~ao, D. M.}
\newblock Refactored bi-iteration~: {A} high performance eigensolution method
  for large power system matrices.
\newblock Technical report, Centro de Pesquisas em Energia El\'etrica (CEPEL),
  Rio de Janeiro, 1995.
\newblock (Submitted to 1995 {IEEE} {Summer Power Meeting}).

\bibitem[C47]{C47}
{Campagnolo, J. M.}, {Martins, N.}, {Pereira, J. L. R.}, and {Falc\~ao, D. M.}
\newblock Algoritmo paralelo para o c\'alculo de autovalores associado a
  avalia\c c\~ao da estabilidade a pequenas perturba\c c\~oes.
\newblock In {\em Anais do V Simp\'osio Brasileiro de Arquitetura de
  Computadores e Processamento de Alto Desempenho -- XIII Congresso da
  Sociedade Brasileira de Computa\c c\~ao}, pages 562--576, 1993.

\bibitem[C40]{C40}
{Campagnolo, J. M.}, {Martins, N.}, {Pereira, J. L. R.}, {Lima, L. T. G.},
  {Pinto, H. J. C. P.}, and {Falc\~ao, D. M.}
\newblock Fast small-signal stability assessment using parallel processing.
\newblock {\em IEEE Trans. Power Systems}, PWRS-9(2):949--956, 1994.

\bibitem[C116]{C116}
{Cantin, G.}
\newblock An equation solver of very large capacity.
\newblock {\em Int. J. Numer. Meth. Eng.}, 3:379--388, 1971.

\bibitem[C134]{C134}
{Carlsson, M.} and {Scharmer, G. B.}
\newblock A new approach to multi-level non-{LTE} radiative transfer problems.
\newblock Technical report, 1985.

\bibitem[C16]{C16}
{Carnahan, B.}, {Luther, H. A.}, and {Wilkes, J. O.}
\newblock {\em Applied Numerical Methods}.
\newblock John Wiley \& Sons, 1969.

\bibitem[C26]{C26}
{Carnahan, B.} and {Wilkes, J. O.}
\newblock {\em Digital Computing and Numerical Methods with {FORTRAN} {IV},
  {WATFOR}, and {WATFIV} Programming}.
\newblock John Wiley \& Sons, 1973.

\bibitem[C6]{C6}
{Carnevali, P.} et~al.
\newblock Efficient {FORTRAN} implementation of the {Gaussian} elimination and
  {Householder} reduction algorithms on the {IBM˙3090} vector multiprocessor.
\newblock {\em Mathematical Modelling and Numerical Analysis}, 23(1):63--86,
  1989.

\bibitem[C149]{C149}
{Carpaneto, G.}, {Fichetti, M.}, and {Toth, P.}
\newblock New lower bounds for the symmetric travelling salesman problem.
\newblock {\em Mathematical Programming}, 5:233--254, 1989.

\bibitem[C35]{C35}
{Carpentier, J.}
\newblock Ordered elimination.
\newblock In {\em Power System Computation Conference}, London, 1963.

\bibitem[C157]{C157}
{Carr, S.}
\newblock {\em Memory-Hierarchy Management}.
\newblock PhD thesis, Dept. of Computer Science, Rice Univ., 1992.

\bibitem[C156]{C156}
{Carr, S.} and {Kennedy, K.}
\newblock Improving the ratio of memory operations to floating-point operations
  in loops.
\newblock {Tech. Report} CRPC-TR-92-284, Center for Research on Parallel
  Computation (CRPC), Rice Univ., Houston, Texas, 1992.

\bibitem[C108]{C108}
{Carr\'e, B. A.}
\newblock The partitioning of network equations for block iteration.
\newblock {\em Computing J.}, 9:84--96, 1966.

\bibitem[C61]{C61}
{Carr\'e, B. A.}
\newblock {\em Graphs and Networks}.
\newblock Clarendon Press, 1979.

\bibitem[C158]{C158}
{Carter, L.}
\newblock {RISC} from a performance programmer's perspective.
\newblock {Tech. Report}, Computer Science and Eng. Dept., San Diego
  Supercomputer Center, Univ. of California, San Diego.

\bibitem[C160]{C160}
{Carter, L.}
\newblock The {RAM} model and the performance programmer.
\newblock {Research Report} RC-16319, IBM Thomas J. Watson Research Center,
  Yorktown Heights, 1990.

\bibitem[C159]{C159}
{Carter, L.}, {Ferrante, J.}, and {Hummel, S. F.}
\newblock Hierarchical tiling for improved superscalar performance.
\newblock {Tech. Report}, Computer Science and Eng. Dept., San Diego
  Supercomputer Center, Univ. of California, San Diego.

\bibitem[C14]{C14}
{Cate, E. G.} and {Twigg, D. W.}
\newblock Algorithm 513~: {Analysis} of in-situ transposition.
\newblock {\em ACM Trans. Math. Software}, 3(1):104--110, 1977.

\bibitem[C68]{C68}
{Cavers, I.}
\newblock Tiebreaking the minimum degree algorithm for ordering sparse
  symmetric positive definite matrices.
\newblock Master's thesis, Dept. of Computer Science, Univ. of British
  Columbia, Vancouver, 1987.

\bibitem[C53]{C53}
{Celis, M. R.}, {Dennis, J. E. Jr.}, and {Tapia, R. A.}
\newblock A trust region strategy for nonlinear equality constrained
  optimization.
\newblock In {Boggs, P.}, {Byrd, R.}, and {Schnabel R.}, editors, {\em
  Numerical Optimization 1984}, pages 71--82. SIAM Publications, 1985.

\bibitem[C54]{C54}
{Celis, M. R.}, {Dennis, J. E. Jr.}, and {Tapia, R. A.}
\newblock An algorithm based on a convenient trust region subproblem for
  nonlinear programming.
\newblock {Tech. Report}, Dept. of Mathematical Sciences, Rice Univ., Houston,
  Texas, 1988.

\bibitem[C88]{C88}
{Chaitin-Chatelin, F.} and {Fraysse, V.}
\newblock {\em Lectures on Finite Precision Computations}.
\newblock SIAM Publications, 1996.
\newblock (To be published).

\bibitem[C138]{C138}
{Chaitin, G. J.}, {Auslander, M. A.}, {Chandra, A. K.}, {Cocke, J.}, {Hopkins,
  M. E.}, and {Markstein, P. W.}
\newblock Register allocation via coloring.
\newblock {\em Computer Languages}, 6:47--57, 1982.

\bibitem[C41]{C41}
{Chan, S. M.} and {Brandwajn, V.}
\newblock Partial matrix refactorization.
\newblock {\em IEEE Trans. Power Systems}, PWRS-1(1):193--200, 1986.

\bibitem[C50]{C50}
{Chan, T. F.} and {Saad, Y.}
\newblock Multigrid algorithms on the hypercube multiprocessor.
\newblock {\em IEEE Trans. Comput.}, C-35(11), 1986.

\bibitem[C70]{C70}
{Chan, W. M.} and {George, A.}
\newblock A linear time implementation of the reverse {Cuthill-McKee}
  algorithm.
\newblock {\em BIT}, 20:8--14, 1980.

\bibitem[C129]{C129}
{Chandra, R.}, {Eisenstat, S. C.}, and {Schultz, M. H.}
\newblock Conjugate gradient methods for partial differential equations.
\newblock In {Vichnevetsky, R.}, editor, {\em Proc. {AICA} International
  Symposium on Computer Methods for Partial Differential Equations, Bethlehem}.
  Prentice-Hall, 1975.

\bibitem[C125]{C125}
{Chang, A.}
\newblock Application of sparse matrix methods in electric power system
  analysis.
\newblock In {Willoughby, R. A.}, editor, {\em Sparse Matrix Proceedings,
  Symposium on Sparse Matrices and Their Applications}, Yorktown Heights, New
  York, 1969. IBM Thomas J. Watson Research Center.

\bibitem[C20]{C20}
{Chang, S. F.}
\newblock {\em Increasing Sparsity in Matrices for Large Scale Optimization~:
  {Theoretical} Properties and Implementational Aspects}.
\newblock PhD thesis, Columbia Univ., 1989.

\bibitem[C21]{C21}
{Chang, S. F.} and {McCormick, S. T.}
\newblock A hierarchical algorithm for making sparse matrices sparser.
\newblock {\em Math. Programming}, 56:1--30, 1992.

\bibitem[C19]{C19}
{Chang, S. F.} and {McCormick, S. T.}
\newblock Implementation and computational results for the hierarchical
  algorithm for making sparse matrices sparser.
\newblock {\em ACM Trans. Math. Software}, 19(3):419--441, 1993.

\bibitem[C106]{C106}
{Chartres, B. A.}
\newblock Adaptation of the {Jacobi} method for a computer with magnetic-tape
  backing store.
\newblock {\em Computing J.}, 5:51--60, 1962.

\bibitem[C107]{C107}
{Chazan, D.} and {Miranker, W. L.}
\newblock Chaotic relaxation.
\newblock {\em Lin. Alg. Appl.}, 2:199--222, 1969.

\bibitem[C154]{C154}
{Chen, M. S.} and {Shin, K. G.}
\newblock Processor allocation in an {N-Cube} multiprocessor using gray codes.
\newblock {\em IEEE Trans. Comput.}, C-36:1396--1407, 1987.

\bibitem[C73]{C73}
{Chen, S.}, {Kuck, D.}, and {Sameh, A.}
\newblock Practical parallel band triangular systems solvers.
\newblock {\em ACM Trans. Math. Software}, 4:270--277, 1978.

\bibitem[C99]{C99}
{Chen, T. C.}
\newblock Parallelism, pipelining and computer efficiency.
\newblock {\em Computer Design}, pages 69--74, 1971.

\bibitem[C90]{C90}
{Chen, T. C}.
\newblock Overlap and parallel processing.
\newblock In {Stone, H. S.}, editor, {\em Introduction to Computer
  Architecture}, pages 427--486. Science Research Associates, Chicago, 1980.

\bibitem[C109]{C109}
{Chen, W. K.}
\newblock The inversion of matrices by flow graphs.
\newblock {\em SIAM J. Appl. Math.}, 12:676--685, 1964.

\bibitem[C92]{C92}
{Chen, W. K.}
\newblock On directed graph solution of linear algebraic equations.
\newblock {\em SIAM Review}, 9:692--707, 1967.

\bibitem[C130]{C130}
{Chen, Y. T.}
\newblock Permutation of irreducible matrices to upper triangular forms.
\newblock {\em J. Inst. Math. Appl.}, 10:15--18, 1972.

\bibitem[C124]{C124}
{Chen, Y. T.}
\newblock {\em Iterative Methods for Linear Least Squares Problems}.
\newblock PhD thesis, Dept. of Computer Science, Waterloo Univ., 1975.
\newblock ({Report CS-75-04}).

\bibitem[C91]{C91}
{Chen, Y. T.} and {Tewarson, R. P.}
\newblock On the optimal choice of pivots for the {Gaussian} elimination.
\newblock {\em Computing}, 9, 1972.

\bibitem[C33]{C33}
{Cheng, Y. C.}, {Houck, D. J. Jr.}, {Liu, J. M.}, {Meketon, M. S.}, {Slutsman,
  L.}, {Vanderbei, R. J.}, and {Wang, P.}
\newblock {AT\&T} {KORBX} system.
\newblock {\em AT\&T Technical Journal}, 68(3):7--19, 1989.

\bibitem[C62]{C62}
{Cheriton, D.} and {Tarjan, R. E.}
\newblock Finding minimum spanning trees.
\newblock {\em SIAM J. Comput.}, 5:724--742, 1976.

\bibitem[C148]{C148}
{Chevalley, C.}
\newblock {\em Theory of {Lie} Groups}.
\newblock Princeton University Press, 1946.

\bibitem[C31]{C31}
{Choi, I. C.}, {Monma, C. L.}, and {Shanno, D. F.}
\newblock Further development of a primal-dual interior point method.
\newblock {\em ORSA J. Computing}, 2:304--311, 1990.

\bibitem[C139]{C139}
{Chow, F. C.} and {Hennessy, J. L.}
\newblock Register allocation by priority-based coloring.
\newblock {\em ACM SIGPLAN Notices}, 19(6):222--232, 1984.
\newblock (Presented at {Proc. SIGPLAN '84 Compiler Construction}).

\bibitem[C140]{C140}
{Chow, F. C.}, {Himelstein, M.}, {Killian, E.}, and {Weber, L.}
\newblock Engineering a {RISC} compiler system.
\newblock In {\em Proc. {COMPCON}}, pages 132--137, San Francisco, 1988. IEEE.

\bibitem[C118]{C118}
{Chow, T. S.} and {Kowalik, J. S.}
\newblock Computing with sparse matrices.
\newblock {\em Int. J. Numer. Meth. Eng.}, 7:211--223, 1973.

\bibitem[C119]{C119}
{Christensen, J. H.}
\newblock The structuring of process optimization.
\newblock {\em Amer. Inst. Chem. Eng. Journal}, 16:177--184, 1970.

\bibitem[C63]{C63}
{Christofides, N.}
\newblock {\em Graph Theory~: An Algorithmic Approach}.
\newblock Academic Press, 1975.

\bibitem[C84]{C84}
{Chu, E.}
\newblock {\em Orthogonal Decomposition of Dense and Sparse Matrices on
  Multiprocessors}.
\newblock PhD thesis, Univ. of Waterloo, 1988.

\bibitem[C2]{C2}
{Chu, E. C. H.} and {George, A.}
\newblock Sparse matrix methods research using the {CSM} testbed software
  system.
\newblock {Contractor Report} CR-4219, NASA, 1989.

\bibitem[C69]{C69}
{Chu, E. C. H.} and {George, A.}
\newblock Sparse orthogonal decomposition on a hypercube multiprocessor.
\newblock {\em SIAM J. Matrix Anal. and Appl.}, 11:453--465, 1990.

\bibitem[C25]{C25}
{Chu, E. C. H.}, {George, A.}, and {Ng, E.}
\newblock ``{User's Guide}'' for {SPARSPAK-A}~: {Waterloo} sparse linear
  equations package.
\newblock {Tech. Report} CS-84-36, Univ. Waterloo, Canada, 1984.

\bibitem[C87]{C87}
{Chui, C. K.}
\newblock {\em Multivariate Splines}.
\newblock SIAM Publications, 1988.

\bibitem[C27]{C27}
{Chv\'atal, V.}
\newblock {\em Linear Programming}.
\newblock Freeman \& Co., 1983.

\bibitem[C141]{C141}
{Clark, D. W.}
\newblock Cache performance of the {VAX-11/780}.
\newblock {\em ACM Trans. Computer Systems}, 1(1):24--37, 1983.

\bibitem[C37]{C37}
{Clark, D. W.}
\newblock Pipelining and performance in the {VAX} 8800 processor.
\newblock In {\em Proc. $2^{nd}$ {IEEE/ACM} Conference on Architectural Support
  for Programming Languages and Operating Systems}, pages 173--177, Palo Alto,
  1987.

\bibitem[C145]{C145}
{Clark, D. W.}, {Bannon, P. J.}, and {Keller, J. B.}
\newblock Measuring {VAX 8800} performance with a histogram hardware monitor.
\newblock In {\em Proc. $15^{th}$ Annual Symposium on Computer Architecture},
  pages 176--185, Honolulu, Hawaii, 1988.

\bibitem[C144]{C144}
{Clark, D. W.} and {Emer, J. S.}
\newblock Performance of the {VAX-11/780} translation buffer~: {Simulation} and
  measurement.
\newblock {\em ACM Trans. Computer Systems}, 3(1):31--62, 1985.

\bibitem[C143]{C143}
{Clark, D. W.} and {Levy, H.}
\newblock Measurement and analysis of instruction set use in the {VAX-11/780}.
\newblock In {\em Proc. $9^{th}$ Annual Symposium on Computer Architecture},
  pages 9--17, Austin, Texas, 1982.

\bibitem[C86]{C86}
{Clarke, F. H.}
\newblock {\em Methods of Dynamics and Nonsmooth Optimization}.
\newblock SIAM Publications, 1989.

\bibitem[C85]{C85}
{Clarke, F. H.}
\newblock {\em Optimization and Nonsmooth Analysis}.
\newblock SIAM Publications, 1990.

\bibitem[C136]{C136}
{Cline, A. K.}, {Golub, G. H.}, and {Platzman, G. W.}
\newblock Calculations of normal modes of oceans using a {Lanczos} method.
\newblock In {Bunch, J. R.} and {Rose, D. J.}, editors, {\em Sparse Matrix
  Computations}, pages 409--426. Academic Press, 1976.

\bibitem[C120]{C120}
{Coates, C. L.}
\newblock Flow graph solutions of linear algebraic equations.
\newblock {\em IEEE Trans. Circuit Theory}, CT-6:170--187, 1959.

\bibitem[C97]{C97}
{Cocke, J.}
\newblock Global common subexpression elimination.
\newblock {\em SIGPLAN Notices}, 5:20--24, 1970.

\bibitem[C146]{C146}
{Cocke, J.} and {Schwartz, J. T.}
\newblock {\em Programming Languages and Their Compilers}.
\newblock Courant Institute, 1970.

\bibitem[C28]{C28}
{Cody, W. J. Jr.} and {Waite, W.}
\newblock {\em Software Manual for the Elementary Functions}.
\newblock Prentice-Hall, 1980.

\bibitem[C89]{C89}
{Coffman, E. G.} and {Denning, P. J.}
\newblock {\em Operating Systems Theory}.
\newblock Prentice-Hall, 1973.

\bibitem[C7]{C7}
{Coleman, T. F.}
\newblock {\em Large Sparse Numerical Optimization}, volume 165 of {\em Lecture
  Notes in Computer Science}.
\newblock Springer-Verlag, 1984.

\bibitem[C55]{C55}
{Coleman, T. F.} and {Conn, A.}
\newblock On the local convergence of quasi-{Newton} methods for the nonlinear
  programming problem.
\newblock {\em SIAM J. Numer. Anal.}, 21:755--769, 1984.

\bibitem[C60]{C60}
{Coleman, T. F.}, {Edenbrandt, A.}, and {Gilbert, J. R.}
\newblock Predicting fill for sparse orthogonal factorization.
\newblock {\em J. ACM}, 33:517--532, 1986.

\bibitem[C10]{C10}
{Coleman, T. F.}, {Garbow, B.}, and {Mor\'e, J. J.}
\newblock Software for estimating sparse {Jacobian} matrices.
\newblock {\em ACM Trans. Math. Software}, 10:329--347, 1984.

\bibitem[C11]{C11}
{Coleman, T. F.}, {Garbow, B.}, and {Mor\'e, J. J.}
\newblock Software for estimating sparse {Hessian} matrices.
\newblock {\em ACM Trans. Math. Software}, 11:363--378, 1985.

\bibitem[C56]{C56}
{Coleman, T. F.} and {Hulbert, L.}
\newblock A direct active set algorithm for large sparse quadratic programs
  with simple bounds.
\newblock {Tech. Report} 88-926, Cornell Univ., Ithaca, NY, 1988.

\bibitem[C9]{C9}
{Coleman, T. F.} and {Li, Y.}, editors.
\newblock {\em Large Scale Numerical Optimization}.
\newblock SIAM Publications, 1990.

\bibitem[C12]{C12}
{Coleman, T. F.} and {Mor\'e, J. J.}
\newblock Estimation of sparse {Jacobian} matrices and graph coloring problems.
\newblock {\em SIAM J. Numer. Anal.}, 20:187--209, 1983.

\bibitem[C13]{C13}
{Coleman, T. F.} and {Mor\'e, J. J.}
\newblock Estimation of sparse {Hessian} matrices and graph coloring problems.
\newblock {\em SIAM J. Numer. Anal.}, 28:243--270, 1984.

\bibitem[C66]{C66}
{Coleman, T. F.} and {Pothen, A.}
\newblock The null space problem -- {I}~: {Complexity}.
\newblock {\em SIAM J. Alg. and Discr. Methods}, 7:527--537, 1986.

\bibitem[C67]{C67}
{Coleman, T. F.} and {Pothen, A.}
\newblock The null space problem -- {II}~: {Algorithms}.
\newblock {\em SIAM J. Alg. and Discr. Methods}, 8:544--563, 1987.

\bibitem[C8]{C8}
{Coleman, T. F.} and {Van Loan, C.}
\newblock {\em Handbook for Matrix Computations}.
\newblock SIAM Publications, 1988.

\bibitem[C114]{C114}
{Collatz, L.}
\newblock {\em Numerische und Graphische Methoden, Handbuch der Physik, volume
  {2}}.
\newblock Springer-Verlag, 1955.

\bibitem[C51]{C51}
{Comer, D.}
\newblock The ubiquitous {B-Tree}.
\newblock {\em ACM Computing Surveys}, 11(2):121--137, 1979.

\bibitem[C30]{C30}
Companhia Telef\^onica Brasileira, Departamento Geral de Desenvolvimento de
  Transmiss\~ao.
\newblock {\em Programa\c c\~ao {FORTRAN} para Aplica\c c\~oes T\'ecnicas e
  Cient\'\i ficas}, 1975.
\newblock ({Ref. TED-32-01-0005}).

\bibitem[C117]{C117}
{Comstock, D. R.}
\newblock A note on multiplying boolean matrices -- {II}.
\newblock {\em Comm. ACM}, 7:13, 1964.

\bibitem[C131]{C131}
{Concus, P.} and {Golub, G. H.}
\newblock A generalized conjugate gradient method for nonsymmetric systems of
  linear equations.
\newblock {Tech. Report} STAN-CS-75-535, Computer Science Dept., Stanford
  Univ., 1975.

\bibitem[C132]{C132}
{Concus, P.}, {Golub, G. H.}, and {O'Leary, D. P.}
\newblock A generalized conjugate gradient method for the numeric solution of
  elliptic partial differential equations.
\newblock {Tech. Report} STAN-CS-75-533, Computer Science Dept., Stanford
  Univ., 1975.

\bibitem[C59]{C59}
{Conn, A. R.}
\newblock {\em Penalty Function Methods}.
\newblock Nonlinear Optimization 1981. Academic Press, 1982.

\bibitem[C57]{C57}
{Conn, A. R.}, {Gould, N.}, and {Toint, Ph. L.}
\newblock Testing a class of methods for solving minimization problems with
  simple bounds on the variables.
\newblock {Tech. Report} 86-3, Dept. of Mathematics, FUNDP, Namur, 1986.

\bibitem[C58]{C58}
{Conn, A. R.}, {Gould, N.}, and {Toint, Ph. L.}
\newblock Global convergence of a class of trust region algorithms for
  optimization problems with simple bounds.
\newblock {Tech. Report}, Dept. of Computer Sciences, Univ. of Waterloo,
  Canada, 1988.

\bibitem[C15]{C15}
{Conn, A. R.}, {Gould, N.}, and {Toint, Ph. L.}, editors.
\newblock {\em Large Scale Optimization}, volume~45 of {\em Math. Programming,
  Series~B}, pages 373--568.
\newblock North Holland, 1989.
\newblock ({Special Issue}).

\bibitem[C104]{C104}
{Conte, S. D.} and {Dames, R. T.}
\newblock An alternating direction method for solving the biharmonic equation.
\newblock {\em Math. of Computation}, 12:198--205, 1958.

\bibitem[C29]{C29}
{Conte, S. D.} and {de Boor, C.}
\newblock {\em Elementary Numerical Analysis~: An Algorithmic Approach}.
\newblock McGraw-Hill, $3^{rd}$ edition, 1980.

\bibitem[C113]{C113}
{CONTROL DATA}.
\newblock {\em {STAR-100} Computer System ``{Hardware Reference Manual}''},
  1973.
\newblock {CONTROL DATA Corporation}.

\bibitem[C64]{C64}
{Cook, S. A.}
\newblock The complexity of theorem-proving procedures.
\newblock In {\em Proc. $3^{rd}$ {ACM} Symposium on Theory of Computing}, pages
  151--158, 1971.

\bibitem[C100]{C100}
{Cooley, J. W.} and {Tukey, J. W.}
\newblock An algorithm for machine calculation of complex {Fourier} series.
\newblock {\em Math. of Computation}, 19:297--301, 1965.

\bibitem[C18]{C18}
{Coppersmith, D.} and {Winograd, S.}
\newblock Matrix multiplication via arithmetic progression.
\newblock In {\em Proc. $19^{th}$ Annual {ACM} Symposium of Theory of
  Computing}, pages 1--6, 1987.

\bibitem[C17]{C17}
{Cormen, T. H.}, {Leiserson, C. E.}, and {Rivest, R. L.}
\newblock {\em Introduction to Algorithms}.
\newblock McGraw-Hill, 1990.

\bibitem[C34]{C34}
{Cottle, R. W.}
\newblock Major {Cholesky}.
\newblock {Manuscript}, Dept. of Oper. Res., Stanford Univ., 1975.

\bibitem[C115]{C115}
{Couffignal, L.}
\newblock {\em R\'esolution Num\'erique des Syst\`emes d'\'Equations
  Lin\'eaires}.
\newblock Gauthier et Villars, 1956.

\bibitem[C101]{C101}
{Courant, R.}
\newblock {\em Methods of Mathematical Physics, volume {1}}.
\newblock Interscience, 1953.

\bibitem[C102]{C102}
{Courant, R.} and {Hilbert, D.}
\newblock {\em Methods of Mathematical Physics, volume {2}}.
\newblock Interscience, 1962.

\bibitem[C74]{C74}
{Cowell, W.} and {Thompson, C.}
\newblock Transforming {FORTRAN} {DO} loops to improve performance on vector
  architectures.
\newblock {\em ACM Trans. Math. Software}, 12:324--353, 1986.

\bibitem[C32]{C32}
{CPLEX} Optimization, Inc., Incline Village, Nevada.
\newblock {\em Using the {CPLEX} Callable Library and {CPLEX} Mixed Integer
  Library}, 1993.

\bibitem[C3]{C3}
{Crane, H.}, {Gibbs, N. E.}, {Poole, W. G. Jr.}, and {Stockmeyer, P. K.}
\newblock Algorithm 508~: {Matrix} bandwidth and profile reduction.
\newblock {\em ACM Trans. Math. Software}, 2:375--377, 1976.

\bibitem[C105]{C105}
{Crank, J.} and {Nicholson, P.}
\newblock A practical method for numerical evaluation of solutions of partial
  differential equations of the heat conduction type.
\newblock {\em Proc. Cambridge Philos. Soc.}, 43:50--67, 1947.

\bibitem[C147]{C147}
{Crawford, J. H.} and {Gelsinger, P. P.}
\newblock {\em Programming the 80386}.
\newblock Sybex, Alameda, California, 1987.

\bibitem[C155]{C155}
{CRAY Research, Inc.}
\newblock {\em {SSGETRF}~: {Factors} a Real Sparse General Matrix ``{Online
  Manual}''}.
\newblock {CRAY} Research, Inc., 1993.

\bibitem[C128]{C128}
{Crespi-Reghizzi, S.} and {Morpurgo, R.}
\newblock A language for treating graphs.
\newblock {\em Comm. ACM}, 13:319--323, 1970.

\bibitem[C111]{C111}
{Crout, P. D.}
\newblock A short method for evaluating determinants and solving systems of
  linear equations with real or complex coefficients.
\newblock {\em AIEE Trans. (supplement)}, 60:1235--1240, 1941.

\bibitem[C133]{C133}
{Curtis, A. R.} and {Chance, E. M.}
\newblock {CHECK} and {CHEKMAT}~: {Two} chemical reaction kinetics programs.
\newblock {Tech. Report} AERE-R-7345, HMSO, Harwell Laboratory, 1974.

\bibitem[C36]{C36}
{Curtis, A. R.}, {Powell, M. J. D.}, and {Reid, J. K.}
\newblock On the estimation of sparse {Jacobian} matrices.
\newblock {\em J. Inst. Math. Appl.}, 13:117--119, 1974.

\bibitem[C93]{C93}
{Curtis, A. R.} and {Reid, J. K.}
\newblock {FORTRAN} subroutines for the solution of sparse sets of linear
  equations.
\newblock {Tech. Report} R-6844, Atomic Energy Res. Establishment, Harwell,
  1971.

\bibitem[C94]{C94}
{Curtis, A. R.} and {Reid, J. K.}
\newblock The solution of large sparse systems of linear equations.
\newblock In {\em Proc. of {IFIP}}. Atomic Energy Res. Establishment, Harwell,
  1971.
\newblock ({Tech. Report TP-450}).

\bibitem[C95]{C95}
{Curtis, A. R.} and {Reid, J. K.}
\newblock The solution of large sparse unsymmetric systems of linear equations.
\newblock {\em J. Inst. Math. Appl.}, 8:344--353, 1971.

\bibitem[C127]{C127}
{Curtis, A. R.} and {Reid, J. K.}
\newblock The solution of large sparse unsymmetric systems of linear equations.
\newblock In {Freiman, C. V.}, editor, {\em Information Processing 71, Proc.
  {IFIP} Congress}, pages 1240--1245, Ljubljana, 1972. North-Holland.

\bibitem[C71]{C71}
{Cuthill, E. H.}
\newblock Several strategies for reducing the bandwidth of matrices.
\newblock In {Rose, D. J.} and {Willoughby, R. A.}, editors, {\em Sparse
  Matrices and Their Applications}, pages 157--166. Plenum Press, New York,
  1972.

\bibitem[C4]{C4}
{Cuthill, E. H.} and {McKee, J.}
\newblock Reducing the bandwidth of sparse symmetric matrices.
\newblock In {\em Proc. $24^{th}$ National Conference of the {ACM}}, pages
  157--172. ACM Press, 1969.

\bibitem[C103]{C103}
{Cuthill, E. H.} and {Varga, R. S.}
\newblock A method of normalized block iteration.
\newblock {\em J. ACM}, 6:236--244, 1959.

\bibitem[C65]{C65}
{Cvetkovic, D.}, {Doob, M.}, and {Sachs, H.}
\newblock {\em Spectra of Graphs}.
\newblock Academic Press, 1980.

\bibitem[C153]{C153}
{da Cruz Neto, J. X.}
\newblock {\em M\'etodos Geod\'esicos na Programa\c c\~ao Matem\'atica}.
\newblock PhD thesis, Depto. de Engenharia de Sistemas e Ci\^encias da
  Computa\c c\~ao, COPPE / Univ. Federal do Rio de Janeiro, 1995.

\bibitem[C151]{C151}
{da Cruz Neto, J. X.} and {Oliveira, P. R.}
\newblock Geodesic descent in linear and nonlinear programming.
\newblock {Tech. Report}, Depto. de Engenharia de Sistemas e Ci\^encias da
  Computa\c c\~ao, COPPE / Univ. Federal do Rio de Janeiro, 1995.

\bibitem[C152]{C152}
{da Cruz Neto, J. X.} and {Oliveira, P. R.}
\newblock A unified view of primal methods through riemannian metrics.
\newblock {Tech. Report} ES-363-95, Depto. de Engenharia de Sistemas e
  Ci\^encias da Computa\c c\~ao, COPPE / Univ. Federal do Rio de Janeiro, 1995.

\bibitem[D53]{D53}
{Dahl, D.}, {Dijkstra, E. W.}, and {Hoare, C. A. R.}
\newblock {\em Structured Programming}.
\newblock Academic Press, 1972.

\bibitem[D92]{D92}
{Dahlhaus, E.} and {Karpinski, M.}
\newblock A fast parallel algorithm for computing all maximal cliques in a
  graph and the related problems.
\newblock {Tech. Report} 8516-CS, Inst. fur Informatik der Univ. Bonn, 1987.

\bibitem[D151]{D151}
{Dahlquist, G.}
\newblock A numerical method for some ordinary differential equations with
  large {Lipschitz} constants.
\newblock In {\em Proc. {IFIP} Congress}, Edinburgh, 1968.

\bibitem[D63]{D63}
{Dahlquist, G.} and {Bj{\"o}rck, A.}
\newblock {\em Numerical Methods}.
\newblock Prentice-Hall, 1974.

\bibitem[D143]{D143}
{Dantzig, G. B.}
\newblock Maximization of a linear function of variables subject to linear
  inequalities.
\newblock In {Koopmans, T. C.}, editor, {\em Activity Analysis of Production
  and Allocation}, pages 339--347. John Wiley \& Sons, New York, 1951.

\bibitem[D49]{D49}
{Dantzig, G. B.}
\newblock {\em Linear Programming and Extensions}.
\newblock Princeton University Press, 1962.

\bibitem[D147]{D147}
{Dantzig, G. B.}
\newblock Compact basis triangularization for the simplex method.
\newblock In {Graves, R. L.} and {Wolfe, P.}, editors, {\em Recent Advances in
  Mathematical Programming}, pages 125--132. McGraw-Hill, 1963.

\bibitem[D112]{D112}
{Dantzig, G. B.}
\newblock All shortest routes in a graph.
\newblock In {\em Theory of Graphs International Symposium}, pages 91--92.
  Gordon and Breach, New York, 1967.

\bibitem[D113]{D113}
{Dantzig, G. B.}
\newblock Comments on {Khachiyan's} algorithm for linear programming.
\newblock {Tech. Report} SOR-79-22, Dept. of Operations Res., Stanford Univ.,
  1979.

\bibitem[D106]{D106}
{Dantzig, G. B.}, {Eisenstat, S. C.}, {Magnante, T.}, {Maier, S.}, {McGrath,
  M.}, {Nicholson, V.}, and {Riedel, C.}
\newblock {MPL}~: {M}athematical {P}rogramming {L}anguage, ``{Specification
  Manual}''.
\newblock {Tech. Report} STAN-CS-70-187, Stanford Univ., 1970.

\bibitem[D149]{D149}
{Dantzig, G. B.}, {Harvey, R. P.}, {McKnight, R. D.}, and {Smith, S. S.}
\newblock Sparse matrix techniques in two mathematical programming codes.
\newblock In {Willoughby, R. A.}, editor, {\em Sparse Matrix Proceedings,
  Symposium on Sparse Matrices and Their Applications}, pages 85--99, Yorktown
  Heights, New York, 1969. IBM Thomas J. Watson Research Center.

\bibitem[D148]{D148}
{Dantzig, G. B.} and {Orchard-Hays, W.}
\newblock The product form of inverse in the simplex method.
\newblock {\em Math. of Computation}, 8:64--67, 1954.

\bibitem[D144]{D144}
{Dantzig, G. B.} and {Van Slyke, R. M.}
\newblock Generalized upper bounding techniques.
\newblock {\em J. Computer Systems Sciences}, 1:213--226, 1967.

\bibitem[D145]{D145}
{Dantzig, G. B.} and {Wolfe, P.}
\newblock Decomposition principle for linear programs.
\newblock {\em Operations Res.}, 8:101--111, 1960.

\bibitem[D146]{D146}
{Dantzig, G. B.} and {Wolfe, P.}
\newblock The decomposition algorithm for linear programs.
\newblock {\em Econometrica}, 29:767--778, 1961.

\bibitem[D93]{D93}
{Datta, B. N.}
\newblock Parallel and large-scale matrix computations in control~: {Some}
  ideas.
\newblock {\em Lin. Alg. Appl.}, 121:243--264, 1989.

\bibitem[D70]{D70}
{Daubechies, I.}
\newblock {\em Ten Lectures on Wavelets}.
\newblock SIAM Publications, 1992.

\bibitem[D62]{D62}
{Davenport, J. L. H.}, {Siret, Y.}, and {Tournier, E.}
\newblock {\em Computer Algebra~: Systems and Algorithms for Algebraic
  Computations}.
\newblock Academic Press, 1988.

\bibitem[D96]{D96}
{Davidon, W. C.}
\newblock Variable metric methods for minimization.
\newblock {Tech. Report} ANL-5990, Argonne National Laboratory, 1959.

\bibitem[D94]{D94}
{Davidon, W. C.}
\newblock Conic approximations and collinear scalings for optimizers.
\newblock {\em SIAM J. Numer. Anal.}, 17:268--281, 1980.

\bibitem[D60]{D60}
{Davis, G.}
\newblock Column {LU} factorization with pivoting on a hypercube
  multiprocessor.
\newblock {\em SIAM J. Alg. and Discr. Methods}, 7, 1986.

\bibitem[D64]{D64}
{Davis, P.}
\newblock {\em Interpolation and Approximation}.
\newblock Blaisdell Publishing Co., 1963.

\bibitem[D65]{D65}
{Davis, P.} and {Rabinowitz, P.}
\newblock {\em Methods of Numerical Integration}.
\newblock Academic Press, $2^{nd}$ edition, 1984.

\bibitem[D135]{D135}
{Davis, T. A.}
\newblock {PSOLVE}~: {A} concurrent algorithm for solving sparse systems of
  linear equations.
\newblock {Tech. Report} 612, Center for Supercomputing Research and
  Development, Univ. of Illinois at Urbana-Champaign, 1986.

\bibitem[D181]{D181}
{Davis, T. A.}
\newblock Performance of an unsymmetric-pattern multifrontal method for sparse
  {LU} factorization.
\newblock {Tech. Report} TR-92-014, Computer and Information Science Dept.,
  Univ. of Florida, 1992.

\bibitem[D59]{D59}
{Davis, T. A.}
\newblock An unsymmetric pattern multifrontal method for sparse {LU}
  factorization.
\newblock {Tech. Report} TR-93-018, Computer and Information Science Dept.,
  Univ. of Florida, 1993.

\bibitem[D174]{D174}
{Davis, T. A.}
\newblock ``{User's Guide}'' for the unsymmetric-pattern multifrontal package
  ({UMFPACK}).
\newblock {Tech. Report} TR-93-020, Computer and Information Sciences Dept.,
  Univ. of Florida, 1993.

\bibitem[D183]{D183}
{Davis, T. A.}
\newblock A combined unifrontal/multifrontal method for unsymmetric sparse
  matrices.
\newblock {Tech. Report} TR-94-005, Computer and Information Science Dept.,
  Univ. of Florida, 1994.
\newblock ({Proc. of $5^{th}$ SIAM Conference on Applied Linear Algebra}).

\bibitem[D180]{D180}
{Davis, T. A.}
\newblock User's guide for the unsymmetric-pattern multifrontal package
  ({UMFPACK}), version 1.1.
\newblock {Tech. Report} TR-95-004, Computer and Information Science Dept.,
  Univ. of Florida, 1995.

\bibitem[D177]{D177}
{Davis, T. A.}, {Amestoy, P.}, and {Duff, I. S.}
\newblock An approximate minimum degree ordering algorithm.
\newblock {Tech. Report} TR-94-039, Computer and Information Science Dept.,
  Univ. of Florida, 1994.
\newblock (Revised July 1995).

\bibitem[D178]{D178}
{Davis, T. A.} and {Duff, I. S.}
\newblock Unsymmetric-pattern multifrontal methods for parallel sparse {LU}
  factorization.
\newblock {Tech. Report} TR-91-023, Computer and Information Science Dept.,
  Univ. of Florida, 1991.

\bibitem[D175]{D175}
{Davis, T. A.} and {Duff, I. S.}
\newblock An unsymmetric-pattern multifrontal method for sparse {LU}
  factorization.
\newblock {Tech. Report} RAL-93-036, Rutherford Appleton Laboratory, Chilton,
  Didcot, Oxfordshire, 1994.

\bibitem[D179]{D179}
{Davis, T. A.} and {Duff, I. S.}
\newblock An unsymmetric-pattern multifrontal method for sparse {LU}
  factorization.
\newblock {Tech. Report} TR-94-038, Computer and Information Science Dept.,
  Univ. of Florida, 1994.

\bibitem[D182]{D182}
{Davis, T. A.} and {Duff, I. S.}
\newblock A combined unifrontal/multifrontal method for unsymmetric sparse
  matrices.
\newblock {Tech. Report} TR-95-020, Computer and Information Science Dept.,
  Univ. of Florida, 1995.

\bibitem[D114]{D114}
{Davis, T. A.} and {Yew, P. C.}
\newblock A nondeterministic parallel algorithm for general unsymmetric sparse
  {LU} factorization.
\newblock {\em SIAM J. Matrix Anal. and Appl.}, 11:383--402, 1990.

\bibitem[D46]{D46}
{Dayde, M. J.} and {Duff, I. S.}
\newblock Use of level-3 {BLAS} in {LU} factorization on the {CRAY-2}, the
  {ETA-10P} and the {IBM 3090-200/VF}.
\newblock {Tech. Report} CSS-229, Computer Science and Systems Division,
  Harwell Laboratory, Oxon, England, 1988.

\bibitem[D21]{D21}
{Dayde, M. J.} and {Duff, I. S.}
\newblock Use of level-3 {BLAS} in {LU} factorization in a multiprocessing
  environment on three vector multiprocessors~: {The} {ALLIANT FX/8}, the
  {CRAY-2} and the {IBM 3090/VF}.
\newblock {Tech. Report} TR-TA-90-30, CERFACS, 1990.

\bibitem[D173]{D173}
{Dayd\'e, M. J.} and {Duff, I. S.}
\newblock {A} block implementation of level 3 {BLAS} for {RISC} processors.
\newblock {Tech. Report}, CERFACS, 1995.

\bibitem[B35]{B35}
{de Boor, C.}
\newblock {\em A Practical Guide to Splines}.
\newblock Springer-Verlag, 1978.

\bibitem[B157]{B157}
{de Buchet, J.}
\newblock How to take into account the low density of matrices to design a
  mathematical programming package~: {Relevant} effects on optimization and
  inversion algorithms.
\newblock In {Reid, J. K.}, editor, {\em Large Sparse Sets of Linear
  Equations}, pages 211--217. Academic Press, 1971.

\bibitem[C1]{C1}
{de Carvalho, M. L. B.}
\newblock On the minimization of work needed to factor a symmetric positive
  definite matrix.
\newblock {Manuscript} ORC 87-14, Dept. of Industrial Eng. and Oper. Research,
  Univ. of California, Berkeley, 1987.

\bibitem[C43]{C43}
{de Carvalho, M. L. B.}, {Carceroni, R. L.}, and {J\'unior, W. M.}
\newblock Uma experi\^encia de implementa\c c\~ao de m\'etodos de ordena\c
  c\~ao paralelos em m\'aquina {SIMD}.
\newblock In {\em Anais do V Simp\'osio Brasileiro de Arquitetura de
  Computadores e Processamento de Alto Desempenho -- XIII Congresso da
  Sociedade Brasileira de Computa\c c\~ao}, pages 189--201, 1993.

\bibitem[C44]{C44}
{de Carvalho, M. L. B.} and {J\'unior, W. M.}
\newblock Simula\c c\~ao de redes neuronais em ambientes heterog\^eneos e
  paralelos.
\newblock In {\em Anais do V Simp\'osio Brasileiro de Arquitetura de
  Computadores e Processamento de Alto Desempenho -- XIII Congresso da
  Sociedade Brasileira de Computa\c c\~ao}, pages 217--231, 1993.

\bibitem[C42]{C42}
{de Carvalho, M. L. B.}, {Lima, M. A. de C.}, {Corr\^ea, W. T.}, and {J\'unior,
  W. M.}
\newblock Uso da heterogeneidade para acelera\c c\~ao de ray tracing.
\newblock In {\em Anais do V Simp\'osio Brasileiro de Arquitetura de
  Computadores e Processamento de Alto Desempenho -- XIII Congresso da
  Sociedade Brasileira de Computa\c c\~ao}, pages 174--188, 1993.

\bibitem[D85]{D85}
{DEC}.
\newblock {Special Issue} dedicated to {VAX} 8800.
\newblock {Digital Technical Journal, 4}, 1987.

\bibitem[D89]{D89}
{Decker, I. C.}, {Falc\~ao, D. M.}, and {Kaszkurewicz, E.}
\newblock An efficient parallel method for transient stability analysis.
\newblock In {\em Proc. $10^{th}$ Power System Computation Conference
  ({PSCC})}, pages 509--516, Graz, Austria, 1990.

\bibitem[D87]{D87}
{Decker, I. C.}, {Falc\~ao, D. M.}, and {Kaszkurewicz, E.}
\newblock Parallel implementation of a power system simulation methodology
  using the conjugate gradient method.
\newblock In {\em IEEE Transactions on Power System Computation Conference},
  pages 509--519, 1991.

\bibitem[D88]{D88}
{Decker, I. C.}, {Falc\~ao, D. M.}, and {Kaszkurewicz, E.}
\newblock Parallel implementation of a power system dynamic simulation
  methodology using the conjugate gradient method.
\newblock {\em IEEE Trans. Power Systems}, PWRS-7:458--465, 1992.

\bibitem[D86]{D86}
{Decker, I. C.}, {Falc\~ao, D. M.}, and {Kaszkurewicz, E.}
\newblock Algoritmos para a simula\c c\~ao da din\^amica de sistemas de energia
  el\'etrica em computadores paralelos.
\newblock In {\em Anais do V Simp\'osio Brasileiro de Arquitetura de
  Computadores e Processamento de Alto Desempenho -- XIII Congresso da
  Sociedade Brasileira de Computa\c c\~ao}, pages 444--458, 1993.

\bibitem[D90]{D90}
{Decker, I. C.}, {Falc\~ao, D. M.}, and {Kaszkurewicz, E.}
\newblock Esquema alternado entrela\c cado impl\'\i cito paralelo~: {Aplica\c
  c\~ao} do m\'etodo gradiente conjugado pr\'e-condicionado as equa\c c\~oes da
  rede el\'etrica.
\newblock {Relat\'orio Interno}, Programa de Engenharia El\'etrica, COPPE/UFRJ,
  1993.

\bibitem[D91]{D91}
{Decker, I. C.}, {Falc\~ao, D. M.}, and {Kaszkurewicz, E.}
\newblock Esquema simult\^aneo impl\'\i cito paralelo no tempo~: {Aplica\c
  c\~ao} dos m\'etodos gradiente biconjugado e bi-cgstab.
\newblock {Relat\'orio Interno}, Programa de Engenharia El\'etrica, COPPE/UFRJ,
  1993.

\bibitem[D1]{D1}
{Dembart, B.} and {Erisman, A. M.}
\newblock Hybrid sparse matrix methods.
\newblock {\em IEEE Trans. Circuit Theory}, CT-20:641--649, 1973.

\bibitem[D79]{D79}
{Dembart, B.} et~al.
\newblock Improved mathematical techniques for dynamic analysis, volume 2.
\newblock EPRI Project 670-2.

\bibitem[D58]{D58}
{Dembart, B.} and {Neves, K.W.}
\newblock Sparse triangular factorization on vector computers.
\newblock In {\em Exploring Applications of Parallel Processing}, pages 22--25,
  Palo Alto, 1977. Electric Power Research Institute.
\newblock ({Report EL-566-QR}).

\bibitem[D104]{D104}
{Dembo, R. S.}
\newblock Large-scale nonlinear optimization.
\newblock In {Powell, M. J. D.}, editor, {\em Nonlinear Optimization 1981},
  pages 361--372. Academic Press, 1982.

\bibitem[D105]{D105}
{Dembo, R. S.}
\newblock {NLPNET}~: {A} code for nonlinear network optimization problems.
\newblock {Working Paper} Series B-70, Yale Univ., New Haven, 1983.

\bibitem[D47]{D47}
{Dembo, R. S.}
\newblock Solving box-constrained quadratic programming problems on a vector
  processor.
\newblock {Tech. Report}, Dept. of Computer Science, Univ. of Toronto, Canada,
  1987.

\bibitem[D95]{D95}
{Dembo, R. S.}, {Eisenstat, S. C.}, and {Steihaug, T.}
\newblock Inexact {Newton} methods.
\newblock {\em SIAM J. Numer. Anal.}, 19:400--408, 1982.

\bibitem[D99]{D99}
{Dembo, R. S.} and {Tulowitzki, U.}
\newblock On the minimization of quadratic functions subject to box
  constraints.
\newblock {Working Paper}~71, School of Organization and Management, Yale
  Univ., New Haven, CT, 1983.

\bibitem[D51]{D51}
{Demidovich, B. P.} and {Maron, I. A.}
\newblock {\em Computational Mathematics}.
\newblock Mir Publishers, 1976.

\bibitem[D170]{D170}
{Demmel, J. W.}, {Gilbert, J. R.}, and {Li, X. S.}
\newblock {\em {SuperLU} ``{User's Guide}''}, 1995.

\bibitem[D171]{D171}
{Eisenstat, S. C.} {Demmel, J. W.}, {Gilbert, J. R.}, {Li, X. S.}, and {Liu, J.
  W. H.}
\newblock A supernodal approach to sparse partial pivoting.
\newblock {Tech. Report} CSL-95-03, XEROX Palo Alto Research Center, 1995.

\bibitem[D159]{D159}
{Denis-Papin, M.} and {Kaufmann, A.}
\newblock {\em Cours de Calcul Matriciel}.
\newblock Albin Michel, 1953.

\bibitem[D155]{D155}
{Denning, P. J.}
\newblock Virtual memory.
\newblock {\em ACM Computing Surveys}, 2:153--189, 1970.

\bibitem[D67]{D67}
{Dennis, J. E. Jr.} and {Mor\'e, J.}
\newblock Quasi-{Newton} methods, motivation and theory.
\newblock {\em SIAM Review}, 19:46--89, 1974.

\bibitem[D48]{D48}
{Dennis, J. E. Jr.} and {Schnabel, R. B.}
\newblock {\em Numerical Methods for Unconstrained Optimization and Nonlinear
  Equations}.
\newblock Prentice-Hall, 1983.

\bibitem[D100]{D100}
{Dennis, J. E. Jr.} and {Schnabel, R. B.}
\newblock A view of unconstrained optimization.
\newblock In {Nemhauser, G. L.}, {Rinnooy Kan, A.}, and {Todd, M. J.}, editors,
  {\em Handbooks in Operations Research and Management Science, volume {1}~:
  {Optimization}}, chapter~1, pages 1--72. North-Holland, 1989.

\bibitem[D71]{D71}
{Dennis, J. E. Jr.} and {Torczon, V.}
\newblock Direct search methods on parallel machines.
\newblock {\em SIAM J. Optimization}, 1(4):448--474, 1991.

\bibitem[D72]{D72}
{Dennis, J. E. Jr.} and {Turner, K.}
\newblock Generalized conjugate directions.
\newblock {\em Lin. Alg. Appl.}, 88:187--209, 1987.

\bibitem[D52]{D52}
{Deo, N.}
\newblock {\em Graph Theory with Applications to Engineering and Computer
  Science}.
\newblock Prentice-Hall, 1974.

\bibitem[D169]{D169}
{Deo, N.}, {Krishnamoorty, M. S.}, and {Langston, M. A.}
\newblock Exact and approximate solutions for the gate matrix layout problem.
\newblock {\em IEEE Trans. on Computer Aided Design}, 6:79--84, 1987.

\bibitem[D166]{D166}
{DeRosa, J.}, {Glackemeyer, R.}, and {Knight, T.}
\newblock Design and implementation of the {VAX 8600} pipeline.
\newblock {\em Computer}, 18(5):38--48, 1985.

\bibitem[D168]{D168}
{Dijkstra, E. W.}
\newblock A note on two problems in connection with graphs.
\newblock {\em Numerical Mathematics}, 1(5):269--271, 1959.

\bibitem[D84]{D84}
{Dijkstra, E. W.}
\newblock {GOTO} statements considered harmful.
\newblock {\em Comm. ACM}, 11:147--148, 1968.

\bibitem[D108]{D108}
{Dijkstra, E. W.}
\newblock {\em A Discipline of Programming}.
\newblock Prentice-Hall, 1976.

\bibitem[D73]{D73}
{Dikin, I. I.}
\newblock Iterative solution of problems of linear and quadratic programming.
\newblock In {\em Doklady Akademii Nauk SSSR 174}, pages 747--748, 1967.
\newblock ({Translated from Russian in Soviet Mathematics Doklady,
  8:674--675}).

\bibitem[D74]{D74}
{Dikin, I. I.}
\newblock On the convergence of an iterative process.
\newblock {\em Upravlyaemye Sistemii}, 12:54--60, 1974.
\newblock ({In Russian}).

\bibitem[D156]{D156}
{Director, S. W.}
\newblock A survey of decomposition techniques for analysis and design of
  electrical networks.
\newblock In {Himmelblau, D. M.}, editor, {\em Decomposition of Large Scale
  Problems}, pages 93--118. North-Holland, 1973.

\bibitem[D142]{D142}
{Ditzel, D. R.} and {McLellan, H. R.}
\newblock Branch folding in the {CRISP} microprocessor~: {Reducing} the branch
  delay to zero.
\newblock In {\em Proc. $14^{th}$ Symposium on Computer Architecture}, pages
  2--7, Pittsburgh, 1987.

\bibitem[D107]{D107}
{Dixon, L. C. W.}
\newblock Global optima without convexity.
\newblock {Tech. Report}, Numerical Optimization Centre, Hatfield Polytechnic,
  1978.

\bibitem[D103]{D103}
{Dixon, L. C. W.}
\newblock The place of parallel computation in numerical optimization -- {I}~:
  {The} local problem.
\newblock {Tech. Report} 118, Numerical Optimization Centre, The Hatfield
  Polytechnic, 1981.

\bibitem[D97]{D97}
{Dixon, L. C. W.} and {Szeg{\"o}, G. P.}
\newblock {\em Towards Global Optimization}, volume~1.
\newblock North-Holland, 1975.

\bibitem[D98]{D98}
{Dixon, L. C. W.} and {Szeg{\"o}, G. P.}
\newblock {\em Towards Global Optimization, volume 2}.
\newblock North-Holland, 1978.

\bibitem[D165]{D165}
{Dixon, P. B.}, {Parmenter, B. R.}, {Sutton, J.}, and {Vincent, D. P.}
\newblock {\em {ORANI}~: {A} Multisectoral Model of the {Australian} Economy}.
\newblock North-Holland, 1982.

\bibitem[D172]{D172}
{Djidjev, H. N.} and {Gilbert, J. R.}
\newblock Separators in graphs with negative and multiple vertex weights.
\newblock {Tech. Report} CSL-90-08, XEROX Palo Alto Research Center, 1990.
\newblock ({Revised at Tech. Report CSL-92-07}).

\bibitem[C150]{C150}
{do Carmo, M. P.}
\newblock {\em Riemannian Geometry}.
\newblock Birkh{\"a}user Verlag, Boston, 1992.

\bibitem[D157]{D157}
{Dobbie, J. M.}
\newblock A survey of search theory.
\newblock {\em Operations Res.}, 16:525--537, 1968.

\bibitem[D57]{D57}
{Dodson, D. S.}, {Grimes, R. G.}, and {Lewis, J. G.}
\newblock Algorithm 692~: {Model} implementation and test package for the
  sparse {B}asic {L}inear {A}lgebra {S}ubprograms.
\newblock {\em ACM Trans. Math. Software}, 17(2):264--272, 1991.

\bibitem[D56]{D56}
{Dodson, D. S.}, {Grimes, R. G.}, and {Lewis, J. G.}
\newblock Sparse extensions to the {FORTRAN} {B}asic {L}inear {A}lgebra
  {S}ubprograms.
\newblock {\em ACM Trans. Math. Software}, 17(2):253--263, 1991.

\bibitem[D124]{D124}
{Dodson, D. S.} and {Lewis, J. G.}
\newblock Issues relating to the extension of the {B}asic {L}inear {A}lgebra
  subprograms.
\newblock {\em ACM SIGNUM Newsletter}, 20(1):2--18, 1985.

\bibitem[D162]{D162}
{Dold, A.} and {Eckmann, B.}, editors.
\newblock {\em Proc. of the Symposium on Constructive and Computational Methods
  for Differential Equations}.
\newblock Springer-Verlag, 1974.

\bibitem[D77]{D77}
{Dommel, H. W.}
\newblock A method for solution of transient phenomena in multiphase systems.
\newblock In {\em Power System Computation Conference}, Stockholm, 1966.

\bibitem[D78]{D78}
{Dommel, H. W.} et~al.
\newblock Further developments in {Newton's} method for power system
  applications.
\newblock {Paper} 70-CP-161, Bonneville Power Administration, 1970.
\newblock (Presented at {IEEE} {Winter Power Meeting, New York}).

\bibitem[D76]{D76}
{Dommel, H. W.} and {Tinney, W. F.}
\newblock Optimal power flow solutions.
\newblock {\em IEEE Trans. Power Apparatus and Systems}, PAS-88(10):1866--1876,
  1969.

\bibitem[D167]{D167}
{Dongarra, J. J.}
\newblock A survey of high performance computers.
\newblock In {\em {COMPCON}}, pages 8--11. IEEE, 1986.

\bibitem[D123]{D123}
{Dongarra, J. J.}, editor.
\newblock {\em Experimental Parallel Computing Architectures}.
\newblock North-Holland, 1987.

\bibitem[D125]{D125}
{Dongarra, J. J.}
\newblock Performance of various computers using standard linear equations
  software in a {FORTRAN} environment.
\newblock {Tech. Report} CS-89-85, Univ. of Tennessee, 1990.

\bibitem[D55]{D55}
{Dongarra, J. J.}
\newblock {NA-NET} is up and running at {O}ak {R}idge {N}ational {L}aboratory.
\newblock {\em SIAM News}, 24(2):22, 1991.

\bibitem[D110]{D110}
{Dongarra, J. J.}, {Du Croz, J.}, {Duff, I. S.}, and {Hammarling, S.}
\newblock A set of level 3 {B}asic {L}inear {A}lgebra {S}ubprograms.
\newblock {\em ACM Trans. Math. Software}, 16:1--17, 1990.

\bibitem[D111]{D111}
{Dongarra, J. J.}, {Du Croz, J.}, {Hammarling, S.}, and {Hanson, R.}
\newblock An extended set of {FORTRAN} {B}asic {L}inear {A}lgebra
  {S}ubroutines.
\newblock {\em ACM Trans. Math. Software}, 14:1--32, 1988.

\bibitem[D5]{D5}
{Dongarra, J. J.} and {Duff, I. S.}
\newblock Performance of vector computers for direct and indirect addressing in
  {FORTRAN}.
\newblock {Tech. Report}, Harwell Laboratory, 1986.

\bibitem[D126]{D126}
{Dongarra, J. J.} and {Duff, I. S.}
\newblock Advanced architecture computers.
\newblock {Tech. Report} CS-89-90, Univ. of Tennessee, 1989.

\bibitem[D3]{D3}
{Dongarra, J. J.}, {Duff, I. S.}, {Sorensen, D. C.}, and {van der Vorst, H. A.}
\newblock {\em Solving Linear Systems on Vector and Shared Memory Computers}.
\newblock SIAM Publications, 1991.

\bibitem[D75]{D75}
{Dongarra, J. J.} and {Eisenstat, S. C.}
\newblock Squeezing the most out of an algorithm in {CRAY} {FORTRAN}.
\newblock {\em ACM Trans. Math. Software}, 10(3):219--230, 1984.

\bibitem[D66]{D66}
{Dongarra, J. J.} et~al.
\newblock {\em {LINPACK} ``{User's Guide}''}.
\newblock SIAM Publications, 1979.

\bibitem[D54]{D54}
{Dongarra, J. J.} and {Grosse. E.}
\newblock Distribution of mathematical software via electronic mail.
\newblock {\em Comm. ACM}, 30(5):403--407, 1987.

\bibitem[D4]{D4}
{Dongarra, J. J.}, {Gustavson, F. G.}, and {Karp, A. H.}
\newblock Implementing linear algebra algorithms for dense matrices on a vector
  pipeline machine.
\newblock {\em SIAM Review}, 26:91--112, 1984.

\bibitem[D2]{D2}
{Dongarra, J. J.} and {Hinds, A. R.}
\newblock Unrolling loops in {FORTRAN}.
\newblock {\em Software Practice and Experience}, 9:219--229, 1979.

\bibitem[D68]{D68}
{Dongarra, J. J}, {Messina, P.}, {Sorensen, D. C.}, and {Voigt, R. G.},
  editors.
\newblock {\em Proc. $4^{th}$ {SIAM} Conference on Parallel Processing for
  Scientific Computing}.
\newblock SIAM Publications, 1990.

\bibitem[D128]{D128}
{Dongarra, J. J.} and {Sorensen, D. C.}
\newblock Linear algebra on high-performance computers.
\newblock In {Schendel, U.}, editor, {\em Proc. of Parallel Computing '85},
  pages 3--32. North-Holland, 1986.

\bibitem[D133]{D133}
{Dongarra, J. J.} and {Sorensen, D. C.}
\newblock A fully parallel algorithm for the symmetric eigenvalue problem.
\newblock {\em SIAM J. Sci. and Stat. Comput.}, 8:s139--s154, 1987.

\bibitem[D127]{D127}
{Dongarra, J. J.}, {Sorensen, D. C.}, {Connolly, K.}, and {Patterson, J.}
\newblock Programming methodology and performance issues for advanced computer
  architectures.
\newblock {\em Parallel Computing}, 8:41--58, 1988.

\bibitem[D61]{D61}
{Dorn, W. S.} and {McCracken, D. D.}
\newblock {\em Numerical Methods with {FORTRAN} {IV} Case Studies}.
\newblock John Wiley \& Sons, 1972.

\bibitem[D160]{D160}
{Dorr, F. W.}
\newblock The direct solution of the discrete {Poisson} equation on a
  rectangle.
\newblock {\em SIAM Review}, 12:248--263, 1970.

\bibitem[D161]{D161}
{Dorr, F. W.}
\newblock The direct solution of the discrete {Poisson} equation in ${O}(n^2)$
  operations.
\newblock {\em SIAM Review}, 17:412--415, 1975.

\bibitem[C110]{C110}
{Du Croz, J. J.}, {Nugent, S. M.}, {Reid, J. K.}, and {Taylor, D. B.}
\newblock Algorithm 578~: {Solution} of real linear equations in a paged
  virtual store.
\newblock {\em ACM Trans. Math. Software}, 7(4):537--551, 1981.

\bibitem[C5]{C5}
{Du Croz, J. J.}, {Nugent, S. M.}, {Reid, J. K.}, and {Taylor, D. B.}
\newblock Solving large full sets of linear equations in a paged virtual store.
\newblock {\em ACM Trans. Math. Software}, 7(4):527--536, 1981.

\bibitem[D164]{D164}
{Duff, I. S.}
\newblock Network analysis and graph theory, 1970.
\newblock (Dissertation for {Dipl. Adv. Math., Oxford Univ.}).

\bibitem[D120]{D120}
{Duff, I. S.}
\newblock {\em Analysis of Sparse Systems}.
\newblock PhD thesis, Oxford Univ., England, 1972.
\newblock ({Chapters: On a Factored Form of the Inverse for Sparse Matrices,
  Selecting a Maximal Transversal}).

\bibitem[D26]{D26}
{Duff, I. S.}
\newblock On the number of nonzeros added when {Gaussian} elimination is
  performed on sparse random matrices.
\newblock {\em Math. of Computation}, 28(125):219--230, 1974.

\bibitem[D16]{D16}
{Duff, I. S.}
\newblock On algorithms for obtaining a maximum transversal.
\newblock {Tech. Report} CSS-49, Harwell Laboratory, 1976.

\bibitem[D11]{D11}
{Duff, I. S.}
\newblock {MA28}~: {A} set of {FORTRAN} subroutines for sparse unsymmetric
  linear equations.
\newblock {Tech. Report} R-8730, HMSO, AERE Harwell Laboratory, 1977.

\bibitem[D7]{D7}
{Duff, I. S.}
\newblock A survey of sparse matrix research.
\newblock {\em Proc. of the IEEE}, 65(4):500--535, 1977.

\bibitem[D17]{D17}
{Duff, I. S.}
\newblock Some current approaches to the solution of large sparse systems of
  linear equations.
\newblock {Tech. Report} CSS-65, Harwell Laboratory, 1978.

\bibitem[D69]{D69}
{Duff, I. S.}
\newblock Practical comparisons of codes for the solution of sparse linear
  systems.
\newblock In {Duff, I. S.} and {Stewart, G. W.}, editors, {\em Sparse Matrix
  Proceedings 1978}, pages 107--134. SIAM Publications, 1979.

\bibitem[D34]{D34}
{Duff, I. S.}
\newblock Recent developments in the solution of large sparse linear equations.
\newblock {Tech. Report} CSS-80, AERE, Harwell Laboratory, 1980.

\bibitem[D119]{D119}
{Duff, I. S.}
\newblock Recent developments in the solution of large sparse linear equations.
\newblock In {Glowinski, R.} and {Lions, J. L.}, editors, {\em Computing
  Methods in Applied Sciences and Engineering}, pages 407--426. North-Holland,
  1980.

\bibitem[D25]{D25}
{Duff, I. S.}
\newblock Algorithm 575~: {Permutations} for a zero-free diagonal.
\newblock {\em ACM Trans. Math. Software}, 7(3):387--390, 1981.

\bibitem[D35]{D35}
{Duff, I. S.}
\newblock Full matrix techniques in sparse {Gaussian} elimination.
\newblock {Tech. Report} CSS-114, AERE, Harwell Laboratory, 1981.

\bibitem[D14]{D14}
{Duff, I. S.}
\newblock {MA32}~: {A} package for solving sparse unsymmetric systems using the
  frontal method.
\newblock {Tech. Report} R-10079, HMSO, AERE Harwell Laboratory, 1981.

\bibitem[D42]{D42}
{Duff, I. S.}
\newblock {ME28}~: {A} sparse unsymmetric linear equation solver for complex
  equations.
\newblock {\em ACM Trans. Math. Software}, 7(4):505--511, 1981.

\bibitem[D29]{D29}
{Duff, I. S.}
\newblock On algorithms for obtaining a maximum transversal.
\newblock {\em ACM Trans. Math. Software}, 7(3):315--330, 1981.

\bibitem[D45]{D45}
{Duff, I. S.}
\newblock A sparse future.
\newblock In {Duff, I. S.}, editor, {\em Sparse Matrices and Their Uses}, pages
  1--29. Academic Press, 1981.

\bibitem[D44]{D44}
{Duff, I. S.}, editor.
\newblock {\em Sparse Matrices and Their Uses}.
\newblock Academic Press, 1981.

\bibitem[D12]{D12}
{Duff, I. S.}
\newblock {MA27}~: {A} set of {FORTRAN} subroutines for sparse symmetric linear
  equations.
\newblock {Tech. Report} R-10533, HMSO, AERE Harwell Laboratory, 1982.

\bibitem[D33]{D33}
{Duff, I. S.}
\newblock Research directions in sparse matrix computations.
\newblock {Tech. Report} AERE-R-10547, AERE, Harwell Laboratory, 1982.

\bibitem[D136]{D136}
{Duff, I. S.}
\newblock The solution of sparse linear equations on the {CRAY-1}.
\newblock {\em CRAY Channels}, 4(3), 1982.

\bibitem[D18]{D18}
{Duff, I. S.}
\newblock A survey of sparse matrix software.
\newblock {Tech. Report} R-10512, Computer Science and Systems Division, AERE
  Harwell Laboratory, Oxfordshire, 1982.

\bibitem[D19]{D19}
{Duff, I. S.}
\newblock Enhancements to the {MA32} package for solving sparse unsymmetric
  equations.
\newblock {Tech. Report} R-11009, HMSO, London, 1983.

\bibitem[D10]{D10}
{Duff, I. S.}
\newblock Data structures, algorithms and software for sparse matrices.
\newblock {Tech. Report} 84-1846, Harwell Laboratory, 1984.

\bibitem[D39]{D39}
{Duff, I. S.}
\newblock Design features of a frontal code for solving sparse unsymmetric
  linear systems out of core.
\newblock {\em SIAM J. Sci. and Stat. Comput.}, 5(2):270--280, 1984.

\bibitem[D37]{D37}
{Duff, I. S.}
\newblock Direct methods for solving sparse systems of linear equations.
\newblock {\em SIAM J. Sci. and Stat. Comput.}, 5(3):605--619, 1984.

\bibitem[D129]{D129}
{Duff, I. S.}
\newblock The solution of sparse linear equations on the {CRAY-1}.
\newblock In {Kowalik, J. S.}, editor, {\em Proceedings of the {NATO} Workshop
  on High Speed Computation, West Germany}, volume F-7 of {\em {NATO} {ASI}
  Series}, pages 293--309. Springer-Verlag, 1984.

\bibitem[D121]{D121}
{Duff, I. S.}
\newblock Data structures, algorithms and software for sparse matrices.
\newblock In {Evans, D. J.}, editor, {\em Sparsity and its Applications}, pages
  1--29. Cambridge University Press, 1985.

\bibitem[D9]{D9}
{Duff, I. S.}, editor.
\newblock {\em Vector and Parallel Processors in Computational Science~:
  {Proc.} $2^{nd}$ International Conference on Vector and Parallel Processors
  in Computational Science}. Elsevier Science Publishing Co., 1985.

\bibitem[D15]{D15}
{Duff, I. S.}
\newblock The influence of vector and parallel processors on numerical
  analysis.
\newblock {Tech. Report} AERE-R-12329, Computer Science and Systems Division,
  Harwell Laboratory, Oxon, England, 1986.

\bibitem[D31]{D31}
{Duff, I. S.}
\newblock Parallel implementation of multifrontal schemes.
\newblock {\em Parallel Computing}, 3:193--204, 1986.

\bibitem[D130]{D130}
{Duff, I. S.}
\newblock The parallel solution of sparse linear equations.
\newblock In {Handler, W.}, {Haupt, D.}, {Jeltsch, R.}, {Juling, W.}, and
  {Lange, O.}, editors, {\em {CONPAR} '86}, volume 237 of {\em Lecture Notes in
  Computer Science}, pages 18--24. Springer-Verlag, 1986.

\bibitem[D20]{D20}
{Duff, I. S.}
\newblock The use of vector and parallel computers in the solution of large
  sparse linear equations.
\newblock {Tech. Report} AERE-R-12393, Computer Science and Systems Division,
  Harwell Laboratory, Oxon, England, 1986.

\bibitem[D22]{D22}
{Duff, I. S.}
\newblock Multiprocessing a sparse matrix code on the {ALLIANT} {FX/8}.
\newblock {Tech. Report} CSS-210, Computer Science and Systems Division,
  Harwell Laboratory, Oxon, England, 1987.

\bibitem[D36]{D36}
{Duff, I. S.}
\newblock Direct solvers.
\newblock {\em Computer Physics Reports}, 11:21--50, 1989.

\bibitem[D115]{D115}
{Duff, I. S.}
\newblock Multiprocessing a sparse matrix code on the {ALLIANT} {FX/8}.
\newblock {\em J. Comput. Appl. Math.}, 27:229--239, 1989.

\bibitem[D13]{D13}
{Duff, I. S.}, {Erisman, A. M.}, {Gear, C. W.}, and {Reid, J. K.}
\newblock Some remarks on inverses of sparse matrices.
\newblock {Tech. Report} CSS-171, AERE Harwell Laboratory, 1985.
\newblock (Also available as Report 51, Mathematics and Computer Science
  Division, Argonne National Laboratory).

\bibitem[D117]{D117}
{Duff, I. S.}, {Erisman, A. M.}, and {Reid, J. K.}
\newblock A comparison of sparsity orderings for obtaining a pivotal sequence
  in {Gaussian} elimination.
\newblock {\em J. Inst. Math. Appl.}, 14:281--291, 1974.

\bibitem[D118]{D118}
{Duff, I. S.}, {Erisman, A. M.}, and {Reid, J. K.}
\newblock Pivot selection and row ordering in {Givens} reduction on sparse
  matrices.
\newblock {\em Computing}, 13:239--248, 1974.

\bibitem[D116]{D116}
{Duff, I. S.}, {Erisman, A. M.}, and {Reid, J. K.}
\newblock On {George's} nested dissection method.
\newblock {\em SIAM J. Numer. Anal.}, 13:686--695, 1976.

\bibitem[D6]{D6}
{Duff, I. S.}, {Erisman, A. M.}, and {Reid, J. K.}
\newblock {\em Direct Methods for Sparse Matrices}.
\newblock Clarendon Press, Oxford, 1986.

\bibitem[D23]{D23}
{Duff, I. S.}, {Gould, N.}, {Lescrenier, M.}, and {Reid, J. K.}
\newblock The multifrontal method in a parallel environment.
\newblock {Tech. Report} CSS-211, Computer Science and Systems Division,
  Harwell Laboratory, Oxon, England, 1987.
\newblock (Published at {Advances in Numerical Computation, Cox, M. and
  Hammarling, S., editors, Oxford University Press, 1990}).

\bibitem[D24]{D24}
{Duff, I. S.}, {Grimes, R. G.}, and {Lewis, J. G.}
\newblock Sparse matrix test problems.
\newblock {\em ACM Trans. Math. Software}, 15(1):1--14, 1989.

\bibitem[D38]{D38}
{Duff, I. S.}, {Grimes, R. G.}, and {Lewis, J. G.}
\newblock ``{User's Guide}'' for the {Harwell-Boeing} sparse matrix collection
  ({R}elease {I}).
\newblock {Tech. Report} RAL-92-086, Rutherford Appleton Laboratory, 1992.

\bibitem[D122]{D122}
{Duff, I. S.}, {Grimes, R. G.}, {Lewis, J. G.}, and {Poole, B.}
\newblock Sparse matrix test problems.
\newblock {\em ACM SIGNUM Newsletter}, 17:22, 1982.

\bibitem[D163]{D163}
{Duff, I. S.} and {Gustavson, F. G.}
\newblock Implementations of the {Hopcroft} and {Karp} maximum matching
  algorithm.

\bibitem[D140]{D140}
{Duff, I. S.} and {Johnsson, L.}
\newblock The effect of orderings on the parallelization of sparse code.
\newblock {Tech. Memorandum}, Mathematics and Computer Science Division,
  Argonne National Laboratory, 1986.

\bibitem[D141]{D141}
{Duff, I. S.} and {Johnsson, L.}
\newblock Node orderings and concurrency in sparse problems~: {An} experimental
  investigation.
\newblock In {\em Proc. of International Conference on Vector and Parallel
  Computing, Loen, Norway}, pages 2--6, 1986.

\bibitem[D188]{D188}
{Duff, I. S.} and {Johnsson, L. S.}
\newblock Node orderings and concurrency in structurally-symmetric sparse
  problems.
\newblock In {Carey, G. F.}, editor, {\em Parallel Supercomputing:~ {Methods},
  Algorithms, and Applications}, pages 177--189. John Wiley \& Sons, 1989.

\bibitem[D131]{D131}
{Duff, I. S.} and {Johnsson, S. L.}
\newblock Node orderings and concurrency in structurally-symmetric sparse
  problems.
\newblock In {Garey, G. F.}, editor, {\em Parallel Supercomputing~: {Methods},
  Algorithms and Applications}, pages 177--189. John Wiley \& Sons, 1988.

\bibitem[D32]{D32}
{Duff, I. S.}, {Marrone, M.}, and {Radicati, G.}
\newblock A proposal for user level sparse {BLAS}.
\newblock {Tech. Report} RAL-92-087, Rutherford Appleton Laboratory, 1992.

\bibitem[D109]{D109}
{Duff, I. S.} and {Meurant, G.}
\newblock The effect of ordering on preconditioned conjugate gradients.
\newblock {\em BIT}, 29, 1989.

\bibitem[D80]{D80}
{Duff, I. S.} and {Reid, J. K.}
\newblock On the reduction of sparse matrices to condensed forms by similarity
  transformations.
\newblock {\em J. Inst. Math. Appl.}, 15:217--224, 1975.

\bibitem[D81]{D81}
{Duff, I. S.} and {Reid, J. K.}
\newblock A comparison of some methods for the solution of sparse
  overdetermined systems of linear equations.
\newblock {\em J. Inst. Math. Appl.}, 17:267--280, 1976.

\bibitem[D28]{D28}
{Duff, I. S.} and {Reid, J. K.}
\newblock Algorithm 529~: {Permutations} to block tridiagonal form.
\newblock {\em ACM Trans. Math. Software}, 4(2):189--192, 1978.

\bibitem[D27]{D27}
{Duff, I. S.} and {Reid, J. K.}
\newblock An implementation of {Tarjan's} algorithm for the block triangulation
  of a matrix.
\newblock {\em ACM Trans. Math. Software}, 4(2):137--147, 1978.

\bibitem[D83]{D83}
{Duff, I. S.} and {Reid, J. K.}
\newblock Performance evaluation of codes for sparse matrix problems.
\newblock In {Fosdick, L. D.}, editor, {\em Performance Evaluation of Numerical
  Software}, pages 121--135. North-Holland, 1979.

\bibitem[D41]{D41}
{Duff, I. S.} and {Reid, J. K.}
\newblock Some design features of a sparse matrix code.
\newblock {\em ACM Trans. Math. Software}, 5(1):18--35, 1979.

\bibitem[D137]{D137}
{Duff, I. S.} and {Reid, J. K.}
\newblock Experience of sparse matrix codes on the {CRAY-1}.
\newblock {\em Comput. Phys. Comm.}, 76:293--302, 1982.

\bibitem[D43]{D43}
{Duff, I. S.} and {Reid, J. K.}
\newblock The multifrontal solution of indefinite sparse symmetric linear
  equations.
\newblock {\em ACM Trans. Math. Software}, 9(3):302--325, 1983.

\bibitem[D40]{D40}
{Duff, I. S.} and {Reid, J. K.}
\newblock The multifrontal solution of unsymmetric sets of linear equations.
\newblock {\em SIAM J. Sci. and Stat. Comput.}, 5(3):633--641, 1984.

\bibitem[D176]{D176}
{Duff, I. S.} and {Reid, J. K.}
\newblock {MA48}:~{A} {FORTRAN} code for direct solution of sparse unsymmetric
  linear systems of equations.
\newblock {Tech. Report} RAL-93-072, Rutherford Appleton Laboratory, Oxon,
  1993.

\bibitem[D184]{D184}
{Duff, I. S.} and {Reid, J. K.}
\newblock The design of {MA48}, a code for the direct solution of sparse
  unsymmetric linear systems of equations.
\newblock {\em ACM Trans. Math. Software}, 1995.
\newblock ({To be published}).

\bibitem[D82]{D82}
{Duff, I. S.}, {Reid, J. K.}, {Munksgaard, N.}, and {Nielsen, H. B.}
\newblock Direct solution of sets of linear equations whose matrix is sparse,
  symmetric and indefinite.
\newblock {\em J. Inst. Math. Appl.}, 23:235--250, 1979.

\bibitem[D185]{D185}
{Duff, I. S.}, {Reid, J. K.}, and {Scott, J. A.}
\newblock The use of low profile reduction algorithms with a frontal code.
\newblock {\em Int. J. Numer. Meth. Eng.}, 28:2555--2568, 1989.

\bibitem[D132]{D132}
{Duff, I. S.}, {Reid, J. K.}, and {Scott, J. A.}
\newblock The use of profile reduction algorithms with a frontal code.
\newblock {\em Int. J. Numer. Meth. in Eng.}, 28:2555--2568, 1989.

\bibitem[D186]{D186}
{Duff, I. S.} and {Scott, J. A.}
\newblock {MA42}:~{A} new frontal code for solving sparse unsymmetric systems.
\newblock {Tech. Report} RAL-93-064, Rutherford Appleton Laboratory, 1993.
\newblock ({To be published in reduced form at ACM Trans. Math. Software}).

\bibitem[D187]{D187}
{Duff, I. S.} and {Scott, J. A.}
\newblock The use of multiple fronts in gaussian elimination.
\newblock In {Lewis, J.}, editor, {\em Proc. $5^{th}$ SIAM Conference on
  Applied Linear Algebra}, pages 567--571. SIAM Publications, 1994.

\bibitem[D8]{D8}
{Duff, I. S.} and {Stewart, G. W.}, editors.
\newblock {\em Sparse Matrix Proceedings 1978}. SIAM Publications, 1979.

\bibitem[D30]{D30}
{Duff, I. S.} and {Wiberg, T.}
\newblock Remarks on implementations of ${O}(n^{1/2} \tau)$ assignment
  algorithms.
\newblock {\em ACM Trans. Math. Software}, 14(3):267--287, 1988.

\bibitem[D150]{D150}
{Dulmage, A. L.} and {Mendelsohn, N. S.}
\newblock On the inversion of sparse matrices.
\newblock {\em Math. of Computation}, 16:494--496, 1962.

\bibitem[D154]{D154}
{Dulmage, A. L.} and {Mendelsohn, N. S.}
\newblock Two algorithms for bipartite graphs.
\newblock {\em SIAM J. Appl. Math.}, 11:183--194, 1963.

\bibitem[D101]{D101}
{Dunn, J.}
\newblock Global and asymptotic convergence rate estimates for a class of
  projected gradient processes.
\newblock {\em SIAM J. Control and Optim.}, 19:368--400, 1981.

\bibitem[D102]{D102}
{Dunn, J.}
\newblock On the convergence of projected gradient processes to singular
  critical points.
\newblock {\em J. of Optim. Theory Appl.}, 55:203--216, 1987.

\bibitem[D152]{D152}
{Dupont, T.}
\newblock A factorization procedure for the solution of elliptic difference
  equations.
\newblock {\em SIAM J. Numer. Anal.}, 5:735--782, 1968.

\bibitem[D153]{D153}
{Dupont, T.}, {Kendall, R. P.}, and {Rachford, H. H. Jr.}
\newblock An approximate factorization procedure for the solving self-adjoint
  elliptic difference equations.
\newblock {\em SIAM J. Numer. Anal.}, 5:559--573, 1968.

\bibitem[D50]{D50}
{Durand, E.}
\newblock {\em Solutions Num\'eriques des \'Equations Alg\'ebriques, tome
  {II}~: Syst\`emes de Plusieurs \'Equations}.
\newblock Masson \& Cie, 1972.

\bibitem[D158]{D158}
{Dwyer, P. S.}
\newblock {\em Linear Computations}.
\newblock John Wiley \& Sons, 1951.

\bibitem[D134]{D134}
{Dwyer, P. S.} and {Macphail, M. S.}
\newblock Symbolic matrix derivatives.
\newblock {\em Ann. Math. Stat.}, 19:517--534, 1948.

\bibitem[E54]{E54}
{Eckstein, J.}, {Qi, R.}, {Ragulin, V. I.}, and {Zenios, S. A.}
\newblock Data parallel implementations of dense linear programming algorithms.
\newblock {Tech. Report} TMC-230, Thinking Machines Corp., Cambridge, MA, 1992.
\newblock ({Also available as Decision Sciences Dept. Report 92-05-06, The
  Warton School, Univ. of Pennsylvania}).

\bibitem[E41]{E41}
{Edelmann, H.}
\newblock Optimal strategies for the direct solution of systems of linear
  equations with sparse coefficient matrices.
\newblock {\em Math. Mech.}, 45:T13--T18, 1965.

\bibitem[E12]{E12}
{Edelmann, H.}
\newblock Ordered triangular factorization of matrices.
\newblock In {\em Power System Computation Conference}, Stockholm, 1966.

\bibitem[