\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[E9]{E9}
{Edelsbrunner, H.}
\newblock Algorithms in combinatorial geometry.
\newblock In {Brauer, W.}, {Rozenberg, G.}, and {Salomaa, A.}, editors, {\em
  {EATCS} Monographs on Theoretical Computer Science}. Springer-Verlag, 1987.

\bibitem[E20]{E20}
{Edenbrandt, A. G.}
\newblock {\em Combinatorial Problems in Matrix Computation}.
\newblock PhD thesis, Cornell Univ., 1985.

\bibitem[E15]{E15}
{Edmonds, J.}
\newblock Paths, trees, and flowers.
\newblock {\em Canadian J. Math.}, 17:449--467, 1965.

\bibitem[E16]{E16}
{Edmonds, J.}
\newblock Optimum branchings.
\newblock {\em J. Res. Nat. Bur. Standards}, B71:233--240, 1967.

\bibitem[E17]{E17}
{Edmonds, J.} and {Karp, R. M.}
\newblock Theoretical improvements in algorithmic efficiency for network flow
  problems.
\newblock {\em J. ACM}, 19:248--264, 1972.

\bibitem[E10]{E10}
{Efimov, N. V.} and {Rozendorn, E. R.}
\newblock {\em Linear Algebra and Multi-Dimensional Geometry}.
\newblock Mir Publishers, 1975.

\bibitem[E53]{E53}
{Eisenhart, L.}
\newblock {\em {Riemannian} Geometry}.
\newblock Princeton University Press, 1925.

\bibitem[E33]{E33}
{Eisenstat, S. C.}
\newblock Complexity bounds for {Gaussian} elimination.
\newblock {Tech. Report}, Yale Univ.

\bibitem[E44]{E44}
{Eisenstat, S. C.}
\newblock An implementation of the minimum degree algorithm.
\newblock {Tech. Report}, Yale Univ.

\bibitem[E28]{E28}
{Eisenstat, S. C.}
\newblock Efficient implementation of a class of preconditioned conjugate
  gradient methods.
\newblock {\em SIAM J. Sci. and Stat. Comput.}, 2:1--4, 1981.

\bibitem[E27]{E27}
{Eisenstat, S. C.}, {Elman, H. C.}, and {Schultz, M. H.}
\newblock Variational iterative methods for nonsymmetric systems of linear
  equations.
\newblock {\em SIAM J. Numer. Anal.}, 20:345--357, 1983.

\bibitem[E4]{E4}
{Eisenstat, S. C.}, {George, A.}, {Grimes, R.}, {Kincaid, D.}, and {Sherman, A.
  H.}
\newblock Some comparisons of software packages for large sparse linear
  systems.
\newblock In {Vichnevetsky, R.} and {Stepleman}, editors, {\em Advances in
  Computer Methods for Partial Differential Equations III}, pages 98--106.
  Publ. IMACE, 1979.

\bibitem[E43]{E43}
{Eisenstat, S. C.}, {Gursky, M. C.}, {Schultz, M. H.}, and {Sherman, A. H.}
\newblock {Y}ale {S}parse {M}atrix {P}ackage ({YSMP}) -- {II}~: {The}
  non-symmetric codes.
\newblock {Tech. Report} 114, Dept. of Computer Science, Yale Univ., 1977.

\bibitem[E2]{E2}
{Eisenstat, S. C.}, {Gursky, M. C.}, {Schultz, M. H.}, and {Sherman, A. H.}
\newblock {Y}ale {S}parse {M}atrix {P}ackage ({YSMP}) -- {I}~: {The} symmetric
  codes.
\newblock {\em Int. J. Numer. Meth. in Eng.}, 18:1145--1151, 1982.

\bibitem[E21]{E21}
{Eisenstat, S. C.}, {Heath, M.}, {Henkel, C.}, and {Romine, C.}
\newblock Modified cyclic algorithms for solving triangular systems on
  distributed-memory multiprocessors.
\newblock {\em SIAM J. Sci. and Stat. Comput.}, 9:589--600, 1988.

\bibitem[E14]{E14}
{Eisenstat, S. C.} and {Liu, J. W. H.}
\newblock Exploiting structural symmetry in unsymmetric sparse symbolic
  factorization.
\newblock {\em SIAM J. Matrix Anal. and Appl.}, 13(1):202--211, 1992.

\bibitem[E56]{E56}
{Eisenstat, S. C.} and {Liu, J. W. H.}
\newblock Exploiting structural symmetry in a sparse partial pivoting code.
\newblock {\em SIAM J. Sci. and Stat. Comput.}, 14:253--257, 1993.
\newblock ({Presented at $4^th$ SIAM Conference on Applied Linear Algebra,
  Minneapolis, 1991}).

\bibitem[E34]{E34}
{Eisenstat, S. C.}, {Schultz, M. H.}, and {Sherman, A. H.}
\newblock Minimal storage band elimination.
\newblock {Tech. Report}, Yale Univ.

\bibitem[E35]{E35}
{Eisenstat, S. C.}, {Schultz, M. H.}, and {Sherman, A. H.}
\newblock Minimal storage sparse elimination.
\newblock {Tech. Report}, Yale Univ.

\bibitem[E32]{E32}
{Eisenstat, S. C.}, {Schultz, M. H.}, and {Sherman, A. H.}
\newblock Subroutines for the efficient implementation of sparse {Gaussian}
  elimination.
\newblock {Tech. Report}, Yale Univ.

\bibitem[E45]{E45}
{Eisenstat, S. C.}, {Schultz, M. H.}, and {Sherman, A. H.}
\newblock The application of sparse matrix methods to the numerical solution of
  nonlinear elliptic partial differential equations.
\newblock In {Dold, A.} and {Eckmann, B.}, editors, {\em Proc. of the Symposium
  on Constructive and Computational Methods for Differential Equations}.
  Springer-Verlag, 1974.

\bibitem[E48]{E48}
{Eisenstat, S. C.}, {Schultz, M. H.}, and {Sherman, A. H.}
\newblock The application of sparse matrix methods to the numerical solution of
  nonlinear elliptic partial differential equations.
\newblock In {Dold, A.} and {Eckmann, B.}, editors, {\em Proc. of the Symposium
  on Constructive and Computational Methods for Differential Equations}, pages
  131--153. Springer-Verlag, 1974.

\bibitem[E31]{E31}
{Eisenstat, S. C.}, {Schultz, M. H.}, and {Sherman, A. H.}
\newblock Application of sparse matrix methods to partial differential
  equations.
\newblock In {Vichnevetsky, R.}, editor, {\em Proc. {AICA} International
  Symposium on Computer Methods for Partial Differential Equations, Bethlehem},
  pages 40--45. Prentice-Hall, 1975.

\bibitem[E3]{E3}
{Eisenstat, S. C.}, {Schultz, M. H.}, and {Sherman, A. H.}
\newblock Efficient implementation of sparse symmetric {Gaussian} elimination.
\newblock In {Vichnevetsky, R.}, editor, {\em Proc. {AICA} International
  Symposium on Computer Methods for Partial Differential Equations, Bethlehem},
  pages 33--39. Prentice-Hall, 1975.

\bibitem[E23]{E23}
{Eisenstat, S. C.}, {Schultz, M. H.}, and {Sherman, A. H.}
\newblock Applications of an element model for {Gaussian} elimination.
\newblock In {Bunch, J. R.} and {Rose, D. J.}, editors, {\em Sparse Matrix
  Computations}, pages 85--96. Academic Press, 1976.

\bibitem[E30]{E30}
{Eisenstat, S. C.}, {Schultz, M. H.}, and {Sherman, A. H.}
\newblock Considerations in the design of software for sparse {Gaussian}
  elimination.
\newblock In {Bunch, J. R.} and {Rose, D. J.}, editors, {\em Sparse Matrix
  Computations}. Academic Press, 1976.

\bibitem[E5]{E5}
{Eisenstat, S. C.}, {Schultz, M. H.}, and {Sherman, A. H.}
\newblock Software for sparse {Gaussian} elimination with limited core storage.
\newblock In {Duff, I. S.} and {Stewart, G. W.}, editors, {\em Sparse Matrix
  Proceedings 1978}, pages 135--153. SIAM Publications, 1979.

\bibitem[E1]{E1}
{Eisenstat, S. C.}, {Schultz, M. H.}, and {Sherman, A. H.}
\newblock Algorithms and data structures for sparse symmetric {Gaussian}
  elimination.
\newblock {\em SIAM J. Sci. and Stat. Comput.}, 2(2):225--237, 1981.

\bibitem[E22]{E22}
{Eisenstat, S. C.} and {Sherman, A. H.}
\newblock Subroutines for envelope solution of sparse linear systems.
\newblock {Tech. Report}~35, Dept. of Computer Science, Yale Univ., New Haven,
  1974.

\bibitem[E42]{E42}
{Elliot, D. L.}
\newblock A note on systems of linear equations.
\newblock {\em SIAM Review}, 3:66--69, 1961.

\bibitem[E40]{E40}
{Elmaghraby, S. E.}
\newblock An algebra for the analysis of generalized activity networks.
\newblock {\em Management Science}, 10:494--514, 1964.

\bibitem[E55]{E55}
{Elman, H.}
\newblock A stability analysis of incomplete {LU} factorization.
\newblock {\em Math. of Computation}, 47:191--218, 1986.

\bibitem[E11]{E11}
{Enbody, R. J} and {Du, H. C.}
\newblock Dynamic hashing schemes.
\newblock {\em ACM Computing Surveys}, 20(2):85--113, 1988.

\bibitem[E13]{E13}
{Enns, M. K.}, {Tinney, W. F.}, and {Alvarado, F. L.}
\newblock Sparse matrix inverse factors.
\newblock {\em IEEE Trans. Power Systems}, PWRS-5:466--473, 1990.

\bibitem[E47]{E47}
{Erisman, A. M.}
\newblock Sparse matrix approach to frequency domain analysis of linear passive
  electrical networks.
\newblock In {Rose, D. J.} and {Willoughby, R. A.}, editors, {\em Sparse
  Matrices and Their Applications}, pages 31--40. Plenum Press, New York, 1972.

\bibitem[E51]{E51}
{Erisman, A. M.}, {Grimes, R. G.}, {Lewis, J. G.}, and {Poole, W. G. Jr.}
\newblock A structurally stable modification of {Hellerman-Rarick's} ${P}^4$
  algorithm for reordering unsymmetric sparse matrices.
\newblock {\em SIAM J. Numer. Anal.}, 22:369--385, 1985.

\bibitem[E26]{E26}
{Erisman, A. M.}, {Grimes, R. G.}, {Lewis, J. G.}, {Poole, W. G. Jr.}, and
  {Simon, H. D.}
\newblock Evaluation of orderings for unsymmetric sparse matrices.
\newblock {\em SIAM J. Sci. and Stat. Comput.}, 7:600--624, 1986.

\bibitem[E7]{E7}
{Erisman, A. M.}, {Neves, K. W.}, and {Dwarakanath, M. H.}, editors.
\newblock {\em Electric Power Problems~: The Mathematical Challenge}.
\newblock SIAM Publications, 1980.

\bibitem[E24]{E24}
{Erisman, A. M.} and {Spies, G. E.}
\newblock Exploiting problem characteristics in the sparse matrix approach to
  frequency domain analysis.
\newblock {\em IEEE Trans. Circuit Theory}, CT-19:260--269, 1972.

\bibitem[E25]{E25}
{Erisman, A. M.} and {Tinney, W. F.}
\newblock On computing certain elements of the inverse of a sparse matrix.
\newblock {\em Comm. ACM}, 18:177--179, 1975.

\bibitem[E8]{E8}
{Eskow, E.} and {Schnabel, R. B.}
\newblock Software for a new modified {Cholesky} factorization.
\newblock {\em ACM Trans. Math. Software}, 17(3):306--312, 1991.

\bibitem[E38]{E38}
{Estrin, G.}, {Bussel, B.}, {Turn, R.}, and {Bibb, J.}
\newblock Parallel processing on a restructurable computer system.
\newblock {\em IEEE Trans. Electronic Computers}, EC-12:747--754, 1963.

\bibitem[E39]{E39}
{Estrin, G.} and {Turn, R.}
\newblock Automatic assignment of computations in a variable structure computer
  system.
\newblock {\em IEEE Trans. Electronic Computers}, EC-12:755--773, 1963.

\bibitem[E49]{E49}
{Eufinger, J.}
\newblock Operations on directed graphs.
\newblock {\em J. Reine Angew Math.}, 247:146--154, 1971.

\bibitem[E37]{E37}
{Evans, D. J.}
\newblock The extrapolated modified {Aitken} iteration method for solving
  elliptic difference equations.
\newblock {\em Computing J.}, 6:193--201, 1963.

\bibitem[E36]{E36}
{Evans, D. J.}, editor.
\newblock {\em Software for Numerical Mathematics}.
\newblock Academic Press, 1974.

\bibitem[E29]{E29}
{Evans, D. J.}
\newblock On the numerical solution of sparse systems of finite element
  equations.
\newblock In {Whiteman, J.}, editor, {\em The Mathematics of Finite Elements \&
  Applications -- {III}, Mafelap 1978 Conference Proceedings}, pages 448--458.
  Academic Press, 1979.

\bibitem[E6]{E6}
{Evans, D. J.}, editor.
\newblock {\em Sparsity and its Applications}.
\newblock Cambridge University Press, 1985.

\bibitem[E46]{E46}
{Eve, J.}
\newblock On computing the transitive closure of a relation.
\newblock {Tech. Report} STAN-CS-75-508, Computer Science Dept., Stanford
  Univ., 1975.

\bibitem[E18]{E18}
{Even, S.}
\newblock {\em Graph Algorithms}.
\newblock Computer Science Press, 1979.

\bibitem[E50]{E50}
{Even, S.} and {Kariv, O.}
\newblock An ${O}(n^{5/2})$ algorithm for maximum matching in general graphs.
\newblock {Tech. Report}, Weizmann Institute, Israel, 1975.

\bibitem[E19]{E19}
{Even, S.} and {Tarjan, R. E.}
\newblock Network flow and testing graph connectivity.
\newblock {\em SIAM J. Comput.}, 4:507--518, 1975.

\bibitem[E52]{E52}
{Everstine, G. C.}
\newblock A comparison of three resequencing algorithms for the reduction of
  matrix profile and wavefront.
\newblock {\em Int. J. Numer. Meth. Eng.}, 14:837--853, 1979.

\bibitem[F9]{F9}
{Faddeev, D. K.} and {Faddeeva, V. H.}
\newblock {\em Computational Methods of Linear Algebra}.
\newblock Freeman \& Co., 1963.
\newblock ({Translated from the Russian original}).

\bibitem[F10]{F10}
{Faddeeva, V. H.}
\newblock {\em Computational Methods of Linear Algebra}.
\newblock Dover Publications, 1959.
\newblock ({Translated from the 1950 Russian edition}).

\bibitem[F53]{F53}
{Falkoff, A. D.}
\newblock Algorithms for parallel search memories.
\newblock {\em J. ACM}, 9:488--501, 1962.

\bibitem[F43]{F43}
{Farkas, J.}
\newblock Theorie der einfachen {Ungleichungen}.
\newblock {\em Journal f{\"u}r die reine und angewandte Mathematik}, 124:1--27,
  1902.

\bibitem[F65]{F65}
{Faybusovich, L.}
\newblock Hamiltonian structure of dynamical systems which solve linear
  programming problems.
\newblock {\em Physics}, D53:217--232, 1991.

\bibitem[F59]{F59}
{Federenko, R. P.}
\newblock A relaxation method for solving elliptic difference equations.
\newblock {\em USSR Comp. Math. and Math. Phys.}, 4:1092, 1961.
\newblock (Originally published at {Zh. Vych. Mat., 1:922--927, 1961}).

\bibitem[F48]{F48}
{Feingold, D. G.} and {Varga, R. S.}
\newblock Block diagonally dominant matrices and generalizations of the
  {Gerschgorin} circle.
\newblock {\em Pacific J. Math.}, 12:1241--1250, 1963.

\bibitem[F61]{F61}
{Felippa, C. A.} and {Clough, R. W.}
\newblock The finite element method in solid mechanics.
\newblock In {Birkhoff, G.} and {Varga, R. S.}, editors, {\em Numerical
  Solution of Field Problems in Continuum Physics}, pages 210--252. American
  Math. Soc., Providence, 1970.

\bibitem[F37]{F37}
{Fellipa, C. A.}
\newblock Solution of linear equations with skyline-stored symmetric matrix.
\newblock {\em Computer and Structures}, 5:13--29, 1975.

\bibitem[F63]{F63}
{Fenichel, R. R.} and {Yochelson, J. C.}
\newblock A {LISP} garbage-collector for virtual memory computer systems.
\newblock {\em Comm. ACM}, 12:611--612, 1969.

\bibitem[F54]{F54}
{Fenves, S. J.}
\newblock {STRESS}~: {Structural} {E}ngineering {S}ystem {S}olver, {A} computer
  programming system for structural engineering problems.
\newblock {Tech. Report} T-63-2, MIT, 1963.

\bibitem[F46]{F46}
{Fenves, S. J.}
\newblock {\em Computer Methods in Civil Engineering}.
\newblock Prentice-Hall, 1967.

\bibitem[F47]{F47}
{Fenves, S. J.} and {Branin, F. H. Jr.}
\newblock A network-topological formulation of structural analysis.
\newblock {\em J. Amer. Soc. Civil Engrs., Structural Division}, 89:483--514,
  1963.

\bibitem[F60]{F60}
{Fenves, S. J.}, {Perrone, N.}, {Robinson, A. R.}, and {Schnobrich, W. C.},
  editors.
\newblock {\em Numerical and Computer Methods in Structural Mechanics}.
\newblock Academic Press, 1973.

\bibitem[F40]{F40}
{Feo, J.}
\newblock An analysis of the computational and parallel complexity of the
  {Livermore} loops.
\newblock {\em Parallel Computing}, 7:163--186, 1988.

\bibitem[F12]{F12}
{Feuer, A. R.} and {Gehani, N.}, editors.
\newblock {\em Comparing and Assessing Programming Languages {ADA}, {C}, and
  {PASCAL}}.
\newblock Prentice-Hall, 1984.

\bibitem[F16]{F16}
{Fiacco, A. V.} and {McCormick, G. P.}
\newblock {\em Nonlinear Programming~: {S}equential {U}nconstrained
  {M}inimization {T}echniques}.
\newblock John Wiley \& Sons, 1968.
\newblock (Republished by {SIAM Publications, 1990}).

\bibitem[F34]{F34}
{Fiedler, M.}
\newblock Algebraic connectivity of graphs.
\newblock {\em Czech. Math. J.}, 23:298--305, 1973.

\bibitem[F35]{F35}
{Fiedler, M.}
\newblock A property of eigenvectors of non-negative symmetric matrices and its
  application to graph theory.
\newblock {\em Czech. Math. J.}, 25:619--633, 1975.

\bibitem[F33]{F33}
{Fiedler, M.}
\newblock Inversion of bigraphs and connection with the gauss elimination.
\newblock In {\em Graphs, Hypergraphs, and Block Systems}, pages 57--68.
  Zielona Gora, Czechoslovakia, 1976.

\bibitem[F7]{F7}
{Fike, C. T.}
\newblock {\em Computer Evaluation of Mathematical Functions}.
\newblock Prentice-Hall, 1968.

\bibitem[F13]{F13}
{Fischer, H.} and {Ritter, K.}
\newblock An asynchronous parallel {Newton} method.
\newblock {\em Math. Programming}, 42(2):363--374, 1988.

\bibitem[F41]{F41}
{Fisher, J. A.}
\newblock Trace scheduling~: {A} technique for global microcode compaction.
\newblock {\em IEEE Trans. Comput.}, C-30(7):478--490, 1981.

\bibitem[F42]{F42}
{Fisher, J. A.}
\newblock Very long instruction word architectures and {ELI-512}.
\newblock In {\em Proc. $10^{th}$ Symposium on Computer Architecture}, pages
  140--150, Stockholm, 1983.

\bibitem[F26]{F26}
{Fletcher, R.}, editor.
\newblock {\em Optimization}.
\newblock Academic Press, 1969.

\bibitem[F4]{F4}
{Fletcher, R.}
\newblock {\em Practical Methods of Optimization, volume {1}~: Unconstrained
  Optimization}.
\newblock John Wiley \& Sons, 1980.

\bibitem[F5]{F5}
{Fletcher, R.}
\newblock {\em Practical Methods of Optimization, volume {2}~: Constrained
  Optimization}.
\newblock John Wiley \& Sons, 1981.

\bibitem[F56]{F56}
{Fletcher, R.} and {Powell, M. J. D.}
\newblock A rapidly convergent descent method for minimization.
\newblock {\em Computing J.}, 6:163--168, 1965.

\bibitem[F3]{F3}
{Fletcher, R.} and {Powell, M. J. D.}
\newblock On the modification of ${LDL}^{T}$ factorizations.
\newblock {\em Math. of Computation}, 28(128):1067--1087, 1974.

\bibitem[F28]{F28}
{Floyd, R. W.}
\newblock Algorithm 96~: {Ancestor}.
\newblock {\em Comm. ACM}, 5:344--345, 1962.

\bibitem[F29]{F29}
{Floyd, R. W.}
\newblock Algorithm 97~: {Shortest Path}.
\newblock {\em Comm. ACM}, 5:345, 1962.

\bibitem[F30]{F30}
{Floyd, R. W.}
\newblock Algorithm 245~: {Treesort} 3.
\newblock {\em Comm. ACM}, 7:701, 1964.

\bibitem[F38]{F38}
{Flynn, M.}
\newblock Very high speed computing systems.
\newblock {\em Proc. of the IEEE}, 54:1901--1909, 1966.

\bibitem[F55]{F55}
{Ford, B.}
\newblock Parameterization of the environment for transportable numerical
  software.
\newblock {\em ACM Trans. Math. Software}, 4(2):100--103, 1978.

\bibitem[F31]{F31}
{Ford, L. R.} and {Fulkerson, D. R.}
\newblock Maximal flow through a network.
\newblock {\em Canadian J. Math.}, 8:399--404, 1956.

\bibitem[F32]{F32}
{Ford, L. R.} and {Fulkerson, D. R.}
\newblock {\em Flows in Networks}.
\newblock Princeton Univ. Press, 1962.

\bibitem[F18]{F18}
{Forrest, J. J. H.} and {Goldfarb, D.}
\newblock Steepest-edge simplex algorithms for linear programming.
\newblock {\em Math. Programming}, 57:341--374, 1992.

\bibitem[F17]{F17}
{Forrest, J. J. H.} and {Tomlin, J. A.}
\newblock Updating triangular factors of the basis to maintain sparsity in the
  product-form simplex method.
\newblock {\em Math. Programming}, 2:263--278, 1972.

\bibitem[F14]{F14}
{Forrest, J. J. H.} and {Tomlin, J. A.}
\newblock Vector processing in simplex and interior methods for linear
  programming.
\newblock {Tech. Report} RJ-6390-62372, {IBM} Thomas J. Watson Research Center,
  Yorktown Heights, 1988.

\bibitem[F15]{F15}
{Forrest, J. J. H.} and {Tomlin, J. A.}
\newblock Vector processing in simplex and interior methods for linear
  programming.
\newblock {\em Annals of Oper. Res.}, 22:71--100, 1990.

\bibitem[F19]{F19}
{Forrest, J. J. H.} and {Tomlin, J. A.}
\newblock What makes a linear programming difficult~?
\newblock (Presented at {ORSA/TIMS Joint National Meeting, San Francisco}),
  1992.

\bibitem[F22]{F22}
{Forsgren, A. L.} and {Murray, W.}
\newblock {Newton} methods for large-scale linear equality-constrained
  minimization.
\newblock {Tech. Report} SOL-90-6, Dept. of Oper. Research, Stanford Univ.,
  1990.

\bibitem[F51]{F51}
{Forsythe, G. E.}
\newblock Algorithm 16~: {Crout} with pivoting.
\newblock {\em Comm. ACM}, 3:507--508, 1960.

\bibitem[F45]{F45}
{Forsythe, G. E.}
\newblock Today's computational methods of linear algebra.
\newblock {\em SIAM Review}, 9:489--515, 1967.

\bibitem[F2]{F2}
{Forsythe, G. E.}, {Malcolm, M. A.}, and {Moler, C. B.}
\newblock {\em Computer Methods for Mathematical Computations}.
\newblock Prentice-Hall, 1977.

\bibitem[F1]{F1}
{Forsythe, G. E.} and {Moler, C. B.}
\newblock {\em Computer Solution of Linear Algebraic Systems}.
\newblock Prentice-Hall, 1967.

\bibitem[F39]{F39}
{Forsythe, G. E.} and {Strauss, E. G.}
\newblock On best conditioned matrices.
\newblock {\em Proc. of the AMS}, 6:340--345, 1955.

\bibitem[F11]{F11}
{Forsythe, G. E.} and {Wasow, W. R.}
\newblock {\em Finite Difference Methods for Partial Differential Equations}.
\newblock John Wiley \& Sons, 1960.

\bibitem[F58]{F58}
{Fortet, R.}
\newblock {\em Alg\`ebre des Tenseurs et des Matrices, Probl\`emes de Valeurs
  Propres}.

\bibitem[F24]{F24}
{Fosdick, L. D.}, editor.
\newblock {\em Performance Evaluation of Numerical Software}.
\newblock North-Holland, 1979.

\bibitem[F64]{F64}
{Fosdick, L. D.}, {Jessup, E. R.}, {Schauble, C. J. C.}, and {Domik, G.}
\newblock {\em An Introduction to High-Performance Scientific Computing}.
\newblock MIT Press, 1995.

\bibitem[F21]{F21}
{Fourer, R.} and {Mehrotra, S.}
\newblock Performance of an augmented system approach for solving least-squares
  problems in an interior point method.
\newblock {\em COAL Newsletter}, 19:26--31, 1991.

\bibitem[F20]{F20}
{Fourer, R.} and {Mehrotra, S.}
\newblock Solving symmetric indefinite systems in an interior point method for
  linear programming.
\newblock {Tech. Report} 92-01, Dept. of Industrial Eng. and Manag. Sciences,
  Northwestern Univ., Evanston, 1992.

\bibitem[F44]{F44}
{Fourier, J. B. J.}
\newblock Solution d'une question particuli\`ere du calcul des in\'egalit\'es.
\newblock {\em Noveau Bulletin des Sciences par la Soci\'et\'e Philomathique de
  Paris}, pages 99--100, 1826.

\bibitem[F52]{F52}
{Fox, B. L.}
\newblock Accelerating {LP} algorithms.
\newblock {\em Comm. ACM}, 12:384--385, 1969.

\bibitem[F6]{F6}
{Fox, G. C.} et~al.
\newblock {FORTRAN} {D} {L}anguage specification.
\newblock {Tech. Report} TR-90-141, Computer Science Dept., Rice Univ., 1990.

\bibitem[F25]{F25}
{Fox, G. C.}, {Johnson, M. A.}, {Lyzenga, G. A.}, {Otto, G. A.}, {Salomon, J.
  K.}, and {Walker, D. W.}
\newblock {\em Solving Problems on Concurrent Processors}.
\newblock Prentice-Hall, 1988.

\bibitem[F49]{F49}
{Fox, L.}, editor.
\newblock {\em Numerical Solution of Ordinary and Partial Differential
  Equations}.
\newblock Addison-Wesley, 1962.

\bibitem[F36]{F36}
{Fox, L.}
\newblock {\em An Introduction to Numerical Linear Algebra}.
\newblock Oxford University Press, 1965.

\bibitem[F23]{F23}
{Franck, H.} and {Fisch, I. T.}
\newblock {\em Communications, Transmission and Transportation Networks}.
\newblock Addison-Wesley, 1971.

\bibitem[F57]{F57}
{Frazer, R. A.}, {Duncan, W. J.}, and {Collar, A. R.}
\newblock {\em Elementary Matrices}.
\newblock Cambridge, 1950.

\bibitem[F62]{F62}
{Freiman, C. V.}, editor.
\newblock {\em Information Processing 71, Proc. {IFIP} Congress}, Ljubljana,
  1972. North-Holland.

\bibitem[F27]{F27}
{Frisch, K.}
\newblock The logarithmic potential method of convex programming.
\newblock {Internal Memorandum}, University Institute of Economics, Olso, 1989.

\bibitem[F8]{F8}
{Fr{\"o}berg, C. E.}
\newblock {\em Introduction to Numerical Analysis}.
\newblock Addison-Wesley, $2^{nd}$ edition, 1969.

\bibitem[F50]{F50}
{Fulkerson, D. R.} and {Wolfe, P.}
\newblock An algorithm for scaling matrices.
\newblock {\em SIAM Review}, 4:142--146, 1962.

\bibitem[G214]{G214}
{Gabay, D.}
\newblock Minimizing a differentiable function over a differential manifold.
\newblock {\em JOTA}, 37(2):177--218, 1982.

\bibitem[G118]{G118}
{Gabow, H. N.}
\newblock {\em Implementation of Algorithms for Maximum Matching on
  Nonbipartite Graphs}.
\newblock PhD thesis, Dept. of Electrical Eng., Stanford Univ., 1973.

\bibitem[G119]{G119}
{Gabow, H. N.}
\newblock An efficient implementation of {Edmond's} algorithm for maximum
  matching on graphs.
\newblock {\em J. ACM}, 23:221--234, 1976.

\bibitem[G212]{G212}
{Gabow, H. N.}, {Galil, Z.}, {Spencer, T.}, and {Tarjan, R. E.}
\newblock Efficient algorithms for finding minimum spanning trees in undirected
  and directed graphs.
\newblock {\em Combinatorica}, 6:109--122, 1986.

\bibitem[G117]{G117}
{Gabow, H. N.} and {Tarjan, R. E.}
\newblock A linear time algorithm for a special case of disjoint set union.
\newblock In {\em Proc. $15^{th}$ Annual ACM Symposium on Theory of Computing},
  pages 246--251, 1983.

\bibitem[G116]{G116}
{Gabow, H. N.} and {Tarjan, R. E.}
\newblock A linear time algorithm for a special case of disjoint set union.
\newblock {\em J. Comput. Syst. Sci.}, 30:209--221, 1985.

\bibitem[G142]{G142}
{Gallagher, R. H.}
\newblock {\em Finite Element Analysis Fundamentals}.
\newblock Prentice-Hall, 1975.

\bibitem[G30]{G30}
{Gallivan, K. A.}, {Heath, M. T.}, {Ng, E.}, {Ortega, J.}, {Peyton, B.},
  {Plemmons, R.}, {Romine, C.}, {Sameh, A.}, and {Voigt, R.}
\newblock {\em Parallel Algorithms for Matrix Computations}.
\newblock SIAM Publications, 1990.

\bibitem[G146]{G146}
{Gallivan, K. A.}, {Jalby, W.}, {Meier, U.}, and {Sameh, A. H.}
\newblock Impact of hierarchical memory systems on linear algebra algorithm
  design.
\newblock {\em Int. J. of Supercomputer Appl.}, 2:12--48, 1988.

\bibitem[G31]{G31}
{Gallivan, K. A.}, {Plemmons, R. J.}, and {Sameh, A. H.}
\newblock Parallel algorithms for dense linear algebra computations.
\newblock {\em SIAM Review}, 32(1):54--135, 1990.

\bibitem[G148]{G148}
{Gannon, D.}
\newblock Restructuring nested loops on the {ALLIANT} {CEDAR} cluster~: {A}
  case study of {Gaussian} elimination of banded matrices.
\newblock {Tech. Report} 543, Center for Supercomputing Research and
  Development, Univ. of Illinois at Urbana-Champaign, 1986.

\bibitem[G199]{G199}
{Gantmacher, F. R.}, editor.
\newblock {\em Matrizenrechnung -- {I}}.
\newblock Berlin, 1958.

\bibitem[G141]{G141}
{Gantmacher, F. R.}
\newblock {\em The Theory of Matrices, volume {2}}.
\newblock Chelsea, New York, 1959.

\bibitem[G190]{G190}
{Garabedian, P. R.}, editor.
\newblock {\em Partial Differential Equations}.
\newblock John Wiley \& Sons, 1964.

\bibitem[G94]{G94}
{Garcia, C. B.} and {Zangwill, W. I.}
\newblock {\em Pathways to Solutions, Fixed Points, and Equilibria}.
\newblock Prentice-Hall, 1981.

\bibitem[G173]{G173}
{Garey, M. R.} and {Johnson, D. S.}
\newblock Some simplified {NP}-complete problems.
\newblock In {\em Proc. $6^{th}$ Annual {ACM} Symposium on Theory of
  Computing}, pages 47--63, 1974.

\bibitem[G163]{G163}
{Garey, M. R.} and {Johnson, D. S.}
\newblock Strong {NP}-completeness results~: {Motivation}, examples and
  implications.
\newblock {\em J. ACM}, 25:499--508, 1978.

\bibitem[G42]{G42}
{Garey, M. R.} and {Johnson, D. S.}
\newblock {\em Computers and Intractability~: A Guide to the Theory of
  {NP-Completeness}}.
\newblock Freeman \& Co., 1979.

\bibitem[G68]{G68}
{Garfinkel, R. S.} and {Nemhauser, G. L.}
\newblock {\em Integer Programming}.
\newblock John Wiley \& Sons, 1972.

\bibitem[G210]{G210}
{Garner, R.}, {Agarwal, A.}, {Briggs, F.}, {Brown, E.}, {Hough, D.}, {Joy, B.},
  {Kleiman, S.}, {Munchnik, S.}, {Namjoo, M.}, {Patterson, D.}, {Pendleton,
  J.}, and {Tuck, R.}
\newblock {S}calable {P}rocessor {Architecture} ({SPARC}).
\newblock In {\em {COMPCON}}, pages 278--283, San Francisco, 1988. IEEE.

\bibitem[G195]{G195}
{Gass, S. I.}
\newblock {\em Linear Programming~: Methods and Applications}.
\newblock McGraw-Hill, 1958.

\bibitem[G213]{G213}
{Gauss, K. F.}
\newblock {\em The Theory of Combination of Observations Least Subject to
  Errors -- Part One, Part Two, Supplement}.
\newblock SIAM Publications, 1995.
\newblock ({Translated by Stewart, G. W.}).

\bibitem[G62]{G62}
{Gavril, F.}
\newblock Algorithms for minimum coloring, maximum clique, minimum covering by
  cliques and maximum independent set of a chordal graph.
\newblock {\em SIAM J. Comput.}, 1:180--187, 1972.

\bibitem[G120]{G120}
{Gavril, F.}
\newblock The intersection graphs of subtrees in trees are exactly the chordal
  graphs.
\newblock {\em J. Combinatorial Theory B}, 16:47--56, 1974.

\bibitem[G99]{G99}
{Gay, D. M.}
\newblock Computing optimal locally constrained steps.
\newblock {\em SIAM J. Sci. and Stat. Comput.}, 2:186--197, 1981.

\bibitem[G100]{G100}
{Gay, D. M.}
\newblock A trust region approach to linearly constrained optimization.
\newblock In {Griffiths, D. F.}, editor, {\em Numerical Analysis, {P}roc.
  Dundee 1983, volume 1066 of Lecture Notes in Mathematics}. Springer-Verlag,
  1984.

\bibitem[G44]{G44}
{Gay, D. M.}
\newblock Electronic mail distribution of linear programming test problems.
\newblock {\em Mathematical Programming Society Committee on Algorithms
  Newsletter}, 13, 1985.

\bibitem[G149]{G149}
{Gay, D. M.}
\newblock Sparse projections in {Karmarkar's} linear programming algorithm.
\newblock {Talk presented at {ORSA/TIMS} Joint National Meeting, Atlanta},
  AT\&T BELL Labs., Murray Hill, 1985.

\bibitem[G1]{G1}
{Gay, D. M.}
\newblock Massive memory buys little speed for complete in-core sparse
  {Cholesky} factorizations on some scalar computers.
\newblock {\em Lin. Alg. Appl.}, 152:291--314, 1991.

\bibitem[G186]{G186}
{Gear, C. W.}
\newblock The automatic integration of stiff differential equations.
\newblock In {\em Proc. {IFIP} Congress}, Edinburgh, 1968.

\bibitem[G69]{G69}
{Gear, C. W.}
\newblock {\em Numerical Initial Value Problems in Ordinary Differential
  Equations}.
\newblock Prentice-Hall, 1971.

\bibitem[G204]{G204}
{Gear, C. W.}
\newblock Simultaneous numerical solution of differential algebraic equations.
\newblock {\em IEEE Trans. Circuit Theory}, CT-18:89--95, 1971.

\bibitem[G104]{G104}
{Gehani, N.}
\newblock {\em {ADA}~: An Advanced Introduction}.
\newblock Prentice-Hall, 1983.

\bibitem[G128]{G128}
{Geist, G. A.}
\newblock Solving finite element problems with parallel multifrontal schemes.
\newblock In {Heath, M. T.}, editor, {\em Hypercube Multiprocessors 1987},
  pages 656--661. SIAM Publications, 1987.

\bibitem[G92]{G92}
{Geist, G. A.}, {Benguelim, A.}, {Dongarra, J.}, {Jiang, J.}, {Manchek, R.},
  and {Sunderam, V.}
\newblock {\em {PVM 3.0} ``{User's Guide}'' and ``{Reference Manual}''}.
\newblock Oak Ridge National Laboratory, 1993.

\bibitem[G129]{G129}
{Geist, G. A.} and {Heath, M. T.}
\newblock Parallel {Cholesky} factorization on a hypercube multiprocessor.
\newblock {Tech. Report} ORNL-6211, Oak Ridge National Laboratory, 1985.

\bibitem[G52]{G52}
{Geist, G. A.} and {Heath, M. T.}
\newblock Matrix factorization on a hypercube multiprocessor.
\newblock In {Heath, M. T.}, editor, {\em Hypercube Multiprocessors 1986},
  pages 161--180. SIAM Publications, 1986.

\bibitem[G150]{G150}
{Geist, G. A.} and {Ng, E.}
\newblock A partitioning strategy for parallel sparse {Cholesky} factorization.
\newblock {Tech. Report} ORNL-TM-10937, Oak Ridge National Laboratory, 1988.

\bibitem[G29]{G29}
{Geist, G. A.} and {Ng, E.}
\newblock Task scheduling for parallel sparse {Cholesky} factorization.
\newblock {\em Int. J. of Parallel Programming}, 18(4):291--314, 1989.

\bibitem[G175]{G175}
{Gentleman, W. M.}
\newblock Least-squares computations by {Givens} transformations without square
  roots.
\newblock {\em J. Inst. Math. Appl.}, 12:329--336, 1973.

\bibitem[G176]{G176}
{Gentleman, W. M.}
\newblock Error analysis of {QR} decompositions by {Givens} transformations.
\newblock {\em Lin. Alg. Appl.}, 10:189--197, 1975.

\bibitem[G20]{G20}
{Gentleman, W. M.} and {George, A.}
\newblock Sparse matrix software.
\newblock In {Bunch, J. R.} and {Rose, D. J.}, editors, {\em Sparse Matrix
  Computations}. Academic Press, New York, 1976.

\bibitem[G133]{G133}
{George, A.}
\newblock {\em Computer Implementation of the Finite Element Method}.
\newblock PhD thesis, Computer Science Dept., Stanford Univ., 1971.
\newblock ({Report STAN-CS-71-208}).

\bibitem[G185]{G185}
{George, A.}
\newblock Block elimination on finite element systems of equations.
\newblock In {Rose, D. J.} and {Willoughby, R. A.}, editors, {\em Sparse
  Matrices and Their Applications}, pages 101--114. Plenum Press, New York,
  1972.

\bibitem[G59]{G59}
{George, A.}
\newblock Nested dissection of a regular finite element mesh.
\newblock {\em SIAM J. Numer. Anal.}, 10:345--363, 1973.

\bibitem[G135]{G135}
{George, A.}
\newblock On block elimination for sparse linear systems.
\newblock {\em SIAM J. Numer. Anal.}, 11:585--603, 1974.

\bibitem[G205]{G205}
{George, A.}
\newblock A negative result on sparse matrix splitting and {Gaussian}
  elimination.
\newblock {Report}, ICASE, Langley, 1975.

\bibitem[G86]{G86}
{George, A.}
\newblock An efficient band-oriented scheme for solving $n$ by $n$ grid
  problems.
\newblock In {\em Proc. 1972 {FJCC}}, pages 1317--1321. AFIPS Press, Montvale,
  New Jersey, 1977.

\bibitem[G134]{G134}
{George, A.}
\newblock Numerical experiments using dissection methods to solve $n$ by $n$
  grid problems.
\newblock {\em SIAM J. Numer. Anal.}, 14:161--179, 1977.

\bibitem[G84]{G84}
{George, A.}
\newblock Solution of linear systems of equations~: {Direct} methods for finite
  element problems.
\newblock In {Barker, V. A.}, editor, {\em Course in Advanced Sparse Matrix
  Techniques, volume 572 of Lecture Notes in Mathematics}, pages 52--101.
  Springer-Verlag, 1977.

\bibitem[G85]{G85}
{George, A.}
\newblock An automatic one-way dissection algorithm for irregular finite
  element problems.
\newblock In {\em Proc. 1977 Dundee Conference on Numerical Analysis, volume
  630 of Lecture Notes in Mathematics}, pages 76--89. Springer-Verlag, 1978.

\bibitem[G90]{G90}
{George, A.}, {Gilbert, J. R.}, and {Liu, J. W. H.}, editors.
\newblock {\em Graph Theory and Sparse Matrix Computation}.
\newblock Springer-Verlag, 1993.

\bibitem[G81]{G81}
{George, A.}, {Heath, M. T.}, and {Liu, J. W. H.}
\newblock Parallel {Cholesky} factorization on a shared memory multiprocessor.
\newblock {\em Lin. Alg. Appl.}, 77:165--187, 1986.

\bibitem[G53]{G53}
{George, A.}, {Heath, M. T.}, {Liu, J. W. H.}, and {Ng, E.}
\newblock Solution of sparse positive definite systems on a shared memory
  multiprocessor.
\newblock {\em Int. J. of Parallel Programming}, 15:309--325, 1986.

\bibitem[G54]{G54}
{George, A.}, {Heath, M. T.}, {Liu, J. W. H.}, and {Ng, E.}
\newblock Sparse {Cholesky} factorization on a local memory multiprocessor.
\newblock {\em SIAM J. Sci. and Stat. Comput.}, 9:327--340, 1988.

\bibitem[G57]{G57}
{George, A.}, {Heath, M. T.}, {Liu, J. W. H.}, and {Ng, E.}
\newblock Solution of sparse positive definite systems on a hypercube.
\newblock {\em J. Comput. Applied. Math}, 27:129--156, 1989.

\bibitem[G13]{G13}
{George, A.}, {Heath, M. T.}, and {Ng, E.}
\newblock Solution of sparse undetermined systems of linear equations.
\newblock {\em SIAM J. Sci. and Stat. Comput.}, 5(4):988--997, 1984.

\bibitem[G56]{G56}
{George, A.}, {Heath, M. T.}, {Ng, E.}, and {Liu, J. W. H.}
\newblock Symbolic {Cholesky} factorization on a local-memory multiprocessor.
\newblock {\em Parallel Computing}, 5:85--95, 1987.

\bibitem[G208]{G208}
{George, A.} and {Liu, J. W. H.}
\newblock An automatic partitioning and solution scheme for solving large
  sparse positive definite systems of linear algebraic equations.
\newblock {Tech. Report} CS-75-17, Dept. of Computer Science, Univ. Waterloo,
  Ontario, Canada, 1975.

\bibitem[G7]{G7}
{George, A.} and {Liu, J. W. H.}
\newblock Some results and notes on fill for sparse matrices.
\newblock {\em SIAM J. Numer. Anal.}, 12(3):452--455, 1975.

\bibitem[G83]{G83}
{George, A.} and {Liu, J. W. H.}
\newblock Algorithms for matrix partitioning and the numerical solution of
  finite element systems.
\newblock {\em SIAM J. Numer. Anal.}, 15:297--327, 1978.

\bibitem[G60]{G60}
{George, A.} and {Liu, J. W. H.}
\newblock An automated nested dissection algorithm for irregular finite element
  problems.
\newblock {\em SIAM J. Numer. Anal.}, 15:1053--1069, 1978.

\bibitem[G10]{G10}
{George, A.} and {Liu, J. W. H.}
\newblock The design of a user interface for a sparse matrix package.
\newblock {\em ACM Trans. Math. Software}, 5(2):139--162, 1979.

\bibitem[G6]{G6}
{George, A.} and {Liu, J. W. H.}
\newblock An implementation of a pseudoperipheral node finder.
\newblock {\em ACM Trans. Math. Software}, 5(3):284--295, 1979.

\bibitem[G87]{G87}
{George, A.} and {Liu, J. W. H.}
\newblock A quotient graph model for symmetric factorization.
\newblock In {Duff, I. S.} and {Stewart, G. W.}, editors, {\em Sparse Matrix
  Proceedings 1978}. SIAM Publications, 1979.

\bibitem[G9]{G9}
{George, A.} and {Liu, J. W. H.}
\newblock A fast implementation of the minimum degree algorithm using quotient
  graphs.
\newblock {\em ACM Trans. Math. Software}, 6(3):337--358, 1980.

\bibitem[G8]{G8}
{George, A.} and {Liu J. W. H.}
\newblock A minimal storage implementation of the minimum degree algorithm.
\newblock {\em SIAM J. Numer. Anal.}, 17(2):282--299, 1980.

\bibitem[G3]{G3}
{George, A.} and {Liu, J. W. H.}
\newblock An optimal algorithm for symbolic factorization of symmetric
  matrices.
\newblock {\em SIAM J. Comput.}, 9(3):583--593, 1980.

\bibitem[G5]{G5}
{George, A.} and {Liu, J. W. H.}
\newblock {\em Computer Solution of Large Positive Definite Systems}.
\newblock Prentice-Hall, 1981.

\bibitem[G2]{G2}
{George, A.} and {Liu, J. W. H.}
\newblock The evolution of the minimum degree ordering algorithm.
\newblock {\em SIAM Review}, 31(1):1--19, 1989.

\bibitem[G152]{G152}
{George, A.}, {Liu, J. W. H.}, and {Ng, E.}
\newblock Row ordering schemes for sparse {Givens} transformations -- {I}~:
  {Bipartite} graph model.
\newblock {\em Lin. Alg. Appl.}, 61:55--81, 1984.

\bibitem[G58]{G58}
{George, A.}, {Liu, J. W. H.}, and {Ng, E.}
\newblock Communication reduction in parallel sparse {Cholesky} factorization.
\newblock In {\em Proc. $2^{nd}$ Hypercube Conference}, Knoxville, 1986.

\bibitem[G153]{G153}
{George, A.}, {Liu, J. W. H.}, and {Ng, E.}
\newblock Row ordering schemes for sparse {Givens} transformations -- {II}~:
  {Implicit} graph model.
\newblock {\em Lin. Alg. Appl.}, 75:203--223, 1986.

\bibitem[G55]{G55}
{George, A.}, {Liu, J. W. H.}, and {Ng, E.}
\newblock Communication results for parallel sparse {Cholesky} factorization on
  a hypercube.
\newblock {\em Parallel Computing}, 10:287--298, 1989.

\bibitem[G61]{G61}
{George, A.} and {McIntyre, D.}
\newblock On the application of the minimum degree algorithm to finite element
  systems.
\newblock {\em SIAM J. Numer. Anal.}, 15:90--112, 1978.

\bibitem[G130]{G130}
{George, A.} and {McIntyre, D.}
\newblock On the application of the minimum degree algorithm to finite element
  systems.
\newblock {\em SIAM J. Numer. Anal.}, 15:90--111, 1978.

\bibitem[G154]{G154}
{George, A.} and {Ng, E.}
\newblock {SPARSPAK}~: {Waterloo} sparse matrix package ``{User's Guide}'' for
  {SPARSPAK-B}.
\newblock {Research Report} CS-84-37, Dept. of Computer Science, Univ. of
  Waterloo, 1984.

\bibitem[G145]{G145}
{George, A.} and {Ng, E.}
\newblock Waterloo sparse matrix package ``{User's Guide}'' for {SPARSPAK-B}.
\newblock {Tech. Report} CS-84-37, Univ. Waterloo, Canada, 1984.

\bibitem[G12]{G12}
{George, A.} and {Ng, E.}
\newblock An implementation of {Gaussian} elimination with partial pivoting for
  sparse systems.
\newblock {\em SIAM J. Sci. and Stat. Comput.}, 6(2):390--409, 1985.

\bibitem[G4]{G4}
{George, A.} and {Ng, E.}
\newblock Symbolic factorization for sparse {Gaussian} elimination with partial
  pivoting.
\newblock {\em SIAM J. Sci. and Stat. Comput.}, 8(6):877--898, 1987.

\bibitem[G124]{G124}
{George, A.} and {Ng, E.}
\newblock On the complexity of sparse {QR} and {LU} factorization of
  finite-element matrices.
\newblock {\em SIAM J. Sci. and Stat. Comput.}, 9:849--861, 1988.

\bibitem[G131]{G131}
{George, A.} and {Ng, E.}
\newblock Parallel sparse {Gaussian} elimination with partial pivoting.
\newblock {\em Annals of Oper. Res.}, 22:219--240, 1990.

\bibitem[G137]{G137}
{George, A.}, {Poole, W. G. Jr.}, and {Voigt, R. G.}
\newblock Analysis of dissection algorithms for vector computers.
\newblock {\em J. Comp. and Math. with Appl.}, 4:287--304, 1978.

\bibitem[G136]{G136}
{George, A.}, {Poole, W. G. Jr.}, and {Voigt, R. G.}
\newblock Incomplete nested dissection for solving $n$ by $n$ grid problems.
\newblock {\em SIAM J. Numer. Anal.}, 15:662--673, 1978.

\bibitem[G170]{G170}
{George, A.} and {Rashwan, H.}
\newblock On symbolic factorization of partitioned sparse symmetric matrices.
\newblock In {Bj{\"o}rck, A.}, {Plemmons, R. J.}, and {Schneider, H.}, editors,
  {\em Large Scale Matrix Problems}, pages 145--158. North-Holland, 1981.

\bibitem[G11]{G11}
{George, A.} and {Rashwan, H.}
\newblock Auxiliary storage methods for solving finite element systems.
\newblock {\em SIAM J. Sci. and Stat. Comput.}, 6(4):882--910, 1985.

\bibitem[G76]{G76}
{George, J. A.} and {Heath, M. T.}
\newblock Solution of sparse linear least squares problems using {Givens}
  rotations.
\newblock {\em Lin. Alg. Appl.}, 34:69--83, 1980.

\bibitem[G37]{G37}
{Gibbons, A.} and {Rytter, W.}
\newblock {\em Efficient Parallel Algorithms}.
\newblock Cambridge University Press, 1988.

\bibitem[G165]{G165}
{Gibbons, P. B.} and {Muchnik, S. S.}
\newblock Efficient instruction scheduling for a pipelined processor.
\newblock In {\em SIGPLAN '86 Symposium on Compiler Construction}, pages
  11--16, Palo Alto, 1986. ACM.

\bibitem[G169]{G169}
{Gibbs, N. E.}
\newblock {\em The Bandwidth of Graphs}.
\newblock PhD thesis, Purdue Univ., 1969.

\bibitem[G139]{G139}
{Gibbs, N. E.}
\newblock Algorithm 509~: {A} hybrid profile reduction algorithm.
\newblock {\em ACM Trans. Math. Software}, 2:378--387, 1976.

\bibitem[G82]{G82}
{Gibbs, N. E.}, {Poole, W. G. Jr.}, and {Stockmeyer, P. K.}
\newblock An algorithm for reducing the bandwidth and profile of a sparse
  matrix.
\newblock {\em SIAM J. Numer. Anal.}, 13:236--250, 1976.

\bibitem[G138]{G138}
{Gibbs, N. E.}, {Poole, W. G. Jr.}, and {Stockmeyer, P. K.}
\newblock A comparison of several bandwidth and profile reduction algorithms.
\newblock {\em ACM Trans. Math. Software}, 2:322--330, 1976.

\bibitem[G155]{G155}
{Gilbert, J. R.}
\newblock {\em Graph Separator Theorems and Sparse {Gaussian} Elimination}.
\newblock PhD thesis, Dept. of Computer Science, Stanford Univ., 1980.

\bibitem[G22]{G22}
{Gilbert, J. R.}
\newblock Predicting structure in sparse matrix computations.
\newblock {Tech. Report} CS-86-750, Cornell Univ., Ithaca, 1986.

\bibitem[G26]{G26}
{Gilbert, J. R.}
\newblock Some nested dissection order is nearly optimal.
\newblock {Tech. Report} 86-767, Dept. of Computer Science, Cornell Univ.,
  1986.

\bibitem[G24]{G24}
{Gilbert, J. R.}
\newblock An efficient parallel sparse partial pivoting algorithm.
\newblock {Tech. Report} CMI-88-45052-1, Centre for Computer Science, Dept. of
  Science and Technology, Christian Michelsen Institute, Bergen, Norway, 1988.

\bibitem[G63]{G63}
{Gilbert, J. R.}
\newblock Some nested dissection order is nearly optimal.
\newblock {\em Inform. Process. Lett.}, 26:325--328, 1988.

\bibitem[G112]{G112}
{Gilbert, J. R.}
\newblock Predicting structure in sparse matrix computations.
\newblock {\em SIAM J. Matrix Anal. and Appl.}, 15(1):62--79, 1994.

\bibitem[G151]{G151}
{Gilbert, J. R.} and {Hafsteinsson, H.}
\newblock A parallel algorithm for finding fill in a sparse symmetric matrix.
\newblock {Tech. Report} TR 86-789, Dept. of Computer Science, Cornell Univ.,
  1986.

\bibitem[G25]{G25}
{Gilbert, J. R.} and {Hafsteinsson, H.}
\newblock Parallel symbolic factorization of sparse linear systems.
\newblock {\em Parallel Computing}, 14:151--162, 1990.

\bibitem[G125]{G125}
{Gilbert, J. R.} and {Heath, M. T.}
\newblock Computing a sparse basis for the null space.
\newblock {\em SIAM J. Alg. and Discr. Methods}, 8:446--459, 1987.

\bibitem[G64]{G64}
{Gilbert, J. R.}, {Lewis, J. G.}, and {Schreiber, R.}
\newblock Parallel preordering for sparse matrix factorization.
\newblock ({In preparation}), 1992.

\bibitem[G114]{G114}
{Gilbert, J. R.} and {Liu, J. W. H.}
\newblock Elimination structures for unsymmetric sparse {LU} factors.
\newblock {Tech. Report} CS-90-11, Dept. of Computer Science, York Univ., North
  York, Ontario, 1990.

\bibitem[G126]{G126}
{Gilbert, J. R.} and {Liu, J. W. H.}
\newblock Elimination structures for unsymmetric sparse {LU} factors.
\newblock {\em SIAM J. Alg. and Discr. Methods}, 14:334--352, 1993.

\bibitem[G110]{G110}
{Gilbert, J. R.}, {Moler, C. B.}, and {Schreiber, R.}
\newblock Sparse matrices in {MATLAB}~: {Design} and implementation.
\newblock {Tech. Report} CSL-91-04, XEROX Palo Alto Research Center, 1991.

\bibitem[G109]{G109}
{Gilbert, J. R.}, {Moler, C. B.}, and {Schreiber, R.}
\newblock Sparse matrices in {MATLAB}~: {Design} and implementation.
\newblock {\em SIAM J. Matrix Anal. and Appl.}, 13(1):333--356, 1992.

\bibitem[G127]{G127}
{Gilbert, J. R.} and {Ng, E.}
\newblock Predicting structure in nonsymmetric sparse matrix factorizations.
\newblock {Tech. Report} CSL-92-08, XEROX Palo Alto Research Center, 1992.
\newblock (Published at {Graph Theory and Sparse Matrix Computations}, {George,
  A., Gilbert, J. R., Liu, J. W. H., editors, Springer-Verlag, 1993}).

\bibitem[G156]{G156}
{Gilbert, J. R.}, {Ng, E.}, and {Peyton, B. W.}
\newblock Separators and structure prediction in sparse orthogonal
  factorization.
\newblock {Tech. Report} CSL-93-15, XEROX Corporation, Palo Alto Research
  Center, 1993.

\bibitem[G111]{G111}
{Gilbert, J. R.}, {Ng, E.}, and {Peyton, B. W.}
\newblock An efficient algorithm to compute row and column counts for sparse
  {Cholesky} factorization.
\newblock {\em SIAM J. Matrix Anal. and Appl.}, 15(4):1075--1091, 1994.

\bibitem[G21]{G21}
{Gilbert, J. R.} and {Peierls, T.}
\newblock Sparse partial pivoting in time proportional to arithmetic
  operations.
\newblock {\em SIAM J. Sci. and Stat. Comput.}, 9(5):862--874, 1988.

\bibitem[G113]{G113}
{Gilbert, J. R.} and {Peierls, T.}
\newblock Sparse partial pivoting in time proportional to arithmetic
  operations.
\newblock {\em SIAM J. Sci. and Stat. Comput.}, 9:862--874, 1988.

\bibitem[G231]{G231}
{Gilbert, J. R.}, {Rose, D. J.}, and {Edenbrandt, A.}
\newblock A separator theorem for chordal graphs.
\newblock {\em SIAM J. Alg. and Discr. Meth.}, 5:306--313, 1984.

\bibitem[G144]{G144}
{Gilbert, J. R.} and {Schreiber, R.}
\newblock Nested dissection with partial pivoting.
\newblock In {\em Sparse Matrix Symposium}, Fairfield Glade, Tennessee, 1982.

\bibitem[G23]{G23}
{Gilbert, J. R.} and {Schreiber, R.}
\newblock Highly parallel sparse {Cholesky} factorization.
\newblock {Tech. Report} CSL-90-07, XEROX Palo Alto Research Center, 1990.
\newblock (To be published at {SIAM J. Sci. and Stat. Comput.}).

\bibitem[G47]{G47}
{Gilbert, J. R.} and {Schreiber, R.}
\newblock Highly parallel sparse {Cholesky} factorization.
\newblock {\em SIAM J. Sci. and Stat. Comput.}, 13(5):1151--1172, 1992.

\bibitem[G132]{G132}
{Gilbert, J. R.} and {Zmijewski, E.}
\newblock A parallel graph partitioning algorithm for a message-passing
  multiprocessor.
\newblock {\em Int. J. of Parallel Programming}, 16:427--449, 1987.

\bibitem[G177]{G177}
{Gill, P. E.}
\newblock Recent developments in numerically stable methods for linear
  programming.
\newblock {\em Bull. Inst. Math. Appl.}, 10:180--186, 1974.

\bibitem[G34]{G34}
{Gill, P. E.}, {Golub, G. H.}, {Murray, W.}, and {Saunders, M. A.}
\newblock Methods for modifying matrix factorizations.
\newblock {\em Math. of Computation}, 28(126):505--535, 1974.

\bibitem[G179]{G179}
{Gill, P. E.} and {Murray, W.}
\newblock A numerically stable form of the simplex algorithm.
\newblock {\em Lin. Alg. Appl.}, 7:99--138, 1973.

\bibitem[G73]{G73}
{Gill, P. E.} and {Murray, W.}
\newblock {Newton} type methods for unconstrained and linearly constrained
  optimization.
\newblock {\em Math. Programming}, 28:311--350, 1974.

\bibitem[G174]{G174}
{Gill, P. E.} and {Murray, W.}
\newblock The orthogonal factorization of a large sparse matrix.
\newblock In {Bunch, J. R.} and {Rose, D. J.}, editors, {\em Sparse Matrix
  Computations}. Academic Press, 1976.

\bibitem[G101]{G101}
{Gill, P. E.} and {Murray, W.}
\newblock The computation of {Lagrange-multiplier} estimates for constrained
  minimization.
\newblock {\em Math. Programming}, 17:32--60, 1979.

\bibitem[G77]{G77}
{Gill, P. E.}, {Murray, W.}, {Poncele\'on, D. B.}, and {Saunders, M. A.}
\newblock Primal-dual methods in linear programming.
\newblock {Tech. Report} SOL-91-3, Systems Optimization Laboratory, Stanford
  Univ., 1991.

\bibitem[G78]{G78}
{Gill, P. E.}, {Murray, W.}, {Poncele\'on, D. B.}, and {Saunders, M. A.}
\newblock Solving reduced {KKT} systems in barrier methods for linear and
  quadratic programming.
\newblock {Tech. Report} SOL-91-7, Systems Optimization Laboratory, Stanford
  Univ., 1991.

\bibitem[G79]{G79}
{Gill, P. E.}, {Murray, W.}, {Poncele\'on, D. B.}, and {Saunders, M. A.}
\newblock Preconditioners for indefinite systems arising in optimization.
\newblock {\em SIAM J. Matrix Anal. and Appl.}, 13(1):292--311, 1992.

\bibitem[G178]{G178}
{Gill, P. E.}, {Murray, W.}, and {Saunders, M. A.}
\newblock Methods for computing and modifying the {LDV} factors of a matrix.
\newblock {\em Math. of Computation}, 29(132), 1975.

\bibitem[G108]{G108}
{Gill, P. E.}, {Murray, W.}, and {Saunders, M. A.}
\newblock Interior point algorithms for linear programming~: {A} challenge to
  the simplex method.
\newblock {Tech. Report} SOL-88-14, Systems Optimization Laboratory, Stanford
  Univ., 1988.

\bibitem[G80]{G80}
{Gill, P. E.}, {Murray, W.}, and {Saunders, M. A.}
\newblock A single phase dual barrier method for linear programming.
\newblock {Tech. Report} SOL-88-10, Systems Optimization Laboratory, Stanford
  Univ., 1988.

\bibitem[G74]{G74}
{Gill, P. E.}, {Murray, W.}, {Saunders, M. A.}, {Tomlin, J. A.}, and {Wright,
  M. H.}
\newblock On projected {Newton} barrier methods for linear programming and an
  equivalence to {Karmarkar's} projective method.
\newblock {\em Math. Programming}, 36:183--209, 1986.

\bibitem[G103]{G103}
{Gill, P. E.}, {Murray, W.}, {Saunders, M. A.}, and {Wright, M. H.}
\newblock ``{User's Guide}'' for {SOL/NPSOL}~: {A} {FORTRAN} package for
  nonlinear programming.
\newblock {Tech. Report} SOL-83-12, Systems Optimization Laboratory, Stanford
  Univ., 1983.

\bibitem[G33]{G33}
{Gill, P. E.}, {Murray, W.}, {Saunders, M. A.}, and {Wright, M. H.}
\newblock Sparse matrix methods in optimization.
\newblock {\em SIAM J. Sci. and Stat. Comput.}, 5:562--589, 1984.

\bibitem[G167]{G167}
{Gill, P. E.}, {Murray, W.}, {Saunders, M. A.}, and {Wright, M. H.}
\newblock Constrained nonlinear programming.
\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~3, pages 171--210. North-Holland, 1989.

\bibitem[G75]{G75}
{Gill, P. E.}, {Murray, W.}, {Saunders, M. A.}, and {Wright, M. H.}
\newblock A practical anti-cycling procedure for linearly constrained
  optimization.
\newblock {\em Math. Programming}, 45:437--474, 1989.

\bibitem[G35]{G35}
{Gill, P. E.}, {Murray, W.}, and {Wright, M. H.}
\newblock {\em Practical Optimization}.
\newblock Academic Press, 1981.

\bibitem[G32]{G32}
{Gill, P. E.}, {Murray, W.}, and {Wright, M. H.}
\newblock {\em Numerical Linear Algebra and Optimization, volume {1}}.
\newblock Addison-Wesley, 1991.

\bibitem[G193]{G193}
{Gill, S.}
\newblock Parallel programming.
\newblock {\em Computing J.}, 1:2--10, 1958.

\bibitem[G194]{G194}
{Gilmore, P. A.}
\newblock Structuring of parallel algorithms.
\newblock {\em J. ACM}, 15:176--192, 1968.

\bibitem[G192]{G192}
{Givens, W.}
\newblock Numerical computation of the characteristic values of a real
  symmetric matrix.
\newblock {Tech. Report} ORNL-1574, Oak Ridge National Laboratory, 1954.

\bibitem[G161]{G161}
{Glowinski, R.} and {Lichnewsky, A.}, editors.
\newblock {\em Computing Methods in Applied Sciences and Engineering}.
\newblock SIAM Publications, 1990.

\bibitem[G140]{G140}
{Glowinski, R.} and {Lions, J. L.}, editors.
\newblock {\em Computing Methods in Applied Sciences and Engineering}.
\newblock North-Holland, 1980.

\bibitem[G121]{G121}
{G{\"o}del, K.}
\newblock {\"U}ber formal unentscheidbare {S{\"a}tze} der principia mathematica
  und verwandten {Systeme} {I}.
\newblock {\em Monatsch. Math. und Phys.}, 38:173--198, 1931.

\bibitem[G107]{G107}
{Golden, B.} and {Stewart, W.}
\newblock Empirical analysis of heuristics.
\newblock In {Lawler, E.}, {Lenstra, J.}, {Rinooy Kan, A.}, and {Shimoys, D.},
  editors, {\em The Travelling Salesman Problem}. John Wiley \& Sons, 1985.

\bibitem[G41]{G41}
{Goldfarb, D.}
\newblock Factorized variable metric methods for unconstrained optimization.
\newblock {\em Math. of Computation}, 30(136):796--811, 1976.

\bibitem[G180]{G180}
{Goldfarb, D.}
\newblock Using the steepest-edge simplex algorithm to solve sparse linear
  programs.
\newblock In {Bunch, J. R.} and {Rose, D. J.}, editors, {\em Sparse Matrix
  Computations}. Academic Press, 1976.

\bibitem[G182]{G182}
{Goldfarb, D.} and {Reid, J. K.}
\newblock {FORTRAN} subroutines for sparse in-core linear programming.
\newblock {Tech. Report}, AERE.

\bibitem[G181]{G181}
{Goldfarb, D.} and {Reid, J. K.}
\newblock A practicable steepest-edge simplex algorithm.
\newblock {Tech. Report}, AERE.

\bibitem[G183]{G183}
{Goldfarb, D.} and {Reid, J. K.}
\newblock On the {Bartels-Golub} decomposition for linear programming bases.
\newblock {Tech. Report} CSS-18, Harwell, 1975.

\bibitem[G166]{G166}
{Goldfarb, D.} and {Todd, M. J.}
\newblock Linear programming.
\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~2, pages 73--170. North-Holland, 1989.

\bibitem[G98]{G98}
{Goldstein, A. A.}
\newblock {\em Constructive Real Analysis}.
\newblock Harper \& Row, 1967.

\bibitem[G211]{G211}
{Goldstine, H. H.}, editor.
\newblock {\em The Computer~: From {Pascal} to {von Neumann}}.
\newblock Princeton University Press, 1972.

\bibitem[G184]{G184}
{Golub, G. H.}
\newblock Numerical methods for solving linear least squares problems.
\newblock {\em Numer. Math.}, 7:206--216, 1965.

\bibitem[G189]{G189}
{Golub, G. H.} and {Kahan, W.}
\newblock Calculating the singular values and the pseudo inverse of a matrix.
\newblock {\em SIAM J. Numer. Anal.}, 2:205--224, 1965.

\bibitem[G50]{G50}
{Golub, G. H.}, {Klema, V.}, and {Stewart, G. W.}
\newblock Rank degeneracy and least squares problems.
\newblock {Tech. Report} TR-456, Dept. of Computer Science, Univ. of Maryland,
  1976.

\bibitem[G38]{G38}
{Golub, G. H.} and {Meurant, G. A.}
\newblock {\em R\'esolution Num\'erique des Grands Syst\`emes Lin\'eaires}.
\newblock Eyrolles, Paris, 1983.

\bibitem[G40]{G40}
{Golub, G. H.} and {O'Leary, D. P.}
\newblock Some history of the conjugate gradient and {Lanczos} algorithms~:
  1948-1976.
\newblock {\em SIAM Review}, 31(1):50--102, 1989.

\bibitem[G171]{G171}
{Golub, G. H.} and {Plemmons, R. J.}
\newblock Large-scale geodetic least-squares adjustment by dissection and
  orthogonal decomposition.
\newblock In {Bj{\"o}rck, A.}, {Plemmons, R. J.}, and {Schneider, H.}, editors,
  {\em Large Scale Matrix Problems}, pages 3--28. North-Holland, 1981.

\bibitem[G39]{G39}
{Golub, G. H.} and {Van Loan, C. F.}
\newblock {\em Matrix Computations}.
\newblock Johns Hopkins University Press, Baltimore, $2^{nd}$ edition, 1989.

\bibitem[G188]{G188}
{Golub, G. H.} and {Wilkinson, J. H.}
\newblock Note on the iterative refinement of least squares solution.
\newblock {\em Numer. Math.}, 9:139--148, 1966.

\bibitem[G51]{G51}
{Golumbic, M. C.}
\newblock {\em Algorithmic Graph Theory and Perfect Graphs}.
\newblock Academic Press, 1980.

\bibitem[G97]{G97}
{Gomes, A.} and {Betancourt, R.}
\newblock Implementation of the fast decoupled load-flow on a vector computer.
\newblock {\em IEEE Trans. Power Systems}, PWRS-5(3):977--983, 1990.

\bibitem[G36]{G36}
{Gomes-Ruggiero, M.}, {Mart\'\i nez, J.}, and {Moretti, A.}
\newblock Comparing algorithms for solving sparse nonlinear systems of
  equations.
\newblock {\em SIAM J. Sci. and Stat. Comput.}, 13(2):459--483, 1992.

\bibitem[G28]{G28}
{Gomez, A.} and {Franquelo, L. G.}
\newblock An efficient ordering algorithm to improve sparse vector methods.
\newblock {\em IEEE Trans. Power Systems}, PWRS-3(4):1538--1544, 1988.

\bibitem[G27]{G27}
{Gomez, A.} and {Franquelo, L. G.}
\newblock Node ordering algorithms for sparse vector method improvement.
\newblock {\em IEEE Trans. Power Systems}, PWRS-3(1):73--79, 1988.

\bibitem[G43]{G43}
{Gondran, M.} and {Minoux, M.}
\newblock {\em Graphs and Algorithms}.
\newblock John Wiley \& Sons, 1984.

\bibitem[G71]{G71}
{Gondzio, J.}
\newblock Splitting dense columns of constraint matrix in interior point
  methods for large scale linear programming.
\newblock (To be published at {Optimization}), 1991.

\bibitem[G72]{G72}
{Gondzio, J.} and {Tachat, D.}
\newblock The design and application of the {IPMLO}~: {A} {FORTRAN} library for
  linear optimization with interior point methods.
\newblock {Tech. Report}, {LAMSADE}, Univ. of Paris Dauphine, 1991.

\bibitem[G48]{G48}
{Gonnet, G. H.}
\newblock {\em Handbook of Algorithms and Data Structures}.
\newblock Addison-Wesley, 1984.

\bibitem[G157]{G157}
{Gonzaga, C. C.}
\newblock Search directions for interior linear programming methods.
\newblock {Tech. Report} UCB-ERL-M-87-44, Electronics Research Laboratory,
  Univ. California, Berkeley, 1987.
\newblock (Published at {Algorithmica, 6:153--181, 1991}).

\bibitem[G160]{G160}
{Gonzaga, C. C.}
\newblock A simple representation of {K}armarkar's algorithm.
\newblock {Tech. Report}, Dept. of Systems Engineering and Computer Science,
  COPPE / Federal University of Rio de Janeiro, 1988.

\bibitem[G158]{G158}
{Gonzaga, C. C.}
\newblock An algorithm for solving linear programming problems in ${O}(n^{3}l)$
  operations.
\newblock In {Meggido, N.}, editor, {\em Progress in Mathematical Programming~:
  Interior Point and Related Methods}, chapter~1, pages 1--28. Springer-Verlag,
  1989.

\bibitem[G159]{G159}
{Gonzaga, C. C.}
\newblock Path-following methods for linear programming.
\newblock {\em SIAM Review}, 34(2):167--224, 1992.

\bibitem[G105]{G105}
{Goodenough, J. B.}
\newblock {\em A Study of High Level Language Features~: Detailed Feature
  Analysis}.
\newblock Softech Inc., Waltham, Massachusetts, 1976.

\bibitem[G196]{G196}
{Gotlieb, C. C.} and {Kumar, S.}
\newblock Semantic clustering of index terms.
\newblock {\em J. ACM}, 15:493--513, 1968.

\bibitem[G65]{G65}
{Gradshteyn, I. S.} and {Ryzhik, I. M.}
\newblock {\em Table of Integrals Series and Products}.
\newblock Academic Press, $4^{th}$ edition, 1965.
\newblock ({Translated by Alan Jeffrey from the 1963 Russian edition}).

\bibitem[G122]{G122}
{Graham, R. L.} and {Hell, P.}
\newblock On the history of the minimum spanning tree problem.
\newblock (Published at {Annals of the History of Computing}).

\bibitem[G70]{G70}
{Grandinetti, L.} and {Conforti, D.}
\newblock Numerical comparisons of nonlinear programming algorithms on serial
  and vector processors using automatic differentiation.
\newblock {\em Math. Programming}, 42(2):375--390, 1988.

\bibitem[G102]{G102}
{Granville, S.}
\newblock Fluxo de pot\^encia \'otimo~: {Algoritmo} de programa\c c\~ao
  quadr\'atica sequencial e m\'etodos de lineariza\c c\~ao/quadratiza\c c\~ao
  sucessivas.
\newblock {Relat\'orio T\'ecnico} 066, Centro de Pesquisas em Energia
  El\'etrica (CEPEL), Rio de Janeiro, 1989.

\bibitem[G191]{G191}
{Graves, R. L.} and {Wolfe, P.}, editors.
\newblock {\em Recent Advances in Mathematical Programming}.
\newblock McGraw-Hill, 1963.

\bibitem[G201]{G201}
{Green, D. R.}
\newblock Algorithm 319~: {Triangular} factors of modified matrices.
\newblock {\em Comm. ACM}, 11:12, 1968.

\bibitem[G66]{G66}
{Greene, D. H.} and {Knuth, D. E.}
\newblock {\em Mathematics for the Analysis of Algorithms}.
\newblock Progress in Computer Science. Birkh{\"a}user Verlag, 1981.
\newblock {Coffman, E.}, {Graham, R.} and {Kuck, D.}, editors.

\bibitem[G106]{G106}
{Gries, D.}, editor.
\newblock {\em Programming Methodology}.
\newblock Springer-Verlag, 1978.

\bibitem[G89]{G89}
{Gries, D.} and {Gehani, N. H.}
\newblock Some ideas on data types in high-level languages.
\newblock {\em Comm. ACM}, 20(6), 1977.

\bibitem[G203]{G203}
{Griesmer, J. H.}, {Jenks, R. D.}, and {Yun, D. Y. Y.}
\newblock {SCRATCHPAD} ``{User's Manual}''.
\newblock {Report} RA-70, IBM, Yorktown Heights, 1975.

\bibitem[G67]{G67}
{Griewank, A.} and {Corliss, G. F.}, editors.
\newblock {\em Automatic Differentiation of Algorithms}.
\newblock SIAM Publications, 1991.

\bibitem[G88]{G88}
{Grimes, R. G.}, {Kincaid, D. R.}, and {Young, D. M.}
\newblock {ITPACK 2.0} ``{User's Guide}''.
\newblock {Tech. Report} CNA-150, Univ. of Texas, Austin, 1979.

\bibitem[G209]{G209}
{Grimes, R. G.}, {Lewis, J. G.}, and {Simon, H. D.}
\newblock Experiences in solving large eigenvalue problems on the {CRAY X-MP}.
\newblock {Tech. Report} ETA-TR-40, Engineering Technology Applications (ETA)
  Division, Boeing Computer Services, Seattle, Washington, 1986.

\bibitem[G123]{G123}
{Grimes, R. G.} and {Pierce, D.}
\newblock The implementation of three resequencing algorithms for
  {MSC/NASTRAN}.
\newblock {Tech. Report} ETA-TR-65, ETA Division, Boeing Computer Services,
  Seattle, Washington, 1987.

\bibitem[G115]{G115}
{Grimes, R. G.}, {Pierce, D. J.}, and {Simon, H. D.}
\newblock A new algorithm for finding a pseudoperipheral node in a graph.
\newblock {\em SIAM J. Matrix Anal. and Appl.}, 11(2):323--334, 1990.

\bibitem[G49]{G49}
{Griss, M. L}.
\newblock The algebraic solution of large sparse systems using {REDUCE-2}.
\newblock {\em Proc. of the ACM}, 74:105--111, 1974.

\bibitem[G215]{G215}
{Gropp, W.}, {Lusk, E.}, and {Skjellum, A.}
\newblock {\em Using {MPI}, Portable Parallel Programming with the Message
  Passing Interface}.
\newblock MIT Press.

\bibitem[G164]{G164}
{Gross, T. R.}
\newblock {\em Code Optimization of Pipeline Constraints}.
\newblock PhD thesis, Computer Systems Lab., Stanford Univ., 1983.

\bibitem[G172]{G172}
{Grosse, E.}
\newblock Tensor spline approximation.
\newblock In {Bj{\"o}rck, A.}, {Plemmons, R. J.}, and {Schneider, H.}, editors,
  {\em Large Scale Matrix Problems}, pages 29--42. North-Holland, 1981.

\bibitem[G45]{G45}
{Grosse, E.}
\newblock {NETLIB} {N}ews~: {Greetings}.
\newblock {\em SIAM News}, 23(6):14, 1990.

\bibitem[G46]{G46}
{Grosse, E.}
\newblock {NETLIB} {N}ews~: {Searching} for files.
\newblock {\em SIAM News}, 25(4):10, 1992.

\bibitem[G162]{G162}
{Grossman, R.}, editor.
\newblock {\em Symbolic Computation~: Applications to Scientific Computing}.
\newblock SIAM Publications, 1989.

\bibitem[G95]{G95}
{Gr{\"o}tschel, M.} and {Korte, B.}, editors.
\newblock {\em Mathematical Programming~: The State of the Art}.
\newblock Springer-Verlag, 1983.

\bibitem[G168]{G168}
{Gr{\"o}tschel, M.}, {Lov\'asz, L.}, and {Schrijver, A.}
\newblock The ellipsoid method and its consequences in combinatorial
  optimization.
\newblock {\em Combinatorica}, 1:169--197, 1981.

\bibitem[G96]{G96}
{Gr{\"o}tschel, M.}, {Lov\'asz, L.}, and {Schrijver, A.}
\newblock {\em The Ellipsoid Method and Combinatorial Optimization}.
\newblock Springer-Verlag, 1988.

\bibitem[G91]{G91}
{Gr{\"o}tschel, M.}, {Lov\'asz, L.}, and {Schrijver, A.}
\newblock {\em Geometric Algorithms and Combinatorial Optimization}.
\newblock Springer-Verlag, 1988.

\bibitem[G206]{G206}
{Guardabassi, G.}
\newblock A note on minimal essential sets.
\newblock {\em IEEE Trans. Circuit Theory}, CT-15:86, 1968.

\bibitem[G230]{G230}
{Gupta, A.} and {Kumar, V.}
\newblock Optimally scalable parallel sparse {Cholesky} factorization.
\newblock In {\em Proc. $7^{th}$ {SIAM} Conference on Parallel Processing for
  Scientific Computing}, pages 442--447, 1995.

\bibitem[G207]{G207}
{Gupta, K. K.}
\newblock Solution of eigenvalue problems by {Sturm} sequence method.
\newblock {\em Int. J. Numer. Meth. Eng.}, 4:379--404, 1972.

\bibitem[G147]{G147}
{Gustafson, J. L.}
\newblock Reevaluating {Amdahl's} law.
\newblock {\em Comm. ACM}, 31:532--533, 1988.

\bibitem[G93]{G93}
{Gustafson, J. L.}, {Montry, G. R.}, and {Benner, R. E.}
\newblock Development of parallel methods for a 1024-processor hypercube.
\newblock {\em SIAM J. Sci. and Stat. Comput.}, 9(4), 1988.

\bibitem[G198]{G198}
{Gustavson, F. G.}
\newblock Some algorithms for sparse elimination.

\bibitem[G15]{G15}
{Gustavson, F. G.}
\newblock Some basic techniques for solving sparse systems of linear equations.
\newblock In {Rose, D. J.} and {Willoughby, R. A.}, editors, {\em Sparse
  Matrices and Their Applications}, pages 41--52. Plenum Press, New York, 1972.

\bibitem[G19]{G19}
{Gustavson, F. G.}
\newblock An efficient algorithm to perform sparse matrix multiplication.
\newblock In {\em {A}rgonne Conference on Sparse Matrix Computations}. Argonne
  National Laboratory, 1976.
\newblock ({Report RC-6176, IBM T. J. Watson Research Center}).

\bibitem[G18]{G18}
{Gustavson, F. G.}
\newblock Finding the block lower triangular form of a sparse matrix.
\newblock In {Bunch, J. R.} and {Rose, D. J.}, editors, {\em Sparse Matrix
  Computations}, pages 275--289. Academic Press, 1976.

\bibitem[G17]{G17}
{Gustavson, F. G.}
\newblock Permuting matrices stored in sparse format.
\newblock {\em IBM Tech. Discl. Bull.}, 16:357--359, 1976.
\newblock (Disclosure 8-72-001).

\bibitem[G226]{G226}
{Gustavson, F. G.}
\newblock Remark on {Algorithm} 408~: {A} sparse matrix package (part {I}).
\newblock {\em ACM Trans. Math. Software}, 4(3):295--295, 1978.

\bibitem[G16]{G16}
{Gustavson, F. G.}
\newblock Two fast algorithms for sparse matrices~: {Multiplication} and
  permuted transposition.
\newblock {\em ACM Trans. Math. Software}, 4(3):250--269, 1978.

\bibitem[G227]{G227}
{Gustavson, F. G.}
\newblock An efficient {3-D} parallel algorithm for matrix multiplication.
\newblock {Talk presented at SIAM Symposium on Discrete Algorithms}, IBM Thomas
  J. Watson Research Center, 1995.

\bibitem[G221]{G221}
{Gustavson, F. G.} and {Agarwal, R. C.}
\newblock Vector and parallel algorithms for cholesky factorization on {IBM}
  3090.
\newblock In {\em Proc. of the Supercomputing 89}, pages 225--233, Reno, NV,
  1989. ACM Press.

\bibitem[G229]{G229}
{Gustavson, F. G.} and {Agarwal, R. C.}
\newblock Vector and parallel algorithms for {Cholesky} factorization on {IBM
  3090}.
\newblock In {\em Proc. Supercomputing '89}, 1989.

\bibitem[G220]{G220}
{Gustavson, F. G.}, {Agarwal, R. C.}, {Alpern, B.}, {Carter, L.}, {Klepacki, D.
  J.}, {Lawrence, R.}, and {Zubair, M.}
\newblock High-performance parallel implementations of the {NAS} kernel
  benchmarks on the {IBM} {SP2}.
\newblock {\em IBM Systems Journal}, 34(2), 1995.

\bibitem[G216]{G216}
{Gustavson, F. G.}, {Agarwal, R. C.}, {Cooley, J. W.}, {Shearer, J. B.},
  {Slishman, G.}, and {Tuckerman, B.}
\newblock New scalar and vector elementary functions for the {IBM} system/370.
\newblock {\em IBM J. of Research and Development}, 30(2):126--144, 1986.

\bibitem[G228]{G228}
{Gustavson, F. G.}, {Agarwal, R. C.}, {Palkar, P.}, and {Zubair, M.}
\newblock A performance analysis of the subroutines in the {ESSL}/{LAPACK} call
  convention interface (cci).
\newblock {Tech. Report}, IBM Thomas J. Watson Research Center, Yorktown
  Heights, 1994.

\bibitem[G222]{G222}
{Gustavson, F. G.}, {Agarwal, R. C.}, and {Zubair, M.}
\newblock A high performance algorithm using pre-processing for the sparse
  matrix-vector multiplication.
\newblock In {\em Proc. of Supercomputing '92}, pages 32--41, Minnesota, 1992.
  IEEE.

\bibitem[G218]{G218}
{Gustavson, F. G.}, {Agarwal, R. C.}, and {Zubair, M.}
\newblock Exploiting functional parallelism of power2 to design
  high-performance numerical algorithms.
\newblock {\em IBM J. of Research and Development}, 38(5):563--576, 1994.
\newblock ({Special Issue on POWER2 and PowerPC Architecture and
  Implementation}).

\bibitem[G217]{G217}
{Gustavson, F. G.}, {Agarwal, R. C.}, and {Zubair, M.}
\newblock A high-performance matrix-multiplication algorithm on a
  distributed-memory parallel computer, using overlapped communication.
\newblock {\em IBM J. of Research and Development}, 38(6), 1994.

\bibitem[G223]{G223}
{Gustavson, F. G.}, {Agarwal, R. C.}, and {Zubair, M.}
\newblock A high performance parallel algorithm for {1-D} {FFT}.
\newblock In {\em Proc. of Supercomputing '91}. IEEE Computer Society Press,
  1994.

\bibitem[G219]{G219}
{Gustavson, F. G.}, {Agarwal, R. C.}, and {Zubair, M.}
\newblock Improving performance of linear algebra algorithms for dense
  matrices, using algorithmic prefetch.
\newblock {\em IBM J. of Research and Development}, 38(3), 1994.

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

\bibitem[G200]{G200}
{Gustavson, F. G.} and {Hachtel, G. D.}
\newblock Program implementation of a network design program based on the
  sparse tableau adjoint method.
\newblock In {\em Proc. $16^{th}$ Midwest Symposium on Circuit Theory, part
  {1}}, 1973.

\bibitem[G14]{G14}
{Gustavson, F. G.}, {Liniger, W. M.}, and {Willoughby, R. A.}
\newblock Symbolic generation of an optimal {Crout} algorithm for sparse
  systems of linear equations.
\newblock {\em J. ACM}, 17(1):87--109, 1970.
\newblock ({Originally as Tech. Report RC-1852, IBM Research Center, Yorktown
  Heights, New York, June 27, 1967. Presented at Sparse Matrix Proceedings, IBM
  Thomas Watson Research Center, pp. 1--9, September 1968}).

\bibitem[G187]{G187}
{Gustavson, F. G.} and {Willoughby, R. A.}
\newblock Sparse matrices~: {Some} techniques and applications.
\newblock {\em Proc. IEEE}, 1972.

\bibitem[G197]{G197}
{Gustavson, F. G.} and {Yun, D. Y. Y.}
\newblock Arithmetic complexity of unordered sparse polynomials.
\newblock In {Jenks, R.}, editor, {\em Proc. 1976 {ACM} Symposium on Symbolic
  and Algebraic Computation}, pages 149--153, Yorktown Heights, New York, 1976.

\bibitem[G224]{G224}
{Gustavson, F. G.} and {Brent, R. P.} {Yun, D. Y. Y.}
\newblock Fast solution of {Toeplitz} systems of equations and computation of
  {Pade} approximants.
\newblock {\em Journal of Algorithms}, 1(3):259--295, 1980.

\bibitem[H42]{H42}
{Haber, S.}
\newblock Numerical evaluation of multiple integrals.
\newblock {\em SIAM Review}, 12:481--526, 1970.

\bibitem[H43]{H43}
{Haberman, R.}
\newblock {\em Mathematical Models}.
\newblock Prentice-Hall, 1977.

\bibitem[H2]{H2}
{Hachtel, G. D.}
\newblock Vector and matrix variability type in sparse matrix algorithms.
\newblock In {Rose, D. J.} and {Willoughby, R. A.}, editors, {\em Sparse
  Matrices and their Applications}, pages 53--66. Plenum Press, 1972.

\bibitem[H85]{H85}
{Hachtel, G. D.}
\newblock Extended applications of the sparse tableau approach~: {Finite}
  elements and least squares.
\newblock In {Spillers, W.}, editor, {\em Basic Questions in Design Theory}.
  North-Holland, 1974.
\newblock (Originally in Tech. Report from Elec. Sci. Eng. and Computer Science
  Dept., {UCLA}).

\bibitem[H76]{H76}
{Hachtel, G. D.}
\newblock The sparse tableau approach to finite element assembly.
\newblock In {Bunch, J. R.} and {Rose, D. J.}, editors, {\em Sparse Matrix
  Computations}, pages 349--363. Academic Press, 1976.

\bibitem[H1]{H1}
{Hachtel, G. D.}, {Brayton, R. K.}, and {Gustavson, F. G.}
\newblock The sparse tableau approach to network analysis and design.
\newblock {\em IEEE Trans. Circuit Theory}, CT-18(1):101--113, 1971.

\bibitem[H94]{H94}
{Hachtel, G. D.}, {Gustavson, F. G.}, {Brayton, R. K.}, and {Grapes, T. E.}
\newblock A sparse matrix approach to network analysis.
\newblock In {\em Proc. Cornell Conference on Computerized Electronics}.
  Cornell Univ., 1969.

\bibitem[H103]{H103}
{Hachtel, G. D.} and {Rohrer, R. A.}
\newblock Techniques for the optimal design and synthesis of switching
  circuits.
\newblock {\em Proc. of the IEEE}, 55:1864--1867, 1967.
\newblock (Special Edition on {Computer Aided Design}).

\bibitem[H146]{H146}
{Hadfield, S. M.}
\newblock {\em On the {LU} Factorization of Sequences of Identically Structured
  Sparse Matrices within a Distributed Memory Environment}.
\newblock PhD thesis, Computer and Information Sciences Dept., Univ. of
  Florida, 1994.
\newblock ({TR-94-019}).

\bibitem[H145]{H145}
{Hadfield, S. M.} and {Davis, T. A.}
\newblock Analysis of potential parallel implementations of the
  unsymmetric-pattern multifrontal method for sparse {LU} factorization.
\newblock {Tech. Report} TR-92-017, Computer and Information Science Dept.,
  Univ. of Florida, 1992.

\bibitem[H147]{H147}
{Hadfield, S. M.} and {Davis, T. A.}
\newblock Lost pivot recovery for an unsymmetric-pattern multifrontal method.
\newblock {Tech. Report} TR-94-029, Computer and Information Science Dept.,
  Univ. of Florida, 1994.
\newblock ({To be published at SIAM J. Matrix Anal. and Appl.}).

\bibitem[H148]{H148}
{Hadfield, S. M.} and {Davis, T. A.}
\newblock A parallel unsymmetric-pattern multifrontal method.
\newblock {Tech. Report} TR-94-028, Computer and Information Science Dept.,
  Univ. of Florida, 1994.
\newblock ({To be published at SIAM J. Sci. and Stat. Comput.}).

\bibitem[H149]{H149}
{Hadfield, S. M.} and {Davis, T. A.}
\newblock Potential and achievable parallelism in the unsymmetric-pattern
  multifrontal {LU} factorization method for sparse matrices.
\newblock {Tech. Report} TR-94-006, Computer and Information Science Dept.,
  Univ. of Florida, 1994.
\newblock ({Presented at Proc. $5^{th}$ SIAM Conference on Applied Linear
  Algebra, Snowbird, Utah}).

\bibitem[H55]{H55}
{Hadley, G.}
\newblock {\em Linear Programming}.
\newblock Addison-Wesley, 1962.

\bibitem[H80]{H80}
{Hageman, L.} and {Young, D. M.}
\newblock {\em Applied Iterative Methods}.
\newblock Academic Press, 1981.

\bibitem[H140]{H140}
{Hager, W.}
\newblock {\em Applied Numerical Linear Algebra}.
\newblock Prentice-Hall, 1988.

\bibitem[H88]{H88}
{Haimovich, M.}
\newblock The simplex algorithm is very good~!~: {On} the expected number of
  pivot steps and related properties of random linear programs.
\newblock {Manuscript}, {Columbia Univ.}

\bibitem[H40]{H40}
{Hairer, E.}, {Norsett, S. P.}, and {Warnner, G.}
\newblock {\em Solving Ordinary Differential Equations, volume {1}~: Non-Stiff
  Problems}.
\newblock Springer-Verlag, 1987.

\bibitem[H41]{H41}
{Hairer, E.}, {Norsett, S. P.}, and {Warnner, G.}
\newblock {\em Solving Ordinary Differential Equations, volume {2}~: Stiff
  Problems}.
\newblock Springer-Verlag, 1987.

\bibitem[H120]{H120}
{Hall, A. D.}
\newblock The {ALTRAN} system for rational function manipulation~: {A} survey.
\newblock {\em Comm. ACM}, 14:517--522, 1971.

\bibitem[H111]{H111}
{Hall, A. S.} and {Woodhead, R. W.}
\newblock {\em Frame Analysis}.
\newblock John Wiley \& Sons, 1961.

\bibitem[H100]{H100}
{Hall, M.}
\newblock An algorithm for distinct representatives.
\newblock {\em Amer. Math. Monthly}, 63:716--717, 1956.

\bibitem[H123]{H123}
{Hall, P.}
\newblock On representatives of subsets.
\newblock {\em J. London Math. Soc.}, 10(37):26--30, 1935.

\bibitem[H133]{H133}
{Hamacher, V. C.}, {Vranesic, Z. G.}, and {Zaky, S. G.}, editors.
\newblock {\em Computer Organization}.
\newblock McGraw-Hill, $2^{nd}$ edition, 1984.

\bibitem[H29]{H29}
{Hamming, R. W.}
\newblock {\em Numerical Methods for Scientists and Engineers}.
\newblock McGraw-Hill, 1962.

\bibitem[H30]{H30}
{Hamming, R. W.}
\newblock {\em Introduction to Applied Numerical Analysis}.
\newblock McGraw-Hill, 1971.

\bibitem[H52]{H52}
{Hamming, R. W.}
\newblock {\em Coding and Information Theory}.
\newblock Prentice-Hall, 1986.

\bibitem[H59]{H59}
{Han, S. P.}
\newblock Superlinearly convergent variable metric algorithms for general
  nonlinear programming problems.
\newblock {\em Math. Programming}, 11:263--282, 1976.

\bibitem[H47]{H47}
{Hansen, P. C.}
\newblock Detection of near-singularity in {Cholesky} and ${LDL}^{T}$
  factorizations.
\newblock {\em J. of Comput. and Appl. Math.}, 19:293--299, 1987.

\bibitem[H78]{H78}
{Harary, F.}
\newblock A graph theoretic method for the complete reduction of a matrix with
  a view toward finding its eigenvalues.
\newblock {\em J. Mathematical Phys.}, 38:104--111, 1959.

\bibitem[H96]{H96}
{Harary, F.}
\newblock On the consistency of precedence matrices.
\newblock {\em J. ACM}, 7:255--259, 1959.

\bibitem[H98]{H98}
{Harary, F.}
\newblock The determinant of the adjacency matrix of a graph.
\newblock {\em SIAM Review}, 4:202--210, 1962.

\bibitem[H97]{H97}
{Harary, F.}
\newblock A graph theoretic approach to matrix inversion by partitioning.
\newblock {\em Numer. Math.}, 4:128--135, 1963.

\bibitem[H77]{H77}
{Harary, F.}, editor.
\newblock {\em Graph Theory and Theoretical Physics}.
\newblock Academic Press, 1967.

\bibitem[H95]{H95}
{Harary, F.}
\newblock Graphs and matrices.
\newblock {\em SIAM Review}, 9:83--90, 1967.

\bibitem[H15]{H15}
{Harary, F.}
\newblock {\em Graph Theory}.
\newblock Addison-Wesley, 1969.

\bibitem[H116]{H116}
{Harary, F.}
\newblock Sparse digraphs~: {Classification} and algorithms.
\newblock {Tech. Report}, Univ. Michigan, Ann Arbor, 1970.

\bibitem[H16]{H16}
{Harary, F.}
\newblock Sparse matrices and graph theory.
\newblock In {Reid, J. K.}, editor, {\em Large Sparse Sets of Linear
  Equations}, pages 139--150. Academic Press, 1971.

\bibitem[H99]{H99}
{Harary, F.}, {Karp, R. M.}, and {Tutte, W. T.}
\newblock A criterion for planarity of the square of a graph.
\newblock {\em J. Combinatorial Theory}, 2:395--405, 1967.

\bibitem[H69]{H69}
{Harary, F.}, {Norman, R. Z.}, and {Cartwright, D.}
\newblock {\em Structural Models~: An Introduction to the Theory of Directed
  Graphs}.
\newblock John Wiley \& Sons, 1965.

\bibitem[H114]{H114}
{Hardy} and {Wright}.
\newblock {\em The Theory of Numbers}.
\newblock Oxford University Press, $4^{th}$ edition, 1962.

\bibitem[H72]{H72}
{Hare, D. R.}, {Johnson, C. R.}, {Olesky, D. D.}, and {van den Driessche, P.}
\newblock Inherited matrix entries~: {LU} factorization.
\newblock {\em SIAM J. Matrix Anal. and Appl.}, 10:94--104, 1989.

\bibitem[H71]{H71}
{Hare, D. R.}, {Johnson, C. R.}, {Olesky, D. D.}, and {van den Driessche, P.}
\newblock Sparsity analysis of the {QR} factorization.
\newblock {\em SIAM J. Matrix Anal. and Appl.}, 14:655--669, 1993.

\bibitem[H101]{H101}
{Harris, P. M. J.}
\newblock Pivot selection methods of the {DEVEX} {LP} code.
\newblock {\em Math. Programming}, 5:1--28, 1973.

\bibitem[H39]{H39}
{Hart, J. F.} et~al.
\newblock {\em Computer Approximations}.
\newblock John Wiley \& Sons, 1968.

\bibitem[H38]{H38}
{Hartree, D. R.}
\newblock {\em Numerical Analysis}.
\newblock Clarendon, Oxford University Press, 1958.

\bibitem[H28]{H28}
{Hastings, C. Jr.}
\newblock {\em Approximations for Digital Computers}.
\newblock Princeton University Press, 1955.

\bibitem[H134]{H134}
{Hauck, E. A.} and {Dent, B. A.}
\newblock {BURROUGHS B6500/B7500} stack mechanism.
\newblock In {\em Proc. {AFIPS} {SJCC}}, pages 245--251, 1968.

\bibitem[H141]{H141}
{Haymond, R. E.}, {Jarvis, J. P.}, and {Shier, D. F.}
\newblock Algorithm 613~: {Minimum} spanning trees for moderate integer
  weights.
\newblock {\em ACM Trans. Math. Software}, 10(1):108--111, 1984.

\bibitem[H124]{H124}
{Heap, B. R.}
\newblock Random matrices and graphs.
\newblock {\em Numer. Math.}, 8:114--122, 1966.

\bibitem[H20]{H20}
{Hearn, A. C.}
\newblock {\em {REDUCE} ``{User's Manual}'' version 3.1}.
\newblock {The RAND Corporation}, Santa Monica, 1984.

\bibitem[H54]{H54}
{Heath, M. T.}
\newblock Some extensions of an algorithm for sparse linear least squares
  problems.
\newblock {\em SIAM J. Sci. and Stat. Comput.}, 3:223--237, 1982.

\bibitem[H79]{H79}
{Heath, M. T.}
\newblock {\em Sparse Matrix Software Catalog, {Sparse} Matrix Symposium 1982}.
\newblock Oak Ridge National Laboratory, 1982.
\newblock (Promoted by Union Carbide Corporation, Nuclear Division).

\bibitem[H6]{H6}
{Heath, M. T.}
\newblock Numerical methods for large sparse linear least squares problems.
\newblock {\em SIAM J. Sci. and Stat. Comput.}, 5(3):497--513, 1984.

\bibitem[H25]{H25}
{Heath, M. T.}, editor.
\newblock {\em Hypercube Multiprocessors 1986}.
\newblock SIAM Publications, 1986.

\bibitem[H26]{H26}
{Heath, M. T.}, editor.
\newblock {\em Hypercube Multiprocessors 1987}.
\newblock SIAM Publications, 1987.

\bibitem[H5]{H5}
{Heath, M. T.}, {Ng, E.}, and {Peyton, B. W.}
\newblock Parallel algorithms for sparse linear systems.
\newblock {\em SIAM Review}, 33(3):420--460, 1991.

\bibitem[H73]{H73}
{Heath, M. T.} and {Romine, C.}
\newblock Parallel solution of triangular systems on distributed-memory
  multiprocessors.
\newblock {\em SIAM J. Sci. and Stat. Comput.}, 9:558--588, 1988.

\bibitem[H74]{H74}
{Heath, M. T.} and {Sorensen, D. C.}
\newblock A pipelined {Givens} method for computing the {QR} factorization of a
  sparse matrix.
\newblock {\em Lin. Alg. Appl.}, 77:189--203, 1986.

\bibitem[H60]{H60}
{Hebden, M.}
\newblock An algorithm for minimization using exact second derivatives.
\newblock {Tech. Report} TP-515, Atomic Energy Research Establishment, Harwell,
  England, 1973.

\bibitem[H58]{H58}
{Heller, D.}
\newblock A survey of parallel algorithms in numerical linear algebra.
\newblock {\em SIAM Review}, 20:740--777, 1978.

\bibitem[H92]{H92}
{Hellerman, E.} and {Rarick, D.}
\newblock Reinversion with the preassigned pivot procedure.
\newblock {\em Math. Programming}, 1:195--216, 1971.

\bibitem[H93]{H93}
{Hellerman, E.} and {Rarick, D.}
\newblock The partitioned preassigned pivot procedure (${P}^4$).
\newblock In {Rose, D. J.} and {Willoughby, R. A.}, editors, {\em Sparse
  Matrices and Their Applications}, pages 67--76. Plenum Press, New York, 1972.

\bibitem[H113]{H113}
{Henderson, H. V.} and {Searle, S. R.}
\newblock On deriving the inverse of a sum of matrices.
\newblock {\em SIAM Review}, 23(1):53--60, 1981.

\bibitem[H9]{H9}
{Henessny, J. L.} and {Patterson, D. A.}
\newblock {\em Computer Architecture a Quantitative Approach}.
\newblock Morgan Kaufmann Publishers, 1990.

\bibitem[H136]{H136}
{Hennessy, J. L.}
\newblock {VLSI} processor architecture.
\newblock {\em IEEE Trans. Comput.}, C-33(11):1221--1246, 1984.

\bibitem[H135]{H135}
{Hennessy, J. L.}
\newblock {VLSI} {RISC} processors.
\newblock {\em VLSI Systems Design}, 6(10):22--32, 1985.

\bibitem[H89]{H89}
{Hennessy, J. L.} and {Gross, T. R.}
\newblock Postpass code optimization of pipeline constraints.
\newblock {\em ACM Trans. Programming Languages and Systems}, 5(3):422--448,
  1983.

\bibitem[H137]{H137}
{Hennessy, J. L.}, {Jouppi, N.}, {Basket, F.}, and {Gill, J.}
\newblock {MIPS}~: {A} {VLSI} processor architecture.
\newblock In {\em Proc. {CMU} Conference on {VLSI} Systems and Computations},
  Rockville, 1981. Computer Science Press.

\bibitem[H34]{H34}
{Henrici, P. K.}
\newblock {\em Discrete Variable Methods for Ordinary Differential Equations}.
\newblock John Wiley \& Sons, 1962.

\bibitem[H33]{H33}
{Henrici, P. K.}
\newblock {\em Elements of Numerical Analysis}.
\newblock John Wiley \& Sons, 1964.

\bibitem[H112]{H112}
{Hershdorfer, A. M.}, {Raab, A. R.}, and {Sturman, G. M.}
\newblock On the efficient inversion of large structured matrices.
\newblock In {\em Proc. Engineering Mechanics Division Specialty Conference},
  pages 651--666, Washington, 1966. ASCE.

\bibitem[H121]{H121}
{Hershkowitz, M.} and {Noble, S. B.}
\newblock Finding the inverse and connections of a type of large matrix.
\newblock {\em Naval Res. Logistics Quart.}, 12:119--132, 1965.

\bibitem[H91]{H91}
{Hertog, D.} and {Roos, C.}
\newblock A survey of search directions in interior point methods for linear
  programming.
\newblock {Tech. Report} 89-65, Faculty of Technical Mathematics and
  Informatics, Technische Univ. Delft, Holland, 1989.

\bibitem[H115]{H115}
{Herz, J. C.}
\newblock {\em Cours de Calcul Num\'erique}.
\newblock IBM.

\bibitem[H82]{H82}
{Hestenes, M. R.} and {Stiefel, E.}
\newblock Methods of conjugate gradients for solving linear system.
\newblock {\em J. Res. Nat. Bur. Standards}, B-49:409--436, 1952.

\bibitem[H17]{H17}
{Hester, J. H.} and {Hirschberg, D. S.}
\newblock Self-organizing linear search.
\newblock {\em ACM Computing Surveys}, 17(3):295--311, 1985.

\bibitem[H144]{H144}
{Higham, N. J.}
\newblock Algorithm 674:~{FORTRAN} codes for estimating the one-norm of a real
  or complex matrix.
\newblock {\em ACM Trans. Math. Software}, 14(4):381--396, 1988.

\bibitem[H19]{H19}
{Higham, N. J.}
\newblock Exploiting fast matrix multiplication within the level 3 {BLAS}.
\newblock {Tech. Report} 89-984, Dept. of Computer Science, Cornell Univ.,
  1989.
\newblock (To be published at {ACM Trans. Math. Software}).

\bibitem[H18]{H18}
{Higham, N. J.}
\newblock Is fast matrix multiplication of practical use~?
\newblock {\em SIAM News}, pages 12--14, November 1990.

\bibitem[H87]{H87}
{Higham, N. J.}
\newblock {\em Handbook of Writing for the Mathematical Sciences}.
\newblock SIAM Publications, 1993.

\bibitem[H86]{H86}
{Higham, N. J.}
\newblock {\em Accuracy and Stability of Numerical Algorithms}.
\newblock SIAM Publications, 1996.
\newblock (To be published).

\bibitem[H64]{H64}
{Higman, B.}
\newblock {\em A Comparative Study of Programming Languages}.
\newblock MacDonald, American Elsevier, 1967.

\bibitem[H31]{H31}
{Hildebrand, F. B.}
\newblock {\em Methods of Applied Mathematics}.
\newblock Prentice-Hall, 1952.

\bibitem[H32]{H32}
{Hildebrand, F. B.}
\newblock {\em Introduction to Numerical Analysis}.
\newblock McGraw-Hill, $2^{nd}$ edition, 1974.
\newblock ({First edition, 1956}).

\bibitem[H138]{H138}
{Hill, M. D.}
\newblock {\em Aspects of Cache Memory and Instruction Buffer Performance}.
\newblock PhD thesis, Berkeley Computer Science Division, Univ. California,
  Berkeley, 1987.
\newblock ({Report UCB-CSD-87-381}).

\bibitem[H139]{H139}
{Hillis, W. D.}, editor.
\newblock {\em The Connection Machine}.
\newblock MIT Press, 1985.

\bibitem[H61]{H61}
{Himmelblau, D. M.}
\newblock {\em Applied Nonlinear Programming}.
\newblock McGraw-Hill, 1972.

\bibitem[H8]{H8}
{Himmelblau, D. M.}
\newblock {\em Decomposition of Large-Scale Problems}.
\newblock North-Holland, 1973.

\bibitem[H118]{H118}
{Himmelblau, D. M.}, editor.
\newblock {\em Proc. {NATO} Conference at Cambridge, 1972}.
\newblock North-Holland, 1973.

\bibitem[H143]{H143}
{Hiriart-Hurruty} and {Lemar\'echal, C.}
\newblock {\em Convex Analysis and Minimization Algorithms -- {II}}.
\newblock Springer-Verlag, 1993.

\bibitem[H46]{H46}
{Ho, J. K.}, {Lee, T. C.}, and {Sundarraj, R. P.}
\newblock Decomposition of linear programs using parallel computation.
\newblock {\em Math. Programming}, 42(2):391--406, 1988.

\bibitem[H83]{H83}
{Hoaglin, D. C.}
\newblock An analysis of the loop optimization scores in {Knuth's} `empirical
  study of {FORTRAN} programs'.
\newblock {\em Software Practice and Experience}, 3:161--169, 1972.

\bibitem[H68]{H68}
{Hoare, C. A. R.}
\newblock Quicksort.
\newblock {\em Computer Journal}, 5(1):13--15, 1962.

\bibitem[H65]{H65}
{Hoare, C. A. R.}
\newblock {CASE} expressions.
\newblock {\em {ALGOL} Bulletin}, 18.3.7:20--22, 1964.

\bibitem[H66]{H66}
{Hoare, C. A. R.}
\newblock A note on the {FOR} statement.
\newblock {\em BIT}, 12:334--341, 1972.

\bibitem[H67]{H67}
{Hoare, C. A. R.}
\newblock Communicating sequential processes.
\newblock {\em Comm. ACM}, 21(8):666--677, 1978.

\bibitem[H27]{H27}
{Hobson, E. W.}
\newblock {\em A Treatise on Plane and Advanced Trigonometry}.
\newblock Dover Publications, $7^{th}$ edition, 1957.
\newblock ({First edition by Cambridge University Press, 1891}).

\bibitem[H62]{H62}
{Hock, W.} and {Schittkowski, K.}
\newblock {\em Test Examples for Nonlinear Programming Codes}, volume 187 of
  {\em Lecture Notes in Economics and Mathematical Systems}.
\newblock Springer-Verlag, 1981.

\bibitem[H105]{H105}
{Hockney, R. W.}
\newblock A fast direct solution of {Poisson's} equation using {Fourier}
  analysis.
\newblock {\em J. ACM}, 12:95--113, 1965.

\bibitem[H142]{H142}
{Hockney, R. W.}
\newblock {\em The Science of Computer Benchmarking}.
\newblock SIAM Publications, 1995.

\bibitem[H81]{H81}
{Hockney, R. W.} and {Curington, I. J.}
\newblock $f_{1/2}$~: {A} parameter to characterize memory and communication
  bottlenecks.
\newblock {\em Parallel Computing}, 10:277--286, 1989.

\bibitem[H10]{H10}
{Hockney, R. W.} and {Jesshope, C.}
\newblock {\em Parallel Computers -- {II}~: {Architectures}, Programming \&
  Algorithms}.
\newblock Adam Hilger, 1988.

\bibitem[H75]{H75}
{Hoffman, A. J.}, {Martin, M. S.}, and {Rose, D. J.}
\newblock Complexity bounds for regular finite difference and finite element
  grids.
\newblock {\em SIAM J. Numer. Anal.}, 10:364--369, 1973.

\bibitem[H24]{H24}
{Hoffman, A. J.} and {McCormick, S. T.}
\newblock A fast algorithm that makes matrices optimally sparse.
\newblock In {Pulleyblank, W. R.}, editor, {\em Progress in Combinatorial
  Optimization}, pages 185--196. Academic Press, 1984.

\bibitem[H49]{H49}
{Hoffman, K.} and {Kunze, R.}
\newblock {\em Linear Algebra}.
\newblock Prentice-Hall, 1971.

\bibitem[H44]{H44}
{Hofstadter, D. R.}
\newblock {\em G{\"o}del, Escher, Bach~: An Eternal Golden Braid}.
\newblock Penguin Books, 1980.

\bibitem[H45]{H45}
{Hofstadter, D. R.}
\newblock {\em Metamagical Themas~: Questing for the Essence of Mind and
  Pattern}.
\newblock Penguin Books, 1986.

\bibitem[H122]{H122}
{Holloman, D. R.}
\newblock Forward and backward chaining of data areas.
\newblock {\em IBM Tech. Discl. Bull.}, 13:1956--1960, 1970.

\bibitem[H50]{H50}
{Hood, P.}
\newblock Frontal solution program for unsymmetric matrices.
\newblock {\em Int. J. Numer. Meth. in Eng.}, 10:379--400, 1976.

\bibitem[H51]{H51}
{Hopcroft, J. E.} and {Karp, R. M.}
\newblock An $n^{5/2}$ algorithm for maximum matchings in bipartite graphs.
\newblock {\em SIAM J. Comput.}, 2:225--231, 1973.

\bibitem[H106]{H106}
{Hopcroft, J. E.} and {Kerr, L. R.}
\newblock On minimizing the number of multiplications necessary for matrix
  multiplication.
\newblock {\em SIAM J. Appl. Math.}, 20:30--36, 1971.

\bibitem[H14]{H14}
{Hopcroft, J. E.} and {Tarjan, R.}
\newblock Efficient algorithms for graph manipulation.
\newblock {\em Comm. ACM}, 16:372--378, 1973.

\bibitem[H70]{H70}
{Hopcroft, J. E.} and {Ullmann, J. D.}
\newblock Set merging algorithms.
\newblock {\em SIAM J. Comput.}, 2:294--303, 1973.

\bibitem[H3]{H3}
{Hopper, M. J.}
\newblock Harwell subroutine library~: {A} catalogue of subroutines.
\newblock {Tech. Report} AERE-R-9185, Harwell Laboratory, 1989.
\newblock ($9^{th}$ Edition).

\bibitem[H13]{H13}
{Horowitz, E.} and {Sahni, S.}
\newblock {\em Fundamentals of Data Structures}.
\newblock Computer Science Press, 1976.

\bibitem[H12]{H12}
{Horowitz, E.} and {Sahni, S.}
\newblock {\em Fundamentals of Computer Algorithms}.
\newblock Computer Science Press, Inc., Maryland, 1978.

\bibitem[H150]{H150}
{Hoskins, J.}
\newblock {\em {IBM} {RISC} System/6000~: {A} Business Perspective}.
\newblock John Wiley \& Sons, $2^{nd}$ edition, 1992.

\bibitem[H107]{H107}
{Householder, A. S.}
\newblock {KWIC} index for matrices in numerical analysis, volume {1} primary
  authors {A--J}, volume {2} primary authors {K--Z}.
\newblock {Report} ORNL-4418, Oak Ridge National Laboratory.

\bibitem[H108]{H108}
{Householder, A. S.}
\newblock {KWIC} index for the numerical treatment of nonlinear equations.
\newblock {Report} ORNL-4595, Oak Ridge National Laboratory.

\bibitem[H36]{H36}
{Householder, A. S.}
\newblock {\em Principles of Numerical Analysis}.
\newblock McGraw-Hill, 1953.

\bibitem[H109]{H109}
{Householder, A. S.}
\newblock A survey of some closed methods for inverting matrices.
\newblock {\em SIAM J. Appl. Math.}, 5:155--169, 1957.

\bibitem[H125]{H125}
{Householder, A. S.}
\newblock Unitary triangularization of a nonsymmetric matrix.
\newblock {\em J. ACM}, 5:339--342, 1958.

\bibitem[H102]{H102}
{Householder, A. S.}
\newblock Matrix inversion.
\newblock In {\em International Dictionary of Applied Mathematics}. Van
  Nostrand, Princeton, 1960.

\bibitem[H35]{H35}
{Householder, A. S.}
\newblock {\em The Theory of Matrices in Numerical Analysis}.
\newblock Blaisdell Publishing Co., 1964.

\bibitem[H37]{H37}
{Householder, A. S.}
\newblock {\em The Numerical Treatment of a Single Nonlinear Equation}.
\newblock McGraw-Hill, 1970.

\bibitem[H48]{H48}
{Housos, E. C.}, {Huang, C. C.}, and {Liu, J-M.}
\newblock Parallel algorithms for the {AT\&T} {KORBX} systems.
\newblock {\em AT\&T Technical Journal}, 68(3):37--47, 1989.

\bibitem[H7]{H7}
{Housos, E. C.} and {Irisarri, G. D.}
\newblock A sparse variable metric optimization method applied to the solution
  of power systems problems.
\newblock {\em IEEE Trans. Power Apparatus and Systems}, PAS-101:195--202,
  1982.

\bibitem[H21]{H21}
{Howell, J. A.} and {Gregory, R. T.}
\newblock An algorithm for solving linear algebraic equations using residue
  arithmetic -- {I}.
\newblock {\em BIT}, 9(3):200--224, 1969.

\bibitem[H22]{H22}
{Howell, J. A.} and {Gregory, R. T.}
\newblock An algorithm for solving linear algebraic equations using residue
  arithmetic -- {II}.
\newblock {\em BIT}, 9(3):324--337, 1969.

\bibitem[H23]{H23}
{Howell, J. A.} and {Gregory, R. T.}
\newblock Solving linear equations using residue arithmetic, algorithm {II}.
\newblock {\em BIT}, 10(1):27--37, 1970.

\bibitem[H117]{H117}
{Howell, T. D.}
\newblock Partitioning using ${PAQ}$.
\newblock In {Bunch, J. R.} and {Rose, D. J.}, editors, {\em Sparse Matrix
  Computations}. Academic Press, 1976.

\bibitem[H127]{H127}
{Hsieh, H. Y.}
\newblock Fill-in comparisons between {Gauss-Jordan} and {Gaussian}
  eliminations.
\newblock {\em IEEE Trans. Circuits and Systems}, CAS-21:230--233, 1974.

\bibitem[H126]{H126}
{Hsieh, H. Y.}
\newblock Pivoting-order computation method for large random sparse systems.
\newblock {\em IEEE Trans. Circuits and Systems}, CAS-21:225--230, 1974.

\bibitem[H130]{H130}
{Hsieh, H. Y.} and {Ghausi, M. S.}
\newblock On sparse matrices and optimal pivoting algorithms.
\newblock {Tech. Report} TR-22-1249, IBM.

\bibitem[H128]{H128}
{Hsieh, H. Y.} and {Ghausi, M. S.}
\newblock On optimal pivoting algorithms in sparse matrices.
\newblock {\em IEEE Trans. Circuit Theory}, CT-19:93--96, 1972.

\bibitem[H129]{H129}
{Hsieh, H. Y.} and {Ghausi, M. S.}
\newblock A probabilistic approach to optimal pivoting and prediction of
  fill-in for random sparse matrices.
\newblock {\em IEEE Trans. Circuit Theory}, CT-19:329--336, 1972.

\bibitem[H131]{H131}
{Hsu, T. H.}
\newblock An algorithm for finding a minimal equivalent graph of a digraph.
\newblock {\em J. ACM}, 22:11--16, 1975.

\bibitem[H119]{H119}
{Hu, T. C.}
\newblock Revised matrix algorithms for shortest paths.
\newblock {\em SIAM J. Appl. Math.}, 15:207--218, 1967.

\bibitem[H132]{H132}
{Hu, T. C.}
\newblock A decomposition algorithm for the shortest paths in a network.
\newblock {\em Operations Res.}, 16:91--102, 1968.

\bibitem[H84]{H84}
{Huang, J.} and {Wing, O.}
\newblock On minimum completion time and optimal scheduling of parallel
  triangulation of a sparse matrix.
\newblock In {\em IEEE Power Engineering Society Summer Meeting}, Los Angeles,
  1978. Institute of Electrical and Electronics Engineers, Inc.
\newblock (IEEE Abstract A78-567-0).

\bibitem[H4]{H4}
{Huang, J. W.} and {Wing, O.}
\newblock Optimal parallel triangulation of a sparse matrix.
\newblock {\em IEEE Trans. Circuits and Systems}, CAS-26(9):726--732, 1979.

\bibitem[H57]{H57}
{Huber, P. J.}
\newblock {\em Robust Statistics}.
\newblock John Wiley \& Sons, 1981.

\bibitem[H104]{H104}
{Hull, T. E.}
\newblock The numerical integration of ordinary differential equations.
\newblock In {\em Proc. {IFIP} Congress}, Edinburgh, 1968.

\bibitem[H56]{H56}
{Humes, C. Jr.} and {Humes, A. F.}
\newblock {\em Programa\c c\~ao Linear~: Um Primeiro Curso}.
\newblock Sociedade Brasileira de Matem\'atica Aplicada e Computacional, Rio de
  Janeiro, 1986.

\bibitem[H110]{H110}
{Hunt, P. M.}
\newblock The electronic digital computer in aircraft structural analysis,
  {The} programming of the {Argyris} matrix formulation of structural theory
  for an electronic digital computer -- {I}~: {A} description of a matrix
  interpretive scheme and its application to a particular example.
\newblock {\em Aircraft Engineering}, 28:70--76, 1956.

\bibitem[H53]{H53}
{Hwang, K.}
\newblock Advanced parallel processing with supercomputer architectures.
\newblock {\em Proc. of the IEEE}, 75:1348--1379, 1987.

\bibitem[H11]{H11}
{Hwang, K.} and {Briggs, F. A.}
\newblock {\em Computer Architecture and Parallel Processing}.
\newblock McGraw-Hill, New York, 1985.

\bibitem[H90]{H90}
{Hwu, W. M.} and {Patt, Y.}
\newblock {HPS}m~: {A} high performance restricted data flow architecture
  having minimum functionality.
\newblock In {\em Proc. $13^{th}$ Symposium on Computer Architecture}, pages
  297--307, Tokyo, 1986.

\bibitem[I12]{I12}
{IBM}.
\newblock {\em {PL/I} ``{Language Specifications}''}.
\newblock ({Form C-28-6571}).

\bibitem[I13]{I13}
{IBM}.
\newblock {\em {PL/I} ``{Reference Manual}''}.
\newblock ({Form C-28-8201}).

\bibitem[I20]{I20}
{IBM}.
\newblock {\em {System/360} Matrix Language ({MATLAN})}.
\newblock ({Application Description IBM H-20-0479, Program Description IBM
  H-20-0564, Operations Manual IBM H-20-0559, System Manual IBM H-20-0261}).

\bibitem[I11]{I11}
{IBM}.
\newblock {\em {FORTRAN} General ``{Information Manual}''}, 1961.
\newblock ({Document F-28-8074-1}).

\bibitem[I16]{I16}
{IBM}.
\newblock {Special Issue on New Techniques in the Mathematics of Numerical
  Computation}.
\newblock {IBM J. of Research and Development, 16}, 1972.

\bibitem[I6]{I6}
{IBM}.
\newblock {\em {IBM} {System/360} and {System/370}, {IBM 1130} and {IBM 1800}
  Mathematics Subroutine Library ``{User's Guide}''}, 1976.
\newblock ({Program Product 5736-XM7}, {IBM Catalogue SH-12-5300-1}).

\bibitem[I14]{I14}
{IBM}.
\newblock {\em {E}ngineering and {S}cientific {S}ubroutine {L}ibrary ({ESSL})
  ``{Guide and Reference}''}, 1988.
\newblock ({Release 3, Order SC-23-0184}).

\bibitem[I15]{I15}
{IBM}.
\newblock {The IBM RISC System/6000 Processor, Collection of Papers}.
\newblock {IBM J. of Research and Development, 34(1)}, 1990.

\bibitem[I5]{I5}
{IBM}.
\newblock {\em {O}ptimization {S}ubroutine {L}ibrary (OSL) ``{Guide and
  Reference}'', Version 2, Release 2}, 1994.
\newblock ({Order No. SC-23-0526-01}).

\bibitem[I17]{I17}
{IEEE}.
\newblock {Special Issue on Computer-Aided-Design}.
\newblock {IEEE Trans. on Circuit Theory, CT-18}, 1971.

\bibitem[I23]{I23}
{IEEE}.
\newblock Standard for binary floating point arithmetic.
\newblock {\em SIGPLAN Notices}, 22(2):9--25, 1985.

\bibitem[I10]{I10}
{IEEE Committee Report}.
\newblock Parallel processing in power systems computation.
\newblock {\em IEEE Trans. Power Systems}, PWRS-7:629--638, 1992.

\bibitem[I19]{I19}
{Iliffe, J. K.} and {Jodeit, J. G.}
\newblock A dynamic memory allocation scheme.
\newblock {\em Computing J.}, 5:200--209, 1962.

\bibitem[I2]{I2}
{IMA}.
\newblock {\em Sparse Matrices and their Uses~: {Proc.} 1980 {IMA} {N}umerical
  {A}nalysis {G}roup Conference}. Academic Press, 1981.

\bibitem[I4]{I4}
{IMSL}.
\newblock {\em Library ``{Reference Manual}''}.
\newblock Houston, $8^{th}$ edition, 1980.

\bibitem[I7]{I7}
{INTEL}.
\newblock {\em {i860} 64-Bit Microprocessor ``{Data Sheet}''}, 1989.

\bibitem[I8]{I8}
{INTEL}.
\newblock {\em {i860} 64-Bit Programmer's ``{Reference Manual}''}, 1989.

\bibitem[I9]{I9}
{INTEL}.
\newblock {\em {iPSC} {i860} {FORTRAN} Compiler ``{User's Guide}''}, 1992.

\bibitem[I21]{I21}
{Irisarri, G. D.} and {Sasson, A. M.}
\newblock An automatic contingency selection method for on-line security
  analysis.
\newblock {\em IEEE Trans. Power Apparatus and Systems}, PAS-100:1838--1844,
  1981.

\bibitem[I1]{I1}
{Irons, B. M.}
\newblock A frontal solution program for finite element analysis.
\newblock {\em Int. J. Numer. Meth. in Eng.}, 2:5--32, 1970.

\bibitem[I22]{I22}
{Irons, B. M.} and {Kan, D. K. Y.}
\newblock Equation-solving algorithms for the finite-element method.
\newblock In {Fenves, S. J.}, {Perrone, N.}, {Robinson, A. R.}, and
  {Schnobrich, W. C.}, editors, {\em Numerical and Computer Methods in
  Structural Mechanics}, pages 497--511. Academic Press, 1973.

\bibitem[I3]{I3}
{Isaacson, E.} and {Keller, H. B.}
\newblock {\em Analysis of Numerical Methods}.
\newblock John Wiley \& Sons, 1966.

\bibitem[I18]{I18}
{Iverson, K. E.}
\newblock {\em {APL}~: A Programming Language}.
\newblock John Wiley \& Sons, 1962.

\bibitem[J5]{J5}
{Jacobs, D. A. H.}, editor.
\newblock {\em The State of the Art in Numerical Analysis}.
\newblock Academic Press, 1977.

\bibitem[J34]{J34}
{Jaeger, A.} and {Wenke, K.}, editors.
\newblock {\em Lineare Wirtschaftsalgebra}.
\newblock Teubner, Berlin, 1969.

\bibitem[J14]{J14}
{Jarre, F.}
\newblock {\em The Method of Analytic Centers for Smooth Convex Programs}.
\newblock Grottenthaler Verlag, Bamberg, 1989.

\bibitem[J25]{J25}
{Jennings, A.}
\newblock A compact storage scheme for the solution of symmetric linear
  simultaneous equations.
\newblock {\em Computing J.}, 9:281--285, 1966.

\bibitem[J35]{J35}
{Jennings, A.}
\newblock A direct method for computing latent roots and vectors of a symmetric
  matrix.
\newblock {\em Proc. Cambridge Philos. Soc.}, 63:755--765, 1967.

\bibitem[J30]{J30}
{Jennings, A.}
\newblock A sparse matrix scheme for the computer analysis of structures.
\newblock {\em Int. J. of Comp. Math.}, 2:1--21, 1968.

\bibitem[J13]{J13}
{Jennings, A.}, editor.
\newblock {\em Matrix Computation for Engineers and Scientists}.
\newblock John Wiley \& Sons, 1977.

\bibitem[J26]{J26}
{Jennings, A.} and {Malik, G. M.}
\newblock Partial elimination.
\newblock {\em J. Inst. Math. Appl.}, 20:307--316, 1977.

\bibitem[J29]{J29}
{Jennings, A.} and {Tuff, A. D.}
\newblock A direct method for the solution of large sparse symmetric
  simultaneous equations.
\newblock In {Reid, J. K.}, editor, {\em Large Sparse Sets of Linear
  Equations}, pages 97--104. Academic Press, 1971.

\bibitem[J10]{J10}
{Jensen, H. G.}
\newblock Designing self supporting transmission towers with the digital
  computer.
\newblock In {\em {PICA} Conference Proceedings}, Pittsburgh, 1967.

\bibitem[J31]{J31}
{Jensen, H. G.}
\newblock Efficient matrix techniques applied to transmission tower design.
\newblock {\em Proc. IEEE}, 55:1997--2000, 1967.

\bibitem[J9]{J9}
{Jensen, H. G.} and {Parks, G. A.}
\newblock Efficient solutions for linear matrix equations.
\newblock {\em J. of the Structural Division, American Soc. of Civil Eng.},
  97(1):49--64, 1970.

\bibitem[J19]{J19}
{Jensen, K.} and {Wirth, N.}, editors.
\newblock {\em {PASCAL}~: User Manual and Report}.
\newblock Springer-Verlag, $2^{nd}$ edition, 1975.

\bibitem[J36]{J36}
{Jensen, P. S.} and {Loden, W. A.}
\newblock Supplementary study on the sensitivity of optimized structures.
\newblock {Tech. Report} LMSC-D-777859, Lockheed Palo Alto Research Laboratory,
  1980.

\bibitem[J4]{J4}
{Jess, J. A. G.} and {Kees, H. G. M.}
\newblock A data structure for parallel {LU} decomposition.
\newblock {\em IEEE Trans. Comput.}, C-31(3):231--239, 1982.

\bibitem[J33]{J33}
{Jewell, J. G.}
\newblock Ordering systems of equations.
\newblock {\em SIAM J. Appl. Math.}, 9:55--71, 1961.

\bibitem[J32]{J32}
{Jodeit, J. G.}
\newblock Storage organization in programming systems.
\newblock {\em Comm. ACM}, 11:741--746, 1968.

\bibitem[J24]{J24}
{Johnson, D. B.}
\newblock Efficient algorithms for shortest paths in sparse networks.
\newblock {\em J. ACM}, 24:1--13, 1977.

\bibitem[J27]{J27}
{Johnson, D. M.}, {Dulmage, A. L.}, and {Mendelsohn, N. S.}
\newblock Connectivity and reducibility of graphs.
\newblock {\em Cand. J. Math.}, 14:529--539, 1963.

\bibitem[J16]{J16}
{Johnson, S. C.}
\newblock {LINT}~: {A} ${C}$ program checker.
\newblock In {\em UNIX Programmer Manual}. BELL Labs., $7^{th}$ edition, 1979.

\bibitem[J17]{J17}
{Johnson, S. C.} and {Kernighan, B. W.}
\newblock The programming language ${B}$.
\newblock {Tech. Report}~8, Computer Science Dept., BELL Labs., Inc., 1973.

\bibitem[J18]{J18}
{Johnson, S. C.} and {Ritchie, D. M.}
\newblock Portability of ${C}$ programs and the {UNIX} system.
\newblock {\em BELL System Tech. Journal}, 57:2021--2048, 1978.

\bibitem[J23]{J23}
{Jones, M. T.} and {Patrick, M. L.}
\newblock The use of {Lanczos's} method to solve the large generalized
  symmetric definite eigenvalue problem.
\newblock {Tech. Report} 89-67, Institute for Computer Applications in Science
  and Engineering ({ICASE}), {NASA} Langley Research Center, Hampton, 1989.

\bibitem[J22]{J22}
{Jones, M. T.} and {Patrick, M. L.}
\newblock Factoring symmetric indefinite matrices in high-performance
  architectures.
\newblock {Tech. Report} 90-8, Institute for Computer Applications in Science
  and Engineering ({ICASE}), {NASA} Langley Research Center, Hampton, 1990.

\bibitem[J21]{J21}
{Jones, M. T.} and {Patrick, M. L.}
\newblock {Bunch-Kaufman} factorization for real symmetric indefinite banded
  matrices.
\newblock {\em SIAM J. Matrix Anal. and Appl.}, 14:553--559, 1993.

\bibitem[J20]{J20}
{Jones, M. T.} and {Patrick, M. L.}
\newblock Factoring symmetric indefinite matrices on high performance
  architectures.
\newblock {\em SIAM J. Matrix Anal. and Appl.}, 15(1):273--283, 1994.

\bibitem[J3]{J3}
{Jones, M. T.} and {Plassmann, P. E.}
\newblock Algorithm 740~: {FORTRAN} subroutines to compute improved incomplete
  {Cholesky} factorizations.
\newblock {\em ACM Trans. Math. Software}, 21(1):18--19, 1995.

\bibitem[J2]{J2}
{Jones, M. T.} and {Plassmann, P. E.}
\newblock An improved incomplete {Cholesky} factorization.
\newblock {\em ACM Trans. Math. Software}, 21(1):5--17, 1995.

\bibitem[J28]{J28}
{Jouppi, N. P.} and {Wall, D. W.}
\newblock Available instruction-level parallelism for superscalar and
  superpipelined machines.
\newblock In {\em Proc. $3^{rd}$ Conference on Architectural Support for
  Programming Languages and Operating Systems}, pages 272--282, Boston, 1989.
  IEEE/ACM.

\bibitem[J6]{J6}
{Joyce, D.}
\newblock A survey of extrapolation processes in numerical analysis.
\newblock {\em SIAM Review}, 13:435--490, 1971.

\bibitem[J15]{J15}
{J\'udice, J.} and {Pires, F.}
\newblock Direct methods for convex quadratic programs subject to box
  constraints.
\newblock {Tech. Report} ANL-MCS-P77-0589, Argonne National Laboratory,
  Argonne, Illinois, 1989.

\bibitem[J7]{J7}
{Jung, H. W.}, {Marsten, R. E.}, and {Saltzman, M. J.}
\newblock The column {Cholesky} method for numerical factorization in interior
  point algorithms.
\newblock {Tech. Report} 596, Dept. of Mathematical Sciences, Clemson Univ.,
  Clemson, 1991.

\bibitem[J1]{J1}
{Jung, H. W.}, {Marsten, R. E.}, and {Saltzman, M. J.}
\newblock Numerical factorization methods for interior point algorithms.
\newblock {\em ORSA J. Computing}, 6(1), 1994.

\bibitem[J8]{J8}
{Jung, H. W.} and {Saltzman, M. J.}
\newblock The multifrontal method for numerical factorization in interior point
  algorithms.
\newblock {Tech. Report} 597, Dept. of Mathematical Sciences, Clemson Univ.,
  Clemson, 1991.

\bibitem[J12]{J12}
{Justino Filho, M. R.}
\newblock Solu\c c\~ao multifrontal de sistemas de equa\c c\~oes alg\'ebricas
  lineares sim\'etricas esparsas.
\newblock {Semin\'ario de Doutorado do Programa de Engenharia Civil,
  COPPE/UFRJ}, 1990.

\bibitem[J11]{J11}
{Justino Filho, M. R.} and {Ebecken, N. F. F.}
\newblock Decomposi\c c\~ao de dom\'\i nio autom\'atica de malhas do m\'etodo
  de elementos finitos no hipercubo {INTEL} {iPSC/860}.
\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 432--443, 1993.

\bibitem[K69]{K69}
{Kahan, W.}
\newblock Numerical linear algebra.
\newblock {\em Canadian Math. Bull.}, 9:757--801, 1966.

\bibitem[K52]{K52}
{Kahan, W.} and {Parlett, B. N.}
\newblock How far should you go with the {Lanczos} process~?
\newblock In {Bunch, J. R.} and {Rose, D. J.}, editors, {\em Sparse Matrix
  Computations}, pages 131--144. Academic Press, 1976.

\bibitem[K15]{K15}
{Kahaner, D.}, {Moler, C. B.}, and {Nash, S.}
\newblock {\em Numerical Methods and Software}.
\newblock Prentice-Hall, 1989.

\bibitem[K93]{K93}
{Kahaner, D. K.}
\newblock Benchmarks for `real' programs.
\newblock {\em SIAM News}, November 1988.

\bibitem[K94]{K94}
{Kane, G.}
\newblock {\em {MIPS} {RS2000} {RISC} Architecture}.
\newblock Prentice Hall, 1986.

\bibitem[K95]{K95}
{Kane, G.}
\newblock {\em {MIPS} {RISC} Architecture}.
\newblock Prentice Hall, 1988.

\bibitem[K65]{K65}
{Kantorovich, L. V.}
\newblock Mathematical methods of organizing and planning production.
\newblock {\em Management Science}, 6:366--422, 1959.
\newblock ({Russian original by Publication House of the Leningrad State
  University, 1939}).

\bibitem[K14]{K14}
{Kantorovich, L. V.} and {Krylov, V. I.}
\newblock {\em Approximate Methods of Higher Analysis}.
\newblock Noordhoff, Groningen, 1958.
\newblock ({Translated from the Russian original}).

\bibitem[K13]{K13}
{Kaplan, W.}
\newblock {\em Advanced Calculus}.
\newblock Addison-Wesley, 1953.

\bibitem[K1]{K1}
{Karmarkar, N.}
\newblock A new polynomial time algorithm for linear programming.
\newblock {\em Combinatorica}, 4:373--395, 1984.

\bibitem[K57]{K57}
{Karmarkar, N.}
\newblock A new polynomial time algorithm for linear programming.
\newblock In {\em Proc. $16^{th}$ Annual ACM Symposium on the Theory of
  Computing}, pages 302--311, 1984.

\bibitem[K96]{K96}
{Karmarkar, N.}
\newblock {Rieamannian} geometry underlying interior-point methods for linear
  programming.
\newblock {\em Contemporary Mathematics}, 114:51--75, 1990.

\bibitem[K18]{K18}
{Karmarkar, N.}, {Lagarias, J. C.}, {Slutsman, L.}, and {Wang, P.}
\newblock Power series variants of {Karmarkar-type} algorithms.
\newblock {\em AT\&T Technical Journal}, 68(3):20--36, 1989.

\bibitem[K2]{K2}
{Karmarkar, N.} and {Ramakrishnan, K.}
\newblock Implementation and computational results of the {Karmarkar} algorithm
  for linear programming using an iterative method for computing projections.
\newblock {Tech. Report}, AT\&T, BELL Labs., New Jersey, 1988.

\bibitem[K56]{K56}
{Karmarkar, N.}, {Resende, M. G. C.}, and {Ramakrishnan, K.}
\newblock A interior point algorithm to solve computationally difficult set
  covering problems.
\newblock {Manuscript}, AT\&T BELL Labs., Murray Hill, 1989.

\bibitem[K58]{K58}
{Karmarkar, N.} and {Sinha, L. P.}
\newblock Application of {Karmarkar's} algorithm to overseas telecommunications
  facilities planning.
\newblock (Presented at {$12^{th}$ International Symposium on Mathematical
  Programming, Boston}), 1985.

\bibitem[K23]{K23}
{Karp, A. H.}
\newblock Programming for parallelism.
\newblock {\em IEEE Computer}, 20:43--57, 1987.

\bibitem[K45]{K45}
{Karp, A. H.} and {Babb, R.}
\newblock A comparison of 12 parallel {FORTRAN} dialects.
\newblock {\em IEEE Software}, pages 52--67, 1988.

\bibitem[K73]{K73}
{Karp, R. M.}
\newblock Some bounds on the storage requirements of sequential machines and
  {Turing} machines.
\newblock {\em J. ACM}, 14:478--489, 1967.

\bibitem[K34]{K34}
{Karp, R. M.}
\newblock Reducibility among combinatorial problems.
\newblock In {Miller, R. E.}, editor, {\em Complexity of Computer
  Computations}, pages 85--103. Plenum Press, 1972.

\bibitem[K35]{K35}
{Karp, R. M.}
\newblock On the complexity of combinatorial problems.
\newblock {\em Networks}, 5:45--68, 1975.

\bibitem[K43]{K43}
{Karp, R. M.}
\newblock Combinatorics, complexity, and randomness.
\newblock {\em Comm. ACM}, 29:98--109, 1986.

\bibitem[K72]{K72}
{Karp, R. M.} and {Miller, R. E.}
\newblock Properties of a model for parallel computation~: Determinancy,
  termination, queueing.
\newblock {\em SIAM J. Appl. Math.}, 14, 1966.

\bibitem[K75]{K75}
{Karp, R. M.} and {Miller, R. E.}
\newblock Parallel program schemata.
\newblock {\em J. Comput. System. Sci.}, 3:147--195, 1969.

\bibitem[K74]{K74}
{Karp, R. M.}, {Miller, R. E.}, and {Winograd, S.}
\newblock The organization of computations for uniform recurrence equations.
\newblock {\em J. ACM}, 14:563--590, 1967.

\bibitem[K64]{K64}
{Karp, R. M.} and {Papadimitriou, C. H.}
\newblock On linear characterizations of combinatorial optimization problems.
\newblock {\em SIAM J. Comput.}, 11:620--632, 1982.

\bibitem[K61]{K61}
{Karush, W.}
\newblock Minima of functions of several variables with inequalities as side
  constraints.
\newblock Master's thesis, Dept. of Mathematics, Univ. of Chicago, 1939.

\bibitem[K98]{K98}
{Karypis, G.}, {Gupta, A.}, and {Kumar, V.}
\newblock A parallel formulation of interior point algorithms.
\newblock In {\em Proc. Supercomputing '94}, pages 204--213. IEEE Computer
  Society Press, 1994.

\bibitem[K16]{K16}
{Kaskurewickz, E.} and {Bhaya, A.}
\newblock Sistemas din\^amicos de grande porte~: {Estabilidade}.
\newblock In {\em {I} Escola Brasileira de Otimiza\c c\~ao}, pages 80--93, Rio
  de Janeiro, 1989.

\bibitem[K24]{K24}
{Kaszkurewicz, E.}, {Bhaya, A.}, and {Siljak, D. D.}
\newblock On the convergence of parallel asynchronous block-iterative
  computations.
\newblock In {\em Linear Algebra and Its Applications}, pages 139--160.
  Elsevier Science Publishing Co., 1990.

\bibitem[K48]{K48}
{Kaufman, L.}
\newblock Application of dense {Householder} transformations to a sparse
  matrix.
\newblock {\em ACM Trans. Math. Software}, 5:442--450, 1979.

\bibitem[K44]{K44}
{Kaufman, L.}
\newblock Usage of the sparse matrix programs in the {PORT} library.
\newblock {Tech. Report} 105, AT\&T BELL Labs., Murray Hill, 1982.

\bibitem[K49]{K49}
{Kaufman, L.}
\newblock The generalized {Householder} transformation and sparse matrices.
\newblock {\em Lin. Alg. Appl.}, 90:221--234, 1987.

\bibitem[K40]{K40}
{Kaufman, L.}
\newblock Computing the ${MDM}^{T}$ decomposition.
\newblock {Tech. Report} 11274-91-1011-20, BELL Labs., 1991.

\bibitem[K54]{K54}
{Keller, R. M.}
\newblock Look-ahead processors.
\newblock {\em ACM Computing Surveys}, 7(4):177--195, 1975.

\bibitem[K30]{K30}
{Kendrick, D.} and {Meeraus, A.}
\newblock {GAMS}~: {An} introduction, 1984.
\newblock Development Research Dept., World Bank.

\bibitem[K63]{K63}
{Kennington, J. L.}
\newblock A survey of linear cost multicommodity network flows.
\newblock {\em Operations Res.}, 26:209--236, 1978.

\bibitem[K31]{K31}
{Kernigham, B. W.} and {McIlroy, M. D.}
\newblock {\em {UNIX} Programmer's Manual}.
\newblock BELL Labs., Murray Hill, 1990.
\newblock ($7^{th}$ edition).

\bibitem[K32]{K32}
{Kernigham, B. W.} and {Ritchie, D. M.}
\newblock {\em The ${C}$ Programming Language}.
\newblock Prentice-Hall, 1978.

\bibitem[K41]{K41}
{Kernighan, B. W.} and {Lin, S.}
\newblock An efficient heuristic procedure for partitioning graphs.
\newblock {\em BELL System Tech. Journal}, 49:291--307, 1970.

\bibitem[K21]{K21}
{Kernighan, B. W.} and {Plauger, P. J.}
\newblock {\em The Elements of Programming Style}.
\newblock McGraw-Hill, 1974.

\bibitem[K7]{K7}
{Kernighan, B. W.} and {Plauger, P. J.}
\newblock {\em Software Tools}.
\newblock Addison-Wesley, 1976.

\bibitem[K87]{K87}
{Kevorkian, A. K.} and {Snoek, J.}
\newblock Decomposition in large scale systems~: {Theory} and applications in
  solving large sets of nonlinear simultaneous equations.
\newblock In {Himmelblau, D. M.}, editor, {\em Proc. {NATO} Conference at
  Cambridge, 1972}, pages 491--515. North-Holland, 1973.

\bibitem[K86]{K86}
{Kevorkian, A. K.} and {Snoek, J.}
\newblock Decomposition in large scale systems~: {Theory} and applications of
  structural analysis in partitioning, disjointing and constructing
  hierarchical systems.
\newblock In {Himmelblau, D. M.}, editor, {\em Proc. {NATO} Conference at
  Cambridge, 1972}, pages 467--489. North-Holland, 1973.

\bibitem[K88]{K88}
{Key, J. E.}
\newblock Computer program for solution of large sparse unsymmetric systems of
  linear equations.
\newblock {\em Int. J. Numer. Meth. Eng.}, 6:497--509, 1973.

\bibitem[K26]{K26}
{Khachiyan, L. G.}
\newblock A polynomial algorithm for linear programming.
\newblock {\em Soviet Math. Doklady}, 20:191--194, 1979.
\newblock ({Russian original in Doklady Akademiia Nauk SSSR, 244:1093--1096}).

\bibitem[K59]{K59}
{Khachiyan, L. G.}
\newblock Polynomial algorithms in linear programming.
\newblock {\em USSR Computational Mathematics and Math. Phys.}, 20:53--72,
  1980.
\newblock ({Russian original in Zhurnal Vychisditel'noi Matematiki i
  Matematicheskoi Fiziki, 20:51--68}).

\bibitem[K60]{K60}
{Khachiyan, L. G.} and {Todd, M. J.}
\newblock On the complexity of approximating the maximal inscribed ellipsoid
  for a polytope.
\newblock {Tech. Report} 893, School of Operations Research and Industrial
  Engineering, Cornell Univ., Ithaca, 1990.

\bibitem[K47]{K47}
{Kincaid, D. R.}, {Respess, J. R.}, {Young, D. M.}, and {Grimes, R. G.}
\newblock {ITPACK 2C}~: {A} {FORTRAN} package for solving large sparse linear
  systems by adaptive accelerated iterative methods.
\newblock {\em ACM Trans. Math. Software}, 8(3):302--322, 1982.

\bibitem[K42]{K42}
{King, I. P.}
\newblock An automatic reordering scheme for simultaneous equations derived
  from network problems.
\newblock {\em Int. J. Numer. Meth. in Eng.}, 2:523--533, 1970.

\bibitem[K25]{K25}
{Kirkpatrick, S.}, {Gelatt, C. D. Jr.}, and {Vecchi, P.}
\newblock Optimization by simulated annealing.
\newblock {\em Science}, 220(4598):671--680, 1983.

\bibitem[K36]{K36}
{Klee, V.}
\newblock Combinatorial optimization~: {What} is the state of the art~?
\newblock {\em Math. Oper. Res.}, 5:1--26, 1980.

\bibitem[K53]{K53}
{Klee, V.} and {Minty, G. J.}
\newblock How good is the simplex algorithm~?
\newblock In {Shisha, O.}, editor, {\em Inequalities -- {III}}, pages 159--175.
  Academic Press, 1972.

\bibitem[K12]{K12}
{Klein, F.} et~al., editors.
\newblock {\em Famous Problems and other Monographs}.
\newblock Chelsea Publishing, $2^{nd}$ edition, 1962.

\bibitem[K82]{K82}
{Klyuyev, V. V.} and {Kokovkin-Shcherbak, N. I.}
\newblock On the minimization of the number of arithmetic operations for the
  solution of linear algebraic systems.
\newblock {Tech. Report} CS-24, Computer Science Dept., Stanford Univ., 1965.

\bibitem[K99]{K99}
{Knowlton, K. C.}
\newblock A fast storage allocator.
\newblock {\em Comm. ACM}, 8:623--625, 1965.

\bibitem[K5]{K5}
{Knuth, D. E.}
\newblock An empirical study of {FORTRAN} programs.
\newblock {\em Software Practice and Experience}, 1(2):105--133, 1971.

\bibitem[K11]{K11}
{Knuth, D. E.}
\newblock {\em Mathematical Analysis of Algorithms}.
\newblock Information Processing, 1971.

\bibitem[K3]{K3}
{Knuth, D. E.}
\newblock {\em The Art of Computer Programming, volume {1}~: Fundamental
  Algorithms}.
\newblock Addison-Wesley, $2^{nd}$ edition, 1973.

\bibitem[K4]{K4}
{Knuth, D. E.}
\newblock {\em The Art of Computer Programming, volume {3}~: Sorting and
  Searching}.
\newblock Addison-Wesley, 1973.

\bibitem[K33]{K33}
{Knuth, D. E.}
\newblock Structured programming with {GOTO} statements.
\newblock {\em ACM Computing Surveys}, 6:261, 1974.

\bibitem[K37]{K37}
{Knuth, D. E.}
\newblock A generalization of {Dijkstra's} algorithm.
\newblock {\em Inform. Process. Lett.}, 6:1--5, 1977.

\bibitem[K46]{K46}
{Kogge, P.}
\newblock {\em The Architecture of Pipelined Computers}.
\newblock McGraw-Hill, 1981.

\bibitem[K27]{K27}
{Kojima, M.}, {Megiddo N.}, {Nooma, T.}, and {Yoshise, A.}
\newblock {\em A Unified Approach to Interior Point Algorithms for Linear
  Complementarity Problems}, volume 538 of {\em Lecture Notes in Computer
  Science}.
\newblock Springer-Verlag, 1991.

\bibitem[K38]{K38}
{Kolmogorov, A.}
\newblock Three approaches to the quantitative definition of information.
\newblock {\em Problems Inform. Transmission}, 1:1--7, 1965.

\bibitem[K39]{K39}
{K{\"o}nig, D.}
\newblock Graphen und matrizen.
\newblock {\em Mat. Fiz. Lapok}, 38:116--119, 1931.

\bibitem[K67]{K67}
{K{\"o}nig, D.}
\newblock {\em Theorie der Endlichen and Unendlichen Graphen}.
\newblock Chelsea, New York, 1950.

\bibitem[K85]{K85}
{Korganoff, A.}
\newblock {\em M\'ethodes de Calcul Num\'erique -- {I}}.
\newblock Dunod, 1960.

\bibitem[K28]{K28}
{Korth, H. F.} and {Silberchatz, A.}
\newblock {\em Database System Concepts}.
\newblock McGraw-Hill, 1986.

\bibitem[K80]{K80}
{Kosko, E.}
\newblock Matrix inversion by partitioning.
\newblock {\em Aero. Quart.}, 8:157--184, 1957.

\bibitem[K76]{K76}
{Kotov, V. E.} and {Maringani, A. S.}
\newblock On transformations of sequential programs into asynchronous parallel
  programs.
\newblock In {\em {IFIP} Congress}, Edinburgh, 1968.

\bibitem[K17]{K17}
{Kranich E.}
\newblock Interior point methods for mathematical programming~: {A}
  bibliography.
\newblock {Tech. Report} 171, Institute of Economy and Operations Research,
  Fern Univ. Hagen, P.O. Box 940, D-5800 Hagen 1, West Germany, 1991.

\bibitem[K10]{K10}
{Kratzer, S. G.}
\newblock Massively parallel sparse matrix computations.
\newblock {Tech. Report} SRC-TR-90-008, Supercomputer Research Center, Bowie,
  1990.

\bibitem[K20]{K20}
{Krogh, F. T.} and {van Snyder, W.}
\newblock Algorithm 669~: {A} new representation of {Patterson's} quadrature
  formulae.
\newblock {\em ACM Trans. Math. Software}, 17(4):457--461, 1991.

\bibitem[K81]{K81}
{Kron, G.}
\newblock {\em Tensor Analysis of Networks}.
\newblock John Wiley \& Sons, 1939.

\bibitem[K77]{K77}
{Kron, G.}
\newblock A set of principles to interconnect the solutions of physical
  systems.
\newblock {\em J. Appl. Phys.}, 24:965--980, 1953.

\bibitem[K78]{K78}
{Kron, G.}
\newblock Solving highly complex elastic structures in easy stages.
\newblock {\em J. Appl. Mech.}, 22:235--244, 1955.

\bibitem[K79]{K79}
{Kron, G.}
\newblock Tearing and interconnecting as a form of transformation.
\newblock {\em Quart. Appl. Math.}, 13:147--159, 1955.

\bibitem[K19]{K19}
{Kron, G.}
\newblock {\em Diakoptics}.
\newblock MacDonald, London, 1963.

\bibitem[K97]{K97}
{Kruskal, J. B.}
\newblock On the shortest spanning subtree of a graph and the traveling
  salesman problem.
\newblock {\em Proc. of the AMS}, 2:48--50, 1956.

\bibitem[K89]{K89}
{Kublanovskaja, V. N.}, {Savinov, G. V.}, and {Smirnova, T. N.}
\newblock On the solution of problems with sparse matrices.
\newblock {\em Zap. Naum. Sem. Leningrad, Otdel. Mat. Inst. Steklov. (LOMI)},
  35:75--94, 1973.
\newblock ({In Russian}).

\bibitem[K68]{K68}
{Kuch, D. J.}
\newblock {ILLIAC IV} software and application programming.
\newblock {\em IEEE Trans. Comput.}, C-17:758--770, 1968.

\bibitem[K100]{K100}
{Kuck, D.}
\newblock {\em The Structure of Computers and Computations, Volume {1}}.
\newblock John Wiley \& Sons, 1978.

\bibitem[K83]{K83}
{Kuh, E. S.} and {Rohrer, R. A.}
\newblock The state-variable approach to network analysis.
\newblock {\em Proc. of the IEEE}, 53:672--686, 1965.

\bibitem[K90]{K90}
{Kuhn, H. W.}
\newblock The {Hungarian} method of solving the assignment problem.
\newblock {\em Naval Res. Logistics Quart.}, 2:83--97, 1955.

\bibitem[K91]{K91}
{Kuhn, H. W.}
\newblock Variants of the {Hungarian} method for assignment problems.
\newblock {\em Naval Res. Logistics Quart.}, 3:253--258, 1957.

\bibitem[K66]{K66}
{Kuhn, H. W.} and {Quandt, R. E.}
\newblock An experimental study of the simplex method.
\newblock In {Metropolis} et~al., editors, {\em Proc. Symposia in Applied
  Mathematics, volume 15, AMS}. 1963.

\bibitem[K62]{K62}
{Kuhn, H. W.} and {Tucker, A. W.}
\newblock Nonlinear programming.
\newblock In {\em Proc. $2^{nd}$ Berkeley Symposium on Mathematical Statistics
  and Probabilistics}, pages 481--492, Berkeley, 1951. University of California
  Press.

\bibitem[K22]{K22}
{Kundur, P.}, {Rogers, G. J.}, {Wong, D. Y.}, {Wang, L.}, and {Lauby, M. G.}
\newblock A comprehensive computer program package for small signal stability
  analysis of power systems.
\newblock {\em IEEE Trans. Power Systems}, PWRS-5:1076--1083, 1990.

\bibitem[K6]{K6}
{Kung, H. T.} and {Leiserson, C. E.}
\newblock Systolic arrays for {VLSI}.
\newblock In {Duff, I.} and {Stewart, G.}, editors, {\em Sparse Matrix
  Proceedings 1978}, pages 256--282. SIAM Publications, 1979.

\bibitem[K50]{K50}
{Kung, S.} and {Gal-Ezar, R.}
\newblock Linear or sparse array for eigenvalue and singular value
  decompositions~?
\newblock In {\em Proc. {USC} Workshop on {VLSI} and Modern Signal Processing},
  pages 89--98, Los Angeles, 1982.

\bibitem[K51]{K51}
{Kung, S.}, {Gal-Ezar, R.}, {Arun, K.}, and {Bhaskarrao, D.}
\newblock Wavefront array processor~: {Architecture}, language and application.
\newblock {\em IEEE Trans. Comput}, C-31:1054--1066, 1982.

\bibitem[K55]{K55}
{Kunkel, S. R.} and {Smith, J. E.}
\newblock Optimal pipelining in supercomputers.
\newblock In {\em Proc. $13^{th}$ Symposium on Computer Architecture}, pages
  404--414, Tokyo, 1986.

\bibitem[K84]{K84}
{Kuntzmann, J.}
\newblock {\em M\'ethodes Num\'eriques~: {Interpolation}, D\'eriv\'ees}.
\newblock Dunod, 1959.

\bibitem[K70]{K70}
{Kuo, F. F.}
\newblock Network analysis by digital computer.
\newblock {\em Proc. IEEE}, 54:820--829, 1966.

\bibitem[K71]{K71}
{Kuo, F. F.} and {Kaiser, J. F.}, editors.
\newblock {\em System Analysis by Digital Computer}.
\newblock John Wiley \& Sons, 1966.

\bibitem[K92]{K92}
{Kuo, F. F.} and {Magnuson, W. G.}, editors.
\newblock {\em Computer Oriented Circuit Design}.
\newblock Prentice Hall, 1969.

\bibitem[K29]{K29}
{Kwong, S. W.} and {Wood, D.}
\newblock {\em Proc. $4^{th}$ International Symposium on Programming},
  volume~83 of {\em Lecture Notes in Computer Science}, chapter Concurrent
  Operations in Large Ordered Indexes, pages 208--221.
\newblock Springer-Verlag, 1980.

\bibitem[L105]{L105}
{Laflin, S.} and {Brefner, M. A.}
\newblock Algorithm 380~: {In-Situ} transposition of a rectangular matrix.
\newblock {\em Comm. ACM}, 13(5):324--326, 1970.

\bibitem[L118]{L118}
{Lagarias, J. C.}
\newblock The nonlinear geometry of linear programming -- {III}~: Projective
  {Legendre} transform coordinates and {Hilbert} geometry.
\newblock {\em Trans. of the American Math. Soc.}, 320:193--225, 1990.

\bibitem[L124]{L124}
{Lagergren, J.}
\newblock Efficient parallel algorithms for tree-decomposition and related
  problems.
\newblock In {\em Proc. $31^{st}$ Annual Symposium on Foundations of Computer
  Science}, pages 173--182. IEEE, 1990.

\bibitem[L85]{L85}
{LAHEY}.
\newblock {F77L-EM/32} {FORTRAN-90} {Reference Manual}, {LAHEY} computer
  systems, inc.

\bibitem[L84]{L84}
{LAHEY}.
\newblock {F77L-EM/32} {FORTRAN} version 5.1 {Reference Manual}, {LAHEY}
  computer systems, inc.

\bibitem[L20]{L20}
{Lam, B.}
\newblock Methods for solving large sparse indefinite systems of linear
  equations.
\newblock {Tech. Report}~53, Australian National Univ., Computer Centre, 1976.

\bibitem[L94]{L94}
{Lam, M.}
\newblock Software pipelining~: {An} effective scheduling technique for {VLIW}
  machines.
\newblock In {\em SIGPLAN Conference on Programming Language Design and
  Implementation}, pages 318--328, Atlanta, 1988. ACM.

\bibitem[L87]{L87}
{Lamport, L.}
\newblock The parallel execution of {DO} loops.
\newblock {\em Comm. ACM}, 17:83--93, 1974.

\bibitem[L106]{L106}
{Lance, G. N.}
\newblock {\em Numerical Methods for High Speed Computers}.
\newblock Iliffe, London, 1960.

\bibitem[L60]{L60}
{Lanczos, C.}
\newblock An iteration method for the solution of the eigenvalue problem of
  linear differential and integral operators.
\newblock {\em J. Res. Nat. Bur. Standards}, 45:255--281, 1950.

\bibitem[L43]{L43}
{Lanczos, C.}
\newblock {\em Applied Analysis}.
\newblock Van Nostrand, Prentice-Hall, 1956.

\bibitem[L44]{L44}
{Lanczos, C.}
\newblock {\em Discourse on Fourier Series}.
\newblock Oliver and Boyd, 1966.

\bibitem[L45]{L45}
{Land, A. H.} and {Powell, S.}
\newblock {\em {FORTRAN} Codes for Mathematical Programming}.
\newblock John Wiley \& Sons, 1973.

\bibitem[L81]{L81}
{Larcombe, M. H. E.}
\newblock A list processing approach to the solution of large sparse sets of
  matrix equations and the factorization of the overall matrix.
\newblock In {Reid, J. K.}, editor, {\em Large Sparse Sets of Linear
  Equations}, pages 25--40. Academic Press, 1971.

\bibitem[L33]{L33}
{Larrazabal, M. R.}
\newblock Implementaci\'on eficiente de algoritmos de puntos interiores para
  programaci\'on lineal.
\newblock Master's thesis, Univ. Sim\'on Bol\'\i var, 1991.

\bibitem[L27]{L27}
{Lasdon, L. S.}
\newblock {\em Optimization Theory for Large Systems}.
\newblock Macmillan Publishing Co., 1970.

\bibitem[L100]{L100}
{Laski, J. G.}
\newblock Segmentation and virtual address topology~: {An} essay in virtual
  research.
\newblock {\em Computing J.}, 11:35--40, 1968.

\bibitem[L82]{L82}
{Law, K. H.} and {Fenves, S. J.}
\newblock Sparse matrices, graph theory and reanalysis.
\newblock In {\em Proc. $1^{st}$ International Conference on Computing in Civil
  Engineering}, pages 234--249. {ASCE}, 1981.

\bibitem[L19]{L19}
{Law, K. H.} and {Fenves, S. J.}
\newblock A node-addition model for symbolic factorization.
\newblock {\em ACM Trans. Math. Software}, 12(1):37--50, 1986.

\bibitem[L71]{L71}
{Lawler, E. L.}, editor.
\newblock {\em Combinatorial Optimization~: Networks and Matroids}.
\newblock Rinehart and Winston, New York, 1976.

\bibitem[L42]{L42}
{Lawler, E. L.}, {Lenstra, J. K.}, {Rinnooy Kan, A. H. G.}, and {Shimoys, D.
  B.}, editors.
\newblock {\em The Traveling Salesman Problem~: A Guided Tour of Combinatorial
  Optimization}.
\newblock John Wiley \& Sons, 1985.

\bibitem[L26]{L26}
{Lawson, C. L.} and {Hanson, R. J.}
\newblock {\em Solving Least Squares Problems}.
\newblock Prentice-Hall, 1974.
\newblock (Reedited by {SIAM Publications} na s\'erie {Classics in Applied
  Mathematics, volume 15, 1995}).

\bibitem[L36]{L36}
{Lawson, C. L.}, {Hanson, R. J.}, {Kincaid, D. R.}, and {Krogh, F. T.}
\newblock Algorithm 539~: {B}asic {L}inear {A}lgebra {S}ubprograms for
  {FORTRAN} usage.
\newblock {\em ACM Trans. Math. Software}, 5(3):324--325, 1979.

\bibitem[L35]{L35}
{Lawson, C. L.}, {Hanson, R. J.}, {Kincaid, D. R.}, and {Krogh, F. T.}
\newblock {B}asic {L}inear {A}lgebra {S}ubprograms for {FORTRAN} usage.
\newblock {\em ACM Trans. Math. Software}, 5(3):308--323, 1979.

\bibitem[L63]{L63}
{Leavenworth, B.}
\newblock Control structures in programming languages~: {The} {GOTO}
  controversy.
\newblock {\em SIGPLAN Notices}, 7(11):53--91, 1972.

\bibitem[L107]{L107}
{Ledet, W. P.} and {Himmelblau, D. M.}
\newblock Decomposition procedures for the solving of large scale systems.
\newblock {\em Advances Chem. Eng.}, 8:185--254, 1970.

\bibitem[L62]{L62}
{Ledgard, H. F.} and {Marcotty, M.}
\newblock A genealogy of control structures.
\newblock {\em Comm. ACM}, 18(11):629--639, 1975.

\bibitem[L109]{L109}
{Lee, H.}
\newblock An implementation of {Gaussian} elimination for sparse systems of
  linear equations.
\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[L24]{L24}
{Leighton, F. T.}
\newblock {\em Introduction to Parallel Architectures~: Arrays, Trees,
  Hypercubes}.
\newblock Morgan Kaufmann Publishers, 1992.

\bibitem[L73]{L73}
{Leiserson, C.} and {Lewis, J. G.}
\newblock Orderings for parallel sparse symmetric factorization.
\newblock In {Rodrigue, G.}, editor, {\em Parallel Processing for Scientific
  Computing}, pages 27--32. SIAM Publications, 1989.

\bibitem[L95]{L95}
{Lemar\'echal, C.}
\newblock Nondifferentiable 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~7, pages 529--572. North-Holland, 1989.

\bibitem[L48]{L48}
{Lemke, C. E.}
\newblock The dual method of solving the linear programming problem.
\newblock {\em Naval Res. Logistics Quart.}, 1:36--47, 1954.

\bibitem[L101]{L101}
{Leontief, W. W.}
\newblock {\em Input-Output Economics}.
\newblock Oxford University Press, New York, 1966.

\bibitem[L74]{L74}
{Leuze, M.}
\newblock Independent set orderings for parallel matrix factorization by
  {Gaussian} elimination.
\newblock {\em Parallel Computing}, 10:177--191, 1989.

\bibitem[L68]{L68}
{Levenberg, K.}
\newblock A method for the solution of certain problems in least-squares.
\newblock {\em Quart. J. of Appl. Math.}, 12:164--168, 1944.

\bibitem[L86]{L86}
{Levesque, J.} and {Williamson, J.}
\newblock {\em A Guidebook to {FORTRAN} on Supercomputers}.
\newblock Academic Press, 1989.

\bibitem[L119]{L119}
{Levi-Civita, T.}
\newblock {\em The Absolute Differential Calculus~: Calculus of Tensors}.
\newblock Dover Publications, 1926.

\bibitem[L88]{L88}
{Levine, J. L.}
\newblock Symbolic expansion of algebraic expressions.
\newblock {\em Comm. ACM}, 13(3):191--192, 1970.

\bibitem[L122]{L122}
{Levkovitz, R.}, {Andersen, J. A.}, and {Mitra, G.}
\newblock The interior point method for {LP} on parallel computers.
\newblock In {Kall, P.}, editor, {\em System Modelling and Optimization, Proc.
  $15^{th}$ {IFIP} Conference, Univ. Zurich, 1991, Volume 180 of Lecture Notes
  in Control and Information Sciences}, pages 241--250. Springer Verlag, 1992.

\bibitem[L115]{L115}
{Levy, H. M.} and {Eckhouse, R. H. Jr.}
\newblock {\em Computer Programming and Architecture~: {The} {VAX}}.
\newblock Digital Press, Bedford, $2^{nd}$ edition, 1989.

\bibitem[L116]{L116}
{Levy, J. V.}
\newblock Buses~: {The} skeleton of computer architectures.
\newblock In {Bell, C. G.}, {Mudge, J. C.}, and {McNamara, J. E.}, editors,
  {\em Computer Engineering~: {A} {DEC} View of Hardware Systems Design}.
  Digital Press, Bedford, 1978.

\bibitem[L110]{L110}
{Levy, R.}
\newblock Restructuring of the structural stiffness matrix to improve
  computational efficiency.
\newblock {\em Jet Propulsion Lab. Tech. Review}, 1:61--70, 1971.

\bibitem[L89]{L89}
{Lewis, J. G.}
\newblock Algorithms for sparse matrix eigenvalue problems.
\newblock {Tech. Report} STAN-CS-77-595, Dept. of Computer Science, Stanford
  Univ., 1977.

\bibitem[L114]{L114}
{Lewis, J. G.}
\newblock Implementation of the {Gibbs-Poole-Stockmeyer} and {Gibbs-King}
  algorithms.
\newblock {\em ACM Trans. Math. Software}, 8:180--189, 190--194, 1982.

\bibitem[L83]{L83}
{Lewis, J. G.}
\newblock Numerical experiments with {SPARSPAK}.
\newblock {\em ACM SIGNUM Newsletter}, 18(3):12--22, 1983.

\bibitem[L91]{L91}
{Lewis, J. G.}, editor.
\newblock {\em {Proc.} $5^{th}$ {SIAM} Conference on Applied Linear Algebra}.
  SIAM Publications, 1994.

\bibitem[L112]{L112}
{Lewis, J. G.} and {Grimes, R. G.}
\newblock Practical {Lanczos} algorithms for solving structural engineering
  eigenvalue problems.
\newblock In {Duff, I. S.}, editor, {\em Sparse Matrices and Their Uses}, pages
  349--355. Academic Press, 1981.

\bibitem[L70]{L70}
{Lewis, J. G.}, {Peyton, B. W.}, and {Pothen, A.}
\newblock A fast algorithm for reordering sparse matrices for parallel
  factorization.
\newblock {\em SIAM J. Sci. and Stat. Comput.}, 10:1156--1173, 1989.

\bibitem[L61]{L61}
{Lewis, J. G.} and {Poole, W. G. Jr.}
\newblock Ordering algorithms applied to sparse matrices in electric power
  problems.
\newblock In {Erisman, A. M.}, {Neves, K. W.}, and {Dwarakanath, M. H.},
  editors, {\em Electric Power Problems~: {The} Mathematical Challenge}, pages
  115--124. SIAM Publications, 1980.

\bibitem[L113]{L113}
{Lewis, J. G.} and {Simon, H. D.}
\newblock Numerical experience with the spectral transformation {Lanczos}
  method.
\newblock {Tech. Report} MM-TR-16, ETA Division, Boeing Computer Services,
  Seattle, Washington, 1984.

\bibitem[L21]{L21}
{Lewis, J. G.} and {Simon, H. D.}
\newblock The impact of hardware gather/scatter on sparse {Gaussian}
  elimination.
\newblock {\em SIAM J. Sci. and Stat. Comput.}, 9(2):304--311, 1988.

\bibitem[L22]{L22}
{Li, G.} and {Coleman, T. F.}
\newblock A parallel triangular solver for a hypercube multiprocessor.
\newblock {Tech. Report} 86-787, Dept. of Computer Science, Cornell Univ.,
  Ithaca, 1986.

\bibitem[L38]{L38}
{Li, G.} and {Coleman, T. F.}
\newblock A parallel triangular solver for a distributed-memory multiprocessor.
\newblock {\em SIAM J. Sci and Stat. Comp.}, 9:485--502, 1988.

\bibitem[L39]{L39}
{Li, G.} and {Coleman, T. F.}
\newblock A new method for solving triangular systems on distributed-memory
  message-passing multiprocessor.
\newblock {\em SIAM J. Sci and Stat. Comp.}, 10:382--396, 1989.

\bibitem[L103]{L103}
{Liebl, P.} and {Sedlacek, J.}
\newblock Transformation of square matrices into quasi-triangular form by means
  of graph theory.
\newblock {\em Apl. Mat.}, 11:1--9, 1966.

\bibitem[L65]{L65}
{Lima, L. T. G.}
\newblock Estudo comparativo dos m\'etodos iterativos de c\'alculo de
  autovalores aplicado ao problema da estabilidade a pequenas perturba\c c\~oes
  de sistemas el\'etricos de pot\^encia.
\newblock Master's thesis, COPPE/UFRJ, 1991.

\bibitem[L64]{L64}
{Lima, L. T. G.}, {Bezerra, L. H.}, {Tomei, C.}, and {Martins, N.}
\newblock New methods for fast small-signal stability assessment of large scale
  power systems.
\newblock Technical report, Centro de Pesquisas em Energia El\'etrica (CEPEL),
  Rio de Janeiro, 1995.
\newblock (Accepted for presentation at 1995 {IEEE} {Winter Power Meeting}).

\bibitem[L23]{L23}
{Lima, L. T. G.}, {Martins, N.}, and {Pinto, H. J. C. P.}
\newblock Mixed real/complex factorization.
\newblock {Paper} 92-WM-288-1-PWRS, Centro de Pesquisas em Energia El\'etrica
  (CEPEL), Rio de Janeiro, 1992.
\newblock (Presented at {IEEE} {Winter Power Meeting}).

\bibitem[L66]{L66}
{Lin, S.} and {van Ness, J. E.}
\newblock Parallel solution of sparse algebraic equations.
\newblock In {\em Power Industry Computer Applications ({PICA})}, pages
  380--386, Phoenix, 1993.

\bibitem[L69]{L69}
{Lin, Y.} and {Pang, J.}
\newblock Iterative methods for large convex quadratic programs~: {A} survey.
\newblock {\em SIAM J. Control and Optim.}, 25:383--411, 1987.

\bibitem[L97]{L97}
{Liniger, W. M.}
\newblock A criterion for {A}-stability of linear multistep integration
  formulae.
\newblock {\em Computing}, 3:280--285, 1968.

\bibitem[L96]{L96}
{Liniger, W. M.} and {Willoughby, R. A.}
\newblock Efficient numerical integration of stiff systems of differential
  equations.
\newblock {\em SIAM J. Numer. Anal.}, 7:47--66, 1970.
\newblock ({Originally in Tech. Report RC-1970, IBM Research Center, Yorktown
  Heights, New York, 1967}).

\bibitem[L111]{L111}
{Lions, J.}
\newblock Some results concerning the reduction of binary matrices.
\newblock {\em J. ACM}, 18:424--430, 1971.

\bibitem[L102]{L102}
{Lipson, J. D.}
\newblock Symbolic methods for the computer solution of linear equations with
  applications to flowgraphs.
\newblock In {Tobey, R. G.}, editor, {\em Proc. 1968 Summer Institute on
  Symbolic Mathematical Computation, IBM Boston Programming Center}, pages
  233--300. Cambridge, Massachusetts, 1968.

\bibitem[L117]{L117}
{Liptay, J. S.}
\newblock Structural aspects of the {System/360} {Model 85} -- {II}:~ {The}
  cache.
\newblock {\em IBM Systems Journal}, 7(1):15--21, 1968.

\bibitem[L37]{L37}
{Lipton, R. J.}, {Rose, D. J.}, and {Tarjan, R. E.}
\newblock Generalized nested dissection.
\newblock {\em SIAM J. Numer. Anal.}, 16:346--358, 1979.

\bibitem[L76]{L76}
{Lipton, R. J.} and {Tarjan, R. E.}
\newblock A separator theorem for planar graphs.
\newblock {\em SIAM J. Appl. Math.}, 36:177--199, 1979.

\bibitem[L104]{L104}
{Little, J. D. C.}, {Murty, K. G.}, {Sweeney, D. W.}, and {Karel, C.}
\newblock An algorithm for the traveling salesman problem.
\newblock {\em Operations Res.}, 11:972--989, 1963.

\bibitem[L80]{L80}
{Liu, J. W. H.}
\newblock On reducing the profile of sparse symmetric matrices.
\newblock {Tech. Report} CS-76-07, Dept. of Computer Science, Univ. of
  Waterloo, Canada, 1976.

\bibitem[L5]{L5}
{Liu, J. W. H.}
\newblock Modification of the minimum-degree algorithm by multiple elimination.
\newblock {\em ACM Trans. Math. Software}, 11(2):141--153, 1985.

\bibitem[L10]{L10}
{Liu, J. W. H.}
\newblock A compact row storage scheme for {Cholesky} factors using elimination
  trees.
\newblock {\em ACM Trans. Math. Software}, 12(2):127--148, 1986.

\bibitem[L2]{L2}
{Liu, J. W. H.}
\newblock Computational models and task scheduling for parallel sparse
  {Cholesky} factorization.
\newblock {\em Parallel Computing}, 3:327--342, 1986.

\bibitem[L14]{L14}
{Liu, J. W. H.}
\newblock On the storage required in the out-of-core multifrontal method for
  sparse factorization.
\newblock {\em ACM Trans. Math. Software}, 12(3):249--264, 1986.

\bibitem[L13]{L13}
{Liu, J. W. H.}
\newblock An adaptive general sparse out-of-core {Cholesky} factorization
  scheme.
\newblock {\em SIAM J. Sci. and Stat. Comput.}, 8(4):585--599, 1987.

\bibitem[L58]{L58}
{Liu, J. W. H.}
\newblock A collection of routines for an implementation of the multifrontal
  method.
\newblock {Tech. Report} CS-87-10, Dept. of Computer Science, York Univ., North
  York, Ontario, 1987.

\bibitem[L1]{L1}
{Liu, J. W. H.}
\newblock A note on sparse factorization in a paging environment.
\newblock {\em SIAM J. Sci. and Stat. Comput.}, 8(6):1085--1888, 1987.

\bibitem[L16]{L16}
{Liu, J. W. H.}
\newblock On threshold pivoting in the multifrontal method for sparse
  indefinite systems.
\newblock {\em ACM Trans. Math. Software}, 13(3):250--261, 1987.

\bibitem[L15]{L15}
{Liu, J. W. H.}
\newblock A partial pivoting strategy for sparse symmetric matrix
  decomposition.
\newblock {\em ACM Trans. Math. Software}, 13(2):173--182, 1987.

\bibitem[L12]{L12}
{Liu, J. W. H.}
\newblock Equivalent sparse matrix reordering by elimination tree rotations.
\newblock {\em SIAM J. Sci and. Stat. Comput.}, 9(3):424--444, 1988.

\bibitem[L7]{L7}
{Liu, J. W. H.}
\newblock A graph partitioning algorithm by node separators.
\newblock {\em ACM Trans. Math. Software}, 15(3):198--219, 1989.

\bibitem[L6]{L6}
{Liu, J. W. H.}
\newblock The minimum degree ordering with constraints.
\newblock {\em SIAM J. Sci. and Stat. Comput.}, 10(6):1136--1145, 1989.

\bibitem[L8]{L8}
{Liu, J. W. H.}
\newblock The multifrontal method and paging in sparse {Cholesky}
  factorization.
\newblock {\em ACM Trans. Math. Software}, 15(4):310--325, 1989.

\bibitem[L3]{L3}
{Liu, J. W. H.}
\newblock Reordering sparse matrices for parallel elimination.
\newblock {\em Parallel Comput.}, 11:73--91, 1989.

\bibitem[L59]{L59}
{Liu, J. W. H.}
\newblock The multifrontal method for sparse matrix solution~: {Theory} and
  practice.
\newblock {Tech. Report} CS-90-04, Dept. of Computer Science, York Univ., North
  York, Ontario, 1990.

\bibitem[L11]{L11}
{Liu, J. W. H.}
\newblock The role of elimination trees in sparse factorizations.
\newblock {\em SIAM J. Matrix Anal. and Appl.}, 11(1):134--172, 1990.

\bibitem[L9]{L9}
{Liu, J. W. H.}
\newblock A generalized envelope method for sparse factorization by rows.
\newblock {\em ACM Trans. Math. Software}, 17(1):112--129, 1991.

\bibitem[L4]{L4}
{Liu, J. W. H.}
\newblock The multifrontal method for sparse matrix solution~: {Theory} and
  practice.
\newblock {\em SIAM Review}, 34(1):82--109, 1992.

\bibitem[L17]{L17}
{Liu, J. W. H.} and {Mirzaian, A.}
\newblock A linear reordering algorithm for parallel pivoting of chordal
  graphs.
\newblock {\em SIAM J. Discr. Math.}, 2:100--107, 1989.

\bibitem[L18]{L18}
{Liu, J. W. H.} and {Ng, E.}
\newblock A supernodal symbolic {Cholesky} factorization on a local-memory
  multiprocessor.
\newblock ({In preparation}), 1990.

\bibitem[L40]{L40}
{Liu, J. W. H.}, {Ng, E.}, and {Peyton, B. W.}
\newblock On finding supernodes for sparse matrix computations.
\newblock {Tech. Report} ORNL-TM-11563, Oak Ridge National Laboratory, 1990.

\bibitem[L57]{L57}
{Liu, J. W. H.}, {Ng, E.}, and {Peyton, B. W.}
\newblock On finding supernodes for sparse matrix computations.
\newblock {\em SIAM J. Matrix Anal. and Appl.}, 14(1):242--252, 1993.

\bibitem[L79]{L79}
{Liu, J. W. H.} and {Sherman, A. H.}
\newblock Comparative analysis of the {Cuthill-McKee} and the reverse
  {Cuthill-McKee} ordering algorithms for sparse matrices.
\newblock {\em SIAM J. Numer. Anal.}, 13:198--213, 1975.

\bibitem[L99]{L99}
{Livesley, R. K.}
\newblock The analysis of large structural systems.
\newblock {\em Computing J.}, 3:34--39, 1960.

\bibitem[L28]{L28}
{Llewellyn, J.} and {Sharda, R.}
\newblock Linear programming software for personal computers~: 1990 {Survey}.
\newblock {\em OR/MS Today}, pages 35--47, October 1990.

\bibitem[L67]{L67}
{Lootsma, F. A.}
\newblock {\em Numerical Methods for Nonlinear Optimization}.
\newblock Academic Press, 1972.

\bibitem[L25]{L25}
{Lootsma, F. A.}
\newblock State of the art in parallel nonlinear optimization.
\newblock {\em Parallel Computing}, 6:133--156, 1988.

\bibitem[L41]{L41}
{Lorin, H.}
\newblock {\em Sorting and Sorting Systems}.
\newblock Addison-Wesley, 1975.

\bibitem[L29]{L29}
{Loute, E.} and {Vial, J. P.}
\newblock A parallelisable block {Cholesky} factorization for staircase linear
  programming problems.
\newblock {Tech. Report}, Faculte des Sciences Economiques et Sociales,
  Departement d'Economie Comerciale et Industrielle, Univ. de Geneve, 1992.

\bibitem[L93]{L93}
{Lov\'asz, L.}
\newblock {\em An Algorithmic Theory of Number, Graphs and Convexity}.
\newblock SIAM Publications, 1986.

\bibitem[L72]{L72}
{Lov\'asz, L.} and {Plummer, M. D.}, editors.
\newblock {\em Matching Theory}.
\newblock North-Holland, 1986.

\bibitem[L78]{L78}
{Lucas, R.}
\newblock {\em Solving Planar Systems of Equations on Distributed-Memory
  Multiprocessors}.
\newblock PhD thesis, Dept. of Electrical Eng., Stanford Univ., 1987.

\bibitem[L77]{L77}
{Lucas, R.}, {Blank, W.}, and {Tieman, J.}
\newblock A parallel solution method for large sparse systems of equations.
\newblock {\em IEEE Trans. Computer Aided Design}, CAD-6:981--991, 1987.

\bibitem[L98]{L98}
{Lueker, G. S.} and {Booth, K. S.}
\newblock Linear algorithms to recognize interval graphs and test for the
  consecutive ones property.
\newblock In {\em Proc. $7^{th}$ Annual {ACM} Symposium on Theory of
  Computing}, pages 255--265, 1975.

\bibitem[L120]{L120}
{Luenberger, D. G.}
\newblock The gradient projection method along geodesic.
\newblock {\em Management Science}, 18(11):620--631, 1972.

\bibitem[L47]{L47}
{Luenberger, D. G.}
\newblock {\em Introduction to Linear and Nonlinear Programming}.
\newblock Addison-Wesley, 1984.

\bibitem[L90]{L90}
{Luk, F. T.}
\newblock {\em Sparse and Parallel Matrix Computations}.
\newblock PhD thesis, Dept. of Computer Science, Stanford Univ., 1978.
\newblock ({Report STAN-CS-78-685}).

\bibitem[L46]{L46}
{Luke, Y.}
\newblock {\em Mathematical Functions and Their Approximations}.
\newblock Academic Press, 1975.

\bibitem[L108]{L108}
{Lum, V. Y.}, {Yuen, S. T.}, and {Dodd, M.}
\newblock Key-to-address transformation techniques~: {A} fundamental
  performance study on large existing formatted files.
\newblock {\em Comm. ACM}, 14:228--239, 1971.

\bibitem[L92]{L92}
{Lund, J.} and {Bowers, K. L.}
\newblock {\em Sinc Methods for Quadrature and Differential Equations}.
\newblock SIAM Publications, 1992.

\bibitem[L34]{L34}
{Lustig, I. J.}
\newblock An analysis of an available set of linear programming test problems.
\newblock {Tech. Report} SOL-87-11, Systems Optimization Laboratory, Dept. of
  Operations Research, Stanford Univ., 1987.
\newblock ({Reduced version in Comput. Oper. Res., 16(2):173--184, 1989}).

\bibitem[L49]{L49}
{Lustig, I. J.}
\newblock Feasibility issues in a primal-dual interior point method for linear
  programming.
\newblock {\em Math. Programming}, 49:145--162, 1990.

\bibitem[L30]{L30}
{Lustig, I. J.}
\newblock The influence of computer language on computational comparisons~:
  {An} example from network optimization.
\newblock {\em ORSA J. Computing}, 2(2):152--161, 1990.

\bibitem[L123]{L123}
{Lustig, I. J.} and {Li, G.}
\newblock An implementation of a parallel primal-dual interior point method for
  block structured linear programs.
\newblock {\em Computational Optimization and Applications}, 1:141--161, 1992.

\bibitem[L54]{L54}
{Lustig, I. J.}, {Marsten, R. E.}, and {Shanno, D. F.}
\newblock The primal-dual interior point method on the {CRAY} supercomputer.
\newblock In {Coleman, T. F.} and {Li, Y.}, editors, {\em Large-Scale Numerical
  Optimization}, pages 70--80. SIAM Publications, 1990.
\newblock (Presented at Cornell University Workshop, October 1989).

\bibitem[L50]{L50}
{Lustig, I. J.}, {Marsten, R. E.}, and {Shanno, D. F.}
\newblock Computational experience with a primal-dual interior point method for
  linear programming.
\newblock {\em Lin. Alg. Appl.}, 152:191--222, 1991.

\bibitem[L51]{L51}
{Lustig, I. J.}, {Marsten, R. E.}, and {Shanno, D. F.}
\newblock Interior point vs. simplex method~: {Beyond} {NETLIB}.
\newblock {\em COAL Newsletter}, 19:41--44, 1991.

\bibitem[L52]{L52}
{Lustig, I. J.}, {Marsten, R. E.}, and {Shanno, D. F.}
\newblock Computational experience with globally convergent primal-dual
  predictor-corrector algorithm for linear programming.
\newblock {Tech. Report} SOR-92-10, School of Eng. and Applied Science, Dept.
  of Civil Eng. and Oper. Research, Princeton Univ., 1992.

\bibitem[L53]{L53}
{Lustig, I. J.}, {Marsten, R. E.}, and {Shanno, D. F.}
\newblock The interaction of algorithms and architectures for interior point
  methods.
\newblock In {Pardalos, P. M.}, editor, {\em Advances in Optimization and
  Parallel Computing}, pages 190--205. North-Holland, 1992.

\bibitem[L55]{L55}
{Lustig, I. J.}, {Marsten, R. E.}, and {Shanno, D. F.}
\newblock On implementing {Mehrotra's} predictor-corrector interior point
  method for linear programming.
\newblock {\em SIAM J. Optimization}, 2:435--449, 1992.

\bibitem[L31]{L31}
{Lustig, I. J.}, {Marsten, R. E.}, and {Shanno, D. F.}
\newblock Interior point methods for linear programming~: {Computational} state
  of the art.
\newblock {\em ORSA J. Computing}, 6(1):1--14, 1994.

\bibitem[L32]{L32}
{Lustig, I. J.}, {Marsten, R. E.}, and {Shanno, D. F.}
\newblock The last word on interior point methods for linear programming~: {For
  Now}.
\newblock {\em ORSA J. Computing}, 6(1):35--36, 1994.

\bibitem[L56]{L56}
{Lustig, I. J.}, {Mulvey, J. M.}, and {Carpenter, T. J.}
\newblock Formulating stochastic programs for interior point methods.
\newblock {Tech. Report} SOR-89-16, School of Eng. and Applied Science, Dept.
  of Civil Eng. and Oper. Research, Princeton Univ., 1990.

\bibitem[L121]{L121}
{Lustig, I. J.} and {Rothberg, E.}
\newblock Gigaflops in linear programming.
\newblock {Tech. Report}, CPLEX Optimization, Inc., 1995.

\bibitem[M5]{M5}
{Machado, P. A.}, {Azevedo, G. P.}, and {Monticelli, A. J.}
\newblock A mixed pivoting approach to the factorization of indefinite matrices
  in power system state estimation.
\newblock {\em IEEE Trans. Power Systems}, PWRS-6(2):676--682, 1991.

\bibitem[M86]{M86}
{MacNeal, R. H.}
\newblock {\em {NASTRAN} ``{Theoretical Manual}''}.
\newblock NASA, 1970.
\newblock ({Contract NAS-5-10049, sect 11.3}).

\bibitem[M87]{M87}
{MacNeal, R. H.} and {McCormick, C. W.}
\newblock The {NASTRAN} computer program for structural analysis.
\newblock {\em Soc. Automotive Eng. Trans.}

\bibitem[M21]{M21}
{Maculan Filho, N.}
\newblock Programmation lin\'eaire en nombres entiers.
\newblock {Tech. Report} 486, D\'epartment D'Informatique et de Recherche
  Op\'erationnelle, Univ. de Montr\'eal, 1983.
\newblock ({First part}).

\bibitem[M20]{M20}
{Maculan Filho, N.}
\newblock The steiner problem in graphs.
\newblock {\em Annals of Discr. Math.}, 31:185--222, 1987.

\bibitem[M7]{M7}
{Maculan Filho, N.} and {Pereira, M. V. F.}
\newblock {\em Programa\c c\~ao Linear}.
\newblock Editora Atlas, 1980.

\bibitem[M103]{M103}
{MacVeigh, D. J.}
\newblock Effect of data representation on efficiency of sparse matrix
  operations.
\newblock Master's thesis, Dept. of Computer Science, North Carolina State
  Univ., Chapel Hill, 1975.

\bibitem[M112]{M112}
{Magenheimer, D. J.}, {Peters, L.}, {Pettis, K. W.}, and {Zuras, D.}
\newblock Integer multiplication and division on the {HP} {Precision
  Architecture}.
\newblock {\em IEEE Trans. Comput.}, C-37(8):980--990, 1988.

\bibitem[M17]{M17}
{Manber, U.}
\newblock {\em Introduction to Algorithms~: A Creative Approach}.
\newblock Addison-Wesley, 1989.

\bibitem[M28]{M28}
{Mandelbrot, B. B.}
\newblock {\em Fractals~: Form, Chance, and Dimension}.
\newblock Freeman \& Co., 1977.

\bibitem[M29]{M29}
{Mandelbrot, B. B.}
\newblock {\em The Fractal Geometry of Nature}.
\newblock Freeman \& Co., 1982.

\bibitem[M75]{M75}
{Mangasarian, O. L.}
\newblock {\em Nonlinear Programming}.
\newblock SIAM Publications, 1994.
\newblock ({First Edition, 1969}).

\bibitem[M9]{M9}
{Mangasarian, O. L.} and {Meyer, R. R.}, editors.
\newblock {\em Parallel Methods in Mathematical Programming}, volume 42(2) of
  {\em Math. Programming, Series~B}, pages 203--470.
\newblock North Holland, 1988.
\newblock ({Special Issue}).

\bibitem[M64]{M64}
{Manteuffel, T. A.}
\newblock Shifted incomplete {Cholesky} factorization.
\newblock In {Duff, I. S.} and {Stewart, G. W.}, editors, {\em Sparse Matrix
  Proceedings 1978}. SIAM Publications, 1979.

\bibitem[M111]{M111}
{Manteuffel, T. A.}
\newblock An incomplete factorization technique for positive definite linear
  systems.
\newblock {\em Math. of Computation}, 34:473--497, 1980.

\bibitem[M97]{M97}
{Marimont, R. B.}
\newblock A new method of checking the consistency of precedence matrices.
\newblock {\em J. ACM}, 6:164--171, 1959.

\bibitem[M106]{M106}
{Marimont, R. B.}
\newblock Application of graphs and boolean matrices to computer programming.
\newblock {\em SIAM Review}, 2:259--268, 1960.

\bibitem[M3]{M3}
{Markowitz, H. M.}
\newblock The elimination form of the inverse and its application to linear
  programming.
\newblock {\em Management Science}, 3(3):255--269, 1957.
\newblock ({Originally at The RAND Corporation, Research Memorandum RM-1452,
  1955}).

\bibitem[M55]{M55}
{Marquardt, D.}
\newblock An algorithm for least-squares estimation of nonlinear parameters.
\newblock {\em SIAM J. Appl. Math.}, 11:431--441, 1963.

\bibitem[M109]{M109}
{Marro, L.}
\newblock M\'ethodes de r\'eduction de la largeur de bande et du profil
  efficace des matrices creuses, 1980.
\newblock Th\`ese de 3\`eme cycle, Univ. de Nice.

\bibitem[M110]{M110}
{Marro, L.}
\newblock A linear time implementation of profile reduction algorithms for
  sparse matrices.
\newblock {\em SIAM J. Sci. and Stat. Comput.}, 7:1212--1231, 1986.

\bibitem[M96]{M96}
{Marshall, H. Jr.}
\newblock {\em The Theory of Groups}.
\newblock MacMillan, New York, 1959.

\bibitem[M39]{M39}
{Marsten, R. E.}
\newblock The design of the {XMP} linear programming library.
\newblock {\em ACM Trans. Math. Software}, 7:481--497, 1981.

\bibitem[M1]{M1}
{Marsten, R. E.}
\newblock {\em ``{User's Manual}'' for the Research Version of {OB1}}.
\newblock School of Ind. and Systems Eng., Georgia Institute of Technology,
  Atlanta, 1990.

\bibitem[M36]{M36}
{Marsten, R. E.}, {Saltzman, M. J.}, {Shanno, D. F.}, {Ballintijn, J. F.}, and
  {Pierce, G. S.}
\newblock Implementation of a dual affine interior point algorithm for linear
  programming.
\newblock {\em ORSA J. Computing}, 1:287--297, 1989.

\bibitem[M102]{M102}
{Martelli, A.} and {Montanari, U.}
\newblock An application of heuristically guided search to elimination
  processes.
\newblock In {\em Proc. International Computing Symposium}, pages 58--72,
  Venice, 1972. {CINI} Foundation.

\bibitem[M90]{M90}
{Martin, D.} and {Estrin, G.}
\newblock Models of computations and systems evaluation of vertex probabilities
  in graph models of computations.
\newblock {\em J. ACM}, 14:281--299, 1967.

\bibitem[M89]{M89}
{Martin, R. S.}, {Peters, G.}, and {Wilkinson, J. H.}
\newblock The {QR} algorithm for real {Hessenberg} matrices.
\newblock {\em Numer. Math.}, 14:219--231, 1970.

\bibitem[M100]{M100}
{Martin, R. S.} and {Wilkinson, J. H.}
\newblock Symmetric decomposition of positive definite band matrices.
\newblock {\em Numer. Math.}, 7:355--361, 1965.

\bibitem[M88]{M88}
{Martin, R. S.} and {Wilkinson, J. H.}
\newblock Similarity reduction of a general matrix to {Hessenberg} form.
\newblock {\em Numer. Math.}, 12:349--368, 1968.

\bibitem[M74]{M74}
{Martinez, J. M.}
\newblock An algorithm for solving sparse nonlinear least squares problems.
\newblock {\em Computing}, 39:307--325, 1987.

\bibitem[M48]{M48}
{Martins, N.}
\newblock Efficient eigenvalue and frequency response methods applied to power
  system small-signal stability studies.
\newblock {\em IEEE Trans. Power Systems}, PWRS-1(1):217--226, 1986.

\bibitem[M49]{M49}
{Martins, N.} and {Lima, L. T. G.}
\newblock Eigenvalue and frequency domain analysis of small-signal
  electromechanical stability problems.
\newblock {Paper} 90-TH-0292-3-PWR, Centro de Pesquisas em Energia El\'etrica
  (CEPEL), Rio de Janeiro, 1989.
\newblock (Presented at 1990 {IEEE Symposium on Application of Eigenanalysis
  and Frequency Domain Methods for System Dynamic Performance, pages 17--33}).

\bibitem[M50]{M50}
{Martins, N.} and {Lima, L. T. G.}
\newblock Determination of suitable locations for power system stabilizers and
  static {VA}r compensators for damping electromechanical oscillations.
\newblock {\em IEEE Trans. Power Systems}, PWRS-5:1455--1469, 1990.

\bibitem[M51]{M51}
{Martins, N.}, {Pinto, H. J. C. P.}, and {Lima, L. T. G.}
\newblock Efficient methods for finding transfer function zeros of power
  systems.
\newblock In {\em Proc. 1991 IEEE Power Industry Computer Application
  Conference}, pages 320--328, 1991.

\bibitem[M67]{M67}
{Mascarenhas, W.}
\newblock Predicting structure in eigenvector computation.
\newblock (To be published at {Lin. Alg. and Appl.}).

\bibitem[M80]{M80}
{MATHLAB} Group, Cambridge, Massachusetts.
\newblock {\em {MACSYMA} Reference Manual, Project {MAC}, {M.I.T.}}, 1974.

\bibitem[M65]{M65}
{MathWorks}.
\newblock {\em {Pro-MATLAB} ``{User's Guide}''}.
\newblock MathWorks, Inc., South Natick, 1990.

\bibitem[M91]{M91}
{Mattson, R. L.}, {Gecsei, J.}, {Slutz, D. R.}, and {Traiger, I. L.}
\newblock Evaluation techniques for storage hierarchies.
\newblock {\em IBM Systems Journal}, 9:78--117, 1970.

\bibitem[M104]{M104}
{Maurer, W. D.}
\newblock An improved hash code for scatter storage.
\newblock {\em Comm. ACM}, 11:35--38, 1968.

\bibitem[M95]{M95}
{Maurer, W. D.}
\newblock {\em Programming, Introduction to Computer Languages and Techniques}.
\newblock Holden-Day, San Francisco, 1968.

\bibitem[M92]{M92}
{Mayoh, B. H.}
\newblock A graph technique for inverting certain matrices.
\newblock {\em Math. of Computation}, 19:644--646, 1965.

\bibitem[M24]{M24}
{McCalla, T. R.}
\newblock {\em Introduction to Numerical Methods and {FORTRAN} Programming}.
\newblock John Wiley \& Sons, 1967.

\bibitem[M23]{M23}
{McCormick, J. M.} and {Salvadori, M. G.}
\newblock {\em Numerical Methods in {FORTRAN}}.
\newblock Prentice-Hall, 1964.
\newblock (Published by {Editora Pol\'\i gono, 1971}).

\bibitem[M116]{M116}
{McCormick, S. F.}, editor.
\newblock {\em Multigrid Methods}.
\newblock SIAM Publications, 1987.

\bibitem[M123]{M123}
{McCormick, S. F.}, editor.
\newblock {\em Multilevel Adaptive Methods for Partial Differential Equations}.
\newblock SIAM Publications, 1989.

\bibitem[M68]{M68}
{McCormick, S. T.}
\newblock {\em A Combinatorial Approach to Some Sparse Matrix Problems}.
\newblock PhD thesis, Stanford Univ., 1983.

\bibitem[M15]{M15}
{McCormick, S. T.}
\newblock Making sparse matrices sparser.
\newblock (To be published at {Math. Programming}), 1990.

\bibitem[M14]{M14}
{McCormick, S. T.} and {Chang, S. F.}
\newblock Making ${AA}^{T}$ sparser for interior point algorithms~:
  {Complexity} and heuristics.
\newblock ({In preparation}), 1990.

\bibitem[M22]{M22}
{McCracken, D. D.}
\newblock {\em A Guide to {FORTRAN} {IV} Programming}.
\newblock John Wiley \& Sons, $2^{nd}$ edition, 1972.

\bibitem[M113]{M113}
{McFarling, S.}
\newblock Program optimization for instruction caches.
\newblock In {\em Proc. $3^{rd}$ International Conference on Architectural
  Support for Programming Languages and Operating Systems}, Boston, 1989.

\bibitem[M77]{M77}
{McFarling, S.} and {Hennessy, J.}
\newblock Reducing the cost of branches.
\newblock In {\em Proc. $13^{th}$ Symposium on Computer Architecture}, pages
  396--307, Tokyo, 1986.

\bibitem[M94]{M94}
{McKeeman, W. M.}
\newblock {Crout} with equilibration and iteration.
\newblock {\em Comm. ACM}, 5:553--555, 1962.

\bibitem[M82]{M82}
{McKellar, A. C.} and {Coffman, E. G.}
\newblock Organizing matrices and matrix operations for a paged memory system.
\newblock {\em Comm. ACM}, 12:153--165, 1969.

\bibitem[M45]{M45}
{McNamee, J. M.}
\newblock A sparse matrix package -- part {I}.
\newblock {\em Comm. ACM}, 14(4):265--273, 1971.

\bibitem[M73]{M73}
{McNamee, J. M.}
\newblock A sparse matrix package -- part {II}~: {Special Cases}.
\newblock {\em ACM Trans. Math. Software}, 9(3):344--345, 1983.

\bibitem[M37]{M37}
{McShane, K. A.}, {Monma, C. L.}, and {Shanno, D. F.}
\newblock Implementation of a primal-dual interior point method for linear
  programming.
\newblock {\em ORSA J. Computing}, 1:70--83, 1989.

\bibitem[M114]{M114}
{Mead, C.} and {Conway, L.}, editors.
\newblock {\em Introduction to {VLSI} Systems}.
\newblock Addison-Wesley, 1980.

\bibitem[M63]{M63}
{Meeraus, A.}
\newblock {G}eneral {A}lgebraic {M}odeling {S}ystem ({GAMS})~: ``{User's
  Guide}'', version 1.0, 1982.
\newblock Development Research Dept., World Bank.

\bibitem[M108]{M108}
{Megiddo, N.}
\newblock Pathways to the optimal set in linear programming.
\newblock In {Megiddo, N.}, editor, {\em Progress in Mathematical Programming~:
  Interior-Point and Related Methods}, pages 131--158. Springer-Verlag, 1989.

\bibitem[M12]{M12}
{Mehlhorn, K.}
\newblock {\em Data Structures and Algorithms, volume {2}~: {NP} Completeness
  and Graph Algorithms}.
\newblock {EATCS} Monographs on Theoretical Computer Science. Springer-Verlag,
  1984.
\newblock {Brauer, W.}, {Rozenberg, G.} and {Salomaa, A.}, editors.

\bibitem[M18]{M18}
{Mehlhorn, K.}
\newblock {\em Data Structures and Algorithms, volume {3}~: Multi-Dimensional
  Searching and Computational Geometry}.
\newblock {EATCS} Monographs on Theoretical Computer Science. Springer-Verlag,
  1984.
\newblock {Brauer, W.}, {Rozenberg, G.} and {Salomaa, A.}, editors.

\bibitem[M42]{M42}
{Mehrotra, S.}
\newblock Implementation of affine scaling methods~: {Approximate} solutions of
  systems of linear equations using preconditioned conjugate gradient methods.
\newblock {\em ORSA J. Computing}, 4:103--118, 1992.

\bibitem[M38]{M38}
{Mehrotra, S.}
\newblock On the implementation of a primal-dual interior point method.
\newblock {\em SIAM J. Optimization}, 2(4):575--601, 1992.

\bibitem[M69]{M69}
{Melhem, R.}
\newblock Parallel solution of linear systems with striped sparse matrices.
\newblock {\em Parallel Computing}, 6:165--184, 1988.

\bibitem[M11]{M11}
{Mesirov, J. P.}, editor.
\newblock {\em Very Large Scale Computation in the $21^{th}$ Century}.
\newblock SIAM Publications, 1991.

\bibitem[M10]{M10}
{Messina, P. C.} and {Sterling, T. A.}, editors.
\newblock {\em System Software and Tools for High Performance Computing
  Environments}.
\newblock SIAM Publications, 1993.

\bibitem[M76]{M76}
{Messina, P. C.}, {Sterling, T. A.}, and {Smith, P. H.}
\newblock {\em Enabling Technologies for PetaFlops Computing}.
\newblock MIT Press, 1995.

\bibitem[M115]{M115}
{Metacalfe, R. M.} and {Boggs, D. R.}
\newblock {ETHERNET}~: {Distributed} packet switching for local computer
  networks.
\newblock {\em Comm. ACM}, 19(7):395--404, 1976.

\bibitem[M71]{M71}
{METAWARE}.
\newblock {High} ${C}$/${C}^{++}$ ``{User's Guide}''.

\bibitem[M47]{M47}
{Metcalf, M.}
\newblock {\em {FORTRAN} Optimization}.
\newblock Academic Press, 1982.

\bibitem[M53]{M53}
{Meurant, G.}
\newblock The evolution of scientific computing on parallel computers.
\newblock {Presented at I Escola de Computa\c c\~ao Cient\'\i fica de Alto
  Desempenho, LNCC, Rio de Janeiro}, 1992.

\bibitem[M44]{M44}
{Meyer, W. S.} and {Albertson, V. D.}
\newblock Improved loss formula computation by optimally ordered elimination
  techniques.
\newblock {\em IEEE Trans. Power Apparatus and Systems}, PAS-90(1):62--69,
  1971.

\bibitem[M33]{M33}
{Meyer, Y.}
\newblock {\em Wavelets~: Algorithms \& Applications}.
\newblock SIAM Publications, 1993.

\bibitem[M117]{M117}
{Meyers, G. J.}
\newblock The evaluation of expressions in a storage-to-storage architecture.
\newblock {\em Computer Architecture News}, 7(3):20--23, 1978.

\bibitem[M118]{M118}
{Meyers, G. J.}
\newblock {\em Advances in Computer Architecture}.
\newblock John Wiley \& Sons, $2^{nd}$ edition, 1982.

\bibitem[M54]{M54}
{Miller, E. R.}, {Pippenger, N.}, {Rosemberg, A. L.}, and {Snyder, L.}
\newblock Optimal 2-3 trees.
\newblock {\em SIAM J. Comput.}, 8(1):42--59, 1979.

\bibitem[M107]{M107}
{Miller, J. J. H.}
\newblock Topics in numerical analysis -- {II}.
\newblock In {\em Proc. Royal Irish Academy Conference on Numerical Analysis,
  London, 1974}. Academic Press, 1975.

\bibitem[M25]{M25}
{Milne, W. E.}
\newblock {\em Numerical Calculus}.
\newblock Princeton University Press, 1949.

\bibitem[M26]{M26}
{Milne, W. E.}
\newblock {\em Numerical Solutions of Differential Equations}.
\newblock John Wiley \& Sons, 1953.

\bibitem[M66]{M66}
{Minieka, E.}
\newblock {\em Optimization Algorithms for Networks and Graphs}.
\newblock Marcel Dekker, New York, 1978.

\bibitem[M8]{M8}
{Minoux, M.}
\newblock {\em Mathematical Programming, Theory and Algorithms}.
\newblock John Wiley \& Sons, 1986.

\bibitem[M93]{M93}
{Minty, G. J.}
\newblock On the axiomatic foundations of the theories of directed linear
  graphs, electrical networks and network-programming.
\newblock {\em J. Math. Mech.}, 15:485--520, 1966.

\bibitem[M81]{M81}
{Miranker, W. L.}
\newblock A survey of parallelism in numerical analysis.
\newblock {\em SIAM Review}, 13:524--547, 1971.

\bibitem[M41]{M41}
{Mitchell, J. E.} and {Todd, M. J.}
\newblock Solving combinatorial optimization problems using {Karmarkar's}
  algorithm.
\newblock {\em Math. Programming}, 56:245--284, 1992.

\bibitem[M84]{M84}
{Moler, C. B.}
\newblock Iterative refinement in floating point.
\newblock {\em J. ACM}, 14:316--321, 1967.

\bibitem[M83]{M83}
{Moler, C. B.}
\newblock State of the art in matrix computations.
\newblock {\em SIGNUM Newsletter}, 4(1):22--28, 1969.

\bibitem[M4]{M4}
{Moler, C. B.}
\newblock Matrix computations with {FORTRAN} and paging.
\newblock {\em Comm. ACM}, 15:268--272, 1972.

\bibitem[M16]{M16}
{Moler, C. B.}
\newblock Matrix computation on distributed memory multiprocessor.
\newblock In {Heath, M. T.}, editor, {\em Hypercube Multiprocessors 1986},
  pages 181--195. SIAM Publications, 1986.

\bibitem[M72]{M72}
{Moler, C. B.}
\newblock A closer look at {Amdahl's} law.
\newblock {Tech. Report} TN-02-687, INTEL, 1987.

\bibitem[M52]{M52}
{Moon, J. W.} and {Moser, L.}
\newblock On cliques in graphs.
\newblock {\em Israel J. Math.}, 3:23--28, 1965.

\bibitem[M119]{M119}
{Moore, B.}, {Padegs, A.}, {Smith, R.}, and {Bucholz, W.}
\newblock Concepts of the {System/370} vector architecture.
\newblock In {\em Proc. $14^{th}$ Symposium on Computer Architecture}, pages
  282--292, Pittsburgh, 1987. ACM/IEEE.

\bibitem[M57]{M57}
{Mor\'e, J.} and {Sorensen, D.}
\newblock Computing a trust region step.
\newblock {\em SIAM J. Sci. and Stat. Comput.}, 4(3):553--572, 1983.

\bibitem[M56]{M56}
{Mor\'e, J. J.}
\newblock Recent developments in algorithms and software for trust region
  methods.
\newblock In {Bachem, A.}, {Gr{\"o}tschel, M.}, and {Korte, B.}, editors, {\em
  Mathematical Programming~: {The} State of the Art, Bonn 1982}.
  Springer-Verlag, 1983.

\bibitem[M59]{M59}
{Mor\'e, J. J.}
\newblock Trust regions and projected gradients.
\newblock {Tech. Report} ANL-MCS-TM-107, Argonne National Laboratory, Argonne,
  Illinois, 1988.

\bibitem[M30]{M30}
{Mor\'e, J. J.}, {Garbow, B.}, and {Hillstrom, K. E.}
\newblock ``{User's Guide}'' to {MINPACK-1}.
\newblock {Tech. Report} ANL-80-74, Argonne National Laboratory, Illinois,
  1980.

\bibitem[M58]{M58}
{Mor\'e, J. J.} and {Sorensen, D.}
\newblock {Newton's} method.
\newblock In {Golub, G. H.}, editor, {\em Studies in Numerical Analysis, MAA
  Studies in Mathematics}, volume~24. The Mathematical Association of America,
  1984.

\bibitem[M61]{M61}
{Mor\'e, J. J.} and {Toraldo, G.}
\newblock Algorithms for bound constrained quadratic programming problems.
\newblock {\em Numer. Math.}, 55:377--400, 1989.

\bibitem[M60]{M60}
{Mor\'e, J. J.} and {Toraldo, G.}
\newblock On the solution of large quadratic programming problems with bound
  constraints.
\newblock {Tech. Report} ANL-MCS-P-77-0589, Argonne National Laboratory,
  Argonne, Illinois, 1989.

\bibitem[M6]{M6}
{Mor\'e, J. J.} and {Wright, S. J.}
\newblock {\em Optimization Software Guide}.
\newblock SIAM Publications, 1993.

\bibitem[M2]{M2}
{Morozowski Filho, M.}
\newblock {\em Matrizes Esparsas em Redes de Pot\^encia}.
\newblock LTC/FEESC, Rio de Janeiro, 1981.

\bibitem[M46]{M46}
{Morris, R.}
\newblock Scatter storage techniques.
\newblock {\em Comm. ACM}, 11(1):38--44, 1968.

\bibitem[M105]{M105}
{Morrison, J. E.}
\newblock User program performance in virtual storage systems.
\newblock {\em IBM Systems Journal}, 12:216--237, 1973.

\bibitem[M120]{M120}
{Morse, S.}, {Ravenal, B.}, {Mazor, S.}, and {Pohlman, W.}
\newblock {INTEL} microprocessors~: 8008 to 8086.
\newblock {\em Computer}, 13(10), 1980.

\bibitem[M31]{M31}
{Moses, J.}
\newblock Symbolic integration~: {The} stormy decade.
\newblock {\em Comm. ACM}, 14:548--560, 1971.

\bibitem[M121]{M121}
{MOTOROLA}.
\newblock {\em {MC88100} {RISC} Microprocessor ``{User's Manual}''}, 1988.

\bibitem[M122]{M122}
{Muchnick, S. S.}
\newblock Optimizing compilers for {SPARC}.
\newblock {\em SUN Technology}, 1(3):64--77, 1988.

\bibitem[M85]{M85}
{Muller, D. E.}
\newblock A method for solving algebraic equations using an automatic computer.
\newblock {\em Math. Tables Aids Comput.}, 10:208--215, 1956.

\bibitem[M43]{M43}
{Mulvey, J. M.} and {Ruszczynski, A.}
\newblock A diagonal quadratic approximation method for large scale linear
  programs.
\newblock {Tech. Report} SOR-90-08, School of Eng. and Applied Science, Dept.
  of Civil Eng. and Oper. Research, Princeton Univ., 1990.

\bibitem[M101]{M101}
{Munkres, J.}
\newblock Algorithms for the assignment and transportation problems.
\newblock {\em SIAM J. Appl. Math.}, 5:32--38, 1957.

\bibitem[M70]{M70}
{Munksgaard, N.}
\newblock {FORTRAN} subroutines for direct solution of sets of sparse and
  symmetric linear equations.
\newblock {Tech. Report} 77-05, Numerical Institute Lyngby, Denmark, 1977.

\bibitem[M35]{M35}
{Munksgaard, N.}
\newblock Solving sparse symmetric sets of linear equations by preconditioned
  conjugate gradients.
\newblock {\em ACM Trans. Math. Software}, 6(2):206--219, 1980.

\bibitem[M98]{M98}
{Munro, I.}
\newblock Efficient determination of the transitive closure of a directed
  graph.
\newblock {\em Information Processing Letters}, 1:56--58, 1971.

\bibitem[M99]{M99}
{Munro, I.}
\newblock {\em Some Results in the Study of Algorithms}.
\newblock PhD thesis, Dept. of Computer Science, Univ. Toronto, Ontario, 1971.

\bibitem[M27]{M27}
{Murray, W.}
\newblock {\em Numerical Methods for Unconstrained Optimization}.
\newblock Academic Press, 1972.

\bibitem[M34]{M34}
{Murray, W.}
\newblock Methods for linear programming.
\newblock (Talk presented at {{NATO} Advanced Workshop on Algorithms and Model
  Formulations in Mathematical Programming, Bergen, Norway}), 1987.

\bibitem[M40]{M40}
{Murtagh, B. A.}
\newblock {\em Advanced Linear Programming}.
\newblock McGraw-Hill, 1981.

\bibitem[M32]{M32}
{Murtagh, B. A.} and {Saunders, M. A.}
\newblock Large-scale linearly constrained optimization.
\newblock {\em Math. Programming}, 14:41--72, 1978.

\bibitem[M62]{M62}
{Murtagh, B. A.} and {Saunders, M. A.}
\newblock A projected {Lagrangian} algorithm and its implementation for sparse
  nonlinear constraints.
\newblock {\em Math. Programming Study}, 16:84--117, 1982.

\bibitem[M13]{M13}
{Murtagh, B. A.} and {Saunders, M. A.}
\newblock {MINOS 5.1} ``{User's Guide}''.
\newblock {Tech. Report} SOL-83-20, Systems Optimization Laboratory, Dept. of
  Operations Research, Stanford Univ., 1987.

\bibitem[M19]{M19}
{Murty, K. G.}
\newblock {\em Linear and Combinatorial Programming}.
\newblock John Wiley \& Sons, 1976.

\bibitem[M79]{M79}
{Murty, K. G.}
\newblock Computational complexity of parametric linear programming.
\newblock {\em Math. Programming}, 19:213--219, 1980.

\bibitem[M78]{M78}
{Murty, K. G.}
\newblock {\em Linear Programming}.
\newblock John Wiley \& Sons, 1983.

\bibitem[N18]{N18}
{NAG}.
\newblock {\em {FORTRAN} Library Manual}.
\newblock Oxford, 1980.
\newblock ({Mark 8}).

\bibitem[N17]{N17}
{NAG}.
\newblock {\em {FORTRAN} {PC50} Library Handbook}, 1983.
\newblock ({Release 1}).

\bibitem[N27]{N27}
{Nagel, E.} and {Newman, J. R.}
\newblock {\em {G\"odel's} Proof}.
\newblock New York Univ. Press, 1958.

\bibitem[N7]{N7}
{Nagel, L. W.}
\newblock {SPICE-2}~: {A} computer program to simulate semiconductor circuits.
\newblock {Memorandum} ERL-M520, Electronics Research Laboratory, Univ.
  Berkeley, 1975.

\bibitem[N28]{N28}
{Naik, V.} and {Patrick, M. L.}
\newblock Data traffic reduction schemes for sparse {Cholesky} factorization.
\newblock {Tech. Report} 88-14, Institute for Computer Applications in Science
  and Engineering ({ICASE}), {NASA} Langley Research Center, Hampton, 1988.

\bibitem[N29]{N29}
{Naik, V.} and {Patrick, M. L.}
\newblock Data traffic reduction schemes for {Cholesky} factorization on
  asynchronous multiprocessor systems.
\newblock {Tech. Report} 89-40, Institute for Computer Applications in Science
  and Engineering ({ICASE}), {NASA} Langley Research Center, Hampton, 1989.

\bibitem[N8]{N8}
{Nakajima, K.}
\newblock A graph theoretical approach to parallel triangulation of a sparse
  asymmetric matrix.
\newblock In {\em Proc. 1984 Conference on Information Science and Systems},
  1984.

\bibitem[N41]{N41}
{Nakhla, M.}, {Singhal, K.}, and {Vlach, J.}
\newblock An optimal pivoting order for the solution of sparse systems of
  equations.
\newblock {\em IEEE Trans. Circuits and Systems}, CAS-21:222--225, 1974.

\bibitem[N12]{N12}
{Naor, J.}, {Naor, M.}, and {Schaffer, A. J.}
\newblock Fast parallel algorithms for chordal graphs.
\newblock {\em SIAM J. Comput.}, 18:327--349, 1989.

\bibitem[N19]{N19}
{Nash, S. G.} and {Sofer, A.}
\newblock A general purpose parallel algorithm for unconstrained optimization.
\newblock {\em SIAM J. Optimization}, 1(4):530--547, 1991.

\bibitem[N6]{N6}
{Natarajan, B. K.}
\newblock Sparse approximate solutions to linear systems.
\newblock {\em SIAM J. Comput.}, 24(2):227--234, 1995.

\bibitem[N36]{N36}
{Nathan, A.} and {Even, R. K.}
\newblock The inversion of sparse matrices by a strategy derived from their
  graphs.
\newblock {\em Computing J.}, 10:190--194, 1967.

\bibitem[N2]{N2}
{Natori, M.} and {Nodera, T.}, editors.
\newblock {\em Sparsity and Supercomputer~: {Advances} in Numerical Methods for
  Large Sparse Sets of Linear Equations 4}, 1988.

\bibitem[N3]{N3}
{Natori, M.} and {Nodera, T.}, editors.
\newblock {\em Parallel Processing for Scientific Computing~: {Advances} in
  Numerical Methods for Large Sparse Sets of Linear Equations 6}, 1990.

\bibitem[N4]{N4}
{Natori, M.} and {Nodera, T.}, editors.
\newblock {\em Parallel Processing for Scientific Computing~: {Advances} in
  Numerical Methods for Large Sparse Sets of Linear Equations 8}, 1992.

\bibitem[N25]{N25}
{Naur, P.}
\newblock Revised report on the algorithmic language {ALGOL} 60.
\newblock {\em Comm. ACM}, 6:1--17, 1963.

\bibitem[N43]{N43}
{Nazareth, J. L.}
\newblock {\em The {Newton}-{Cauchy} Framework~: {A} Unified Approach to
  Unconstrained Nonlinear Minimization}.
\newblock Springer-Verlag, 1994.

\bibitem[N38]{N38}
{Neiss, F.}, editor.
\newblock {\em Determinanten und Matrizen}.
\newblock Springer-Verlag, $5^{th}$ edition, 1959.

\bibitem[N5]{N5}
{Nemhauser, G. L.}, {Rinooy Kan, A.}, and {Todd, M. J.}, editors.
\newblock {\em Handbooks in Operations Research and Management Sciences, volume
  {1}~: {Optimization}}.
\newblock North-Holland, 1989.

\bibitem[N13]{N13}
{Nemhauser, G. L.} and {Wosley, L. A.}
\newblock {\em Integer and Combinatorial Optimization}.
\newblock John Wiley \& Sons, 1988.

\bibitem[N34]{N34}
{Nemhauser, G. L.} and {Wosley, L. A.}
\newblock Integer programming.
\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~6, pages 447--527. North-Holland, 1989.

\bibitem[N33]{N33}
{Nesterov, Y. E.} and {Nemirovsky, A. S.}
\newblock A general approach to polynomial-time algorithms design for convex
  programming.
\newblock {Report}, Central Economical and Mathematical Institute, USSR Academy
  of Sciences, Moscow, 1988.

\bibitem[N23]{N23}
{Nesterov, Y. E.} and {Nemirovsky, A. S.}
\newblock Self-concordant functions and polynomial time methods in convex
  programming, 1989.

\bibitem[N20]{N20}
{Nesterov, Y. E.} and {Nemirovsky, A. S.}
\newblock Acceleration and parallelization of the path-following interior
  method for a linearly constrained convex quadratic problem.
\newblock {\em SIAM J. Optimization}, 1(4):548--564, 1991.

\bibitem[N21]{N21}
{Nesterov, Y. E.} and {Nemirovsky, A. S.}
\newblock {\em Interior Point Polynomial Methods in Convex Programming~: Theory
  and Algorithms}.
\newblock SIAM Publishing, 1993.

\bibitem[N31]{N31}
{Ng, E.}
\newblock A two-level one-way dissection scheme for finite element problems.
\newblock In {\em Proc. $9^{th}$ Manitoba Conference on Numerical Mathematics
  and Computing}, pages 26--29, 1979.

\bibitem[N1]{N1}
{Ng, E.}
\newblock A scheme for handling rank-deficiency in the solution of sparse
  linear least squares problems.
\newblock {\em SIAM J. Sci. and Stat. Comput.}, 12(5):1173--1183, 1991.

\bibitem[N11]{N11}
{Ng, E.}
\newblock Supernodal symbolic {Cholesky} factorization on a local-memory
  multiprocessor.
\newblock {\em Parallel Computing}, 19:153--162, 1993.

\bibitem[N45]{N45}
{Ng, E.}
\newblock A comparison of some direct methods for solving sparse nonsymmetric
  linear systems.
\newblock In {\em Proc. $5^{th}$ SIAM Conf. on Applied Linear Algebra},
  Snowbird, Utah, 1994.

\bibitem[N10]{N10}
{Ng, E.} and {Peyton, B. W.}
\newblock A supernodal {Cholesky} factorization algorithm for shared-memory
  multiprocessors.
\newblock {Tech. Report} ORNL-TM-11814, Oak Ridge National Laboratory, 1991.

\bibitem[N44]{N44}
{Ng, E.} and {Peyton, B. W.}
\newblock Block sparse cholesky algorithms on advanced uniprocessor computers.
\newblock {\em SIAM J. Sci. and Stat. Comput.}, 14:1034--1056, 1993.

\bibitem[N26]{N26}
{Nicholls, J. E.}
\newblock {\em The Design and Structure of Programming Languages}.
\newblock Addison-Wesley, 1975.

\bibitem[N9]{N9}
{Nicol, D. M.} and {Saltz, J. H.}
\newblock An analysis of scatter decomposition.
\newblock {\em IEEE Trans. Comput.}, C-29(11):1337--1345, 1980.

\bibitem[N32]{N32}
{Nicolau, A.} and {Fisher, J. A.}
\newblock Measuring the parallelism available for very long instruction word
  architectures.
\newblock {\em IEEE Trans. Comput.}, C-33(11):968--976, 1984.

\bibitem[N30]{N30}
{Nie, N. H.} et~al.
\newblock {SPSS}~: {S}tatistical {P}ackage for the {S}ocial {S}ciences.

\bibitem[N14]{N14}
{Niederreiter, H.}
\newblock {\em Random Number Generation and Quasi-Monte Carlo Methods}.
\newblock SIAM Publications, 1992.

\bibitem[N15]{N15}
{Noble, B.}
\newblock {\em Numerical Methods, volume {1}}.
\newblock Oliver and Boyd, London, 1964.

\bibitem[N16]{N16}
{Noble, B.}
\newblock {\em Numerical Methods, volume {2}}.
\newblock Oliver and Boyd, London, 1964.

\bibitem[N24]{N24}
{Nocedal, J.} and {Overton, M.}
\newblock Projected {Hessian} updating algorithms for nonlinear constrained
  optimization.
\newblock {\em SIAM J. Numer. Anal.}, 22:821--850, 1985.

\bibitem[N35]{N35}
{Norin, R. S. } and {Pottle, C.}
\newblock Precompilation of a state-space network analysis algorithm.
\newblock In {\em Proc. Cornell Conference on Computerized Electronics}, pages
  83--91, Ithaca, 1969. Cornell Univ.

\bibitem[N39]{N39}
{Norin, R. S.} and {Pottle, C.}
\newblock Effective ordering of sparse matrices arising from nonlinear
  electrical networks.
\newblock {\em IEEE Trans. Circuit Theory}, CT-18:139--145, 1971.

\bibitem[N42]{N42}
{Norman, R. Z.} and {Rabin, M. O.}
\newblock An algorithm for the minimum cover of a graph.
\newblock {\em Proc. Amer. Math. Soc.}, 10:315--319, 1959.

\bibitem[N37]{N37}
{Norris, C. H.} and {Wilbur, J. B.}
\newblock {\em Elementary Structural Analysis}.
\newblock McGraw-Hill, $2^{nd}$ edition, 1960.

\bibitem[N22]{N22}
{Nucera, R.} and {Gilles, M.}
\newblock A blocked sparse matrix formulation for the solution of
  equality-constrained state estimation, 1990.
\newblock (Presented at {IEEE} {Winter Power Meeting}).

\bibitem[N40]{N40}
{Nuding, E.} and {Kahlert-Warmbold, I.}
\newblock A computer-orientated representation of matrices.
\newblock {\em Computing}, 6:1--8, 1971.

\bibitem[O28]{O28}
{O'Brien, G. G.}, {Hyman, M. A.}, and {Kaplan, S.}
\newblock A study of the numerical solution of partial differential equations.
\newblock {\em J. Math. and Phys.}, 29:223--251, 1951.

\bibitem[O34]{O34}
{O'Byrne, B.}
\newblock An investigation of the performance of some sparse matrix storage and
  processing algorithms in computers with paged memory.
\newblock Master's thesis, Dept. Computer Science, Univ. of Newcastle, 1975.

\bibitem[O33]{O33}
{Oettlie, W.}, {Prager, W.}, and {Wilkinson, J. H.}
\newblock Admissible solutions of linear systems with not sharply defined
  coefficients.
\newblock {\em SIAM J. Numer. Anal.}, 2:291--299, 1965.

\bibitem[O14]{O14}
{Ogbuobiri, E. C.}
\newblock Dynamic storage and retrieval in sparsity programming.
\newblock {\em IEEE Trans. Power Apparatus and Systems}, PAS-89(1):150--155,
  1970.

\bibitem[O25]{O25}
{Ogbuobiri, E. C.}
\newblock Sparsity techniques in power-system grid-expansion planning.
\newblock In {Reid, J. K.}, editor, {\em Large Sparse Sets of Linear
  Equations}, pages 219--230. Academic Press, 1971.

\bibitem[O1]{O1}
{Ogbuobiri, E. C.}, {Tinney, W. F.}, and {Walker, J. W.}
\newblock Sparsity-directed decomposition for {Gaussian} elimination on
  matrices.
\newblock {\em IEEE Trans. Power Apparatus and Systems}, PAS-89(1):141--150,
  1970.

\bibitem[O8]{O8}
{Ogielski, A. T.} and {Aiello, W.}
\newblock Sparse matrix computations on a parallel processor array.
\newblock {\em SIAM J. Sci. and Stat. Comput.}, 14(3):519--530, 1993.

\bibitem[O9]{O9}
{Oh-Eigeartaigh, M.}, {Lenstra, J. K.}, and {Rinnooy Kan, A. H. G.}, editors.
\newblock {\em Combinatorial Optimization~: Annotated Bibliographies}.
\newblock John Wiley \& Sons, 1985.

\bibitem[O16]{O16}
{O'Leary, D. P.}
\newblock A generalized conjugate gradient algorithm for solving a class of
  quadratic programming problems.
\newblock {\em Lin. Alg. and Appl.}, 34:371--399, 1980.

\bibitem[O24]{O24}
{O'Leary, D. P.}
\newblock On bounds for scaled projections and pseudo-inverses.
\newblock {\em Lin. Alg. Appl.}, 132:115--117, 1990.

\bibitem[O23]{O23}
{Oliveira, F. S. G.}
\newblock {ENTERPRISE}~: {Uma} arquitetura {LISP}.
\newblock Master's thesis, 1991.

\bibitem[O22]{O22}
{Oohori, T.} and {Ohuchi, A.}
\newblock Symbolic generation of an optimal {Karmarkar's} algorithm for sparse
  linear programs.
\newblock In {Sebastian, H. J.} and {Tammer, K.}, editors, {\em System
  Modelling and Optimization~: {Proc.} $14^{th}$ {IFIP} Conference, Leipzig,
  1989}, volume 143 of {\em Lecture Notes in Control and Information Science},
  pages 194--203. Springer-Verlag, 1990.

\bibitem[O29]{O29}
{Orchard-Hays, W.}
\newblock Evolution of linear programming computing techniques.
\newblock {\em Management Science}, 4:183--190, 1958.

\bibitem[O10]{O10}
{Orchard-Hays, W.}
\newblock {\em Advanced Linear-Programming Computing Techniques}.
\newblock McGraw-Hill, 1968.

\bibitem[O32]{O32}
{Orden, A.}
\newblock Matrix inversion and related topics by direct methods.
\newblock In {\em Mathematical Methods for Digital Computers, volume {1}}. John
  Wiley \& Sons, 1960.

\bibitem[O15]{O15}
{Ore, O.}
\newblock {\em Theory of Graphs}, volume~38.
\newblock American Mathematical Society Colloquium Publications, 1962.

\bibitem[O17]{O17}
{Ortega, J. M.}
\newblock {\em Numerical Analysis~: A Second Course}.
\newblock Academic Press, 1972.

\bibitem[O6]{O6}
{Ortega, J. M.}
\newblock The $ijk$ forms of factorization methods -- {I}~: {Vector} computers.
\newblock {\em Parallel Computing}, 7:135--147, 1988.

\bibitem[O3]{O3}
{Ortega, J. M.}
\newblock {\em Introduction to Parallel and Vector Solution of Linear Systems}.
\newblock Plenum Press, New York, 1988.

\bibitem[O18]{O18}
{Ortega, J. M.}
\newblock {\em Matrix Theory~: A Second Course}.
\newblock Plenum Press, 1988.

\bibitem[O12]{O12}
{Ortega, J. M.} and {Poole, W.}
\newblock {\em An Introduction to Numerical Methods for Differential
  Equations}.
\newblock Pitman, Marshfield, 1981.

\bibitem[O5]{O5}
{Ortega, J. M.} and {Rheinboldt, W. C.}
\newblock {\em Iterative Solution of Nonlinear Equations in Several Variables}.
\newblock Academic Press, 1970.

\bibitem[O31]{O31}
{Ortega, J. M.} and {Rheinboldt, W. C.}, editors.
\newblock {\em Numerical Solution of Nonlinear Problems~: {Studies} in
  Numerical Analysis {2}, Proc. Symposium sponsored by Office of Naval
  Research, Fall {SIAM} Meeting, Penna, 1968}.
\newblock SIAM Publishing, 1970.

\bibitem[O7]{O7}
{Ortega, J. M.} and {Romine, C. H.}
\newblock The $ijk$ forms of factorization methods -- {II}~: {Parallel}
  systems.
\newblock {\em Parallel Computing}, 7:149--162, 1988.

\bibitem[O19]{O19}
{Ortega, J. M.} and {Voigt, R. G.}
\newblock Solution of partial differential equations on vector and parallel
  computers.
\newblock {\em SIAM Review}, 27:149--240, 1985.

\bibitem[O4]{O4}
{Ortega, J. M.}, {Voigt, R. G.}, and {Romine, C. H.}
\newblock A bibliography on parallel and vector numerical algorithms.
\newblock {Tech. Report} ORNL-TM-10998, Oak Ridge National Laboratory, 1989.
\newblock (Also published at {Parallel Algorithms for Matrix Computations, SIAM
  Publications, 1990}).

\bibitem[O30]{O30}
{Osborne, E. E.}
\newblock On pre-conditioning of matrices.
\newblock {\em J. ACM}, 7:338--345, 1960.

\bibitem[O26]{O26}
{Osborne, M. R.}
\newblock A new method for the integration of stiff systems of ordinary
  differential equations.
\newblock In {\em Proc. {IFIP} Congress}, Edinburgh, 1968.

\bibitem[O2]{O2}
{Osterby, O.} and {Zlatev, Z.}
\newblock {\em Direct Methods for Sparse Matrices}, volume 157 of {\em Lecture
  Notes in Computer Science}.
\newblock Springer-Verlag, 1983.

\bibitem[O20]{O20}
{Ostlund, N.}
\newblock {WATERLOOP V2/64}~: {A} highly parallel machine for numerical
  computation.
\newblock {\em Comput. Phys. Comm.}, 37:109--117, 1985.

\bibitem[O21]{O21}
{Ostrouchov, G.}
\newblock Symbolic {Givens} reduction and row-ordering in large sparse least
  squares problems.
\newblock {\em SIAM J. Sci. and Stat. Comput.}, 8:248--264, 1987.

\bibitem[O27]{O27}
{Ostrowski, A. M.}
\newblock On the convergence of the {Rayleigh} quotient iteration for the
  computation of the characteristic roots and vectors.
\newblock {\em Arch. Rational Mech. Anal.}, 3:341--347, 1959.

\bibitem[O11]{O11}
{Ostrowski, A. M.}
\newblock {\em Solution of Equations and Systems of Equations}.
\newblock Academic Press, $2^{nd}$ edition, 1966.

\bibitem[O13]{O13}
{Overton, M. L.}
\newblock Large-scale optimization of eigenvalues.
\newblock {\em SIAM J. Optimization}, 2:88--120, 1992.

\bibitem[P55]{P55}
{Pachl, J. K.}
\newblock Finding pseudoperipheral nodes in graphs.
\newblock {\em J. Comput. System Sci.}, 29:48--53, 1984.

\bibitem[P22]{P22}
{Pacitti, T.}
\newblock {\em {FORTRAN-Monitor}, Princ\'\i pios}.
\newblock Livros T\'ecnicos e Cient\'\i ficos Editora, 1968.

\bibitem[P21]{P21}
{Pacitti, T.} and {Atkinson, C. P.}
\newblock {\em Programa\c c\~ao e M\'etodos Computacionais, volume {2}}.
\newblock Livros T\'ecnicos e Cient\'\i ficos Editora, 1977.
\newblock ($2^{a}$ edi\c c\~ao).

\bibitem[P41]{P41}
{Padilha, A.}
\newblock Metodologia para solu\c c\~ao de equa\c c\~oes alg\'ebricas esparsas
  em computadores vetoriais.
\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 595--600, 1993.

\bibitem[P43]{P43}
{Padilha, A.} and {Morelato, A.}
\newblock C\'alculo de matrizes de fatores inversos para multiprocessamento de
  equa\c c\~oes de redes el\'etricas.
\newblock In {\em IX Congresso Brasileiro de Autom\'atica}, pages 598--603,
  Vit\'oria, 1992.

\bibitem[P42]{P42}
{Padilha, A.} and {Morelato, A.}
\newblock A {W-Matrix} methodology for solving sparse network equations on
  multiprocessor computers.
\newblock {\em IEEE Trans. Power Systems}, PWRS-7(3):1023--1030, 1992.

\bibitem[P39]{P39}
{Padua, D. A.} and {Wolfe, M. J.}
\newblock Advanced compiler optimizations for supercomputers.
\newblock {\em Comm. ACM}, 29(2):1184--1201, 1986.

\bibitem[P77]{P77}
{Page, E. S.} and {Wilson, L. B.}
\newblock {\em Information Representation and Manipulation in a Computer}.
\newblock Cambridge University Press, 1973.

\bibitem[P36]{P36}
{Paige, C. C.}
\newblock {\em The Computation of Eigenvalues and Eigenvectors of Very Large
  Sparse Matrices}.
\newblock PhD thesis, Univ. of London, 1971.

\bibitem[P5]{P5}
{Paige, C. C.} and {Saunders, M. A.}
\newblock Solution of sparse indefinite systems of linear equations.
\newblock {\em SIAM J. Numer. Anal.}, 12(4):617--629, 1975.

\bibitem[P59]{P59}
{Paige, C. C.} and {Saunders, M. A.}
\newblock Algorithm 583~: {LSQR} -- {Sparse} linear equations and least squares
  problems.
\newblock {\em ACM Trans. Math. Software}, 8:195--209, 1982.

\bibitem[P6]{P6}
{Paige, C. C.} and {Saunders, M. A.}
\newblock {LSQR}~: {An} algorithm for sparse linear equations and sparse least
  squares.
\newblock {\em ACM Trans. Math. Software}, 8(1):43--71, 1982.

\bibitem[P12]{P12}
{Pan, V.}
\newblock Strassen algorithm is not optimal~: {Trilinear} technique of
  aggregating, uniting and canceling for constructing fast algorithms for
  matrix multiplication.
\newblock In {\em Proc. $19^{th}$ Annual Symposium on the Foundations of
  Computer Science}, pages 166--176, Ann Arbor, 1978.

\bibitem[P13]{P13}
{Pan, V.}
\newblock How can we speed up matrix multiplication~?
\newblock {\em SIAM Review}, 26:393--415, 1984.

\bibitem[P14]{P14}
{Pan, V.}
\newblock {\em How to Multiply Matrices Faster}.
\newblock Lecture Notes in Computer Science. Springer-Verlag, 1984.

\bibitem[P20]{P20}
{Pan, V.} and {Reif, J.}
\newblock Efficient parallel solution of linear systems.
\newblock In {\em Proc. $17^{th}$ Annual {ACM} Symposium on Theory of
  Computing}, pages 143--152, 1985.

\bibitem[P61]{P61}
{Papadimitriou, C. H.}
\newblock The {NP}-completeness of the bandwidth minimization problem.
\newblock {\em Computing}.

\bibitem[P10]{P10}
{Papadimitriou, C. H.} and {Steiglitz, K.}
\newblock {\em Combinatorial Optimization~: Algorithms and Complexity}.
\newblock Prentice-Hall, 1982.

\bibitem[P68]{P68}
{Parlett, B. N.}
\newblock The development and use of methods of {LR} type.
\newblock {\em SIAM Review}, 6:275--294, 1964.

\bibitem[P66]{P66}
{Parlett, B. N.}
\newblock {Laguerre's} method applied to the matrix eigenvalue problem.
\newblock {\em Math. of Computation}, 18:464--485, 1964.

\bibitem[P62]{P62}
{Parlett, B. N.} and {Reid, J. K.}
\newblock On the solution of system of linear equations whose matrix is
  symmetric but not definite.
\newblock {\em BIT}, 10:386--397, 1970.

\bibitem[P37]{P37}
{Parlett, B. N.} and {Reid, J. K.}
\newblock Tracking the progress of the {Lanczos} algorithm for large symmetric
  eigenproblems.
\newblock {Tech. Report} AERE-CSS-83, Harwell Laboratory, 1980.

\bibitem[P56]{P56}
{Parlett, B. N.}, {Simon, H.}, and {Stringer, L.}
\newblock Estimating the largest eigenvalue with the {Lanczos} algorithm.
\newblock {\em Math. of Computation}, 38:153--165, 1982.

\bibitem[P73]{P73}
{Parodi, M.}
\newblock {\em Alg\`ebre des Matrices et Applications Physiques}.
\newblock 1958.

\bibitem[P74]{P74}
{Parodi, M.}
\newblock {\em La Localisation des Valeurs Caract\'eristiques des Matrices et
  ses Applications}.
\newblock Gauthier et Villars, 1959.

\bibitem[P67]{P67}
{Parter, S.}
\newblock On `two line' iterative methods for the {Laplace} and biharmonic
  difference equations.
\newblock {\em Numer. Math.}, 1:240--252, 1959.

\bibitem[P70]{P70}
{Parter, S.}
\newblock On the eigenvalues and eigenvectors of a class of matrices.
\newblock {\em SIAM J. Appl. Math.}, 8:376--388, 1960.

\bibitem[P33]{P33}
{Parter, S.}
\newblock The use of linear graphs in {Gaussian} elimination.
\newblock {\em SIAM Review}, 3:119--130, 364--369, 1961.

\bibitem[P40]{P40}
{Patel, R. V.}, {Laub, A. J.}, and {van Dooren, P. M.}
\newblock {\em Numerical Linear Algebra Techniques for Systems and Control}.
\newblock IEEE Press, 1994.

\bibitem[P76]{P76}
{Paton, K.}
\newblock An algorithm for the blocks and cutnodes of a graph.
\newblock {\em Comm. ACM}, 14:468--475, 1971.

\bibitem[P84]{P84}
{Patterson, D. A.}
\newblock Microprogramming.
\newblock {\em Scientific American}, 248(3):36--43, 1983.

\bibitem[P85]{P85}
{Patterson, D. A.}
\newblock Reduced instruction set computers.
\newblock {\em Comm. ACM}, 28(1):8--21, 1985.

\bibitem[P88]{P88}
{PDS}.
\newblock The performance database server, 1995.

\bibitem[P75]{P75}
{Peaceman, D. W.} and {Rachford, H. H.}
\newblock The numerical solution of parabolic and elliptic differential
  equations.
\newblock {\em SIAM J. Appl. Math.}, 3:28--41, 1955.

\bibitem[P80]{P80}
{Pearson, K. R.} and {Rimmer, R. J.}
\newblock An efficient method for the solution of large computable general
  equilibrium models.
\newblock In {\em Proc. $6^{th}$ Biennial Conference of the Simulation Society
  of Australia}, 1984.
\newblock (Published at {Journal of the International Association for
  Mathematics and Computers in Simulation}).

\bibitem[P81]{P81}
{Pearson, K. R.} and {Rimmer, R. J.}
\newblock Sparse matrix methods on the {VAX 11/780}.
\newblock In {\em Proc. $24^{th}$ European {DECUS} Symposium}, pages 545--552,
  Amsterdam, 1984.

\bibitem[P65]{P65}
{Pease, M. C.}
\newblock Matrix inversion using parallel processing.
\newblock {\em J. ACM}, 14:757--764, 1967.

\bibitem[P26]{P26}
{Peitgen, H.} and {Richter, P.}
\newblock {\em The Beauty of Fractals}.
\newblock Springer-Verlag, 1986.

\bibitem[P72]{P72}
{Peltier, J.}
\newblock {\em R\'esolution Num\'erique des \'Equations Alg\'ebriques}.
\newblock 1957.

\bibitem[P9]{P9}
{Pereira, L. A. C.}
\newblock Implementa\c c\~ao de um programa de fluxo de pot\^encia \'otimo
  utilizando programa\c c\~ao quadr\'atica sequencial.
\newblock Master's thesis, Depto. de Eng. de Sistemas e Computa\c c\~ao,
  COPPE/UFRJ, 1991.

\bibitem[P34]{P34}
{Peschon, J.} et~al.
\newblock Optimum control of reactive power flow.
\newblock {\em IEEE Trans. Power Apparatus and Systems}, PAS-87(1):40--48,
  1968.

\bibitem[P3]{P3}
{Peters, F. J.}
\newblock Sparse matrices and substructures with a novel implementation of
  finite element algorithms.
\newblock In {\em volume 119 of Mathematical Centre Tracts}, Amsterdam, 1980.

\bibitem[P18]{P18}
{Peters, F. J.}
\newblock Parallel pivoting algorithms for sparse symmetric matrices.
\newblock {\em Parallel Computing}, 1:99--110, 1984.

\bibitem[P60]{P60}
{Peters, F. J.}
\newblock Parallelism and sparse linear equations.
\newblock In {Evans, D. J.}, editor, {\em Sparsity and Its Applications}, pages
  285--301. Cambridge University Press, 1985.

\bibitem[P63]{P63}
{Peters, G.} and {Wilkinson, J. H.}
\newblock Symmetric decomposition of positive definite band matrices.
\newblock {\em Numer. Math.}, 7:355--361, 1965.

\bibitem[P38]{P38}
{Peters, G.} and {Wilkinson, J. H.}
\newblock The least squares problem and pseudo-inverses.
\newblock {\em Computing J.}, 13:309--316, 1970.

\bibitem[P35]{P35}
{Peterson, N. M.} and {Meyer, W. S.}
\newblock Automatic adjustment of transformer and phase shifter taps in the
  {Newton} power flow.
\newblock {\em IEEE Trans. Power Apparatus and Systems}, PAS-90(1):103--109,
  1971.

\bibitem[P69]{P69}
{Petrie, G. W.}
\newblock Matrix inversion and solution of simultaneous linear algebraic
  equations with the {IBM 604} electronic calculating punch.
\newblock {\em Nat. Bur. Standards Appl. Math.}, 29:105--110, 1953.

\bibitem[P19]{P19}
{Peyton, B. W.}
\newblock {\em Some Applications of Clique Trees to the Solution of Sparse
  Linear Systems}.
\newblock PhD thesis, Clemson Univ., 1986.

\bibitem[P29]{P29}
{Phillips, A. T.} and {Rosen, J. B.}
\newblock A parallel algorithm for constrained concave quadratic global
  minimization.
\newblock {\em Math. Programming}, 42(2):421--448, 1988.

\bibitem[P27]{P27}
{Piessens, R.} et~al.
\newblock {\em {QUADPACK}~: {A} Subroutine Package for Automatic Integration}.
\newblock Springer-Verlag, 1983.

\bibitem[P28]{P28}
{Pinto, H. J. C. P.} and {Teixeira, M. J.}
\newblock Aplica\c c\~ao de processamento paralelo em otimiza\c c\~ao de grande
  porte.
\newblock {\em Pesquisa Operacional}, 8(2):47--64, 1988.

\bibitem[P23]{P23}
{Piskounov, N.}
\newblock {\em C\'alculo Diferencial e Integral, volume {1}}.
\newblock Lopes da Silva Editora, Porto, 1978.
\newblock ({Translated from the Russian original}).

\bibitem[P24]{P24}
{Piskounov, N.}
\newblock {\em C\'alculo Diferencial e Integral, volume {2}}.
\newblock Lopes da Silva Editora, Porto, 1978.
\newblock ({Translated from the Russian original}).

\bibitem[P2]{P2}
{Pissanetzky, S.}
\newblock Gauss elimination with supersparse matrices.
\newblock {Tech. Report} BNL-26773, Brookhaven National Laboratory, 1979.

\bibitem[P57]{P57}
{Pissanetzky, S.}
\newblock {KUBIK}~: {An} automatic three-dimensional finite element mesh
  generator.
\newblock {\em Int. J. Numer. Meth. in Eng.}, 17:255--269, 1981.

\bibitem[P58]{P58}
{Pissanetzky, S.}
\newblock An infinite element and formula for numerical quadrature over an
  infinite interval.
\newblock {\em Int. J. Numer. Meth. in Eng.}, 19:913--927, 1983.

\bibitem[P1]{P1}
{Pissanetzky, S.}
\newblock {\em Sparse Matrix Technology}.
\newblock Academic Press, Inc., 1984.

\bibitem[P8]{P8}
{Plassmann, P. E.}
\newblock Sparse {Jacobian} estimation and factorization on a multiprocessor.
\newblock {Tech. Report} MCS-P-243-0591, Argonne National Laboratory, 1991.

\bibitem[P82]{P82}
{Platzman, G. W.}
\newblock Normal modes of the {Atlantic} and {Indian} oceans.
\newblock {\em J. Phys. Oceanography}, 5:201--221, 1975.

\bibitem[P48]{P48}
{Plauger, P. J.}
\newblock A review of {Kernighan} and {Ritchie} 1978.
\newblock {\em Computing Reviews}, pages 2--4, 1979.

\bibitem[P11]{P11}
{Polak, E.}
\newblock {\em Computational Methods in Optimization}.
\newblock Academic Press, 1971.

\bibitem[P32]{P32}
{Polak, R.}
\newblock {\em Numerical Methods in Optimization}.
\newblock Academic Press, 1961.

\bibitem[P31]{P31}
{Poncele\'on, D. B.}
\newblock Barrier methods for large-scale quadratic programming.
\newblock {Tech. Report} SOL-91-2, Systems Optimization Laboratory, Stanford
  Univ., 1991.

\bibitem[P78]{P78}
{Ponstein, J.}
\newblock Self-avoiding paths and the adjacency graph of a matrix.
\newblock {\em SIAM J. Appl. Math.}, 14:600--609, 1966.

\bibitem[P4]{P4}
{Pooch, U. W.} and {Neider, A.}
\newblock A survey of indexing techniques for sparse matrices.
\newblock {\em ACM Computing Surveys}, 5:109--133, 1973.

\bibitem[P83]{P83}
{Postnikov, M. M.}
\newblock {\em The Variational Theory of Geodesics}.
\newblock Dover Publications, 1967.

\bibitem[P52]{P52}
{Pothen, A.}
\newblock The complexity of optimal elimination trees.
\newblock {Tech. Report} CS-88-16, Dept. of Computer Science, Penn. State
  Univ., University Park, 1988.

\bibitem[P49]{P49}
{Pothen, A.}
\newblock Simplicial cliques, shortest elimination trees, and supernodes in
  sparse {Cholesky} factorization.
\newblock {Tech. Report} CS-88-13, Dept. of Computer Science, Penn. State
  Univ., University Park, 1988.

\bibitem[P54]{P54}
{Pothen, A.}
\newblock Predicting the structure of sparse orthogonal factors.
\newblock ({Manuscript}), 1991.

\bibitem[P50]{P50}
{Pothen, A.} and {Fan, C. J.}
\newblock Computing the block triangular form of a sparse matrix.
\newblock {Tech. Report} CS-88-51, Dept. of Computer Science, Penn. State
  Univ., University Park, 1988.
\newblock (To be published at {ACM Trans. Math. Software}).

\bibitem[P51]{P51}
{Pothen, A.} and {Fan, C. J.}
\newblock Computing the block triangular form of a sparse matrix.
\newblock {\em ACM Trans. Math. Software}, 16:303--324, 1990.

\bibitem[P90]{P90}
{Pothen, A.}, {Rothberg, E.}, {Simon, H.}, and {Wang, L.}
\newblock Parallel sparse cholesky factorization using spectral nested
  dissection ordering on the {INTEL} {PARAGON}.
\newblock {Tech. Report}, 1994.
\newblock ({In preparation}).

\bibitem[P89]{P89}
{Pothen, A.}, {Rothberg, E.}, {Simon, H.}, and {Wang, L.}
\newblock Parallel sparse cholesky factorization with spectral nested
  dissection ordering.
\newblock {Tech. Report} RN-94-011, NASA Ames Research Center, 1994.

\bibitem[P53]{P53}
{Pothen, A.}, {Simon, H.}, and {Liou, K.}
\newblock Partitioning sparse matrices with eigenvectors of graphs.
\newblock {\em SIAM J. Matrix Anal. and Appl.}, 11:430--452, 1990.

\bibitem[P92]{P92}
{Pothen, A.}, {Simon, H.}, and {Wang, L.}
\newblock Spectral nested dissection.
\newblock {Tech. Report} CS-92-01, Computer Science Dept., Pennsylvania State
  Univ., 1992.

\bibitem[P17]{P17}
{Pothen, A.} and {Sun, C.}
\newblock A distributed multifrontal algorithm using clique trees.
\newblock {Tech. Report} CTC-91-TR-72, Cornell Theory Center Report, Cornell
  Univ., 1991.

\bibitem[P93]{P93}
{Pothen, A.} and {Sun, C.}
\newblock A mapping algorithm for parallel sparse cholesky factorization.
\newblock {\em SIAM J. Sci. and Stat. Comput.}, 14:1253--1257, 1993.

\bibitem[P91]{P91}
{Pothen, A.} and {Wang, L.}
\newblock An improved spectral nested dissection algorithm.
\newblock {Tech. Report}, 1994.
\newblock ({In preparation}).

\bibitem[P64]{P64}
{Powell, M. J. D.}
\newblock A theorem on rank one modifications to a matrix and its inverse.
\newblock {\em Computing J.}, 12:288--290, 1969.

\bibitem[P44]{P44}
{Powell, M. J. D.}
\newblock A new algorithm for unconstrained optimization.
\newblock In {Rosen, J. B.}, {Mangasarian, O. L.}, and {Ritter, K.}, editors,
  {\em Nonlinear Programming}. Academic Press, 1970.

\bibitem[P46]{P46}
{Powell, M. J. D.}
\newblock Variable metric methods for constrained optimization.
\newblock In {Bachem, A.}, {Gr{\"o}tschel, M.}, and {Korte, B.}, editors, {\em
  Mathematical Programming~: {The} State of the Art, Bonn 1982}.
  Springer-Verlag, 1983.

\bibitem[P45]{P45}
{Powell, M. J. D.}
\newblock On the global convergence of trust region algorithm for unconstrained
  minimization.
\newblock {\em Math. Programming}, 29(3):297--303, 1984.

\bibitem[P30]{P30}
{Powell, M. J. D.}
\newblock On the number of iterations of {Karmarkar} algorithm for linear
  programming.
\newblock {Tech. Report} DAMTP-1991-NA-23, Dept. of Applied Mathematics and
  Theoretical Physics, Univ. Cambridge, 1991.

\bibitem[P7]{P7}
{Powell, M. J. D.} and {Toint, Ph. L.}
\newblock On the estimation of sparse {Hessian} matrices.
\newblock {\em SIAM J. Numer. Anal.}, 16:1060--1074, 1979.

\bibitem[P47]{P47}
{Powell, M. J. D.} and {Yuan, Y.}
\newblock A trust region algorithm for equality constrained optimization.
\newblock {Tech. Report} DAMTP-1986-NA-2, Dept. of Applied Mathematics and
  Theoretical Physics, Univ. of Cambridge, Cambridge, England, 1986.

\bibitem[P15]{P15}
{Pratt, T. W.}
\newblock {\em Programming Languages~: Design and Implementation}.
\newblock Prentice-Hall, 1975.

\bibitem[P16]{P16}
{Preparata, F. P.} and {Shamos, M. I.}
\newblock {\em Computational Geometry~: An Introduction}.
\newblock Springer-Verlag, 1985.

\bibitem[P25]{P25}
{Press, W. H.}, {Flannery, B. P.}, {Teukolsky, S. A.}, and {Vetterling, W. T.}
\newblock {\em Numerical Recipes~: The Art of Scientific Computing, ({FORTRAN}
  version)}.
\newblock Cambridge University Press, 1989.

\bibitem[P87]{P87}
{Prim, R. C.}
\newblock Shortest connection networks and some generalizations.
\newblock {\em Bell Systems Technology Journal}, 36:1389--1401, 1957.

\bibitem[P71]{P71}
{Przemieniecki, J. S.}
\newblock {\em Theory of Matrix Structural Analysis}.
\newblock McGraw-Hill, 1968.

\bibitem[P86]{P86}
{Przybylski, S. A.}
\newblock {\em Cache Design~: {A} Performance-Directed Approach}.
\newblock Morgan Kaufmann Publishers, 1990.

\bibitem[P79]{P79}
{Purdom, P. Jr.}
\newblock A transitive closure algorithm.
\newblock {\em BIT}, 10:76--94, 1970.

\bibitem[Q3]{Q3}
{Qing-shi, G.} and {Rong-Quan, W.}
\newblock Vector computer for sparse matrix operations.
\newblock In {\em Proc. 1983 International Conference on Parallel Processing},
  pages 87--89, 1983.

\bibitem[Q1]{Q1}
{Quinn, M. J.}
\newblock {\em Designing Efficient Algorithms for Parallel Computers}.
\newblock McGraw-Hill, 1987.

\bibitem[Q2]{Q2}
{Quinn, M. J.} and {Deo, N.}
\newblock Parallel graph algorithms.
\newblock {\em ACM Computing Surveys}, 16:319--348, 1984.

\bibitem[R65]{R65}
{Rabinowitz, P.}
\newblock Applications of linear programming to numerical analysis.
\newblock {\em SIAM Review}, 10:121--159, 1968.

\bibitem[R49]{R49}
{Raghavan, P.} and {Pothen, A.}
\newblock Parallel orthogonal factorization.
\newblock In {Lewis, J. G.} and {Gilbert, J. R.}, editors, {\em Symposium on
  Sparse Matrices}. SIAM Publications, Salishan Resort, Gleneden Beach, Oregon,
  1989.

\bibitem[R71]{R71}
{Rall, L. B.}, editor.
\newblock {\em Error in Digital Computation, volume {1}, Proc. of the Symposium
  of the Mathematics Research Center, 1964}, Madison, 1965. Univ. Wisconsin.

\bibitem[R72]{R72}
{Rall, L. B.}, editor.
\newblock {\em Error in Digital Computation, volume {2}, Proc. of the Symposium
  of the Mathematics Research Center, 1965}, Madison, 1965. Univ. Wisconsin.

\bibitem[R22]{R22}
{Ralston, A.} and {Rabinowitz, P.}
\newblock {\em A First Course in Numerical Analysis}.
\newblock McGraw-Hill, $2^{nd}$ edition, 1978.
\newblock ({First edition, 1965}).

\bibitem[R23]{R23}
{Ralston, A.} and {Wilf, H. S.}, editors.
\newblock {\em Mathematical Methods for Digital Computers, volume {1}}.
\newblock John Wiley \& Sons, 1960.

\bibitem[R24]{R24}
{Ralston, A.} and {Wilf, H. S.}, editors.
\newblock {\em Mathematical Methods for Digital Computers, volume {2}}.
\newblock John Wiley \& Sons, 1967.

\bibitem[R82]{R82}
{Ramamoorthy, C. V.}, {Chandy, K. M.}, and {Gonzalez, M. J.}
\newblock Optimal scheduling strategies in a multiprocessor system.
\newblock {\em IEEE Trans. Comput.}, C-21:137--146, 1972.

\bibitem[R63]{R63}
{Ramawoorthy, C. V.} and {Li, H. F.}
\newblock Pipeline architecture.
\newblock {\em ACM Computing Surveys}, 9(1):61--102, 1977.

\bibitem[R76]{R76}
{Randell, B.} and {Kuehner, J.}
\newblock Dynamic storage allocation systems.
\newblock {\em Comm. ACM}, 11:297--306, 1968.

\bibitem[R45]{R45}
{Read, R.}, editor.
\newblock {\em Graph Theory and Computing}.
\newblock Academic Press, 1973.

\bibitem[R28]{R28}
{Redish, K. A.}
\newblock {\em An Introduction to Computational Methods}.
\newblock John Wiley \& Sons, 1961.

\bibitem[R92]{R92}
{Reed, B.}
\newblock Finding approximate separators and computing tree-width quickly.
\newblock In {\em Proc. $24^{th}$ Annual Symposium on Theory of Computing},
  pages 221--228, 1992.

\bibitem[R73]{R73}
{Reed, R.}, editor.
\newblock {\em Graph Theory and Computing}.
\newblock Academic Press, 1971.

\bibitem[R14]{R14}
{Reichel, L.}, {Varga, R. S.}, and {Ruttan, A.}
\newblock {Kent State} launches {E}lectronic {N}umerical {A}nalysis journal.
\newblock {\em SIAM News}, 26(6):20, 1993.

\bibitem[R33]{R33}
{Reid, J. K.}
\newblock A method for finding the optimum successive over-relaxation
  parameter.
\newblock {\em Computing J.}, 9:200--204, 1966.

\bibitem[R5]{R5}
{Reid, J. K.}, editor.
\newblock {\em Large Sparse Sets of Linear Equations}.
\newblock Academic Press, 1971.

\bibitem[R32]{R32}
{Reid, J. K.}
\newblock A note on the stability of {Gaussian} elimination.
\newblock {\em J. Inst. Math. Appl.}, 8:374--375, 1971.

\bibitem[R44]{R44}
{Reid, J. K.}
\newblock On the method of conjugate gradients for the solution of large sparse
  systems of linear equations.
\newblock In {\em Proc. of the Conference on Large Sparse Sets of Linear
  Equations}. Academic Press, New York, 1971.

\bibitem[R68]{R68}
{Reid, J. K.}
\newblock Two {FORTRAN} subroutines for direct solution of linear equations
  whose matrix is sparse, symmetric and positive-definite.
\newblock {Tech. Report} R-7119, AERE/HMSO, 1972.

\bibitem[R36]{R36}
{Reid, J. K.}
\newblock Least squares solution of sparse systems of non-linear equations by a
  modified {Marquardt} algorithm.
\newblock In {Himmelblau, D. M.}, editor, {\em Proc. {NATO} Conference at
  Cambridge, 1972}, pages 437--445. North-Holland, 1973.

\bibitem[R67]{R67}
{Reid, J. K.}
\newblock Direct methods for sparse matrices.
\newblock In {Evans, D. J.}, editor, {\em Software for Numerical Mathematics},
  pages 29--47. Academic Press, 1974.

\bibitem[R2]{R2}
{Reid, J. K.}
\newblock {FORTRAN} subroutines for handling sparse linear programming bases.
\newblock {Tech. Report} AERE-R-8269, HMSO, London, 1976.

\bibitem[R34]{R34}
{Reid, J. K.}
\newblock A package of subroutines for the solution of very large sets of
  linear finite-element equations.
\newblock {Tech. Report} AERE-M-2947, Harwell Laboratory, 1978.

\bibitem[R35]{R35}
{Reid, J. K.}
\newblock A survey of sparse matrix computation.
\newblock In {Erisman, A. M.}, {Neves, K. W.}, and {Dwarakanath, M. H.},
  editors, {\em Electric Power Problems~: {The} Mathematical Challenge}, pages
  41--68. SIAM Publications, 1980.

\bibitem[R4]{R4}
{Reid, J. K.}
\newblock A sparsity exploiting variant of the {Bartels-Golub} decomposition
  for linear programming bases.
\newblock {\em Math. Programming}, 24:55--69, 1982.

\bibitem[R3]{R3}
{Reid, J. K.}
\newblock {TREESOLVE}~: {A} {FORTRAN} package for solving large sets of linear
  finite-element equations.
\newblock {Tech. Report} CSS-155, Computer Science and Systems Division, AERE
  Harwell Laboratory, 1984.

\bibitem[R1]{R1}
{Reid, J. K.}
\newblock Sparse matrices.
\newblock {Tech. Report} 84-1316, Harwell Laboratory, 1986.

\bibitem[R46]{R46}
{Reingold, E. M.}, {Nievergelt, J.}, and {Deo, N.}, editors.
\newblock {\em Combinatorial Algorithms~: Theory and Practice}.
\newblock Prentice-Hall, 1977.

\bibitem[R77]{R77}
{Reiter, R.}
\newblock Scheduling parallel computations.
\newblock {\em J. ACM}, 15:590--599, 1968.

\bibitem[R91]{R91}
{Rendl, F.} and {Wolkowicz, H.}
\newblock A projection technique for partitioning the nodes of a graph.
\newblock {\em Annals of Oper. Res.}, 1994.
\newblock ({To be published}).

\bibitem[R62]{R62}
{Renegar, J.}
\newblock Incorporating condition measures into the complexity theory of linear
  programming.
\newblock (To be published at {SIAM J. Optimization}).

\bibitem[R61]{R61}
{Renegar, J.}
\newblock Linear programming, complexity, theory and elementary functional
  analysis.
\newblock (To be published at {Math. Programming}).

\bibitem[R60]{R60}
{Renegar, J.}
\newblock Some perturbation theory for linear programming.
\newblock {\em Math. Programming}, 65(1):73--92, 1994.

\bibitem[R58]{R58}
{Rheinboldt, W. C.}
\newblock {\em Methods for Solving Systems of Nonlinear Equations}.
\newblock SIAM Publications, 1974.

\bibitem[R86]{R86}
{Rheinboldt, W. C.} and {Mesztenyi, C. K.}
\newblock {GRAAL}~: {A} {Graph} {A}lgorithmic {L}anguage.
\newblock In {Willoughby, R. A.}, editor, {\em Sparse Matrix Proceedings,
  Symposium on Sparse Matrices and Their Applications}, pages 167--176,
  Yorktown Heights, New York, 1969. IBM Thomas J. Watson Research Center.

\bibitem[R87]{R87}
{Rheinboldt, W. C.} and {Mesztenyi, C. K.}
\newblock On a programming language for graph algorithms.
\newblock {\em BIT}, 12:220--241, 1972.

\bibitem[R55]{R55}
{Rheinboldt, W. C.} and {Mesztenyi, C. K.}
\newblock Arc graphs and their possible application to sparse matrix problems.
\newblock {\em BIT}, 14:227--239, 1973.

\bibitem[R83]{R83}
{Rheinboldt, W. C.} and {Mesztenyi, C. K.}
\newblock Programs for the solution of large sparse matrix problems based on
  the arc-graph structure.
\newblock {Tech. Report} TR-262, Computer Science Center, Univ. of Maryland,
  1973.

\bibitem[R25]{R25}
{Rice, J. R.}
\newblock {\em The Approximation of Functions, volume {1}}.
\newblock Addison-Wesley, 1964.

\bibitem[R26]{R26}
{Rice, J. R.}
\newblock {\em The Approximation of Functions, volume {2}}.
\newblock Addison-Wesley, 1964.

\bibitem[R27]{R27}
{Rice, J. R.}
\newblock {\em Numerical Methods, Software, and Analysis}.
\newblock McGraw-Hill, 1983.

\bibitem[R21]{R21}
{Rich, R. P.}
\newblock {\em Internal Sorting Methods Illustrated with {PL/I} Programs}.
\newblock Prentice-Hall, 1972.

\bibitem[R20]{R20}
{Riesel, H.}
\newblock {\em Prime Numbers and Computer Methods for Factorization}.
\newblock Birkh{\"a}user Verlag, 1985.

\bibitem[R81]{R81}
{Riley, V.} and {Gass, S. I.}
\newblock {\em Linear Programming and Associated Techniques}.
\newblock Bibliographic Reference Series. Johns Hopkins Press, 1958.

\bibitem[R59]{R59}
{Ringeisen, R. D.} and {Roberts, F. S.}, editors.
\newblock {\em Applications of Discrete Mathematics, Proc. Conference held in
  Clemson, South Carolina, 1986}.
\newblock SIAM Publications, 1988.

\bibitem[R41]{R41}
{Ritchie, D. M.}
\newblock {\em ${C}$ {R}eference Manual}.
\newblock Documents for use with the {UNIX} Time-Sharing System. BELL Labs.,
  $5^{th}$ edition, 1974.

\bibitem[R42]{R42}
{Ritchie, D. M.}, {Johnson, S. C.}, {Lesk, M. E.}, and {Kernighan, B. W.}
\newblock The ${C}$ programming language.
\newblock {\em BELL System Tech. Journal}, 57(6):1991--2019, 1978.

\bibitem[R43]{R43}
{Ritchie, D. M.} and {Thompson, K.}
\newblock The {UNIX} time-sharing system.
\newblock {\em Comm. ACM}, 17(7):365--375, 1974.
\newblock (Revised in {BELL System Tech. Journal, 57(6):1905--1929, 1978}).

\bibitem[R47]{R47}
{Rivest, R. L.} and {Vuillemin, J.}
\newblock On recognizing graph properties from adjacency matrices.
\newblock {\em Theoret. Comput. Sci.}, 3:371--384, 1976.

\bibitem[R13]{R13}
{Roberts, E.}
\newblock {\em Thinking Recursively}.
\newblock John Wiley \& Sons, 1986.

\bibitem[R95]{R95}
{Robertson, N.} and {Seymour, P. D.}
\newblock Graph minors -- {II}:~ {Algorithmic} aspects of tree-width.
\newblock {\em J. of Algorithms}, 7:309--322, 1986.

\bibitem[R94]{R94}
{Robertson, N.} and {Seymour, P. D.}
\newblock Graph minors -- {XIII}:~ {The} disjoint path problem.
\newblock {Manuscript}, 1986.

\bibitem[R93]{R93}
{Robertson, N.} and {Seymour, P. D.}
\newblock Graph minors -- {X}:~ {Obstructions} to tree-decompositions.
\newblock {\em J. Comb. Theory Series B}, 52:153--190, 1991.

\bibitem[R38]{R38}
{Rockafellar, T.}
\newblock {\em Convex Analysis}, volume~28 of {\em Princeton Mathematics
  Series}.
\newblock Princeton University Press, 1970.

\bibitem[R57]{R57}
{Rockafellar, T.}
\newblock {\em Conjugate Duality and Optimization}.
\newblock SIAM Publications, 1974.

\bibitem[R48]{R48}
{Rodrigue, G.}, editor.
\newblock {\em Parallel Processing for Scientific Computing}.
\newblock SIAM Publications, 1989.

\bibitem[R75]{R75}
{Rollet, J. S.} and {Wilkinson, J. H.}
\newblock An efficient scheme for the codiagonalization of a symmetric matrix
  with a two-level store.
\newblock {\em Computing J.}, 4:177--180, 1961.

\bibitem[R15]{R15}
{Romero, L. F.} and {Zapata, E. L.}
\newblock Data distributions for sparse matrix vector multiplication.
\newblock {\em Parallel Computing}, 21:583--605, 1995.

\bibitem[R70]{R70}
{Rose, D. J.}
\newblock An algorithm for solving a special class of tridiagonal systems of
  linear equations.
\newblock {\em Comm. ACM}, 12:234--236, 1969.

\bibitem[R64]{R64}
{Rose, D. J.}
\newblock {\em Symmetric Elimination on Sparse Positive Definite Systems and
  Potential Flow Network Problem}.
\newblock PhD thesis, Mathematics Dept., Harvard Univ., Cambridge, 1970.
\newblock ({Partially revised and published in Graph Theory and Computing,
  Reed, R., editor, Academic Press, 1971}).

\bibitem[R10]{R10}
{Rose, D. J.}
\newblock Triangulated graphs and the elimination process.
\newblock {\em J. Math. Anal. Appl.}, 32:597--609, 1970.

\bibitem[R56]{R56}
{Rose, D. J.}
\newblock A note on consistent ordering and zero circulation.
\newblock {\em J. ACM}, 18:573--575, 1971.

\bibitem[R9]{R9}
{Rose, D. J.}
\newblock A graph-theoretic study of the numerical solution of sparse positive
  definite systems of linear equations.
\newblock In {Read, R.}, editor, {\em Graph Theory and Computing}, pages
  183--217. Academic Press, 1973.

\bibitem[R53]{R53}
{Rose, D. J.}
\newblock On simple characterization of $k$-trees.
\newblock {\em Discrete Math.}, 7:317--322, 1974.

\bibitem[R66]{R66}
{Rose, D. J.} and {Tarjan, R. E.}
\newblock Algorithmic aspects of vertex elimination.
\newblock In {\em Proc. $7^{th}$ Annual {ACM} Symposium on Theory of
  Computing}, pages 245--254, 1975.

\bibitem[R7]{R7}
{Rose, D. J.} and {Tarjan, R. E.}
\newblock Algorithm aspects of vertex elimination on directed graphs.
\newblock {\em SIAM J. Appl. Math.}, 34(1):176--197, 1978.

\bibitem[R8]{R8}
{Rose, D. J.}, {Tarjan, R. E.}, and {Lueker, G. S.}
\newblock Algorithm aspects of vertex elimination on graphs.
\newblock {\em SIAM J. Computing}, 5(2):266--283, 1976.

\bibitem[R51]{R51}
{Rose, D. J.} and {Whitten, G. F.}
\newblock Automatic nested dissection.
\newblock In {\em Proc. {ACM} National Conference}, pages 82--88. 1974.

\bibitem[R52]{R52}
{Rose, D. J.} and {Whitten, G. F.}
\newblock A recursive analysis of dissection strategies.
\newblock In {Bunch, J. R.} and {Rose, D. J.}, editors, {\em Sparse Matrix
  Computations}, pages 59--84. Academic Press, 1976.

\bibitem[R6]{R6}
{Rose, D. J.}, {Whitten, G. F.}, {Sherman, A. H.}, and {Tarjan, R. E.}
\newblock Algorithms and software for in-core factorization of sparse symmetric
  positive definite matrices.
\newblock {\em Computer \& Structures}, 11:597--608, 1980.

\bibitem[R85]{R85}
{Rose, D. J.} and {Willoughby, R. A.}, editors.
\newblock {\em Sparse Matrices and Their Applications,}, New York, 1972. Plenum
  Press.
\newblock ({Proc. of the Conference at {IBM} Research Center, Yorktown Heights,
  Sept. 9--10, 1971}).

\bibitem[R74]{R74}
{Rosen, A.}
\newblock A new network theorem.
\newblock {\em J. IEE, London}, 62:916--918, 1924.

\bibitem[R40]{R40}
{Rosen, J. B.}
\newblock Parametric global minimization for large-scale problems.
\newblock {Tech. Report} 81-40, Computer Science Dept., Univ. of Minnesota,
  1981.

\bibitem[R39]{R39}
{Rosen, J. B.}
\newblock Global minimization of a linearly constrained concave function by
  partition of feasible domain.
\newblock {\em Math. Oper. Res.}, 8:215--230, 1983.

\bibitem[R54]{R54}
{Rosen, J. B.}, {Mangasarian, O. L.}, and {Ritter, K.}, editors.
\newblock {\em Nonlinear Programming}.
\newblock Academic Press, 1970.

\bibitem[R80]{R80}
{Rosen, R.}
\newblock Matrix bandwidth minimization.
\newblock In {\em Proc. {ACM} National Conference}, Las Vegas, Nevada, 1968.

\bibitem[R84]{R84}
{Rosenblatt, D.}
\newblock On the graphs and asymptotic forms of finite {Boolean} relation
  matrices and stochastic matrices.
\newblock {\em Naval Res. Logistics Quart.}, 4:151--167, 1957.

\bibitem[R30]{R30}
{Rosenfeld, A.} and {Kak, A.}
\newblock {\em Digital Picture Processing}.
\newblock Academic Press, 1982.

\bibitem[R78]{R78}
{Rosenfeld, J. L.}
\newblock A case study in programming for parallel processors.
\newblock {\em Comm. ACM}, 12:645--655, 1969.

\bibitem[R88]{R88}
{Ross, I. C.} and {Harary, F.}
\newblock A description of strengthening and weakening members of a group.
\newblock {\em Sociometry}, 22:139--147, 1959.

\bibitem[R79]{R79}
{Roth, J. P.}
\newblock An application of algebraic topology~: {Kron's} method of tearing.
\newblock {\em Quart. Appl. Math.}, 17:1--24, 1959.

\bibitem[R17]{R17}
{Rothberg, E.}
\newblock {\em Exploiting the Memory Hierarchy in Sequential and Parallel
  Sparse {Cholesky} Factorization}.
\newblock PhD thesis, Stanford Univ., 1993.

\bibitem[R100]{R100}
{Rothberg, E.}
\newblock Performance of panel and block approaches to sparse {Cholesky}
  factorization on the {INTEL} {iPSC/860} and {PARAGON} multicomputers.
\newblock In {\em Proc. 1994 Scalable High Performance Computing Conference
  (SHPCC '94)}, 1994.

\bibitem[R98]{R98}
{Rothberg, E.}
\newblock Alternatives for solving sparse triangular systems of equations.
\newblock {\em Parallel Computing}, 1995.
\newblock ({To be published}).

\bibitem[R18]{R18}
{Rothberg, E.}
\newblock Alternatives for solving sparse triangular systems on
  distributed-memory multiprocessors.
\newblock {\em Parallel Computing}, 21:1121--1136, 1995.

\bibitem[R11]{R11}
{Rothberg, E.} and {Gupta, A.}
\newblock Fast sparse matrix factorization on modern workstations.
\newblock {Tech. Report} STAN-CS-89-1286, Stanford Univ., 1989.

\bibitem[R16]{R16}
{Rothberg, E.} and {Gupta, A.}
\newblock Techniques for improving the performance of sparse {Cholesky}
  factorization on multiprocessor workstations.
\newblock {\em Proc. Supercomputing}, 90:232--243, 1990.

\bibitem[R19]{R19}
{Rothberg, E.} and {Gupta, A.}
\newblock Efficient sparse matrix factorization on high-performance
  workstations~: {Exploiting} the memory hierarchy.
\newblock {\em ACM Trans. Math. Software}, 17:313--334, 1991.

\bibitem[R97]{R97}
{Rothberg, E.} and {Gupta, A.}
\newblock An efficient block-oriented approach to parallel sparse {Cholesky}
  approaches to sparse {Cholesky} factorization.
\newblock {\em Supercomputing}, pages 503--512, November 1993.

\bibitem[R96]{R96}
{Rothberg, E.} and {Gupta, A.}
\newblock An evaluation of left-looking, right-looking and multifrontal
  approaches to sparse {Cholesky} factorization on hierarchical-memory
  machines.
\newblock {\em Int. J. High Speed Computing}, 5:537--593, 1993.

\bibitem[R99]{R99}
{Rothberg, E.}, {Gupta, A.}, {Ng, E.}, and {Peyton, B.}
\newblock Parallel sparse {Cholesky} factorization algorithms for shared-memory
  multiprocessor systems.
\newblock In {\em Proc. $7^{th}$ {IMACS} International Conference on Computer
  Methods for Partial Differential Equations}, 1992.

\bibitem[R29]{R29}
{Roy, M. R.}
\newblock {\em A History of Computing Technology}.
\newblock Prentice-Hall, 1985.

\bibitem[R31]{R31}
{Rubinstein, R.}
\newblock {\em Simulation and the {Monte Carlo} Method}.
\newblock John Wiley \& Sons, 1981.

\bibitem[R90]{R90}
{Russel, R. M.}
\newblock The {CRAY-1} computer system.
\newblock {\em Comm. ACM}, 21(1):63--72, 1978.

\bibitem[R69]{R69}
{Russo, P. M.}
\newblock On the time domain analysis of linear time invariant networks with
  large time constant spreads by digital computer.
\newblock {\em IEEE Trans. Circuit Theory}.

\bibitem[R12]{R12}
{Rustin, R.}, editor.
\newblock {\em Design and Optimization of Compilers}. Prentice-Hall, 1972.
\newblock ($5^{th}$ {C}ourant Computer Science Symposium).

\bibitem[R37]{R37}
{Rutishauer, H.}
\newblock Simultaneous iteration method for symmetric matrices.
\newblock {\em Numer. Math.}, 16:205--223, 1970.

\bibitem[R89]{R89}
{Rutishauser, H.}
\newblock On {Jacobi} rotation patterns.
\newblock {\em Proc. Symposia in Applied Mathematics}, 15:219--239, 1963.

\bibitem[R50]{R50}
{Ryder, B. G.}
\newblock The {PFORT} verifier.
\newblock {\em Software Practice and Experience}, 4:359--377, 1974.

\bibitem[S23]{S23}
{Saad, Y.}
\newblock {Gaussian} elimination on hypercubes.
\newblock {Tech. Report} YALEU-DCS-RR-462, Dept. of Computer Science, Yale
  Univ., 1986.

\bibitem[S103]{S103}
{Saad, Y.}
\newblock Krylov subspace methods on supercomputers.
\newblock {Tech. Report}~19, RIACS, Moffet Field, 1988.

\bibitem[S183]{S183}
{Saad, Y.}
\newblock {\em Iterative Methods for Sparse Linear Systems}.
\newblock PWS publishing, 1996.

\bibitem[S8]{S8}
{Sadayappan, P.} and {Visvanathan, V.}
\newblock Distributed sparse factorization of circuit matrices via recursive
  e-tree partitioning.
\newblock In {Lewis, J. G.} and {Gilbert, J. R.}, editors, {\em Symposium on
  Sparse Matrices}. SIAM Publications, Salishan Resort, Gleneden Beach, Oregon,
  1989.

\bibitem[S124]{S124}
{Salomaa, A.}
\newblock {\em Theory of Automata}, pages 120--123.
\newblock Pergamon Press, 1969.

\bibitem[S45]{S45}
{Saltz, J.}
\newblock Aggregation methods for solving sparse triangular systems on
  multiprocessors.
\newblock {\em SIAM J. Sci. and Stat. Comput.}, 11:123--144, 1990.

\bibitem[S38]{S38}
{Salvadori, M. G.} and {Baron, M. L.}
\newblock {\em Numerical Methods in Engineering}.
\newblock Prentice-Hall, 1961.

\bibitem[S171]{S171}
{Samples, A. D.} and {Hilfinger, P. N.}
\newblock Code reorganization for instruction caches.
\newblock {Tech. Report} UCB-CSD-88-447, Univ. of California, Berkeley, 1988.

\bibitem[S155]{S155}
{Sandberg, I. W.}
\newblock Theorems on the analysis of nonlinear transistor networks.
\newblock {\em Bell Systems Tech. Journal}, 49:95--114, 1970.

\bibitem[S141]{S141}
{Sangiovanni-Vicentelli, L.}, {Chen, K.}, and {Chua, L. O.}
\newblock An efficient heuristic cluster algorithm for tearing large-scale
  networks.
\newblock {\em IEEE Trans. Circuit and Systems}, CAS-24:709--717, 1977.

\bibitem[S150]{S150}
{Sargent, R. W. H.} and {Westerbeg, A. W.}
\newblock `{Speed-Up}' in chemical engineering design.
\newblock {\em Trans. Inst. Chem. Eng.}, 42:190--197, 1964.

\bibitem[S56]{S56}
{Sato, N.} and {Tinney, W. F.}
\newblock Techniques for exploiting the sparsity of the network admittance
  matrix.
\newblock {\em IEEE Trans. Power Apparatus and Systems}, PAS-82(12):944--950,
  1963.

\bibitem[S153]{S153}
{Saunders, M. A.}
\newblock Large-scale linear programming using the {Cholesky} factorization.
\newblock {Tech. Report} STAN-CS-72-252, Computer Science Dept., Stanford
  Univ., 1972.

\bibitem[S100]{S100}
{Saunders, M. A.}
\newblock Product form of the {Cholesky} factorization for large-scale linear
  programming.
\newblock {Tech. Report} STAN-CS-72-301, Computer Science Dept., Stanford
  Univ., 1972.

\bibitem[S123]{S123}
{Saunders, M. A.}
\newblock The complexity of {LU} updating in the simplex method.
\newblock In {Anderssen, R. S.} and {Brent, R. P.}, editors, {\em Complexity of
  Computational Problem Solving}. Queensland University Press, 1975.

\bibitem[S126]{S126}
{Saunders, M. A.}
\newblock A fast, stable implementation of the simplex method using
  {Bartels-Golub} updating.
\newblock In {Bunch, J. R.} and {Rose, D. J.}, editors, {\em Sparse Matrix
  Computations}. Academic Press, 1976.

\bibitem[S20]{S20}
{Saunders, M. A.}
\newblock Major {Cholesky} would feel proud.
\newblock {\em ORSA J. Computing}, 6(1):23--27, 1994.

\bibitem[S163]{S163}
{Saylor, P. E.}
\newblock {Richardson's} iteration with dynamic parameters and the {SIP}
  incomplete factorization for the solution of linear systems of equations.
\newblock {\em Soc. of Petroleum Eng. Journal}, pages 691--708, 1981.

\bibitem[S39]{S39}
{Scarborough, J. B.}
\newblock {\em Numerical Mathematical Analysis}.
\newblock Johns Hopkins Press, $4^{th}$ edition, 1958.

\bibitem[S158]{S158}
{Scharmer, G. B.} and {Carlsson, M.}
\newblock A new approach to multi-level non-{LTE} radiative transfer problems.
\newblock {\em J. Comput. Phys.}, 38, 1985.

\bibitem[S72]{S72}
{Schendel, U.}
\newblock {\em Introduction to Numerical Methods for Parallel Computers}.
\newblock Ellis Horwood Limited, 1984.

\bibitem[S2]{S2}
{Schendel, U.}
\newblock {\em Sparse Matrices~: Numerical Aspects with Applications for
  Scientists and Engineers}.
\newblock Halsted Press, 1989.

\bibitem[S156]{S156}
{Schiff, R.}, {Lifson, H.}, {Pekeris, C. L.}, and {Rabinowitz, P.}
\newblock $2^{1,3}p$, $3^{1,3}p$ and $4^{1,3}p$ states of {He} and the $2^1p$
  state of $li^+$.
\newblock {\em Phys. Review}, 140:A1104--A1121, 1965.

\bibitem[S78]{S78}
{Schittkowski, K.}
\newblock {\em Nonlinear Programming Codes~: Information, Tests, Performance},
  volume 183 of {\em Lecture Notes in Economics and Mathematical Systems}.
\newblock Springer-Verlag, 1980.

\bibitem[S77]{S77}
{Schittkowski, K.}
\newblock The nonlinear programming method of {Wilson}, {Han} and {Powell} with
  an augmented {Lagrangian} type line search function.
\newblock {\em Numer. Math.}, 38:83--114, 1981.

\bibitem[S76]{S76}
{Schittkowski, K.}
\newblock On the convergence of a sequential quadratic programming method with
  an augmented {Lagrangian} line search function.
\newblock {\em Mathematishe Operations Forschung und Statistik, Ser.
  Optimization}, 14:193--216, 1983.

\bibitem[S79]{S79}
{Schittkowski, K.}
\newblock {NLPQL}~: {A} {FORTRAN} subroutine solving constrained nonlinear
  programming problems.
\newblock {Working Paper}, Univ. Stuttgart, 1984.

\bibitem[S75]{S75}
{Schnabel, R. B.}
\newblock {\em Analyzing and Improving Quasi-{Newton} Methods for Unconstrained
  Optimization}.
\newblock PhD thesis, Cornell Computer Science Dept., 1977.

\bibitem[S50]{S50}
{Schnabel, R. B.}
\newblock Sequential and parallel methods for unconstrained optimization.
\newblock In {Iri, M.} and {Tanabe, K.}, editors, {\em Mathematics and Its
  Applications}, pages 227--261. Kluwer Academic Publishers, Tokyo, 1989.

\bibitem[S21]{S21}
{Schnabel, R. B.} and {Eskow, E.}
\newblock A new modified {Cholesky} factorization.
\newblock {\em SIAM J. Sci. and Stat. Comput.}, 11(6):1136--1158, 1990.

\bibitem[S67]{S67}
{Schneck, P. B.}
\newblock {\em Supercomputer Architecture}.
\newblock Kluwer Academic Publishers, 1987.

\bibitem[S84]{S84}
{Schrage, L.}
\newblock {\em Linear, Integer and Quadratic Programming with {LINDO}}.
\newblock The Scientific Press, Palo Alto, 1984.

\bibitem[S1]{S1}
{Schreiber, R.}
\newblock A new implementation of sparse {Gaussian} elimination.
\newblock {\em ACM Trans. Math. Software}, 8(3):256--276, 1982.

\bibitem[S106]{S106}
{Schreiber, R.} and {Van Loan, C. F.}
\newblock A storage efficient {WY} representation for products of {Householder}
  transformations.
\newblock {\em SIAM J. Sci. and Stat. Comput.}, 10:53--57, 1989.

\bibitem[S46]{S46}
{Schreiber, T.}
\newblock {\em Simulation using {GPSS}}.
\newblock John Wiley \& Sons, 1974.

\bibitem[S27]{S27}
{Schrijver, A.}
\newblock {\em Theory of Linear and Integer Programming}.
\newblock John Wiley \& Sons, 1986.

\bibitem[S148]{S148}
{Schubert, L. K.}
\newblock Modification of a quasi-newton method for nonlinear equations with a
  sparse {Jacobian}.
\newblock {\em Math. of Computation}, 24:27--30, 1970.

\bibitem[S51]{S51}
{Schultz, G. L.} and {Meyer, R. R.}
\newblock An interior point method for block angular optimization.
\newblock {\em SIAM J. Optimization}, 1(4):583--602, 1991.

\bibitem[S47]{S47}
{Schultz, M.}
\newblock {\em Spline Analysis}.
\newblock Prentice-Hall, 1973.

\bibitem[S132]{S132}
{Schwartz, E. S.}
\newblock An automatic sequencing procedure with application to parallel
  processing.
\newblock {\em J. ACM}, 8:513--537, 1961.

\bibitem[S133]{S133}
{Schwartz, J. T.}
\newblock Large parallel computers.
\newblock {\em J. ACM}, 13:25--32, 1966.

\bibitem[S128]{S128}
{Schwarz, H. R.}
\newblock Algorithm 183~: {Reduction} of a symmetric band matrix to triple
  diagonal form.
\newblock {\em Comm. ACM}, 6:315--316, 1963.

\bibitem[S62]{S62}
{Schwarz, H. R.}
\newblock Tridiagonalization of a symmetric band matrix.
\newblock {\em Numer. Math.}, 12:231--241, 1968.

\bibitem[S10]{S10}
{Schwarz, H. R.}, {Rutishauer, H.}, and {Stiefel, E.}
\newblock {\em Numerical Analysis of Symmetric Matrices}.
\newblock Prentice-Hall, 1973.

\bibitem[S172]{S172}
{Scott, N. R.}
\newblock {\em Computer Number Systems and Arithmetic}.
\newblock Prentice-Hall, 1985.

\bibitem[S15]{S15}
{Sedgewick, R.}
\newblock {\em Algorithms}.
\newblock Addison-Wesley, $2^{nd}$ edition, 1988.

\bibitem[S66]{S66}
{Sedgewick, R.}
\newblock {\em Algorithms in ${C}^{++}$}.
\newblock Addison-Wesley, 1992.

\bibitem[S139]{S139}
{Seodore, S.} et~al.
\newblock {SCEPTRE}~: {An} automated digital computer program for determining
  the response of electronic systems to transient nuclear radiation, volume
  {11}.
\newblock {Tech. Report} AFWL-TR-66-126, IBM Space Guidance Center, Oswego, New
  York, 1966.

\bibitem[S157]{S157}
{Sergeev, N. D.}
\newblock On a efficient scheme for solving systems of linear algebraic
  equations with sparse coefficient matrices.
\newblock {\em Sbornik Tr. Leningrad Inz-Stroit}, 57:140--151, 1968.
\newblock ({In Russian}).

\bibitem[S186]{S186}
{Sethi, R.} and {Ullman, J. D.}
\newblock The generation of optimal code for arithmetic expressions.
\newblock {\em J. ACM}, 17(4):715--728, 1970.

\bibitem[S120]{S120}
{Shamir, R.}
\newblock The efficiency of the simplex method~: {A} survey.
\newblock {\em Management Sci.}, 33:301--334, 1987.

\bibitem[S33]{S33}
{Shampine, L. F.} and {Allen, R.}
\newblock {\em Numerical Computing}.
\newblock Philadelphia, Saunders, 1973.

\bibitem[S32]{S32}
{Shampine, L. F.} and {Gordon, M. K.}
\newblock {\em Computer Solution of Ordinary Differential Equations~: The
  Initial Value Problem}.
\newblock Freeman \& Co., 1975.

\bibitem[S34]{S34}
{Shampine, L. F.}, {Watts, H. A.}, and {Davenport, S. M.}
\newblock Solving non-stiff ordinary differential equations~: {The} state of
  the art.
\newblock {\em SIAM Review}, 18:376--441, 1976.

\bibitem[S9]{S9}
{Shanno, D. F.}
\newblock On variable-metric methods for sparse hessians.
\newblock {\em Math. of Computation}, 34(150):499--514, 1980.

\bibitem[S49]{S49}
{Shanno, D. F.}
\newblock Computing {Karmarkar} projections quickly.
\newblock {\em Math. Programming}, 41:61--71, 1988.

\bibitem[S54]{S54}
{Shanno, D. F.} and {Bagchi, A.}
\newblock A unified view of interior point methods for linear programming.
\newblock {\em Annals of Oper. Res.}, 22:55--70, 1990.

\bibitem[S28]{S28}
{Shapiro, J. F.}
\newblock {\em Mathematical Programming, Structures and Algorithms}.
\newblock John Wiley \& Sons, 1979.

\bibitem[S134]{S134}
{Shedler, G. S.}
\newblock Parallel numerical methods for solution of equations.
\newblock {\em Comm. ACM}, 10:286--290, 1967.

\bibitem[S135]{S135}
{Shedler, G. S.} and {Lehman, M. M.}
\newblock Evaluation of redundancy in a parallel algorithm.
\newblock {\em IBM Systems Journal}, 6:142--149, 1967.

\bibitem[S131]{S131}
{Shekel, J.}
\newblock {\em Analysis of Linear Networks}.
\newblock PhD thesis, MIT, 1957.

\bibitem[S125]{S125}
{Sherman, A. H.}
\newblock Subroutines for envelope solution of sparse linear equations.
\newblock {Tech. Report}~35, Dept. of Computer Science, Yale Univ., 1974.

\bibitem[S6]{S6}
{Sherman, A. H.}
\newblock On the efficient solution of sparse systems of linear and non-linear
  equations.
\newblock {Tech. Report}~46, Dept. of Computer Science, Yale Univ., 1975.

\bibitem[S142]{S142}
{Sherman, A. H.}
\newblock {Y}ale {S}parse {M}atrix {P}ackage ({YSMP}) ``{User's Guide}''.
\newblock {Tech. Report} UCID-30114, Lawrence Livermore Laboratory, 1975.

\bibitem[S7]{S7}
{Sherman, A. H.}
\newblock Algorithm 533~: {NSPIV} -- {A} {FORTRAN} subroutine for sparse
  {Gaussian} elimination with partial pivoting.
\newblock {\em ACM Trans. Math. Software}, 4(4):391--398, 1978.

\bibitem[S5]{S5}
{Sherman, A. H.}
\newblock Algorithms for sparse {Gaussian} elimination with partial pivoting.
\newblock {\em ACM Trans. Math. Software}, 4(4):330--338, 1978.

\bibitem[S101]{S101}
{Sherman, J.} and {Morrison, W. J.}
\newblock Adjustment of an inverse matrix corresponding to changes in elements
  of a given column or a given row of the original matrix.
\newblock {\em Ann. Math. Stat.}, 20:621, 1949.

\bibitem[S140]{S140}
{Sherman, J.} and {Morrison, W. J.}
\newblock Adjustment of an inverse matrix corresponding to a change in one
  element of a given matrix.
\newblock {\em Ann. Math. Stat.}, 21:124--127, 1950.

\bibitem[S98]{S98}
{Shier, D. R.}
\newblock Inverting sparse matrices by tree partitioning.
\newblock {\em J. Res. Nat. Bur. Standards}, B-80(2), 1976.

\bibitem[S57]{S57}
{Shipley, R. B.} and {Coleman, D.}
\newblock A new direct matrix inversion method.
\newblock {\em IEEE Trans. Power Apparatus and Systems}, PAS-78(11):568--572,
  1959.

\bibitem[S149]{S149}
{Shirey, R. W.}
\newblock {\em Implementation and Analysis of Efficient Graph Planarity Testing
  Algorithms}.
\newblock PhD thesis, Univ. Wisconsin, Madison, 1969.

\bibitem[S121]{S121}
{Shor, N. Z.}
\newblock Utilization of the operation of space dilatation in the minimization
  of convex functions.
\newblock {\em Cybernetics}, 6:7--15, 1970.
\newblock ({Russian original published at Kibernetika, 1:6--12}).

\bibitem[S73]{S73}
{Shor, N. Z.}
\newblock {\em Minimization Methods for Non-Differentiable Functions}.
\newblock Springer-Verlag, 1985.

\bibitem[S80]{S80}
{Shultz, G.}, {Schnabel, R.}, and {Byrd, R.}
\newblock A family of trust-region-based algorithms for unconstrained
  minimization with strong global convergence properties.
\newblock {\em SIAM J. Numer. Anal.}, 22:47--67, 1985.

\bibitem[S173]{S173}
{Shurkin, J.}
\newblock {\em Engines of the Mind~: {A} History of the Computer}.
\newblock W. W. Norton, New York, 1984.

\bibitem[S130]{S130}
{SIAM}.
\newblock {Special Issue in honor of A. S. Householder}.
\newblock {SIAM J. Numer. Anal., 7(4)}, 1970.

\bibitem[S52]{S52}
{SIAM}.
\newblock {Special Addendum} on {P}arallel {P}rocessing.
\newblock {SIAM J. Sci. and Stat. Comput., 8(1):s1-s227}, 1987.

\bibitem[S88]{S88}
{SIAM}.
\newblock {Special Section} on {Sparse Matrices}.
\newblock {SIAM J. Matrix Anal. Appl., 11(3)}, 1990.
\newblock From page 381. (Selection of works presented at {Symposium on Sparse
  Matrices, Salishan Resort, Gleneden Beach, Oregon, 1989}, promoted by {SIAM
  Activity Group on Linear Algebra}, chaired by {Lewis, J. G., Gilbert, J. R.,
  Plemmons, R. J., Simon, H. D.}).

\bibitem[S87]{S87}
{SIAM}.
\newblock {Special Issue} dedicated to {Gene Golub} on the occasion of his
  $60^{th}$ birthday.
\newblock {SIAM J. Matrix Anal. Appl., 13(1)}, 1992.

\bibitem[S53]{S53}
{SIAM}.
\newblock {Special Issue} on {Iterative Solution of Linear Systems}.
\newblock {SIAM J. Sci. and Stat. Comput., 13(1)}, 1992.

\bibitem[S109]{S109}
{SIAM}.
\newblock {\em Proc. $4^{th}$ {ACM/SIAM} Symposium on Discrete Algorithms}.
\newblock SIAM Publications, Austin, Texas, 1993.

\bibitem[S110]{S110}
{SIAM}.
\newblock {\em Proc. $5^{th}$ {ACM/SIAM} Symposium on Discrete Algorithms}.
\newblock SIAM Publications, Arlington, Virginia, 1994.

\bibitem[S111]{S111}
{SIAM}.
\newblock {\em Proc. $6^{th}$ {ACM/SIAM} Symposium on Discrete Algorithms}.
\newblock SIAM Publications, San Francisco, California, 1995.

\bibitem[S86]{S86}
{Siegel, S.}
\newblock {\em Nonparametric Statistics for the Behavioral Sciences}.
\newblock McGraw-Hill, 1956.

\bibitem[S185]{S185}
{SILICON GRAPHICS, INC.}
\newblock {\em Power ${C}$ ``{User's Guide}''}.

\bibitem[S95]{S95}
{Simon, H. D.}
\newblock Bounds for the dominant eigenvector of a graph.
\newblock {Tech. Report}, Dept. of Applied Mathematics, State Univ. of New
  York, Stony Brook, 1982.

\bibitem[S161]{S161}
{Simon, H. D.}
\newblock The {Lanczos} algorithm with partial reorthogonalization.
\newblock {\em Math. of Computation}, 42:115--142, 1984.

\bibitem[S164]{S164}
{Simon, H. D.}
\newblock Incomplete {LU} preconditioned conjugate-gradient-like methods in
  reservoir simulation.
\newblock In {\em Proc. $8^{th}$ {SPE} Symposium on Reservoir Simulation},
  Dallas, Texas, 1985.

\bibitem[S24]{S24}
{Simon, H. D.}, {Vu, P.}, and {Yang, C.}
\newblock Performance of a supernodal general sparse solver on the {CRAY}
  {Y-MP}.
\newblock {Tech. Report} SCA-TR-117, Boeing Computer Services, Seattle,
  Washington, 1989.

\bibitem[S104]{S104}
{Simon, H. D.}, {Vu, P.}, and {Yang, C.}
\newblock Performance of a supernodal general sparse solver on the {CRAY
  Y-MP}~: 1.68 {GigaFlops} with autotasking.
\newblock {Tech. Report} SCA-TR-117, Boeing Computer Services, Seattle,
  Washington, 1989.

\bibitem[S127]{S127}
{Simonnard, M.}
\newblock {\em Linear Programming}.
\newblock Prentice-Hall, 1966.
\newblock ({Translated by Jewell, W. S. from the original, Dunod, Paris,
  1962}).

\bibitem[S152]{S152}
{Sites, R. L.}
\newblock {ALGOL W} ``{Reference Manual}''.
\newblock {Report} STAN-CS-71-230, Computer Science Dept., Stanford Univ.,
  1972.

\bibitem[S174]{S174}
{Sites, R. L.}
\newblock How to use 1000 registers.
\newblock In {\em Caltech Conference on {VLSI}}, 1979.

\bibitem[S114]{S114}
{Sites, R. L.}
\newblock Instruction ordering for the {CRAY-1} computer.
\newblock {Tech. Report} 78-CS-023, Dept. of Computer Science, Univ.
  California, San Diego, 1979.

\bibitem[S162]{S162}
{Slater, P. B.}
\newblock Migration regions of the united states~: {Two} county-level 1965--70
  analyses.
\newblock {Report}, Community and Organization Research Institute, Univ. of
  California, Santa Barbara, 1983.

\bibitem[S89]{S89}
{Sleator, D. D.} and {Tarjan, R. E.}
\newblock A data structure for dynamic trees.
\newblock {\em J. Comput. System Sci.}, 24, 1983.
\newblock (Also published at {Proc. $13^{th}$ Annual ACM Symposium on
  Foundations of Computing, pages 114--122, 1981}).

\bibitem[S90]{S90}
{Sleator, D. D.} and {Tarjan, R. E.}
\newblock Self-adjusting binary trees.
\newblock In {\em Proc. $15^{th}$ Annual ACM Symposium on Foundations of
  Computing}, pages 235--245, 1983.

\bibitem[S14]{S14}
{Sleator, D. D.} and {Tarjan, R. E.}
\newblock Self-adjusting heaps.
\newblock {\em SIAM J. Computing}, 15(1):52--69, 1986.

\bibitem[S184]{S184}
{Sloan, S. W.}
\newblock An algorithm for profile and wavefront reduction of sparse matrices.
\newblock {\em Int. J. Numer. Meth. Eng.}, 23:239--251, 1986.

\bibitem[S112]{S112}
{Smale, S.}
\newblock On the average number of steps of the simplex method of linear
  programming.
\newblock {\em Math. Programming}, 27:241--262, 1983.

\bibitem[S175]{S175}
{Smith, A. J.}
\newblock Cache memories.
\newblock {\em ACM Computing Surveys}, 14(3):473--530, 1982.

\bibitem[S176]{S176}
{Smith, A. J.}
\newblock Bibliography and readings on {CPU} cache memories and related topics.
\newblock {\em Computer Architecture News}, pages 22--42, January 1986.

\bibitem[S115]{S115}
{Smith, A. J.} and {Lee, J.}
\newblock Branch prediction strategies and branch target buffer design.
\newblock {\em Computer}, 17(1):6--22, 1984.

\bibitem[S41]{S41}
{Smith, B. T.}, {Boyle, J. M.}, {Dongarra, J. J.}, {Garbow, B. S.}, {Ikebe,
  Y.}, {Klema, V. C.}, and {Moler, C. B.}
\newblock {\em Matrix Eigensystem Routines~: {EISPACK} Guide}, volume~6 of {\em
  Lecture Notes in Computer Science}.
\newblock Springer-Verlag, 1976.

\bibitem[S151]{S151}
{Smith, D. M.}
\newblock Data logistics for matrix inversion.
\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[S129]{S129}
{Smith, D. M.} and {Orchard-Hays, W.}
\newblock Computational efficiency in product form {LP} codes.
\newblock In {Graves, R. L.} and {Wolfe, P.}, editors, {\em Recent Advances in
  Mathematical Programming}. McGraw-Hill, 1963.

\bibitem[S116]{S116}
{Smith, J. E.}
\newblock A study of branch prediction strategies.
\newblock In {\em Proc. $8^{th}$ Symposium on Computer Architecture}, pages
  135--148, Minneapolis, 1981.

\bibitem[S117]{S117}
{Smith, J. E.}
\newblock Decoupled access/execute computer architectures.
\newblock {\em ACM Trans. Computer Systems}, 2(4):289--308, 1984.

\bibitem[S118]{S118}
{Smith, J. E.}
\newblock Dynamic instruction scheduling and the {ASTRONAUTICS ZS-1}.
\newblock {\em Computer}, 22(7):21--35, 1989.

\bibitem[S119]{S119}
{Smith, M. D.}, {Johnson, M.}, and {Horowitz, M. A.}
\newblock Limits on multiple instruction issue.
\newblock In {\em Proc. $3^{rd}$ Conference on Architectural Support for
  Programming Languages and Operating Systems}, pages 290--302, Boston, 1989.
  IEEE/ACM.

\bibitem[S58]{S58}
{Smith, O. J. M.} et~al.
\newblock Sparse solutions using hash storage.
\newblock {\em IEEE Trans. Power Apparatus and Systems}, PAS-91:1396--1404,
  1972.

\bibitem[S96]{S96}
{Smyth, W. F.}
\newblock Algorithms for the reduction of matrix bandwidth and profile.
\newblock {\em J. Comp. Appl. Math.}, 12/13:551--561, 1985.

\bibitem[S99]{S99}
{Smyth, W. F.} and {Benzi, W. M. L.}
\newblock An algorithm for finding the diameter of a graph.
\newblock In {\em {IFIP} Congress '74}, pages 500--503. North-Holland, 1974.

\bibitem[S159]{S159}
{Smyth, W. F.} and {Dunn, J.}
\newblock Results of tests on matrix bandwidth and profile reduction
  algorithms.
\newblock {Report}, Dept. of Computer Science and Systems, McMaster Univ.,
  Ontario, Canada, 1986.

\bibitem[S93]{S93}
{Solovay, R.} and {Strassen, V.}
\newblock A fast monte-carlo test for primality.
\newblock {\em SIAM J. Comput.}, 6:84--85, 1977.

\bibitem[S167]{S167}
{Sonnevend, G.}
\newblock {\em An `Analytic Center' for Polyhedrons and New Classes of Global
  Algorithms for Linear, Smooth, Convex Programming}, volume~84 of {\em Lecture
  Notes in Control Inform. Sci.}, pages 866--876.
\newblock Springer-Verlag, Budapest, 1986.

\bibitem[S168]{S168}
{Sonnevend, G.}
\newblock New algorithms in convex programming based on a notion of `centre'
  for systems of analytic inequalities and on rational extrapolation.
\newblock In {Hoffman, K. H.}, {Hiriart-Urruty, J. B.}, {Lemarechal, C.}, and
  {Zowe, J.}, editors, {\em Trends in Mathematical Optimization}, pages
  311--327. Birkh{\"a}user Verlag, 1988.

\bibitem[S169]{S169}
{Sonnevend, G.}
\newblock Global ellipsoidal approximations and homotopy methods for solving
  convex analytic programs.
\newblock {\em Appl. Math. Optim.}, 21:139--166, 1990.

\bibitem[S81]{S81}
{Sorensen, D. C.}
\newblock {\em Updating the Symmetric Indefinite Factorization with
  Applications in a Modified {Newton's} Method}.
\newblock PhD thesis, Univ. of California, San Diego, 1977.

\bibitem[S82]{S82}
{Sorensen, D. C.}
\newblock {Newton's} method with a model trust region modification.
\newblock {\em SIAM J. Numer. Anal.}, 19:409--426, 1982.

\bibitem[S83]{S83}
{Sorensen, D. C.}
\newblock Trust region methods for unconstrained minimization.
\newblock In {Powell, M. J. D.}, editor, {\em Nonlinear Optimization 1981}.
  Academic Press, 1982.

\bibitem[S105]{S105}
{Sorensen, D. C.} and {Van Loan, C.}
\newblock Block factorizations for symmetric indefinite matrices.
\newblock ({Cornell Tech. Report} in preparation).

\bibitem[S143]{S143}
{Souriau, J. M.}
\newblock {\em Calcul Lin\'eaire}.
\newblock 1959.

\bibitem[S177]{S177}
{SPEC}.
\newblock Benchmark suite release 1.0, 1989.

\bibitem[S26]{S26}
{Spedicato, E.}, editor.
\newblock {\em Algorithms for Continuous Optimization~: The State of the Art},
  volume 434 of {\em {NATO} {ASI} {Series} {C} -- {Mathematical} and Physical
  Sciences}.
\newblock Kluwer Academic Publishers, 1988.

\bibitem[S25]{S25}
{Speelpenning, B.}
\newblock The generalized element method.
\newblock {Tech. Report} UIUC-DCS-R-78-946, Dept. of Computer Science, Univ. of
  Illinois, Urbana, 1978.

\bibitem[S37]{S37}
{Spiegel, M. R.}
\newblock {\em Mathematical Handbook of Formulas and Tables}.
\newblock McGraw-Hill, 1968.

\bibitem[S138]{S138}
{Spillers, W. R.}
\newblock Network techniques applied to structures.
\newblock {\em Matrix Tensor Quart.}, 15:31--41, 1964.

\bibitem[S136]{S136}
{Spillers, W. R.}
\newblock On diakoptics~: {Tearing} and arbitrary system.
\newblock {\em Quart. Appl. Math.}, 23:188--190, 1965.

\bibitem[S137]{S137}
{Spillers, W. R.} and {Hickerson, N.}
\newblock Optimal elimination of sparse symmetric systems as a graph problem.
\newblock {\em Quart. Appl. Math.}, 26:425--432, 1968.

\bibitem[S94]{S94}
{Spira, P. M.} and {Pan, A.}
\newblock On finding and updating spanning trees and shortest paths.
\newblock {\em SIAM J. Comput.}, 4:375--380, 1975.

\bibitem[S22]{S22}
{Springer, J.}
\newblock Exact solution of general integer systems of linear equations.
\newblock {\em ACM Trans. Math. Software}, 12(1):51--61, 1986.

\bibitem[S35]{S35}
{Squire, W.}
\newblock {\em Integration for Engineers and Scientists}.
\newblock Modern Analytic and Computational Methods in Science and Mathematics.
  Elsevier Publishing Co., 1970.
\newblock {Bellmann, R.}, editor.

\bibitem[K8]{K8}
{Sreenivasa Kumar, P.}, {Kishore Kumar, M.}, and {Basu, A.}
\newblock A parallel algorithm for elimination tree computation and symbolic
  factorization.
\newblock {\em Parallel Computing}, 18:849--856, 1992.

\bibitem[K9]{K9}
{Sreenivasa Kumar, P.}, {Kishore Kumar, M.}, and {Basu, A.}
\newblock Parallel algorithms for sparse triangular system solution.
\newblock {\em Parallel Computing}, 19:187--196, 1993.

\bibitem[S60]{S60}
{Stagg, G. W.} and {El-Abaid, A. H.}
\newblock {\em Computer Methods in Power Systems Analysis}.
\newblock McGraw-Hill, 1968.

\bibitem[S91]{S91}
{Standish, T. A.}
\newblock {\em Data Structure Techniques}.
\newblock Addison-Wesley, 1980.

\bibitem[S43]{S43}
{Stark, P. A.}
\newblock {\em Introduction to Numerical Methods}.
\newblock Macmillan, 1970.

\bibitem[S170]{S170}
{Steenrod, N.}
\newblock {\em The Topology of Fibre Bundles}.
\newblock Princeton University Press, 1950.

\bibitem[S36]{S36}
{Steffensen, J. F.}
\newblock {\em Interpolation}.
\newblock Chelsea Publishing, $2^{nd}$ edition, 1950.
\newblock ({First edition, 1927}).

\bibitem[S48]{S48}
{Sterbenz, P.}
\newblock {\em Floating Point Computation}.
\newblock Prentice-Hall, 1974.

\bibitem[S180]{S180}
{Stern, N.}
\newblock Who invented the first electronic digital computer.
\newblock {\em Annals of the History of Computing}, 2(4):375--376, 1980.

\bibitem[S122]{S122}
{Steward, D. V.}
\newblock On an approach to techniques for the analysis of the structure of
  large systems of equations.
\newblock {\em SIAM Review}, 4:321--342, 1962.

\bibitem[S61]{S61}
{Steward, D. V.}
\newblock Partitioning and tearing systems of equations.
\newblock {\em SIAM J. Numer. Anal.}, 2:345--365, 1965.

\bibitem[S102]{S102}
{Steward, D. V.}
\newblock Tearing analysis of the structure of disorderly sparse matrices.
\newblock In {Willoughby, R.}, editor, {\em Proc. of the Symposium on Sparse
  Matrices and their Applications}, pages 65--75, Yorktown Heights, 1969.

\bibitem[S146]{S146}
{Steward, D. V.}
\newblock {\em The Analysis of the Structure of Systems}.
\newblock PhD thesis, Univ. Wisconsin, Madison, 1973.

\bibitem[S3]{S3}
{Stewart, G. W.}
\newblock {\em Introduction to Matrix Computations}.
\newblock Academic Press, 1973.

\bibitem[S4]{S4}
{Stewart, G. W.}
\newblock Modifying pivot elements in {Gaussian} elimination.
\newblock {\em Math. of Computation}, 28:537--542, 1974.

\bibitem[S154]{S154}
{Stewart, G. W.}
\newblock The numerical treatment of large eigenvalue problems.
\newblock In {\em Proc. 1974 {IFIP} Congress}, pages 666--672. North-Holland,
  Amsterdam, 1974.

\bibitem[S107]{S107}
{Stewart, G. W.}
\newblock A bibliographical tour of the large sparse generalized eigenvalue
  problem.
\newblock In {Bunch, J. R.} and {Rose, D. J.}, editors, {\em Sparse Matrix
  Computations}. Academic Press, 1976.

\bibitem[S63]{S63}
{Stewart, G. W.}
\newblock Simultaneous iteration for computing invariant subspaces of
  non-{Hermitian} matrices.
\newblock {\em Numer. Math.}, 25:123--136, 1976.

\bibitem[S69]{S69}
{Stewart, G. W.}
\newblock On the perturbation of pseudo-inverses, projections and linear least
  squares problems.
\newblock {\em SIAM Review}, 19:634--662, 1977.

\bibitem[S113]{S113}
{Stewart, G. W.}
\newblock On scaled projection for pseudo-inverses.
\newblock {\em Lin. Alg. Appl.}, 112:189--193, 1989.

\bibitem[S108]{S108}
{Stewart, G. W.}
\newblock {\em Afternotes on Numerical Analysis}.
\newblock SIAM Publications, 1996.
\newblock (To be published).

\bibitem[S44]{S44}
{Stiefel, E. L.}
\newblock {\em An Introduction to Numerical Mathematics}.
\newblock Academic Press, 1963.

\bibitem[S42]{S42}
{Stoer, J.} and {Bulirsch, R.}
\newblock {\em Introduction to Numerical Analysis}.
\newblock Springer-Verlag, 1980.

\bibitem[S147]{S147}
{Stone, H. L.}
\newblock Iterative solution of implicit approximations of multidimensional
  partial differential equations.
\newblock {\em SIAM J. Numer. Anal.}, 5:530--558, 1968.

\bibitem[S13]{S13}
{Stone, H. S.}
\newblock Parallel tridiagonal equation solvers.
\newblock {\em ACM Trans. Math. Software}, 1(4):289--307, 1975.

\bibitem[S12]{S12}
{Stone, H. S.}
\newblock {\em High Performance Computer Architecture}.
\newblock Addison-Wesley, $2^{nd}$ edition, 1990.

\bibitem[S19]{S19}
{Storer, J. A.}
\newblock {\em Data Compression~: Methods and Theory}.
\newblock Computer Science Press, 1988.

\bibitem[S74]{S74}
{Stot, B.}
\newblock Power system dynamic response calculations.
\newblock {\em Proc. of the IEEE}, 67:219--241, 1979.

\bibitem[S68]{S68}
{Stott, B.} and {Alsa\c c, O.}
\newblock Fast decoupled load-flow.
\newblock {\em IEEE Trans. Power Apparatus and Systems}, PAS-93:859--869, 1974.

\bibitem[S70]{S70}
{Stott, B.} and {Alsa\c c, O.}
\newblock An overview of sparse matrix techniques for on-line network
  applications.
\newblock In {\em Proc. {IFAC} Symposium on Power Systems and Power Plant
  Control}, pages 17--23, Beijing, China, 1986.

\bibitem[S59]{S59}
{Stott, B.} and {Hobson, E.}
\newblock Solution of large power systems networks by ordered elimination.
\newblock {\em Proc. of the Institution of Electrical Engineers},
  118(1):125--134, 1971.

\bibitem[S85]{S85}
{Stotts, P. D. Jr.}
\newblock A comparative survey of concurrent programming languages.
\newblock {\em SIGPLAN Notices}, 17(9):76--87, 1982.

\bibitem[S97]{S97}
{Straffin, P. D.}
\newblock Linear algebra in geography~: {Eigenvector} networks.
\newblock {\em Math. Mag.}, 53:269--276, 1980.

\bibitem[S182]{S182}
{Strang, G.} and {Nguyen, T.}
\newblock {\em Wavelets and Filter Banks}.
\newblock Wellesley-Cambridge Press, 1996.

\bibitem[S11]{S11}
{Strang, G. W.}
\newblock {\em Linear Algebra and its Applications}.
\newblock Academic Press, $2^{nd}$ edition, 1980.

\bibitem[S40]{S40}
{Strang, G. W.} and {Fix, G. J.}
\newblock {\em An Analysis of the Finite Element Method}.
\newblock Prentice-Hall, 1973.

\bibitem[S18]{S18}
{Strassen, V.}
\newblock {Gaussian} elimination is not optimal.
\newblock {\em Numer. Math.}, 13:354--356, 1969.

\bibitem[S178]{S178}
{Strecker, W. D.}
\newblock Cache memories for the {PDP-11}~?
\newblock In {\em Proc. $3^{rd}$ Annual Symposium on Computer Architecture},
  pages 155--158, Pittsburgh, 1976.

\bibitem[S179]{S179}
{Strecker, W. D.}
\newblock {VAX-11/780}~: {A} virtual address extension to the {PDP-11} family.
\newblock In {\em Proc. {AFIPS} National Computer Conference, 47}, pages
  967--980, 1978.

\bibitem[S31]{S31}
{Stroud, A. H.}
\newblock {\em Approximate Calculation of Multiple Integrals}.
\newblock Prentice-Hall, 1972.

\bibitem[S29]{S29}
{Stroud, A. H.}
\newblock {\em Numerical Quadrature and Solution of Ordinary Differential
  Equations}.
\newblock Springer-Verlag, 1974.

\bibitem[S30]{S30}
{Stroud, A. H.} and {Secrest, D.}
\newblock {\em {Gaussian} Quadrature Formulas}.
\newblock Prentice-Hall, 1966.

\bibitem[S64]{S64}
{Stroustrup, B.}
\newblock The ${C}^{++}$ {P}rogramming {L}anguage.

\bibitem[S65]{S65}
{Stroustrup, B.} and {Ellis, M.}
\newblock {\em The Annotated ${C}^{++}$ Reference Manual}.
\newblock Addison-Wesley, 1990.

\bibitem[S181]{S181}
{Stubbs, D. F.} and {Webre, N. W.}
\newblock {\em Data Structures with Abstract Data Types and {PASCAL}}.
\newblock Brooks/Cole Publishing, Monterey, CA, 1985.

\bibitem[S55]{S55}
{Suhl, U. H.} and {Suhl, L. M.}
\newblock Computing sparse {LU} factorizations for large-scale linear
  programming bases.
\newblock {\em ORSA J. Computing}, 2:325--335, 1990.

\bibitem[S166]{S166}
{SUN}.
\newblock {\em The {SPARC} ``{Architecture Manual}'', version {8}}.
\newblock SUN Microsystems, 1989.
\newblock {Part 800-1399-09}.

\bibitem[S92]{S92}
{Swamy, M. N. S.} and {Thulasiraman, K.}
\newblock {\em Graphs, Networks, and Algorithms}.
\newblock John Wiley \& Sons, 1981.

\bibitem[S165]{S165}
{Swartz, J. T.}
\newblock Ultracomputers.
\newblock {\em ACM Trans. Programming Languages and Systems}, 4(2):484--521,
  1980.

\bibitem[S144]{S144}
{Swarztrauber, P. N.} and {Sweet, R. A.}
\newblock Efficient {FORTRAN} subprograms for the solution of elliptic partial
  differential equations.
\newblock {Tech. Report}, National Center of Atmospheric Research, Boulder,
  1975.

\bibitem[S145]{S145}
{Swift, G.}
\newblock A comment on matrix inversion by partitioning.
\newblock {\em SIAM Review}, 2:132--133, 1960.

\bibitem[S17]{S17}
{Syslo, M.}, {Deo, N.}, and {Kowalik, J.}
\newblock {\em Discrete Optimization Algorithms with {PASCAL} Programs}.
\newblock Prentice-Hall, 1983.

\bibitem[S16]{S16}
{Szwarcfiter, J. L.} and {Markenzon, L.}
\newblock Estruturas de dados e seus algoritmos.
\newblock In {\em {I} Escola Brasileira de Otimiza\c c\~ao}, Rio de Janeiro,
  1989.

\bibitem[S71]{S71}
{Szwarficter, J. L.} and {Barroso, M.}
\newblock Enumerating the maximal cliques of circle graphs.
\newblock In {Chung, R. F. K.}, {Graham, R. L.}, and {Hsu, D. F.}, editors,
  {\em Graph Theory, Combinatorics, Algorithms and Applications}, pages
  511--517. SIAM Publications, 1991.

\bibitem[S160]{S160}
{Szyld, D. B.}
\newblock Using sparse matrix techniques to solve a model of the world economy.
\newblock In {Duff, I. S.}, editor, {\em Sparse Matrices and Their Uses}, pages
  357--365. Academic Press, 1981.

\bibitem[T72]{T72}
{Takagi, N.}, {Yasuura, H.}, and {Yajima, S.}
\newblock High speed {VLSI} multiplication algorithm with a redundant binary
  addition tree.
\newblock {\em IEEE Trans. Comput.}, C-34(9):789--796, 1985.

\bibitem[T73]{T73}
{Tanenbaum, A. S.}
\newblock Implications of structured programming for machine architecture.
\newblock {\em Comm. ACM}, 21(3):237--246, 1978.

\bibitem[T14]{T14}
{Tanenbaum, A. S.}
\newblock {\em Structured Computer Organization}.
\newblock Prentice-Hall, $3^{rd}$ edition, 1991.

\bibitem[T51]{T51}
{Tardos, E.}
\newblock A strongly polynomial algorithm to solve combinatorial linear
  programs.
\newblock {\em Operations Res.}, 35:250--256, 1986.

\bibitem[T37]{T37}
{Tarjan, R. E.}
\newblock Updating a balanced search tree in ${O}(1)$ rotations.
\newblock (Published at {Inform. Proc. Letters}).

\bibitem[T13]{T13}
{Tarjan, R. E.}
\newblock An efficient planarity algorithm.
\newblock {Tech. Report} 244, Computer Science Dept., Stanford Univ., 1971.

\bibitem[T12]{T12}
{Tarjan, R. E.}
\newblock Deep-first search and linear graph algorithms.
\newblock {\em SIAM J. Computing}, 1:146--160, 1972.

\bibitem[T32]{T32}
{Tarjan, R. E.}
\newblock Finding dominators in directed graphs.
\newblock {\em SIAM J. Comput.}, 3:62--89, 1974.

\bibitem[T11]{T11}
{Tarjan, R. E.}
\newblock Efficiency of a good but not linear set union algorithm.
\newblock {\em J. ACM}, 22(2):215--225, 1975.

\bibitem[T59]{T59}
{Tarjan, R. E.}
\newblock Graph theory and {Gaussian} elimination.
\newblock In {Bunch, J. R.} and {Rose, D. J.}, editors, {\em Sparse Matrix
  Computations}. Academic Press, 1976.

\bibitem[T33]{T33}
{Tarjan, R. E.}
\newblock Finding optimum branchings.
\newblock {\em Networks}, 7:25--35, 1977.

\bibitem[T34]{T34}
{Tarjan, R. E.}
\newblock Complexity of combinatorial algorithms.
\newblock {\em SIAM Review}, 20:457--491, 1978.

\bibitem[T31]{T31}
{Tarjan, R. E.}
\newblock Applications of path compression on balanced trees.
\newblock {\em J. ACM}, 26:690--715, 1979.

\bibitem[T10]{T10}
{Tarjan, R. E.}
\newblock A class of algorithms which require nonlinear time to maintain
  disjoint sets.
\newblock {\em J. of Computer and System Sciences}, 18:110--127, 1979.

\bibitem[T39]{T39}
{Tarjan, R. E.}
\newblock Recent developments in the complexity of combinatorial algorithms.
\newblock In {\em Proc. $5^{th}$ IBM Symposium on Mathematical Foundations of
  Computer Science}, pages 1--28, Tokyo, 1980.

\bibitem[T35]{T35}
{Tarjan, R. E.}
\newblock A unified approach to path problems.
\newblock {\em J. ACM}, 28:577--593, 1981.

\bibitem[T36]{T36}
{Tarjan, R. E.}
\newblock Sensitivity analysis of minimum spanning trees and shortest path
  trees.
\newblock {\em Inform. Proc. Letters}, 14:30--33, 1982.

\bibitem[T8]{T8}
{Tarjan, R. E.}
\newblock {\em Data Structures and Network Algorithms}.
\newblock SIAM Publications, 1983.

\bibitem[T7]{T7}
{Tarjan, R. E.}
\newblock Space-efficient implementations of graph search methods.
\newblock {\em ACM Trans. Math. Software}, 9(3):326--339, 1983.

\bibitem[T9]{T9}
{Tarjan, R. E.}
\newblock Amortized computational complexity.
\newblock {\em SIAM J. Alg. and Discr. Meth.}, 6(2):306--318, 1985.

\bibitem[T38]{T38}
{Tarjan, R. E.} and {van Leeuwen, J.}
\newblock Worst-case analysis of set union algorithms.
\newblock (Published at {J. ACM}).

\bibitem[T40]{T40}
{Tarjan, R. E.} and {Yannakakis, M.}
\newblock Simple linear-time algorithms to test chordality of graphs, test
  acyclicity of hipergraphs, and selectively reduce acyclic hypergraphs.
\newblock {\em SIAM J. Comput.}, 13:566--579, 1984.

\bibitem[T74]{T74}
{Taylor, G. S.}
\newblock Compatible hardware for division and square root.
\newblock In {\em Proc. $5^{th}$ {IEEE} Symposium on Computer Arithmetic},
  pages 127--134, 1981.

\bibitem[T75]{T75}
{Taylor, G. S.}
\newblock Radix 16 {SRT} dividers with overlapped quotient selection stages.
\newblock In {\em Proc. $7^{th}$ {IEEE} Symposium on Computer Arithmetic},
  pages 64--71, 1985.

\bibitem[T1]{T1}
{Terry, L. A.} and {Pereira, M. V. F.}
\newblock Tratamento de sistemas lineares esparsos.
\newblock {Relat\'orio Interno} {Projeto} 7167, Centro de Pesquisas em Energia
  El\'etrica (CEPEL), Rio de Janeiro, 1980.

\bibitem[T53]{T53}
{Tewarson, R. P.}
\newblock On the product form of inverses of sparse matrices.
\newblock {\em SIAM Review}, 8:336--342, 1966.

\bibitem[T6]{T6}
{Tewarson, R. P.}
\newblock On the product form of inverses of sparse matrices and graph theory.
\newblock {\em SIAM Review}, 9(1):91--99, 1967.

\bibitem[T43]{T43}
{Tewarson, R. P.}
\newblock Row-column permutation of sparse matrices.
\newblock {\em Computing J.}, 10:300--305, 1967.

\bibitem[T57]{T57}
{Tewarson, R. P.}
\newblock Solution of a system of simultaneous linear equations with a sparse
  coefficient matrix by elimination methods.
\newblock {\em BIT}, 7:226--239, 1967.

\bibitem[T64]{T64}
{Tewarson, R. P.}
\newblock On computing generalized inverses.
\newblock {\em Computing}, 1968.

\bibitem[T56]{T56}
{Tewarson, R. P.}
\newblock On the orthonormalization of sparse vectors.
\newblock {\em Computing}, 3:268--279, 1968.

\bibitem[T54]{T54}
{Tewarson, R. P.}
\newblock The {Crout} reduction for sparse matrices.
\newblock {\em Computing J.}, 12:158--159, 1969.

\bibitem[T22]{T22}
{Tewarson, R. P.}
\newblock Computation with sparse matrices.
\newblock {\em SIAM Review}, 12(4):523--543, 1970.

\bibitem[T44]{T44}
{Tewarson, R. P.}
\newblock Sorting and ordering sparse linear systems.
\newblock In {Reid, J. K.}, editor, {\em Large Sparse Sets of Linear
  Equations}, pages 151--168. Academic Press, 1971.

\bibitem[T5]{T5}
{Tewarson, R. P.}
\newblock {\em Sparse Matrices}.
\newblock Academic Press, 1973.

\bibitem[T55]{T55}
{Tewarson, R. P.} and {Cheng, K. Y.}
\newblock A desirable form for sparse matrices when computing their inverses in
  factored forms.
\newblock {\em Computing}, 9, 1972.

\bibitem[T71]{T71}
{Thorelli, L. E.}
\newblock An algorithm for computing all paths in a graph.
\newblock {\em BIT}, 6:347--349, 1966.

\bibitem[T45]{T45}
{Thorlin, J. F.}
\newblock Code generation for {PIE} (parallel instruction execution) computers.
\newblock In {\em Proc. Spring Joint Computer Conference}, Atlantic City, 1967.

\bibitem[T46]{T46}
{Thornton, J. E.}
\newblock Parallel operation in the {CONTROL DATA 6600}.
\newblock In {\em Proc. Fall Joint Computer Conference}, pages 26, 33--40,
  1964.

\bibitem[T47]{T47}
{Thornton, J. E.}
\newblock {\em Design of a Computer~: {The} {CONTROL DATA 6600}}.
\newblock Scott, Foresman, Glenview, Illinois, 1970.

\bibitem[T65]{T65}
{Thurnau, D.}
\newblock Algorithm 195~: {BANDSOLVE}.
\newblock {\em Comm. ACM}, 6:441, 1963.

\bibitem[T63]{T63}
{Tinney, W. F.}
\newblock Notes on network solutions by ordered triangular factorization.
\newblock {Bonneville, Power Administration, P.O. Box 3621, Portland, Oregon
  97208}.

\bibitem[T62]{T62}
{Tinney, W. F.}
\newblock Optimal ordering for sparsely coupled subnetworks.
\newblock {Bonneville, Power Administration, P.O. Box 3621, Portland, Oregon
  97208}, 1968.

\bibitem[T3]{T3}
{Tinney, W. F.}
\newblock Comments on using sparsity techniques for power systems problems.
\newblock In {Willoughby, R. A.}, editor, {\em Proc. of the Symposium on Sparse
  Matrices and their Applications}, pages 25--34, Yorktown Heights, 1969.
\newblock ({RAI 3-12-69}).

\bibitem[T70]{T70}
{Tinney, W. F.}
\newblock Some example of sparse matrix methods for power network problems.
\newblock (Presented at {Power Systems Computation Conference, Rome}), 1969.

\bibitem[T24]{T24}
{Tinney, W. F.}
\newblock Some examples of sparse matrix methods for power network problems.
\newblock In {\em Power System Computation Conference}, Rome, 1969.

\bibitem[T68]{T68}
{Tinney, W. F.}
\newblock Compensation methods for network solutions by optimally ordered
  triangular factorization.
\newblock {\em IEEE Trans. Power Apparatus and Systems}, PAS-91(1):123--127,
  1972.

\bibitem[T26]{T26}
{Tinney, W. F.}, {Brandwajn, V.}, and {Chan, S. M.}
\newblock Sparse vector methods.
\newblock {\em IEEE Trans. Power Apparatus and Systems}, PAS-104(2):295--301,
  1985.

\bibitem[T23]{T23}
{Tinney, W. F.} and {Hart, C. E.}
\newblock Power flow solution by {Newton's} method.
\newblock {\em IEEE Trans. Power Apparatus and Systems}, PAS-86(11):1449--1460,
  1967.

\bibitem[T58]{T58}
{Tinney, W. F.} and {Ogbuobiri, E. C.}
\newblock Sparsity techniques~: {Theory} and practice.
\newblock {Tech. Report}, Bonneville Power Administration, Portland, 1970.

\bibitem[T25]{T25}
{Tinney, W. F.} and {Powell, W. L.}
\newblock Notes on the {Newton-Raphson} method for solution of {AC} power flow
  problems.
\newblock ({Internal Publication}), Bonneville Power Administration, Portland,
  Oregon, 1971.

\bibitem[T4]{T4}
{Tinney, W. F.}, {Powell, W. L.}, and {Peterson, N. M.}
\newblock Sparsity oriented network reduction.
\newblock In {\em Proc. $8^{th}$ {PICA} Conference}, Minneapolis, 1973.

\bibitem[T2]{T2}
{Tinney, W. F.} and {Walker, J.}
\newblock Direct solution of sparse network equations by optimally ordered
  triangular factorization.
\newblock {\em Proc. of the IEEE}, 55:1801--1809, 1967.

\bibitem[T48]{T48}
{Tjaden, G. S.} and {Flynn, M. J.}
\newblock Detection and parallel execution of independent instructions.
\newblock {\em IEEE Trans. Comput.}, C-19(10):889--895, 1970.

\bibitem[T67]{T67}
{Tobey, R. G.}, editor.
\newblock {\em Proc. 1968 Summer Institute on Symbolic Mathematical
  Computation, IBM Boston Programming Center}, Cambridge, Massachusetts, 1968.

\bibitem[T19]{T19}
{Todd, J.}, editor.
\newblock {\em Survey of Numerical Analysis}.
\newblock McGraw-Hill, 1962.

\bibitem[T16]{T16}
{Todd, M. J.}
\newblock Theory and practice for interior point methods.
\newblock {\em ORSA J. Computing}, 6(1):28--31, 1994.

\bibitem[T27]{T27}
{Toint, Ph. L.}
\newblock On sparse and symmetric matrix updating subject to a linear equation.
\newblock {\em Math. of Computation}, 31:954--961, 1977.

\bibitem[T28]{T28}
{Toint, Ph. L.}
\newblock Some numerical results using a sparse matrix updating formula in
  unconstrained optimization.
\newblock {\em Math. of Computation}, 32:839--851, 1978.

\bibitem[T29]{T29}
{Toint, Ph. L.}
\newblock A sparse quasi-{Newton} update derived variationally with a
  non-diagonally weighted {Frobenius} norm.
\newblock {\em Math. of Computation}, 37:425--434, 1981.

\bibitem[T30]{T30}
{Toint, Ph. L.}
\newblock Towards an efficient sparsity exploiting {Newton} method for
  minimization.
\newblock In {Duff, I. S.}, editor, {\em Sparse Matrices and Their Uses}, pages
  57--88. Academic Press, 1981.

\bibitem[T49]{T49}
{Tomasulo, R. M.}
\newblock An efficient algorithm for exploiting multiple arithmetic units.
\newblock {\em IBM J. of Research and Development}, 11(1):25--33, 1967.

\bibitem[T52]{T52}
{Tomlin, J. A.}
\newblock Maintaining sparse inverse in the simplex method.
\newblock {Tech. Report} 70-15, Operations Res. Dept., Stanford Univ., 1970.

\bibitem[T60]{T60}
{Tomlin, J. A.}
\newblock Pivoting for size and sparsity in linear programming inversion
  routines.
\newblock {\em J. Inst. Math. Appl.}, 10:289--295, 1972.

\bibitem[T61]{T61}
{Tomlin, J. A.}
\newblock On pricing and backward transformation in linear programming.
\newblock {\em Math. Programming}, 6:42--47, 1974.

\bibitem[T20]{T20}
{Tomlin, J. A.}
\newblock An experimental approach to {Karmarkar's} projective method for
  linear programming.
\newblock {\em Math. Programming Study}, 31:175--191, 1987.

\bibitem[T15]{T15}
{Traub, J. F.}
\newblock {\em Iterative Methods for the Solution of Equations}.
\newblock Prentice-Hall, 1964.

\bibitem[T42]{T42}
{Traub, J. F.}, editor.
\newblock {\em Complexity of Sequential and Parallel Numerical Algorithms}.
\newblock Academic Press, 1973.

\bibitem[T76]{T76}
{Treleaven, P. C.}, {Brownbridge, D. R.}, and {Hopkins, R. P.}
\newblock Data-driven and demand-driven computer architectures.
\newblock {\em ACM Computing Surveys}, 14(1):93--143, 1982.

\bibitem[T50]{T50}
{Troiani, M.}, {Ching, S. S.}, {Quaynor, N. N.}, {Bloem, J. E.}, and {Colon
  Osorio, F. C.}
\newblock The {VAX 8600-I} box~: {A} pipelined implementation of the {VAX}
  architecture.
\newblock {\em Digital Technical Journal}, 1:4--19, 1985.

\bibitem[T21]{T21}
{Tsuchiya T.} and {Muramatsu, M.}
\newblock Global convergence of the long-step affine scaling algorithm for
  degenerate linear programming problems.
\newblock {Tech. Report} 423, The Institute of Statistical Mathematics, Tokyo,
  1992.

\bibitem[T77]{T77}
{Tucker, S. G.}
\newblock Microprogram control for the {System/360}.
\newblock {\em IBM Systems Journal}, 6(4):222--241, 1967.

\bibitem[T18]{T18}
{Tuma, J. J.}
\newblock {\em Technology Mathematics Handbook}.
\newblock McGraw-Hill, 1975.

\bibitem[T17]{T17}
{Tuma, J. J.}
\newblock {\em Engineering Mathematics Handbook}.
\newblock McGraw-Hill, 1979.

\bibitem[T41]{T41}
{Turing, A. M.}
\newblock On computable numbers, with an application to the {E}ntscheidungs
  problem.
\newblock {\em Proc. London Math. Soc.}, 2(42):230--265, 1936.
\newblock (Corrections on volume 2(43):544--546).

\bibitem[T66]{T66}
{Turing, A. M.}
\newblock Rounding-off errors in matrix processes.
\newblock {\em Quart. J. Mech. Appl. Math.}, 1:287--308, 1948.

\bibitem[U2]{U2}
{Ullman, J. D.}
\newblock Fast algorithms for the elimination of subexpressions.
\newblock {\em Acta Informatica}, 2:191--213, 1973.

\bibitem[U4]{U4}
{Ullman, J. D.}
\newblock {\em Computational Aspects of {VLSI}}.
\newblock Computer Science Press, Rockville, MD, 1984.

\bibitem[U3]{U3}
{Underwood, R.}
\newblock {\em An Iterative Block {Lanczos} Method for the Solution of Large
  Sparse Symmetric Eigenproblems}.
\newblock PhD thesis, Computer Science Dept., Stanford Univ., 1975.
\newblock ({Report STAN-CS-75-496}).

\bibitem[U1]{U1}
{Undrill, J. M.} and {Happ, H. H.}
\newblock Automatic sectionalization of power system networks for networks
  solution.
\newblock {\em IEEE Trans. Power Apparatus and Systems}, PAS-90(1):46--63,
  1971.

\bibitem[V29]{V29}
{Vaidya, P. M.}
\newblock An algorithm for linear programming which requires
  ${O}(((m+n)n^2+(m+n)^{1.5}n){L})$ arithmetic operations.
\newblock In {\em Proc. $19^{th}$ {ACM} Symposium on Theory of Computing},
  pages 29--38, 1987.

\bibitem[V9]{V9}
{Vaidya, P. M.}
\newblock Speeding-up linear programming using fast matrix multiplication.
\newblock {Tech. Report}, AT\&T BELL Labs., Murray Hill, 1989.

\bibitem[V25]{V25}
{van der Sluis, A.}
\newblock Condition numbers and equilibration of matrices.
\newblock {\em Numer. Math.}, 14:14--23, 1969.

\bibitem[V26]{V26}
{van der Sluis, A.}
\newblock Condition, equilibration and pivoting in linear algebraic systems.
\newblock {\em Numer. Math.}, 15:74--86, 1970.

\bibitem[V21]{V21}
{van der Vorst, H. A.}
\newblock High performance preconditioning.
\newblock {\em SIAM J. Sci. and Stat. Comput.}, 10:1174--1185, 1989.

\bibitem[V22]{V22}
{Van Huffel, S.} and {Vandewalle, J.}, editors.
\newblock {\em The Total Least Squares Problem~: Computational Aspects and
  Analysis}.
\newblock SIAM Publications, 1991.

\bibitem[V35]{V35}
{van Leeuwen, J.}
\newblock Graph algorithms.
\newblock In {\em Handbook of Theoretical Computer Science -- A~: {Algorithms}
  and Complexity Theory}. North Holland, 1990.

\bibitem[V11]{V11}
{Van Loan, C.}
\newblock {\em Computational Frameworks for the Fast {Fourier} Transform}.
\newblock SIAM Publications, 1992.

\bibitem[V17]{V17}
{van Ness, J. E.} and {Griffin, J. H.}
\newblock Elimination methods for load-flow studies.
\newblock {\em IEEE Trans. Power Apparatus and Systems}, PAS-80(6):299--304,
  1961.

\bibitem[W38]{W38}
{van Wijngaarden, A.} et~al.
\newblock Report on the algorithmic language {ALGOL} 68.
\newblock {\em Numer. Math.}, 14:79--218, 1969.

\bibitem[V12]{V12}
{Vanderbei, R. J.}
\newblock Dense columns in interior point methods.
\newblock In {\em Proc. {IMACS}'91 World Congress on Computation and Applied
  Mathematics}, Dublin, Ireland, 1991.

\bibitem[V13]{V13}
{Vanderbei, R. J.}
\newblock Splitting dense columns in sparse linear systems.
\newblock {\em Lin. Alg. Appl.}, 152:107--117, 1991.

\bibitem[V14]{V14}
{Vanderbei, R. J.}
\newblock {LOQO} ``{User's Manual}''.
\newblock {Tech. Report} SOR-92-5, School of Eng. and Applied Science, Dept. of
  Civil Eng. and Oper. Research, Princeton Univ., 1992.

\bibitem[V15]{V15}
{Vanderbei, R. J.}
\newblock Symmetric quasi-definite matrices.
\newblock {Tech. Report} SOR-91-10, School of Eng. and Applied Science, Dept.
  of Civil Eng. and Oper. Research, Princeton Univ., 1992.

\bibitem[V8]{V8}
{Vanderbei, R. J.}
\newblock Interior point methods~: {Algorithms} and formulations.
\newblock {\em ORSA J. Computing}, 6(1):32--34, 1994.

\bibitem[V16]{V16}
{Vanderbei, R. J.} and {Carpenter, T. J.}
\newblock Symmetric indefinite systems for interior point methods.
\newblock {\em Math. Programming}, 58:1--32, 1993.

\bibitem[V18]{V18}
{Vandergraft, J. S.}
\newblock {\em Introduction to Numerical Computations}.
\newblock Academic Press, 1978.

\bibitem[V34]{V34}
{Vannelli, A.}
\newblock A parallel implementation of an interior point method for linear
  programming.
\newblock In {\em Parallel Processing for Scientific Computing}, pages
  163--167, Houston, Texas, 1991. SIAM Publications.

\bibitem[V19]{V19}
{Vardi, A.}
\newblock A trust region algorithm for equality constrained minimization~:
  {Convergence} properties and implementation.
\newblock {\em SIAM J. Numer. Anal.}, 22(3):575--591, 1985.

\bibitem[V27]{V27}
{Varga, R. S.}
\newblock Factorization and normalized iteration methods.
\newblock In {Langer, R. E.}, editor, {\em Boundary Problems in Differential
  Equations, Proc. Mathematical Research Center}, pages 121--142. University of
  Wisconsin Press, Madison, 1959.

\bibitem[V6]{V6}
{Varga, R. S.}
\newblock {\em Matrix Iterative Analysis}.
\newblock Prentice-Hall, 1962.

\bibitem[V24]{V24}
{Varga, R. S.}
\newblock {\em Functional Analysis and Approximation Theory in Numerical
  Analysis}.
\newblock SIAM Publications, 1971.

\bibitem[V23]{V23}
{Varga, R. S.}
\newblock {\em Scientific Computation on Mathematical Problems and
  Conjectures}.
\newblock SIAM Publications, 1990.

\bibitem[V33]{V33}
{Vavasis, S. A.}
\newblock Stable finite elements for problems with wild coefficients.
\newblock {Tech. Report} 93-1364, Dept. of Computer Science, Cornell Univ.,
  1993.
\newblock ({To be published at SIAM J. Numerical Analysis}).

\bibitem[V20]{V20}
{VAX}.
\newblock {FORTRAN} version 4.0 ``{User's Guide}'', {DEC}, 1984.

\bibitem[V1]{V1}
{Veldhorst, M.}
\newblock An analysis of sparse matrix storage schemes.
\newblock In {\em volume 150 of Mathematical Centre Tracts}, Amsterdam, 1982.

\bibitem[V7]{V7}
{Veloso, P.}, {Azeredo, P.}, and {Furtado, A. L.}
\newblock {\em Estruturas de Dados}.
\newblock Editora Campus, 1983.

\bibitem[V4]{V4}
{Vichnevetsky, R.}, editor.
\newblock {\em Advances in Computer Methods for Partial Differential Equations
  -- {III}}. Publ. IMACE, 1979.

\bibitem[V3]{V3}
{Vichnevetsky, R.} and {Stepleman}, editors.
\newblock {\em Proc. {AICA} International Symposium on Computer Methods for
  Partial Differential Equations, Bethlehem}. Prentice-Hall, 1975.

\bibitem[V5]{V5}
{Vignes, J.}
\newblock {\em Algorithmes Num\'eriques, Analyse et Mise en \OE uvre, tome
  {II}~: \'Equations et Syst\`emes Non Lin\'eaires}.
\newblock \'Editions Technip, 1980.

\bibitem[V30]{V30}
{Villers, F. A.}
\newblock {\em Methoden der Praktischen Analysis}.
\newblock Walter de Gruyter, 1957.

\bibitem[V2]{V2}
{Villiers, E.} and {Wilson, L. B.}
\newblock Hashing the subscripts of a sparse matrix.
\newblock {\em BIT}, 14:347--358, 1974.

\bibitem[V32]{V32}
{Volgenant, T.} and {Jonker, R.}
\newblock The symmetric travelling salesman problem and edge exchanges in
  minimal 1-trees.
\newblock {\em European Journal of Operations Research}, 12:394--403, 1983.

\bibitem[V31]{V31}
{von Neumann, J.} and {Goldstine, H. H.}
\newblock Numerical inverting of matrices of high order.
\newblock {\em Bull. Amer. Math. Soc.}, 53:1021--1099, 1947.

\bibitem[V28]{V28}
{von Rosenberg, D. V.}, editor.
\newblock {\em Methods for the Numerical Solution of Partial Differential
  Equations}.
\newblock American Elsevier, New York, 1969.

\bibitem[V10]{V10}
{Vygodsky, M.}
\newblock {\em Mathematical Handbook~: Higher Mathematics}.
\newblock Mir Publishers, 1975.

\bibitem[W83]{W83}
{Wachspress, E. L.}
\newblock {\em Iterative Solution of Elliptic Systems and Applications to the
  Neutron Diffusion Equations of Reactor Physics}.
\newblock Prentice-Hall, 1966.

\bibitem[W61]{W61}
{Wagner, R.}
\newblock Parallel solution of arbitrarily sparse linear systems.
\newblock {Tech. Report} CS-1984-13, Dept. of Computer Science, Duke Univ.,
  1984.

\bibitem[W62]{W62}
{Wagner, R.} and {Patrick, M.}
\newblock A sparse matrix algorithm on the {Boolean} vector machine.
\newblock {\em Parallel Computing}, 6:359--372, 1988.

\bibitem[W52]{W52}
{Wagner, R. A.}
\newblock A shortest path algorithm for edge-sparse graphs.
\newblock {\em J. ACM}, 23:50--57, 1976.

\bibitem[W32]{W32}
{Wagner, R. E.}
\newblock Indexing design considerations.
\newblock {\em IBM Systems Journal}, 4:351--367, 1973.

\bibitem[W89]{W89}
{Waite, W. M.}
\newblock Path detection in multidimensional iterative arrays.
\newblock {\em J. ACM}, 14:300--310, 1967.

\bibitem[W98]{W98}
{Wakerly, J.}
\newblock {\em Microcomputer Architecture and Programming}.
\newblock John Wiley \& Sons, 1989.

\bibitem[W57]{W57}
{Walker, H. F.}
\newblock Implementation of the {GMRES} method using {Householder}
  transformations.
\newblock {\em SIAM J. Sci. and Stat. Comput.}, 9:152--163, 1988.

\bibitem[W82]{W82}
{Walker, J. W.}
\newblock Renumbering subroutine~: {Complete} documentation of program for
  near-optimal ordering.
\newblock {Bonneville, Power Administration, P.O. Box 3621, Portland, Oregon
  97208}, 1967.

\bibitem[W65]{W65}
{Waltz, D. L.}, editor.
\newblock {\em Neural and Artificial Parallel Computation, {Proc.} $5^{th}$
  {NEC} Research Symposium}. SIAM Publications, 1995.

\bibitem[W9]{W9}
{Wang, H. H.}
\newblock A parallel method for tridiagonal equations.
\newblock {\em ACM Trans. Math. Software}, 7:170--183, 1981.

\bibitem[W29]{W29}
{Wang, L.}
\newblock {\em Eigenvalue Analysis of Large Power Systems}.
\newblock PhD thesis, Univ. Toronto, 1991.

\bibitem[W116]{W116}
{Wang, L.}
\newblock {\em Spectral Nested Dissection}.
\newblock PhD thesis, Dept. of Computer Science and Engineering, The
  Pennsylvania State Univ., 1994.

\bibitem[W30]{W30}
{Wang, L.} and {Semlyen, A.}
\newblock Application of sparse eigenvalue techniques to the small-signal
  stability analysis of power systems.
\newblock {\em IEEE Trans. Power Systems}, PWRS-5:635--642, 1990.

\bibitem[W90]{W90}
{Ward, J. B.} and {Hale, H. W.}
\newblock Digital computer solution of power flow problems.
\newblock {\em IEEE Trans. Power Apparatus and Systems}, PAS-75(3):398--404,
  1956.

\bibitem[W60]{W60}
{Ware, W.}
\newblock The ultimate computer.
\newblock {\em IEEE Spectrum}, pages 89--91, 1973.

\bibitem[W69]{W69}
{Warshall, S.}
\newblock A theorem on {Boolean} matrices.
\newblock {\em J. ACM}, 9:11--12, 1962.

\bibitem[W99]{W99}
{Watanabe, T.}
\newblock Architecture and performance of the {NEC} supercomputer {SX} system.
\newblock {\em Parallel Computing}, 5:247--255, 1987.

\bibitem[W59]{W59}
{WATCOM}.
\newblock ${C}$ version 9.1 ``{User's Guide}''.

\bibitem[W58]{W58}
{WATCOM}.
\newblock {FORTRAN} version 9.1 ``{User's Guide}''.

\bibitem[W100]{W100}
{Waters, F.}
\newblock {\em {IBM} {RT} Personal Computer Technology}.
\newblock IBM, Austin, Texas, 1986.

\bibitem[W37]{W37}
{Watson, G. A.}
\newblock {\em Numerical Analysis, Dundee 1977}, volume 630 of {\em Lecture
  Notes in Mathematics}.
\newblock Springer-Verlag, 1978.

\bibitem[W20]{W20}
{Watson, L. T.}, {Billups, S. C.}, and {Morgan, A. P.}
\newblock {HOMPACK}~: {A} suite of codes for globally convergent homotopy
  algorithms.
\newblock {\em ACM Trans. Math. Software}, 13:281--310, 1987.

\bibitem[W21]{W21}
{Weaver, H. J.}
\newblock {\em Applications of Discrete and Continuous Fourier Analysis}.
\newblock John Wiley \& Sons, 1983.

\bibitem[W70]{W70}
{Weaver, W. Jr.}
\newblock {\em Computer Programs for Structural Analysis}.
\newblock Van Nostrand-Reinhold, Princeton, New Jersey, 1967.

\bibitem[W53]{W53}
{Wegman, M. N.} and {Carter, J. L.}
\newblock New hash functions and their use in authentication and set equality.
\newblock {\em J. Comput. System Sci.}, 22:265--279, 1981.

\bibitem[W101]{W101}
{Weicker, R. P.}
\newblock {DHRYSTONE}~: {A} synthetic systems programming benchmark.
\newblock {\em Comm. ACM}, 27(10):1013--1030, 1984.

\bibitem[W39]{W39}
{Weinberg, G.}
\newblock {\em The Psychology of Computer Programming}.
\newblock Van Nostrand, 1971.

\bibitem[W25]{W25}
{Weinberg, L.}
\newblock {\em Network Analysis and Systems}.
\newblock McGraw-Hill, 1962.

\bibitem[W67]{W67}
{Weiss, S.} and {Smith, J. E.}
\newblock Instruction issue logic for pipelined supercomputers.
\newblock In {\em Proc. $11^{th}$ Symposium on Computer Architecture}, pages
  110--118, Ann Arbor, 1984.

\bibitem[W68]{W68}
{Weiss, S.} and {Smith, J. E.}
\newblock A study of scalar compilation techniques for pipelined
  supercomputers.
\newblock In {\em Proc. $2^{nd}$ Conference on Architectural Support for
  Programming Languages and Operating Systems}, pages 105--109, Palo Alto,
  1987. IEEE/ACM.

\bibitem[W40]{W40}
{Weissman, C.}
\newblock Psychological complexity of computer programs~: {An} initial
  experiment, 1973.
\newblock Computer Systems Research Group Technical Report, Univ. of Toronto.

\bibitem[W15]{W15}
{Wendroff, B.}
\newblock {\em Theoretical Numerical Analysis}.
\newblock Academic Press, 1966.

\bibitem[W16]{W16}
{Wendroff, B.}
\newblock {\em First Principles of Numerical Analysis~: An Undergraduate Text}.
\newblock Addison-Wesley, 1969.

\bibitem[W18]{W18}
{Westlake, J. R.}
\newblock {\em A Handbook of Numerical Matrix Inversion and Solution of Linear
  Equations}.
\newblock John Wiley \& Sons, 1968.

\bibitem[W102]{W102}
{Whitby-Strevens, C.}
\newblock The {TRANSPUTER}.
\newblock In {\em Proc. $12^{th}$ International Symposium on Computer
  Architecture}, pages 292--300, Boston, 1985.

\bibitem[W22]{W22}
{Whittaker, E.} and {Robinson, G.}
\newblock {\em The Calculus of Observations}.
\newblock Blackie and Son, London, 1924.

\bibitem[W92]{W92}
{Whitten, G. F.}
\newblock {\em Structurally Recursive Algorithms}.
\newblock PhD thesis, Committee on Applied Mathematics, Harvard Univ., 1978.

\bibitem[W103]{W103}
{Wichmann, B. A.}
\newblock {\em {ALGOL 60} Compilation and Assessment}.
\newblock Academic Press, 1973.

\bibitem[W84]{W84}
{Widlund, O. B.}
\newblock On the rate of convergence of an alternating direction implicit
  method in a non-commutative case.
\newblock {\em Math. of Computation}, 20:500--515, 1966.

\bibitem[W104]{W104}
{Wiecek, C.}
\newblock A case study of the {VAX 11} instruction set usage for compiler
  execution.
\newblock In {\em Proc. Symposium on Architectural Support for Programming
  Languages and Operating Systems}, pages 174--184, Palo Alto, 1982. IEEE/ACM.

\bibitem[W17]{W17}
{Wilde, D. J.}
\newblock {\em Optimum Seeking Methods}.
\newblock Prentice-Hall, 1964.

\bibitem[W80]{W80}
{Wilf, H. S.}
\newblock Matrix inversion by the annihilation of rank.
\newblock {\em SIAM J. Appl. Math.}, 7:149--151, 1959.

\bibitem[W66]{W66}
{Wilf, H. S.}
\newblock {\em Combinatorial Algorithms~: An Update}.
\newblock SIAM Publications, 1989.

\bibitem[W107]{W107}
{Wilkes, M. V.}
\newblock The best way to design an automatic calculating machine.
\newblock In {\em Manchester University Computer Inaugural Conference, London,
  1951}, 1953.
\newblock (Republished at {The Genesis of Microprogramming, Annals of the
  History of Computing, 8:116)}.

\bibitem[W106]{W106}
{Wilkes, M. V.}
\newblock Slave memories and dynamic storage allocation.
\newblock {\em IEEE Trans. Electronic Computers}, EC-14(2):270--271, 1965.

\bibitem[W77]{W77}
{Wilkes, M. V.}
\newblock The growth of interest in microprogramming~: {A} literature survey.
\newblock {\em ACM Computing Surveys}, 1:139--145, 1969.

\bibitem[W78]{W78}
{Wilkes, M. V.}
\newblock {\em Time-Sharing Computing Systems}.
\newblock Elsevier, New York, 1969.

\bibitem[W108]{W108}
{Wilkes, M. V.}
\newblock {\em Memoirs of a Computer Pioneer}.
\newblock MIT Press, 1985.

\bibitem[W110]{W110}
{Wilkes, M. V.} and {Renwick, W.}
\newblock Report of a conference on high speed automatic calculating machines,
  1949.

\bibitem[W109]{W109}
{Wilkes, M. V.} and {Stringer, J. B.}
\newblock Microprogramming and the design of the control circuits in an
  electronic digital computer.
\newblock In {\em Proc. Cambridge Philosophical Society, volume 49}, pages
  230--238, 1953.
\newblock (Republished at {Siewiorek, D. P. and Bell, C. G. and Newell, A.,
  Computer Structures~: Principles and Examples, pages 158--163, McGraw-Hill,
  1982} and in {The Genesis of Microprogramming, Annals of the History of
  Computing, 8:116)}.

\bibitem[W111]{W111}
{Wilkes, M. V.}, {Wheeler, D. J.}, and {Gill, S.}
\newblock {\em The Preparation of Programs for an Electronic Digital Computer}.
\newblock Addison-Wesley, 1951.

\bibitem[W85]{W85}
{Wilkinson, J. H.}
\newblock The evaluation of ill-conditioned polynomials -- {I}, {II}.
\newblock {\em Numer. Math.}, 1:150--180, 1959.

\bibitem[W27]{W27}
{Wilkinson, J. H.}
\newblock Error analysis of direct methods of matrix inversion.
\newblock {\em J. ACM}, 8:281--330, 1961.

\bibitem[W86]{W86}
{Wilkinson, J. H.}
\newblock Instability of the elimination method of reducing a matrix to
  tridiagonal form.
\newblock {\em Computing J.}, 5:61--70, 1962.

\bibitem[W14]{W14}
{Wilkinson, J. H.}
\newblock {\em Rounding Errors in Algebraic Processes}.
\newblock Prentice-Hall, 1963.

\bibitem[W13]{W13}
{Wilkinson, J. H.}
\newblock {\em The Algebraic Eigenvalue Problem}.
\newblock Clarendon Press, Oxford, 1965.

\bibitem[W87]{W87}
{Wilkinson, J. H.}
\newblock The solution of ill-conditioned linear equations.
\newblock In {Ralston, A.} and {Wilf, H. S.}, editors, {\em Mathematical
  Methods for Digital Computers, volume {2}}, pages 65--93. John Wiley \& Sons,
  1967.

\bibitem[W79]{W79}
{Wilkinson, J. H.}
\newblock A survey of error analysis of matrix algorithms.
\newblock {\em Appl. Math.}, 13:93--102, 1968.

\bibitem[W4]{W4}
{Wilkinson, J. H.}ÿand {Reinsch, C.}
\newblock {\em Handbook for Automatic Computation, volume {2}~: Linear
  Algebra}.
\newblock Springer-Verlag, 1971.

\bibitem[W54]{W54}
{Williams, J. W. J.}
\newblock Algorithm 232~: {HEAPSORT}.
\newblock {\em Comm. ACM}, 7:347--348, 1964.

\bibitem[W112]{W112}
{Williams, T. E.}, {Horowitz, M.}, {Alverson, R. L.}, and {Yang, T. S.}
\newblock A self-timed chip for division.
\newblock In {\em Proc. 1987 {Stanford} Conference on Advanced Research in
  {VLSI}}. MIT Press, 1987.

\bibitem[W12]{W12}
{Willner, E.} and {Demchak, B.}
\newblock {\em Advanced {UCSD} {PASCAL} Programming Techniques}.
\newblock Prentice-Hall, 1985.

\bibitem[W74]{W74}
{Willoughby, R. A.}
\newblock Some numerical analysis aspects of computational circuit design.
\newblock In {\em Proc. Cornell Conference on Computerized Electronics}, pages
  24--35, Ithaca, 1969. Cornell Univ.

\bibitem[W1]{W1}
{Willoughby, R. A.}, editor.
\newblock {\em Sparse Matrix Proceedings, Symposium on Sparse Matrices and
  Their Applications}, Yorktown Heights, New York, 1969. IBM Thomas J. Watson
  Research Center.
\newblock ({Tech. Report} {RA-1-11707}, {Table of Cont.} {MR-39 No. 1106}).

\bibitem[W88]{W88}
{Willoughby, R. A.}
\newblock Some pivot considerations in direct methods for sparse matrices.
\newblock In {\em Proc. Mexico 1971 International {IEEE} Conference on Systems,
  Networks and Computers}, 1971.

\bibitem[W3]{W3}
{Willoughby, R. A.}
\newblock Sparse matrix algorithms and their relation to problem classes and
  computer architecture.
\newblock In {Reid, J. K.}, editor, {\em Large Sparse Sets of Linear
  Equations}, pages 255--277. Academic Press, 1971.

\bibitem[W93]{W93}
{Willoughby, R. A.}
\newblock A characterization of matrix irreducibility via triangular
  factorization.
\newblock {Tech. Report} RC-3931, IBM Thomas J. Watson Research Center,
  Yorktown Heights, New York, 1972.

\bibitem[W75]{W75}
{Willoughby, R. A.}
\newblock A matrix reducibility algorithm.
\newblock {\em Math. of Computation}, 1972.

\bibitem[W2]{W2}
{Willoughby, R. A.}
\newblock A survey of sparse matrix technology.
\newblock In {\em Conference on Computer Oriented Analysis of Shell Structures,
  1970}, Lockheed, Palo Alto, 1972.
\newblock ({IBM} {Tech. Report} {RC-3872}).

\bibitem[W96]{W96}
{Willoughby, R. A.}
\newblock The inverse {M-Matrix} problem.
\newblock {Tech. Report} RC-5441, IBM Thomas J. Watson Research Center,
  Yorktown Heights, New York, 1975.

\bibitem[W113]{W113}
{Wilson, A. W. Jr.}
\newblock Hierarchical cache/bus architecture for shared memory
  multiprocessors.
\newblock In {\em Proc. $14^{th}$ International Symposium on Computer
  Architecture}, pages 244--252, Pittsburgh, 1987.

\bibitem[W26]{W26}
{Wilson, E. L.}
\newblock Solution of sparse stiffness matrices for structural systems.
\newblock In {Duff, I. S.} and {Stewart, G. W.}, editors, {\em Sparse Matrix
  Proceedings 1978}. SIAM Publications, 1979.

\bibitem[W95]{W95}
{Wilson, E. L.}, {Bathe, K. L.}, and {Doherty, W. P.}
\newblock Direct solution of large systems of linear equations.
\newblock {\em Computers and Structures}, 4:363--372, 1974.

\bibitem[W81]{W81}
{Wilson, L. B.}
\newblock Solution of certain large sets of equations on {PEGASUS} using matrix
  methods.
\newblock {\em Computing J.}, 2:130--133, 1959.

\bibitem[W35]{W35}
{Wilson, R. B.}
\newblock {\em A Simplicial Algorithm for Concave Programming}.
\newblock PhD thesis, Harvard University Graduate School of Economics,
  Cambridge, 1963.

\bibitem[W91]{W91}
{Windley, P. F.}
\newblock Transposing matrices in a digital computer.
\newblock {\em Computing J.}, 2:47--48, 1959.

\bibitem[W64]{W64}
{Wing, O.}
\newblock A content addressable systolic array for sparse matrix computation.
\newblock {\em J. Par. and Dist. Comp.}, 2:170--181, 1985.

\bibitem[W63]{W63}
{Wing, O.} and {Huang, J.}
\newblock A parallel triangulation process of sparse matrices.
\newblock In {\em Proc. 1977 International Conference on Parallel Processing},
  pages 207--214, 1977.

\bibitem[W8]{W8}
{Wing, O.} and {Huang, J. W.}
\newblock A computation model of parallel solution of linear equations.
\newblock {\em IEEE Trans. Comput.}, C-29:632--638, 1980.

\bibitem[W5]{W5}
{Winograd, S.}
\newblock A new algorithm for inner product.
\newblock {\em IEEE Trans. Comput.}, C-18:693--694, 1968.

\bibitem[W76]{W76}
{Winograd, S.}
\newblock On the number of multiplications required to compute certain
  functions.
\newblock {\em Comm. Pure and Appl. Math.}, 23:165--179, 1970.

\bibitem[W114]{W114}
{Winograd, S.}
\newblock {\em Arithmetic Complexity of Computations}.
\newblock SIAM Publications, 1980.

\bibitem[W43]{W43}
{Wirth, N.}
\newblock The design of a {PASCAL} compiler.
\newblock {\em Software Practice and Experience}, 1:309--333, 1971.

\bibitem[W48]{W48}
{Wirth, N.}
\newblock Program development by stepwise refinement.
\newblock {\em Comm. ACM}, 14(4):221--227, 1971.

\bibitem[W49]{W49}
{Wirth, N.}
\newblock The programming language {PASCAL}.
\newblock {\em Acta Informatica}, 1:35--63, 1971.

\bibitem[W50]{W50}
{Wirth, N.}
\newblock {\em Systematic Programming~: An Introduction}.
\newblock Prentice-Hall, 1973.

\bibitem[W46]{W46}
{Wirth, N.}
\newblock From programming techniques to programming methods.
\newblock In {G{\"u}nter}, {Levrat}, and {Lipps}, editors, {\em International
  Computing Symposium 1973}. North-Holland, 1974.

\bibitem[W45]{W45}
{Wirth, N.}
\newblock On the design of programming languages.
\newblock In {Rosenfeld, L.}, editor, {\em Information Processing 1974}.
  North-Holland, 1974.

\bibitem[W42]{W42}
{Wirth, N.}
\newblock An assessment of the programming language {PASCAL}.
\newblock {\em IEEE Trans. Software Engineering}, SE-1(2):192--198, 1975.

\bibitem[W7]{W7}
{Wirth, N.}
\newblock {\em Algorithms + Data Structures = Programs}.
\newblock Prentice-Hall, 1976.

\bibitem[W44]{W44}
{Wirth, N.}
\newblock {MODULA}~: {A} language for modular multiprogramming.
\newblock {\em Software Practice and Experience}, 7:3--35, 1977.

\bibitem[W47]{W47}
{Wirth, N.}
\newblock Programming languages~: {What} to demand and how to assess them.
\newblock In {Perrot, R. H.}, editor, {\em Software Engineering}. Academic
  Press, 1977.

\bibitem[W41]{W41}
{Wirth, N.}
\newblock A computation model of parallel solution of linear equations.
\newblock {\em IEEE Trans. Comput.}, C-29:632--638, 1980.

\bibitem[W6]{W6}
{Wirth, N.}
\newblock {\em Algorithms \& Data Structures}.
\newblock Prentice-Hall, 1986.

\bibitem[W51]{W51}
{Wirth, N.} and {Hoare, C. A. R.}
\newblock A contribution to the development of {ALGOL}.
\newblock {\em Comm. ACM}, 9(6):413--431, 1966.

\bibitem[W31]{W31}
{Withers, G.}
\newblock Parallel programming on the {iPSC/860} system.
\newblock Proc. $4^{th}$ {ISMM/IASTED} International Conference on Parallel and
  Distributed Computing and Systems, pages 341-343, 1991.

\bibitem[W55]{W55}
{Witzgall, C.} and {Zahn, C. T. Jr.}
\newblock Modification of {Edmond's} maximum matching algorithm.
\newblock {\em J. Res. Nat. Bur. Standards}, B69:91--98, 1966.

\bibitem[W115]{W115}
{Wolfe, M. J.}
\newblock Loop skewing~: {The} wavefront method revised.
\newblock {\em J. of Parallel Programming}, 1986.

\bibitem[W23]{W23}
{Wolfe, P.}
\newblock The composite simplex algorithm.
\newblock {\em SIAM Review}, 7(1):42--54, 1965.

\bibitem[W33]{W33}
{Wolfe, P.}
\newblock Convergence conditions for ascent methods.
\newblock {\em SIAM Review}, 11:226--235, 1969.

\bibitem[W71]{W71}
{Wolfe, P.}
\newblock Trends in linear programming computations.
\newblock In {Willoughby, R. A.}, editor, {\em Sparse Matrix Proceedings,
  Symposium on Sparse Matrices and Their Applications}, pages 107--112,
  Yorktown Heights, New York, 1969. IBM Thomas J. Watson Research Center.

\bibitem[W34]{W34}
{Wolfe, P.}
\newblock Convergence conditions for ascent methods -- {II}~: {Some}
  corrections.
\newblock {\em SIAM Review}, 13:185--188, 1971.

\bibitem[W72]{W72}
{Wolfe, P.} and {Cutler, L.}
\newblock Experiments in linear programming.
\newblock In {Graves, R. L.} and {Wolfe, P.}, editors, {\em Recent Advances in
  Mathematical Programming}. 1963.

\bibitem[W19]{W19}
{Wolfram, S.}
\newblock {\em Mathematica~: A System for doing Mathematics by Computer}.
\newblock Addison-Wesley, $2^{nd}$ edition, 1991.

\bibitem[W73]{W73}
{Woo, P. T.}, {Eisenstat, S. C.}, and {Schultz, M. H.}ÿand {Sherman, A. H.}
\newblock Application of sparse matrix techniques to reservoir simulation.
\newblock In {Bunch, J. R.} and {Rose, D. J.}, editors, {\em Sparse Matrix
  Computations}. Academic Press, 1976.

\bibitem[W97]{W97}
{Woo, P. T.}, {Roberts, S. J.}, and {Gustavson, F. G.}
\newblock Application of sparse matrix techniques in reservoir simulation.
\newblock In {\em Proc. $48^{th}$ Annual Fall Meeting Soc. Petroleum Eng.,
  {AIME}}, Las Vegas, 1973.
\newblock (Paper {SPE-4544}).

\bibitem[W94]{W94}
{Woodbury, M.}
\newblock Inverting modified matrices.
\newblock {Memo. Report}~42, Statistical Research Group, Princeton Univ., 1950.

\bibitem[W28]{W28}
{Woof, C.} and {Hodgkinson, D.}
\newblock {\em {MuMath}~: A Microcomputer Algebra System}.
\newblock Academic Press, 1987.

\bibitem[W56]{W56}
{Worley, P.} and {Schreiber, R.}
\newblock Nested dissection on a mesh-connected processor array.
\newblock In {Wouk, A.}, editor, {\em New Computing Environments~: {Parallel},
  Vector and Systolic}. SIAM Publications, 1986.

\bibitem[W10]{W10}
{Wouk, A.}, editor.
\newblock {\em New Computing Environments~: Parallel, Vector and Systolic}.
\newblock SIAM Publications, 1986.

\bibitem[W11]{W11}
{Wouk, A.}, editor.
\newblock {\em New Computing Environments~: Microcomputers in Large-Scale
  Computing}.
\newblock SIAM Publications, 1987.

\bibitem[W24]{W24}
{Wright, M. H.}
\newblock Interior methods for constrained optimization.
\newblock In {Iserles, A.}, editor, {\em Acta Numerica 1992}, pages 341--407.
  Cambridge University Press, 1992.

\bibitem[W36]{W36}
{Wright, S.}
\newblock Implementing proximal point methods for linear programming.
\newblock {Tech. Report} ANL-MCS-P-45-0189, Argonne National Laboratory,
  Argonne, Illinois, 1989.

\bibitem[W105]{W105}
{Wulf, W.}
\newblock Compilers and computer architecture.
\newblock {\em Computer}, 14(7):41--47, 1981.

\bibitem[Y10]{Y10}
{Yang, C.} and {Vu, P.}
\newblock A vector/parallel implementation of the multifrontal method for
  sparse symmetric definite linear systems on the {CRAY Y-MP}.
\newblock {Tech. Report}, CRAY Research, 1990.

\bibitem[Y6]{Y6}
{Yang, E.} and {Tolle, J.}
\newblock A class of methods for solving large convex quadratic programs
  subject to box constraints.
\newblock {Preprint}, Dept. of Operations Research, University of North
  Carolina, Chapel Hill, North Carolina, 1988.

\bibitem[Y1]{Y1}
{Yannakakis, M.}
\newblock Computing the minimum fill-in is {NP-Complete}.
\newblock {\em SIAM J. Alg. and Discr. Meth.}, 2(1):77--79, 1981.

\bibitem[Y12]{Y12}
{Yaspan, A.}
\newblock On finding a maximal assignment.
\newblock {\em Operations Res.}, 14:646--651, 1966.

\bibitem[Y9]{Y9}
{Ye, Y.}
\newblock {Karmarkar's} algorithm and the ellipsoid method.
\newblock {\em Operations Res. Letters}, 4:177--182, 1987.

\bibitem[Y11]{Y11}
{Young, D. M.}
\newblock Iterative methods for solving partial difference equations of
  elliptic type.
\newblock {\em Trans. Amer. Math. Soc.}, 76:92--111, 1954.

\bibitem[Y3]{Y3}
{Young, D. M.}
\newblock {\em Iterative Solution of Large Linear Systems}.
\newblock Academic Press, 1971.

\bibitem[Y4]{Y4}
{Young, D. M.}
\newblock A survey of modern numerical analysis.
\newblock {\em SIAM Review}, 15(2), 1973.

\bibitem[Y5]{Y5}
{Young, D. M.} and {Gregory, R. T.}
\newblock {\em A Survey of Numerical Mathematics, volume {1}}.
\newblock Addison-Wesley, 1972.

\bibitem[Y2]{Y2}
{Yu, D. C.}, {Chen, S. T.}, and {Alvarado, F. L.}
\newblock An interactive graphic interface to illustrate sparse matrix/vector
  methods.
\newblock {Paper} 90-WM-072-9-PWRS, Univ. of Wisconsin, Madison, 1990.
\newblock (Presented at {IEEE} {Winter Power Meeting}).

\bibitem[Y7]{Y7}
{Yuan, Y.}
\newblock On a subproblem of trust region algorithms for constrained
  optimization.
\newblock {Tech. Report} DAMTP-1986-NA-10, Dept. of Applied Mathematics and
  Theoretical Physics, Univ. of Cambridge, England, 1987.

\bibitem[Y8]{Y8}
{Yuan, Y.}
\newblock A dual algorithm for minimizing a quadratic function with two
  quadratic constraints.
\newblock {Tech. Report} DAMTP-1988-NA-3, Dept. of Applied Mathematics and
  Theoretical Physics, Univ. of Cambridge, England, 1988.

\bibitem[Z17]{Z17}
{Zangwill, W. I.}
\newblock {\em Nonlinear Programming}.
\newblock Prentice-Hall, 1969.

\bibitem[Z12]{Z12}
{Zenios, S. A.}
\newblock On fine-grain decomposition of multicommodity transportation
  problems.
\newblock {\em SIAM J. Optimization}, 1(4):643--669, 1991.

\bibitem[Z6]{Z6}
{Zenios, S. A.}
\newblock Parallel computing~: {The} introduction of novel computer
  architectures greatly alters technical landscape.
\newblock {\em OR/MS Today}, pages 44--49, August 1992.

\bibitem[Z29]{Z29}
{Zenios, S. A.} and {Mulvey, J. M.}
\newblock Relaxation techniques for strictly convex network problems.
\newblock {\em Annals of Oper. Res.}, 1986.

\bibitem[Z5]{Z5}
{Zenios, S. A.} and {Mulvey, J. M.}
\newblock Vectorization and multitasking of nonlinear network programming
  algorithms.
\newblock {\em Math. Programming}, 42:449--470, 1988.

\bibitem[Z11]{Z11}
{Zenios, S. A.} and {Pinar, M. \c C.}
\newblock Parallel block-partitioning of truncated {Newton} methods for
  nonlinear network optimization.
\newblock {Tech. Report} 89-09-08, Decision Sciences Dept., The Wharton School,
  Univ. of Pennsylvania, 1989.

\bibitem[Z7]{Z7}
{Zhang, G.} and {Elman, H. C.}
\newblock Parallel sparse {Cholesky} factorization on a shared memory
  multiprocessor.
\newblock {\em Parallel Computing}, 18:1009--1022, 1992.

\bibitem[Z18]{Z18}
{Zhang, Y.}
\newblock Computing a {Celis-Dennis-Tapia} trust region step for equality
  constrained optimization.
\newblock {Tech. Report} TR-88-16, Dept. of Mathematical Sciences, Rice Univ.,
  Houston, Texas, 1988.

\bibitem[Z13]{Z13}
{Zhang, Y.}, {Tapia, R. A.}, and {Dennis, J. E. Jr.}
\newblock On the superlinear and quadratic convergence of primal-dual interior
  point linear programming algorithms.
\newblock {\em SIAM J. Optimization}, 2:304--324, 1992.

\bibitem[Z8]{Z8}
{Zhou, Y. F.}
\newblock Optimal parallel triangulation of a sparse matrix~: {A} graphical
  approach.
\newblock In {\em {IEEE} 1981 Symposium on Circuits and Systems}, 1981.

\bibitem[Z24]{Z24}
{Zielke, G.}
\newblock Adjustment of the inverse of a symmetric matrix when two symmetric
  elements are changed.
\newblock {\em Comm. ACM}, 11:118, 1968.

\bibitem[Z25]{Z25}
{Zielke, G.}
\newblock Inversion of modified symmetric matrices.
\newblock {\em J. ACM}, 15:402--408, 1968.

\bibitem[Z26]{Z26}
{Zielke, G.}
\newblock Variation of the inverse of a symmetric matrix under symmetric
  variation of rows and columns.
\newblock {\em Computing}, 3:76--77, 1968.

\bibitem[Z21]{Z21}
{Zienkiewicz, O. C.}
\newblock {\em The Finite Element Method in Structural and Continuum
  Mechanics}.
\newblock McGraw-Hill, 1967.

\bibitem[Z20]{Z20}
{Zienkiewicz, O. C.}
\newblock {\em The Finite Element Method}.
\newblock McGraw-Hill, 1977.

\bibitem[Z16]{Z16}
{Zisman, A.}
\newblock A \'arvore-{B} e uma proposta de implementa\c c\~ao.
\newblock Master's thesis, Instituto de Matem\'atica e Estat\'\i stica, USP,
  1993.

\bibitem[Z15]{Z15}
{Zisman, A.} and {Setzer, V. W.}
\newblock Um novo algoritmo de concorr\^encia para acesso e compacta\c c\~ao de
  \'arvores-{B}.
\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 614--630, 1993.

\bibitem[Z31]{Z31}
{Zitney, S. E.}
\newblock A frontal code for aspen plus on advanced architecture computers.
\newblock In {\em American Inst. of Chemical Eng. ({AIChE}) Symposium on
  Parallel Computing}, 1990.

\bibitem[Z32]{Z32}
{Zitney, S. E.}, {Mallya, J.}, {Davis, T. A.}, and {Stadtherr, M. A.}
\newblock Multifrontal vs. frontal techniques for chemical process simulation
  on supercomputers.
\newblock {\em Comput. Chem. Eng.}, 1995.
\newblock ({To be published}).

\bibitem[Z30]{Z30}
{Zitney, S. E.} and {Stadtherr, M. A.}
\newblock A frontal algorithm for equation-based chemical process flowsheeting
  on vector and parallel computers.
\newblock In {\em American Inst. of Chemical Eng. ({AIChE}) Annual Meeting},
  Washington, 1988.

\bibitem[Z33]{Z33}
{Zitney, S. E.} and {Stadtherr, M. A.}
\newblock Supercomputing strategies for the design and analysis of complex
  separation systems.
\newblock {\em Ind. Eng. Chem. Res.}, 32:604--612, 1993.

\bibitem[Z34]{Z34}
{Zlatev, Z.}
\newblock On some pivotal strategies in {Gaussian} elimination by sparse
  technique.
\newblock {\em SIAM J. Numer. Anal.}, 17:18--30, 1980.

\bibitem[Z22]{Z22}
{Zlatev, Z.}
\newblock Comparison of two pivotal strategies in sparse plane rotations.
\newblock {\em Comput. Math. Appl.}, 8:119--135, 1982.

\bibitem[Z1]{Z1}
{Zlatev, Z.}
\newblock {\em Computational Methods for General Sparse Matrices}.
\newblock Kluwer Academic Publishers, 1991.

\bibitem[Z3]{Z3}
{Zlatev, Z.} and {Barker, V. A.}ÿand {Thomsen, P. G.}
\newblock {SSLEST}~: {A} {FORTRAN} {IV} subroutine for solving sparse systems
  of linear equations, ``{User's Guide}''.
\newblock {Tech. Report} NI-78-01, Numerisk Institut, Lyngby, Denmark, 1978.

\bibitem[Z23]{Z23}
{Zlatev, Z.} and {Nielsen, H.}
\newblock {LLSS01}~: {A} {FORTRAN} subroutine for solving least squares
  problems, ``{User's Guide}''.
\newblock {Tech. Report} 79-07, Institute of Numerical Analysis, Technical
  Univ. of Denmark, Lyngby, 1979.

\bibitem[Z14]{Z14}
{Zlatev, Z.} and {Thomsen, P. G.}
\newblock {ST}~: {A} {FORTRAN} {IV} subroutine for the solution of large
  systems of linear algebraic equations with real coefficients by use of sparse
  technique.
\newblock {Tech. Report} 76-05, Institute of Numerical Analysis, Technical
  Univ. of Denmark, 1976.

\bibitem[Z2]{Z2}
{Zlatev, Z.}, {Wasniewski, J.}, and {Schaumburg, K.}
\newblock {\em {Y12M}~: {Solution} of Large and Sparse Systems of Linear
  Algebraic Equations, Documentation of Subroutines}, volume 121 of {\em
  Lecture Notes in Computer Science}.
\newblock Springer-Verlag, 1981.

\bibitem[Z9]{Z9}
{Zmijewski, E.}
\newblock {\em Sparse {Cholesky} Factorization on a Multiprocessor}.
\newblock PhD thesis, Dept. of Computer Science, Cornell Univ., 1987.
\newblock ({Report 87-856}).

\bibitem[Z19]{Z19}
{Zmijewski, E.}
\newblock Limiting communication in parallel sparse {Cholesky} factorization.
\newblock {Tech. Report} TRCS-89-18, Dept. of Computer Science, Univ. of
  California, Santa Barbara, 1989.

\bibitem[Z4]{Z4}
{Zmijewski, E.} and {Gilbert, J. R.}
\newblock A parallel algorithm for large sparse {Cholesky} factorization on a
  multiprocessor.
\newblock {Tech. Report} TR-86-733, Dept. of Computer Science, Cornell Univ.,
  Ithaca, 1986.

\bibitem[Z10]{Z10}
{Zmijewski, E.} and {Gilbert, J. R.}
\newblock A parallel algorithm for sparse symbolic {Cholesky} factorization on
  a multiprocessor.
\newblock {\em Parallel Computing}, 7:199--210, 1988.

\bibitem[Z27]{Z27}
{Zurm{\"u}hl, R.}
\newblock {\em Praktische Mathematik}.
\newblock Springer-Verlag, 1957.

\bibitem[Z28]{Z28}
{Zurm{\"u}hl, R.}
\newblock {\em Matrizen}.
\newblock Springer-Verlag, 1958.

\end{thebibliography}