----------------------------------------------------------------------------- Bibliography on the Solution of Sparse Linear Systems and Related Areas of Computation Dr. Ricardo Duarte Arantes Computational and Applied Mathematics Department National Laboratory for Scientific Computation Rua Lauro Muller, 455 - Botafogo 22290-160 - Rio de Janeiro, Brazil http://www.lncc.br/~duarte/sparsbib.html August 1997 ----------------------------------------------------------------------------- This bibliographic list of references was originally compiled during the elaboration of my PhD thesis (on "Structural Codifications for the Scalar Scalar Solution of Sparse Symmetric Positive Definite Linear Systems"). This work has been gradually expanded since them, counting now with more than 2000 selected references, covering the solution of Sparse Linear Systems and Related Areas of computation, including: Computational Linear Algebra, High Performance Computing, Mathematical Programming and Graph Theory. One additional aspect of this bibliography is the citation of a significant number of Classical textbook references. For the future, a commented version by subject areas is planned, with the indication of selected works from the literature. ============================================================================= Previous Release: September 1996 Updated: August 1997 Number of Entries: 2290 Author: Ricardo Duarte Arantes (na.rarantes) URL: http://www.lncc.br/~duarte/sparsbib.html ============================================================================= Aasen, J. O. On the reduction of a symmetric matrix to tridiagonal form. BIT, 11:233-242, 1971. Abadie, J., editor. Nonlinear Programming. North-Holland, 1967. Abramowitz, M. and Stegun, I. A., editors. Handbook of Mathematical Functions. Dover Publications, 1964. ACM. Special Issue : Programming. ACM Computing Surveys, 6(4), 1974. Acton, F. S. Numerical Methods That Work. Harper and Row, 1970. Adler, I., Karmarkar, N., Resende, M. G. C., and Veiga, G. Data structures and programming techniques for the implementation of Karmarkar's algorithm for linear programming. ORSA J. Computing, 1(2):84-106, 1989. Adler, I., Karp, R. M., and Shamir, R. A simplex variant solving an m x d linear program in O(min(m^2,d^2)) expected number of pivot steps. J. Complexity, 3:372-387, 1987. Adler, I., Resende, M. G. C., Veiga, G., and Karmarkar, N. An implementation of Karmarkar's algorithm for linear programming. Math. Programming, 44:297-335, 1989. (Errata in Math. Programming, 50, page 415, 1991). Agerwala, T. and Cocke, J. High performance reduced instruction set processors. Tech. Report, IBM, 1987. Ahlberg, H. H., Nilson, E., and Walsh, J. L., editors. The Theory of Splines and Their Applications. Academic Press, 1967. Aho, A. V., Garey, M. R., and Ullmann, J. D. The transitive reduction of a directed graph. SIAM J. Comput., 1:131-137, 1972. Aho, A. V., Hopcroft, J. E., and Ullman, J. D. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974. Aho, A. V., Hopcroft, J. E., and Ullman, J. D. Data Structures and Algorithms. Addison-Wesley, 1983. Aho, A. V., Hopcroft, J. E., and Ullmann, J. D. On finding lowest common ancestors in trees. SIAM J. Comput., 5:115-132, 1976. Aho, A. V., Sethi, R., and Ullman, J. D. Compilers : Principles, Techniques and Tools. Addison-Wesley, 1986. Aho, A. V. and Ullman, J. D. The Theory of Parsing, Translation and Compiling, volume 2 : Compiling. Prentice-Hall, 1973. Aho, A. V. and Ullman, J. D. Principles of Compiler Design. Prentice-Hall, 1977. Akl, S. G. Parallel Sorting Algorithms. Academic Press, 1985. Akl, S. G. The Design and Analysis of Parallel Algorithms. Prentice-Hall, 1989. Akl, S. G. and Lyons, K. A. Parallel Computational Geometry. Prentice-Hall, 1993. Al-Bassam, S. and El-Rewini, H. Processor allocation for hypercubes. J. of Parallel and Distributed Computing, 16:394-401, 1992. Alaghband, G. Parallel pivoting combined with parallel reduction. Tech. Report 87-75, ICASE, NASA Langley Research Center, Hampton, 1987. Alaghband, G. Multiprocessor Sparse LU Decomposition with Controlled Fill-in. PhD thesis, Univ. of Colorado, Boulder, 1988. Alaghband, G. Parallel pivoting combined with parallel reduction and fill-in control. Parallel Computing, 11:201-221, 1989. Alaghband, G. Parallel sparse matrix solution and performance. Parallel Computing, 21:1407-1430, 1995. Alaghband, G. and Jordan, H. F. Parallelization of the MA28 sparse matrix package for the HEP. Tech. Report CSDG-83-3, Dept. of Electrical and Computer Eng., Univ. of Colorado, Boulder, 1983. Alaghband, G. and Jordan, H. F. Parallelizing a sparse matrix package. Tech. Report CSDG-83-3, Computer System Design Group, Electrical and Computer Eng. Dept., Univ. of Colorado, 1983. Alaghband, G. and Jordan, H. F. Multiprocessor sparse L/U decomposition with controlled fill-in. Tech. Report 85-48, ICASE, NASA Langley Research Center, Hampton, 1985. Alaghband, G. and Jordan, H. F. Sparse Gaussian elimination with controlled fill-in on a shared memory multiprocessor. Tech. Report ECSE 86-1-5, Dept. of Electrical and Computer Eng., Univ. of Colorado, 1986. Alaghband, G. and Jordan, H. F. Sparse Gaussian elimination with controlled fill-in on a shared memory multiprocessor. IEEE Trans. Comput., C-38(11):1539-1557, 1989. Alavi, Y., Chung, F. R. K., Graham, R. L., and Hsu, F., editors. Graph Theory, Combinatorics, Algorithms, and Applications, Proc. Conference held at San Francisco State University, 1989. SIAM Publications, 1991. Alfeld, P. and Eyre, D. J. Algorithm 701 : GOLIATH, A software system for the exact analysis of rectangular rank-deficient sparse rational linear systems. ACM Trans. Math. Software, 17(4):519-532, 1991. Alfeld, P. and Eyre, D. J. The exact analysis of sparse rectangular linear systems. ACM Trans. Math. Software, 17(4):502-518, 1991. Allen, R. H. Fast computer aided analysis of nonlinear electronic circuits. In Proc. Cornell Conference on Computerized Electronics, pages 326-345, Ithaca, 1969. Cornell Univ. Almasi, G. S. and Gottlieb, A. Highly Parallel Computing. The Benjamin/Cummings Publishing Co., 1989. Alpern, B. and Carter, L. Performance programming : A science waiting to happen. In Vishkin, U., editor, Developing a Computer Science Agenda for High-Performance Computing. ACM Press, 1994. Alpern, B. and Carter, L. Is scalability relevant ? : A look at sparse matrix-vector product. In Proc. 7^th SIAM Conference on Parallel Processing, San Francisco, 1995. Alpern, B. and Carter, L. Message compression for high performance. In Proc. 7^th SIAM Conference on Parallel Processing, San Francisco, 1995. Alpern, B. and Carter, L. The myth of scalable high performance. Tech. Report, Computer Science and Eng. Dept., San Diego Supercomputer Center, Univ. of California, San Diego, 1995. Alpern, B., Carter, L., Feig, E., and Selker, T. The uniform memory hierarchy model of computation. Tech. Report, IBM Thomas J. Watson Research Center, Yorktown Heights, 1992. Alpern, B., Carter, L., and Ferrante, J. Modeling parallel computers as memory hierarchies. In Proc. Programming Models for Massively Parallel Computers, 1993. Alpern, B., Carter, L., and Selker, T. Visualizing computer memory architectures. In IEEE Visualization '90 Conference, 1990. Alsac, O., Stott, B., and Tinney, W. F. Sparsity-oriented compensation methods for modified network solutions. IEEE Trans. Power Apparatus and Systems, PAS-102(5):1050-1060, 1983. Alvarado, F. L. Computational complexity in power systems. IEEE Trans. Power Apparatus and Systems, PAS-95(4):1028-1037, 1976. Alvarado, F. L. A note on sorting sparse matrices. Proc. of the IEEE, 67(9):1362-1363, 1979. Alvarado, F. L. Parallel solution of transient problems by trapezoidal integration. IEEE Trans. Power Apparatus and Systems, PAS-98:1080-1090, 1979. Alvarado, F. L. Manipulation and visualization of sparse matrices. ORSA J. Computing, 2(2):186-207, 1990. Alvarado, F. L. Sparse matrix technology for power system computer applications. Technical report, Univ. of Wisconsin, Madison, 1990. (Presented at IEEE Winter Power Meeting). Alvarado, F. L. and Enns, M. K. Blocked sparse matrices in electric power systems. Paper A-76-362-4, Univ. of Wisconsin, Madison, 1976. (Presented at IEEE Summer Power Meeting, Portland). Alvarado, F. L., Enns, M. K., and Tinney, W. F. Sparsity enhancement in mutually coupled networks. IEEE Trans. Power Apparatus and Systems, PAS-103:1582-1509, 1984. Alvarado, F. L., Mong, S. K., and Enns, M. K. A fault program with macros, monitors and direct compensation in mutual groups. IEEE Trans. Power Apparatus and Systems, PAS-104:1109-1120, 1985. Alvarado, F. L., Reitan, D. K., and Bahari-Kashani, M. Sparsity in diakoptic algorithms. IEEE Trans. Power Apparatus and Systems, PAS-96(5):1450-1459, 1977. Alvarado, F. L. and Schreiber, R. Optimal parallel solution of sparse triangular systems. Contractor Report CR-188872, NASA, 1990. Alvarado, F. L. and Schreiber, R. Optimal parallel solution of sparse triangular systems. SIAM J. Sci. and Stat. Comput., 14:446-460, 1993. Alvarado, F. L. and Tinney, W. F. State estimation using augmented block matrices. Paper 90-WM-241-0-PWRS, Univ. of Wisconsin, Madison, 1990. (Presented at IEEE Winter Power Meeting). Alvarado, F. L., Tinney, W. F., and Enns, M. K. Sparse matrix inverse factors. Paper 88-SM-728-8, Univ. of Wisconsin, Madison, 1988. (Presented at IEEE Summer Power Meeting, Portland, to be published at IEEE Trans. Power Systems, 1990). Alvarado, F. L., Yu, D. C., and Betancourt, R. Ordering schemes for partitioned sparse inverses. Technical report, Univ. of Wisconsin, Madison, 1989. (Presented at SIAM Symposium on Sparse Matrices, Salishan Lodge, Oregon). Alvarado, F. L., Yu, D. C., and Betancourt, R. Partitioned sparse A^-1 methods. IEEE Trans. Power Systems, PWRS-5(2):452-459, 1990. Alway, G. G. and Martin, D. W. An algorithm for reducing the bandwidth of a matrix of symmetric configuration. Computing J., 8:264-272, 1965. Amano, H., Boku, T., Kudoh, T., and Aiso, H. A new version of the sparse matrix solving machine. In Proc. 12^th International Symposium on Computer Architecture, pages 100-107, 1985. Amdahl, G. M. The validity of the single processor approach to achieving large scale computing capabilities. AFIPS Conf. Proc., 30:483-485, 1967. Amdahl, G. M. Limits of expectation. Int. J. of Supercomputer Appl., 2(1):88-97, 1988. Amdahl, G. M., Blaauw, G. A., and Brooks, F. P. Jr. Architecture of the IBM System/360. IBM J. of Research and Development, 8(2):87-101, 1964. American Standards Association, Inc. X3.9 1966 American National Standard FORTRAN, 1966. American Standards Association, Inc. X3.9 1978 American National Standard FORTRAN, 1978. Ames, W. F., editor. Nonlinear Partial Differential Equations in Engineering. Academic Press, 1965. Amestoy, P. R. Vectorization of a multiprocessor multifrontal code. Int. J. of Supercomputer Appl., 3(3):41-59, 1989. Amestoy, P. R. Factorization of Large Sparse Matrices Based on a Multifrontal Approach in a of Multiprocessor Environment. PhD thesis, CERFACS, Toulouse, 1991. (Report TH-PA-91-2). Amestoy, P. R. and Duff, I. S. Memory allocation issues in sparse multiprocessor multifrontal methods. Int. J. of Supercomputer Appl., 7:64-82, 1993. Amestoy, P. R. and Duff, I. S. MUPS : A parallel package for solving sparse unsymmetric sets of linear equations. Tech. Report, CERFACS, 1994. Amorim, C. L. Simulated performance of a class of vector processors. In Kartashev, L. P. and Kartashev, S. I., editors, Proc. 2^nd International Conference on Supercomputing, pages 350-358, 1987. Amorim, C. L., Citro, R., Souza, A. F., and Chaves Filho, E. M. O sistema de computacao paralela NCP I. In Anais do V Simposio Brasileiro de Arquitetura de Computadores e Processamento de Alto Desempenho - XIII Congresso da Sociedade Brasileira de Computacao, pages 89-102, 1993. Andersen, J., Mitra, G., and Parkinson, D. The scheduling of sparse matrix-vector multiplication on a massively parallel DAP computer. Parallel Computing, 18:675-697, 1992. Anderson, D. W., Sparacio, F. J., and Tomasulo, R. M. The IBM 360 Model 91 : Machine philosophy and instruction handling. IBM J. of Research and Development, 11(1):8-24, 1967. 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. LAPACK ``User's Guide''. SIAM Publications, 2^nd edition, 1995. Anderson, E. and Saad, Y. Solving sparse triangular linear systems on parallel computers. Internat. J. High Speed Comput., 1:73-95, 1989. Anderson, J. P. Program structures for parallel processing. Comm. ACM, 8:786-788, 1965. Andrews, H. C. Degrees of freedom and modular structure in matrix multiplications. IEEE Trans. Comput., C-20:133-141, 1971. Angelaccio, M. and Colajanni, M. Subcube matrix decomposition : A unifying view for LU factorization on multicomputers. Parallel Computing, 20:257-270, 1994. Anon. Modern Computing Methods, volume 16 of Notes in Applied Science. Her Majesty's Stationery Office, London, 1961. Anon. Harwell Subroutine Library : A Catalogue of Subroutines (Release 11). Theoretical Studies Department, AEA Industrial Technology, 1993. Arantes, R. D. 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. Tech. Report 102/91, CEPEL Electric Energy Research Center, Rio de Janeiro, 1990. (in Portuguese). Arantes, R. D. Symbolic methodologies for the efficient solution of sparse linear systems with static structure. Master's thesis, Systems and Computation Engineering Dept., COPPE / Federal University of Rio de Janeiro, Rio de Janeiro, Brazil, 1994. (in Portuguese). Arantes, R. D. New methodologies for the solution of sparse positive definite linear systems. In Annals of XIX National Congress of Computational and Applied Mathematics, pages 419-420, Goiania, Brazil, 1996. (in Portuguese). Arantes, R. D. Structural Codifications for the Scalar Solution of Sparse Symmetric Positive Definite Linear Systems. PhD thesis, Systems and Computation Engineering Dept., COPPE / Federal University of Rio de Janeiro, Rio de Janeiro, Brazil, 1996. (in Portuguese). Arantes, R. D. Code orderings for the solution of sparse positive definite linear systems, September 1997. (Talk to be presented at the II Pan American Workshop on Applied and Computational Mathematics). Arantes, R. D. Implicit reorderings for the scalar solution of sparse positive definite linear systems, February 1997. (Talk presented at the 2nd Summer School of the Brazilian National Laboratory for Scientific Computation). Arantes, R. D. and Amorim, C. L. Parallel solution of sparse systems of linear equations. In Annals of V Brazilian Symposium of Computer Architectures and High Performance Computing - XIII Congress of the Brazilian Computing Society, pages 202-216, Florianopolis, Brazil, 1993. (in Portuguese). Arden, B. W. An Introduction to Digital Computing. Addison-Wesley, 1963. Arden, B. W. and Astill, K. N. Numerical Algorithms : Origins and Applications. Addison-Wesley, 1970. Argyris, J. H., editor. Energy Theorems and Structural Analysis. Butterworths, London, 1960. Argyris, J. H., editor. Recent Advances in Matrix Methods of Structural Analysis. Macmillan, New York, 1964. Arioli, M., Demmel, J. W., and Duff, I. S. Solving sparse linear systems with sparse backward error. Tech. Report CSS-214, Computer Science and Systems Division, AERE, Harwell Laboratory, Didcot, England, 1988. (Published at SIAM J. Matrix Anal. Appl. 10(2):165-190, 1989). Arioli, M. and Duff, I. S. Experiments tearing large sparse systems. Tech. Report CSS-217, Computer Science and Systems Division, AERE, Harwell Laboratory, Didcot, England, 1988. (To be published at Proc. of Advances in Numerical Computation, from National Propulsion Laboratory, 1987 in the memory of James Wilkinson). Arioli, M., Duff, I. S., Noailles, J., and Ruiz, D. A block projection method for sparse matrices. SIAM J. Sci. and Stat. Comput., 13:47-70, 1990. Arioli, M., Duff, I. S., and Rijk, P. P. M. On the augmented system approach to sparse least-squares problem. Numer. Math., 55:667-684, 1989. Armijo, L. Minimization of functions having Lipschitz-continuous first partial derivatives. Pacific J. Math., 16:1-3, 1980. Armstrong, B. A. Near minimal matrix profiles and wavefronts for testing nodal resequencing algorithms. Int. J. Numer. Meth. Eng., 21:1785-1790, 1986. Arnborg, S. Efficient algorithms for combinatorial problems on graphs with bounded decomposability : A survey. BIT, 25:2-23, 1985. Arnborg, S., Corneil, D. G., and Proskurowski, A. Complexity of finding embebdings in a k-tree. SIAM J. Alg. and Discr. Meth., 8:277-284, 1987. Arnborg, S., Lagergren, J., and Seese, D. Easy problems for tree-decomposable graphs. J. of Algorithms, 12:308-340, 1991. ASCE. Extensive Bibliography on the use of Digital Computers in Structural Engineering. J. Amer. Soc. Civil Engrs., Structural Division, 89, pp. 461-491, 1963. Ashcraft, C. A vector implementation of the multifrontal method for large sparse symmetric positive definite linear systems. Tech. Report ETA-TR-51, Engineering Technology Applications (ETA) Division, Boeing Computer Services, Seattle, Washington, 1987. Ashcraft, C. The Aggregate Model for the Factorization of Symmetric Positive Definite Matrices. PhD thesis, Dept. of Computer Science, Yale Univ., New Haven, 1990. Ashcraft, C. The domain/segment partition for the factorization of sparse symmetric positive definite matrices. Tech. Report ECA-TR-148, Engineering Computing and Analysis (ECA) Division, Boeing Computer Services, Seattle, Washington, 1990. Ashcraft, C. Compressed graphs and the minimum degree algorithm. SIAM J. Sci. and Stat. Comput., 1995. (Tech. Report BCS-TECH-93-024, Boeing Computer Services, To be published). Ashcraft, C., Eisenstat, S. C., and Liu, J. W. H. A fan-in algorithm for distributed sparse numerical factorization. SIAM J. Sci. and Stat. Comput., 11(3):593-599, 1990. Ashcraft, C., Eisenstat, S. C., Liu, J. W. H., Peyton, B., and Sherman, A. H. A compute-ahead implementation of the fan-in sparse distributed factorization scheme. Tech. Report ORNL-TM-11496, Oak Ridge National Laboratory, 1990. Ashcraft, C., Eisenstat, S. C., Liu, J. W. H., and Sherman, A. H. A comparison of 3 column-based distributed sparse factorization schemes. Tech. Report YALEU-DCS-RR-810, Dept. of Computer Science, Yale Univ., 1990. Ashcraft, C. and Grimes, R. G. The influence of relaxed supernode partitions on the multifrontal method. ACM Trans. Math. Software, 15(4):291-309, 1989. Ashcraft, C., Grimes, R. G., Lewis, J. G., Peyton, B. W., and Simon, H. D. Progress in sparse matrix methods for large linear systems on vector supercomputers. Int. J. of Supercomputer Appl., 1(4):10-30, 1987. Ashcraft, C., Lewis, J. G., and Peyton, B. W. A supernodal implementation of general sparse factorization for vector computers. Tech. Report ETA-TR-52, ETA Division, Boeing Computer Services, Seattle, Washington, 1987. Ashcraft, C. and Liu, J. W. H. Generalized nested dissection : Some recent progress. In Proc. 5^th SIAM Conf. on Applied Linear Algebra, Snowbird, Utah, 1994. Ashcraft, C. and Liu, J. W. H. A partition improvement algorithm for generalized nested dissection. Tech. Report BCS-TECH-94-020, Boeing Computer Services, Seattle, 1994. Ashcraft, C. and Liu, J. W. H. Using domain decomposition to find graph bisectors. Tech. Report CS-95-08, Dept. of Computer Science, York Univ., North York, Ontario, 1995. Aspvall, B. and Gilbert, J. R. Graph coloring using eigenvalue decomposition. SIAM J. Alg. and Discr. Methods, 5:526-538, 1984. Aspvall, B. and Stone, R. E. Khachiyan's linear programming algorithm. J. Algorithms, 1:1-13, 1980. Atkinson, K. E. An Introduction to Numerical Analysis. John Wiley & Sons, 1978. Atkinson, L. V. Hashing matrix subscripts. BIT, 15:328-330, 1975. Avriel, M. Nonlinear Programming : Analysis and Methods. Prentice-Hall, 1976. Aykanat, C., Ozguner, F., Ercal, F., and Sadayapan, P. Iterative algorithms for solution of large sparse systems of linear equations on hypercubes. IEEE Trans. Comput., C-37(12), 1988. Azevedo, G. P. Uma nova estrategia para a solucao de problemas de estimacao de estado com restricoes de igualdade. Master's thesis, COPPE/UFRJ, 1989. Baase, S. Computer Algorithms. Addison-Wesley, 2^nd edition, 1985. Bacher, R. and Tinney, W. F. Faster local power flow solutions : The zero mismatch approach. IEEE Trans. Power Systems, PWRS-4(4):1345-1354, 1989. Backus, J. The history of FORTRAN I, II, and III. Annals of the History of Computing, 1:21-37, 1979. Bailey, D. H. Extra high speed matrix multiplication on the CRAY-2. SIAM J. Sci. and Stat. Comput., 9:603-607, 1988. Bailey, D. H., Bjorstad, P. E., Gilbert, J. R., Mascagni, M. D., Schreiber, R., Simon, H. D., Torczon, V. J., and Watson, L. T., editors. Proc. 7^th SIAM Conference on Parallel Processing for Scientific Computing. SIAM Publications, 1995. Bailey, D. H., Lee, K., and Simon, H. D. Using Strassen's algorithm to accelerate the solution of linear systems. (Manuscript), 1990. Baker, J. M. A note on multiplying Boolean matrices. Comm. ACM, 5:102, 1962. 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. Ibm second-generation RISC machine organization. In Proc. International Conference on Computer Design, pages 138-142. IEEE, 1989. Bank, R. E. FORTRAN implementation of marching algorithms. Tech. Report TR-17-75, Center for Research in Computing Technology, Harvard Univ., Cambridge, 1975. Bank, R. E. Marching Algorithms for Elliptic Boundary Value Problems. PhD thesis, Harvard Univ., 1975. Bank, R. E. Marching algorithms and block Gaussian elimination. In Bunch, J. R. and Rose, D. J., editors, Sparse Matrix Computations. Academic Press, 1976. Bank, R. E. PLTMG : A Software Package for Solving Elliptic Partial Differential Equations, ``User's Guide'' 7.0. SIAM Publications, 1994. Bank, R. E. and Rose, D. J. Marching algorithms for elliptic boundary value problems - I : The constant coefficient case. SIAM J. Numer. Anal. Bank, R. E. and Rose, D. J. An O(n^2) method for solving constant coefficient boundary value problems in two dimensions. SIAM J. Numer. Anal. Bank, R. E. and Rose, D. J. On the complexity of sparse Gaussian elimination via bordering. SIAM J. Sci. and Stat. Comput., 11(1):145-160, 1990. Bank, R. E. and Smith, R. K. General sparse elimination requires no permanent integer storage. SIAM J. Sci. and Stat. Comput., 8(4):574-584, 1987. Barbosa, V. C., Fernandes, E. S. T., and Amorim, C. L. Perspectivas em processamento paralelo para computacao cientifica. Pesquisa Operacional, 8(1):20-40, 1988. Barbosa, V. C. and Lima, P. M. V. On the distributed parallel simulation of Hopfield's neural networks. Software Practice and Experience, 20(10):967-983, 1990. Bard, Y. Nonlinear Parameter Estimation. Academic Press, 1970. Barker, V. A. Course in Advanced Sparse Matrix Techniques : Copenhagen 1976, volume 572 of Lecture Notes in Mathematics. Springer-Verlag, 1977. Barnes, G. H., Brown, R. M., Kato, M., Kuck. D. J., Slonick, D. L., and Stokes, R. A. The ILLIAC IV computer. IEEE Trans. Comput., C-17:746-757, 1968. Barret, R., Berry, M., Chan, T., Demmel, J., Donato, J., Dongarra, J., Eijkhout, V., Romine, C., and van der Vorst, H. Templates for the Solution of Linear Systems : Building Blocks for Iterative Methods. SIAM Publications, 1993. Barret, W. W., Johnson, C. R., Olesky, D. D., and van den Driessche, P. Inherited matrix entries : Principal submatrices of the inverse. SIAM J. Alg. and Discr. Methods, 8:313-322, 1987. Barron, D. W., editor. Recursive Techniques in Programming. American Elsevier, 1968. Barron, D. W. and Swinnerton-Dyer, H. P. F. Solution of simultaneous linear equations using a magnetic tape store. Computing J., 3:28-33, 1960. Bartels, R. H. A stabilization of the simplex method. Numer. Math., 16:414-434, 1971. Bartels, R. H. and Golub, G. H. The simplex method of linear programming using LU decomposition. Comm. ACM, 12:266-268, 1969. Bartholomew-Biggs, M. C. Recursive quadratic programming methods for nonlinear constraints. In Powell, M. J. D., editor, Nonlinear Optimization 1981. Academic Press, 1982. Barwell, V. and George, A. A comparison of algorithms for solving symmetric indefinite systems of linear equations. ACM Trans. Math. Software, 2:242-251, 1976. Baskow. T. R., editor. Engineering Applications of Digital Computers. Academic Press, 1968. Baty, J. P. and Stewart, K. L. Dissection of structures. J. Struct. Div. ASCE, 5:217-232, 1967. Baty, J. P. and Stewart, K. L. Organization of network equations using dissection theory. In Reid, J. K., editor, Large Sparse Sets of Linear Equations, pages 169-190. Academic Press, 1971. Bau, D. and Trefethen, L. N. Numerical Linear Algebra. SIAM Publications, 1996. (To be published). Bauer, F. L. Optimally scaled matrices. Numer. Math., 5:73-87, 1963. Bauer, F. L. Remarks on optimally scaled matrices. Numer. Math., 13:1-3, 1969. Bauer, F. L. et al. Compiler Construction, An Advanced Course, volume 21 of Lecture Notes in Computer Science. Springer-Verlag, 1974. Baumann, R. Some new aspects on load-flow calculation - I : Impedance matrix generation controlled by network topology. In Power System Computation Conference, Stockholm, 1966. Bayer, D. A. and Lagarias, J. C. The nonlinear geometry of linear programming - I : Affine and projective scaling trajectories. Trans. of the American Math. Soc., 314:499-526, 1989. Bayer, D. A. and Lagarias, J. C. The nonlinear geometry of linear programming - II : Legendre transform coordinates. Trans. of the American Math. Soc., 314:527-581, 1989. Bayer, R. and McCreight. Organization and maintenance of large ordered indexes. Acta Informatica, 1:173-189, 1972. Beale, E. M. L. Nonlinear Programming using a General Mathematical Programming System. Design and Implementation of Optimization Software. Stijthoff and Noordhoff, Holland, 1978. Beale, F. Numerical methods. In Abadie, J., editor, Nonlinear Programming. North-Holland, 1967. Beasley, J. E. An SST-based algorithm for the Steiner problem in graphs. Networks, 19:1-16, 1989. Belady, L. A. A study of replacement algorithms for a virtual-storage computer. IBM Systems Journal, 5:78-101, 1966. Belady, L. A. and Kuehner, C. J. Dynamic space-sharing computer systems. Comm. ACM, 12:282-285, 1969. Bell, C. G., Cady, R., McFarland, H., DeLagi, B., O'Laughlin, J., Noonan, R., and Wulf, W. A new architecture for mini-computers : The DEC PDP-11. In Proc. AFIPS SJCC, pages 657-675, 1970. Bell, C. G. and Newell, A., editors. Computer Structures : Readings and Examples. McGraw-Hill, 1971. Bell, E. T. Men of Mathematics. Simon and Schuster, 1975. BELL Labs. BELL System Tech. Journal, 57(6), part 2, 1978. (Special Issue devoted to UNIX). Bellman, R. Dynamic programming treatment of the traveling salesman problem. J. ACM, 9, 1962. Bellman, R. Introduction to Matrix Analysis. SIAM Publications, 1995. (First edition by McGraw-Hill, 1960). Bellman, R., Cooke, K. L., and Lockett, J. A. Algorithms, Graphs and Computers. Academic Press, 1970. Bellmore, M. and Nemhauser, G. L. The traveling salesman problem : A survey. Operations Res., 16:538-558, 1968. Ben-Ari, M. Principles of Concurrent Programming. Prentice-Hall, 1982. Bender, C. M. and Orszag, S. A., editors. Advanced Mathematical Methods for Scientists and Engineers. McGraw-Hill, 1978. Benders, J. F. Partitioning procedures for solving mixed-variable programming problems. Numer. Math., 4:238-252, 1962. Benner, R., Montry, G., and Weigand, G. Concurrent multifrontal methods : Shared memory, cache and frontwidth issues. Int. J. of Supercomputer Appl., 1(3):26-44, 1987. Bennet, J. M. Triangular factors of modified matrices. Numer. Math., 7:216-221, 1965. Bentley, J. L. Writing Efficient Programs. Prentice-Hall, 1982. Bentley, J. L. Programming Pearls. Addison-Wesley, 1986. Bentley, J. L. More Programming Pearls, 1988. Bentley, J. L., Weide, B. W., and Yao, A. C. Optimal expected-time algorithms for closest point problems. ACM Trans. Math. Software, 6:563-580, 1980. Berge, C. The Theory of Graphs and its Applications. John Wiley & Sons, 1962. Berge, C., editor. The Theory of Graphs, International Symposium, Rome, 1967. Dunod. Berge, C. Graphs and Hypergraphs. North-Holland, 1973. Berger, A., Mulvey, J., Rothberg, E., and Vanderbei, R. Solving multistage stochastic programs using tree dissection. Tech. Report SOR-97-07, Program in Statistics and Operations Research, Princeton Univ., New Jersey, 1995. Berman, P. and Schnitger, G. On the performance of the minimum degree ordering for Gaussian elimination. SIAM J. Matrix Anal. and Appl., 11:83-88, 1990. Berry, M. A FORTRAN-77 software library for the sparse singular value decomposition. Tech. Report CS-92-159, Univ. of Tennessee, Knoxville, 1992. Berry, M. SVDPACKC : version 1.0 ``User's Guide''. Tech. Report CS-93-194, Univ. of Tennessee, Knoxville, 1993. Berry, M. A survey of public-domain Lanczos-based software. In Brown, J. D., Chu, M. T., Ellison, D. C., and Plemmons, R. J., editors, Proc. of the Cornelius Lanczos International Centenary Conference, Rayleigh, 1993, pages 332-334. SIAM Publications, 1994. Berry, R. D. An optimal ordering of electronic circuit equations for a sparse matrix solution. IEEE Trans. Circuit Theory, CT-18:139-145, 1971. Bertsekas, D. P. On penalty and multiplier methods for constrained optimization. SIAM J. Control and Optim., 14:216-235, 1976. Bertsekas, D. P. On the Goldstein-Levitin-Polyak gradient projection method. IEEE Trans. Automatic Control, 21:174-184, 1976. Bertsekas, D. P. Constrained Optimization and Lagrange Multiplier Methods. Academic Press, 1982. Bertsekas, D. P. Projected Newton methods for optimization problems with simple constraints. SIAM J. Control and Optim., 20(2):221-246, 1982. Bertsekas, D. P. and Eckstein, J. Dual coordinate step methods for linear network flow problems. Math. Programming, 42(2):203-244, 1988. Bertsekas, D. P. and Tsitsiklis, J. N. Parallel and Distributed Computation - Numerical Methods. Prentice Hall, 1989. Betancourt, R. An efficient heuristic ordering algorithm for partial matrix refactorization. IEEE Trans. Power Systems, PWRS-3(3):1181-1187, 1988. Bhat, M. V., Habash, W. G., Liu, J. W. H., Nguyen, V. N., and Peeters, M. F. A note on nested dissection for regular grids. SIAM J. Matrix Anal. and Appl., 14(1):253-258, 1993. Bickley, W. G. and McNamee, J. Matrix and other direct methods for the solution of systems of linear difference equations. Philos. Trans. Royal Soc. London, series A, 252:69-131, 1960. Bik, A. J. C. and Wijshoff, H. A. G. Compilation techniques for sparse matrix computations. In ACM International Conference on Supercomputing, Tokyo, 1993. Birge, J. R., Freund, R. M., and Vanderbei, R. J. Prior reduced fill-in in solving equations in interior point algorithms. Operations Res. Letters, 11:195-198, 1992. Birkhoff, G. and George, A. Elimination by nested dissection. In Traub, J. F., editor, Complexity of Sequential and Parallel Numerical Algorithms. Academic Press, 1973. Birkhoff, G. and Varga, R. S. Implicit alternating direction methods. Trans. Amer. Math. Soc., 92:13-24, 1959. Birkhoff, G. and Varga, R. S., editors. Numerical Solution of Field Problems in Continuum Physics. American Math. Soc., Providence, 1970. Birkhoff, G., Varga, R. S., and Young, D. M. Alternating direction implicit method. In Advances in Computers, volume 3, pages 189-273. Academic Press, 1962. Birkhoff, G., Young, D. M., and Zarantonello, E. H. Numerical methods in conformal mapping. In Abadie, J., editor, Proc. of the Symposium Applied Mathematics, volume 4, pages 117-140. McGraw-Hill, 1953. Bischof, C. H., Carle, A., Khademi, P., and Maurer, A. The ADIFOR 2.0 system for the automatic differentiation of FORTRAN 77 programs. Tech. Report CPRC-TR-94-491, Center for Research on Parallel Computation, Rice Univ., Houston, Texas, 1994. Bischof, C. H. and Dongarra, J. J. A project for developing a linear algebra library for high-performance computers. Tech. Report MCS-P-105-0989, Argonne National Laboratory, 1989. Bischof, C. H. and Hovland, P. Using ADIFOR to compute dense and sparse Jacobians. Tech. Memorandum ANL-MCS-TM-158, Mathematics and Computer Science Division, Argonne National Laboratory, 1991. (ADIFOR Working Note # 2). Bischof, C. H., Lewis, J. G., and Pierce, D. J. Incremental condition estimation for sparse matrices. SIAM J. Matrix Anal. Appl., 11:644-659, 1990. Bischof, C. H., Pan, C. T., and Tang, P. T. P. A Cholesky up-and-downdating algorithm for systolic and SIMD architectures. SIAM J. Sci. and Stat. Comput., 1992. (To be published). Bisseling, R., Doup, T., and Loyens, L. A parallel interior point algorithm for linear programming on a network of transputers. Annals of Oper. Res., 43:51-86, 1993. Bixby, R. E. Implementing the simplex method : The initial basis. ORSA J. Computing, 4(3):267-284, 1992. Bixby, R. E. Progress in linear programming. ORSA J. Computing, 6(1):15-22, 1994. Bixby, R. E., Dennis, J. E. Jr., and Wu, Z. Solving nonlinear integer programs with a subgradient approach on parallel computers. SIAM News, 25(4):1, 18-19, 1992. Bixby, R. E., Gregory, J. W., Lustig, I. J., Marsten, R. E., and Shanno, D. F. Very large-scale linear programming : A case study in combining interior point and simplex methods. Operations Res., 40:885-897, 1992. Bjorstad, P. E. A large scale, sparse, secondary storage, direct linear equation solver for structural analysis and its implementation on vector and parallel architectures. Parallel Computing, 5:3-12, 1987. Bjorck, A. Solving linear least squares problems by Gram-Schmidt orthogonalization. BIT, 7:1-21, 1967. Bjorck, A. Methods for sparse least squares problems. In Bunch, J. R. and Rose, D. J., editors, Sparse Matrix Computations. Academic Press, 1976. Bjorck, A. A direct method for sparse least squares problems with lower and upper bounds. Numer. Math., 54:19-32, 1988. Bjorck, A. A note on scaling in the augmented system methods. (Unpublished Manuscript), 1991. Bjorck, A. Numerical Methods for Least Squares Problems. SIAM Publications, 1996. (To be published). Bjorck, A. and Duff, I. S. A direct method for the solution of sparse linear least squares problems. Tech. Report, AERE, Harwell Laboratory, 1979. (To be published at Lin. Alg. Appl.). Bjorck, A., Plemmons, R. J., and Schneider, H., editors. Large Scale Matrix Problems. North-Holland, 1981. Blair, J. R. S. and Peyton, B. W. On finding minimum-diameter clique trees. Tech. Report ORNL-TM-11850, Oak Ridge National Laboratory, 1991. Bloch, E. The engineering design of the STRETCH computer. In Proc. Fall Joint Computer Conference, pages 48-59, 1959. Blum, L. Lectures on a theory of computation and complexity over the reals (or an arbitrary ring). Tech. Report TR-89-065, International Computer Science Institute, Berkeley, 1989. Blum, L., Shub, M., and Smale, S. On a theory of computation and complexity over the real numbers : NP-completeness, recursive functions and universal machines. Bull. AMS, 21(1):1-46, 1989. Bodewig, E. Matrix Calculus. Amsterdam, 2^nd edition, 1959. Bodlaender, H., Gilbert, J. R., Hafsteinsson, H., and Kloks, T. Approximating treewidth, pathwidth, frontsize, and minimum elimination tree height. Tech. Report CSL-90-10, XEROX Palo Alto Research Center, 1990. (To be published at J. Algorithms). Bodlaender, H. L. Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees. J. of Algorithms, 11:631-644, 1990. Bodlaender, H. L. A linear time algorithm for finding tree-decompositions of small treewidth. In Proc. 25^th Annual Symposium on Theory of Computing, pages 226-234. ACM Press, 1993. Bodlaender, H. L. and Mohring, R. H. The pathwidth and treewidth of cographs. SIAM J. Alg. and Discr. Meth., 6:181-188, 1993. Boggs, P. T., Byrd, R. H., and Schnabel, R. B., editors. Numerical Optimization 1984. SIAM Publications, 1985. Boisvert, R. F., Howe, S. E., and Kahaner, D. K. The guide to available mathematical software. Tech. Report PB-84-171305, National Technical Information Service, Virginia, 1984. Bondy, J. A. and Murty, U. S. R. Graph Theory with Applications. North-Holland, 1976. Boom, H. J. and De Jong, E. A critical comparison of several programming language implementations. Software Practice and Experience, 10(6):435-473, 1980. Booth, A. D. Numerical Methods. Butterworths, London, 1955. Boothby. Introduction to Differentiable Manifolds and Riemannian Geometry. Academic Press, 1975. Boothroyd, J. Algorithm 302 : Transpose vector stored array. Comm. ACM, 10(5):292-293, 1967. Borges, C. L. T. Investigacao do desempenho de metodos de solucao do fluxo de potencia para processamento paralelo e vetorial. Master's thesis, COPPE/UFRJ, 1991. Borgwardt, K. The Simplex Method : A Probabilistic Analysis. Springer-Verlag, 1987. Borosh, I. and Fraenkel, A. S. Exact solution of linear equations with rational coefficients by congruence techniques. Math. of Computation, 20(93):107-112, 1966. Borovkov, K. A. Russian-English English-Russian Dictionary on Probability, Statistics and Combinatorics. SIAM Publications, 1994. Bowdler, H. J., Martin, R. S., Peters, G., and Wilkinson, J. H. Solution of real and complex systems of linear equations. Numer. Math., 8:217-234, 1966. Boyer, C. B. A History of Mathematics. John Wiley & Sons, 1968. Brameller, A., Allan, R. N., and Haman, Y. M. Sparsity. Pittman Press, New York, 1976. Brandon, D. M. Jr. IMP - ``General Manual'', A General Simulator for Multivariate Differential or Algebraic Systems. Chemical Engineering Dept., Univ. of Connecticut, Storrs, 1972. Brandon, D. M. Jr. The implementation and use of sparse matrix techniques in general simulation programs. Computing J., 17:165-170, 1974. Branin, F. H. Jr., Hall, L. V., Suez, J., Carlitz, R. M., and Chen, T. C. An interpretative program for matrix arithmetic. IBM Systems Journal, 4:2-24, 1965. Brassard, G. and Bratley, P. Algorithmics : Theory and Practice. Prentice-Hall, 1988. Bratley, P., Fox, B. L., and Schrage, L. A Guide to Simulation. Springer-Verlag, 1987. Brawn, B. S., Gustavson, F. G., and Mankin, E. S. Sorting in a paging environment. Comm. ACM, 13:483-494, 1970. Brayton, R. K. and Cullum, J. An algorithm for minimizing a differentiable function subject to box constraints and errors. Journal Optim. Theory Appl., 29(4):521-558, 1979. Brayton, R. K., Gustavson, F. G., and Willoughby, R. A. Some results on sparse matrices. Math. of Computation, 24:937-954, 1970. (Originally in Tech. Report RC-2332, IBM Research Center, Yorktown Heights, New York, 1969). Bree, D. Jr. Some remarks on the application of graph theory to the solution of sparse systems of linear equations. Internal Publication, Bonneville Power Administration, 1964. Bree, D. Jr. Some Remarks on the Application of Graph Theory to the Solution of Sparse Systems of Linear Equations. PhD thesis, Mathematics Dept., Princeton Univ., New Jersey, 1965. Brent, R. P. Algorithms for matrix multiplication. Tech. Report CS-157, Computer Science Dept., Stanford Univ., 1970. Brent, R. P. Algorithms for Minimization Without Derivatives. Prentice-Hall, 1973. Briggs, P. Register Allocation via Graph Coloring. PhD thesis, Dept. of Computer Science, Rice Univ., 1992. Briggs, W. L. A Multigrid Tutorial. SIAM Publications, 1987. Briggs, W. L. The DFT : An Owner's Manual for the Discrete Fourier Transform. SIAM Publications, 1995. Brigham, O. The Fast Fourier Transform. Prentice-Hall, 1974. Brinch Hansen, P. The Architecture of Concurrent Programs. Prentice-Hall, 1977. Brink, J. and Spillman, R. Computer Architecture and VAX Assembly Language Programming. The Benjamin/Cummings Co., 1987. Brooks, D. F. and Brotton, D. M. Computer system for analysis of large frameworks. Journal ASCE, Structural Division, 94:1-23, 1968. Brooks, F. P. Jr. Mass memory in computer systems. IEEE Trans., MAG-5:635-639, 1969. Brown, D. C. A unified lunar control network. Photogrammetric Engineering, 34:1272-1292, 1968. Brown, R. J. and Tinney, W. F. Digital solutions for large scale power networks. IEEE Trans. Power Apparatus and Systems, PAS-76(3):347, 1957. Brown, W. S. An operating environment for dynamic-recursive computer programming systems. Comm. ACM, 8(6):371-377, 1965. Browne, J., Dongarra, J., Karp, A. H., Kennedy, K., and Kuck, D. 1988 Gordon Bell prize. IEEE Software, 6:78-85, 1989. (Special Report). Broyden, C. G. A new method of solving nonlinear simultaneous equations. Computing J., 12:94-99, 1969. Brualdi, R. A. and Ryser, H. J. Combinatorial Matrix Theory. Cambridge Univ. Press, 1991. Brualdi, R. A. and Shader, B. L. Strong Hall matrices. IMA Preprint Series 909, Institute for Mathematics and Its Applications, Univ. of Minnesota, 1991. Bruce, W. H. Recursive Programming Techniques. Addison-Wesley, 1975. Bucholtz, W., editor. Planning a Computer System : Project STRETCH. McGraw-Hill, 1962. Buckingham, R. A. Numerical Methods. Pittman Press, London, 1957. Bunch, J. R. On Direct Methods for Solving Symmetric Systems of Linear Equations. PhD thesis, Univ. of California, Berkeley, 1969. Bunch, J. R. Analysis of sparse elimination. SIAM J. Numer. Anal., 11:847-873, 1974. Bunch, J. R. Partial pivoting strategies for symmetric matrices. SIAM J. Numer. Anal., 11:521-528, 1974. Bunch, J. R. Block methods for solving sparse linear systems. In Bunch, J. R. and Rose, D. J., editors, Sparse Matrix Computations. Academic Press, 1976. Bunch, J. R. and Hopcroft, J. E. Triangular factorization and inversion by fast matrix multiplication. Math. Comp., 28:231-236, 1974. Bunch, J. R. and Kaufman, L. Some stable methods for calculating inertia and solving symmetric indefinite systems of linear equations. Math. of Computation, 31:163-179, 1977. Bunch, J. R., Kaufman, L., and Parlett, B. N. Decomposition of a symmetric matrix. Numer. Math., 27:95-110, 1976. Bunch, J. R. and Parlett, B. N. Direct methods for solving symmetric indefinite systems of linear equations. SIAM J. Numer. Anal., 8:639-655, 1971. Bunch, J. R. and Rose, D. J. Partitioning, tearing and modification of sparse linear systems. J. Math. Anal. Appl., 48:574-593, 1974. Bunch, J. R. and Rose, D. J. Sparse Matrix Computations. Academic Press, 1976. Buoni, J. J., Farrel, P. A., and Ruttan, A. Algorithms for LU decomposition on a shared memory multiprocessor. Parallel Computing, 19:925-937, 1993. Burke, J. and More, J. On the identification of active constraints. SIAM J. Numer. Anal., 25:1197-1211, 1988. Burke, J., More, J., and Toraldo, G. Convergence properties of trust region methods for linear and convex constraints. Tech. Report ANL-MCS-TM-116, Argonne National Laboratory, Argonne, Illinois, 1988. Busacker, R. G. and Saaty, T. L. Finite Graphs and Their Networks : An Introduction with Applications. McGraw-Hill, 1965. Busing, W. R. and Levy, H. A. A procedure for inverting large symmetric matrices. Comm. ACM, 8:445-446, 1962. Businger, P. A. Matrices which can be optimally scaled. Numer. Math., 12:346-348, 1968. Businger, P. A. and Golub, G. H. Linear least-squares solutions by householder transformations. Numer. Math., 7:269-276, 1965. Buzby, B. R. Techniques and Experience Solving Really Big Nonlinear Programs. Optimization Methods. English Universities Press, 1974. Byrd, R. H., Schnabel, R. B., and Shultz, G. A. A trust region algorithm for nonlinearly constrained optimization. Tech. Report CU-CS-313-85, Dept. of Computer Science, Univ. of Colorado at Boulder, Boulder, Colorado, 1985. Byrd, R. H., Schnabel, R. B., and Shultz, G. A. Approximate solution of the trust region problem by minimization over two-dimensional subspaces. Math. Programming, 40:247-263, 1988. Byrd, R. H., Schnabel, R. B., and Shultz, G. A. Parallel quasi-Newton methods for unconstrained optimization. Math. Programming, 42(2):273-306, 1988. Byrnes, F. D. A program for the direct solution of matrix equations. Tech. Report, Bonneville Power Administration, Portland, 1967. Cabay, S. and Lam, T. P. L. Congruence techniques for the exact solution of integer systems of linear equations. ACM Trans. Math. Software, 3(4):386-397, 1977. Cabay, S. and Lam, T. P. L. ESOLVE : Congruence techniques for the exact solution of integer systems of linear equations. ACM Trans. Math. Software, 3(4):404-410, 1977. Cabral, R. G. Avaliacao do desempenho do metodo dos gradientes conjugados em multiprocessadores com arquitetura hipercubica. Master's thesis, COPPE/UFRJ, 1991. Cabral, R. G. and Kaskurewicz, E. Uma implementacao do metodo dos gradientes conjugados em multiprocessadores com arquitetura hipercubica. In Anais do V Simposio Brasileiro de Arquitetura de Computadores e Processamento de Alto Desempenho - XIII Congresso da Sociedade Brasileira de Computacao, pages 412-425, 1993. Caceres, E. N. Algoritmos paralelos para problemas em grafos. Master's thesis, COPPE/UFRJ, 1992. Caceres, E. N. and Szwarficter, J. L. Cliques maximais em grafos circulo. In Anais do V Simposio Brasileiro de Arquitetura de Computadores e Processamento de Alto Desempenho - XIII Congresso da Sociedade Brasileira de Computacao, pages 398-411, 1993. Cachard, F. Logiciel numerique associe a une modelisation de systemes informatiques, 1981. These, Univ. Scientifique et Medicale de Grenoble, et l'Institut National Polytechnique de Grenoble. Calahan, D. A. Computer Aided Network Design. McGraw-Hill, 1968. Calahan, D. A. Switching circuit optimization. In Proc. Cornell Conference on Computerized Electronics, pages 282-292, Ithaca, 1969. Cornell Univ. Calahan, D. A. Parallel solution of sparse simultaneous linear equation. In Proc. 11^th Annual Allerton Conference on Circuits and System Theory, pages 729-738, 1973. Calahan, D. A. A block-oriented sparse equation solver for the CRAY-1. In Proc. 1979 International Conference on Parallel Processing, pages 116-123, 1979. Calahan, D. A. Vectorized sparse elimination. In Proc. of Scientific Computer Information Exchange Meeting, Livermore, 1979. Calahan, D. A. Multi-level vectorized sparse solution of LSI circuits. In Proc. IEEE Conference on Circuits and Computers, pages 976-979, Rye, New York, 1980. Calahan, D. A. Direct solution of linear equations on the CRAY-1. CRAY Channels, 3:1-5, 1981. Calahan, D. A. Performance of linear algebra codes on the CRAY-1. SPE Journal, pages 558-564, 1981. Calahan, D. A. High performance banded and profile equation-solvers for the CRAY-1 : The unsymmetric case. Tech. Report 160, Systems Eng. Laboratory, Univ. of Michigan, 1982. Calahan, D. A. Influence of task granularity on vector multiprocessor performance. In Proc. 1984 International Conference on Parallel Processing, pages 278-284, 1984. Calahan, D. A. Task granularity studies on a many-processor CRAY X-MP. Parallel Computing, 2:109-118, 1985. Calahan, D. A. Block-oriented, local-memory-based linear equation solution on the CRAY-2 : Uniprocessor algorithms. In Proc. 1986 International Conference on Parallel Processing, pages 375-378, 1986. Calahan, D. A. and Ames, W. G. Vector processors : Models and applications. IEEE Trans. Circuits and Systems, CAS-26(9):715-726, 1979. Calahan, D. A., Dongarra, J. J., and Levine, D. Vectorizing compilers : A test suite and results. In Supercomputer '88, pages 98-105. IEEE Press, 1988. Calahan, D. A., Dongarra, J. J., and Levine, D. Vectorizing compilers : A test suite and results. In Supercomputing '88, pages 409-426, Orlando, 1988. ACM/IEEE. Calahan, D. A. and Grapes, T. E. Description of a sparse matrix compiler with applications. Tech. Report AFORS-TR-71-2676, Systems Engineering Lab., Univ. Michigan, Ann Arbor, 1971. Calahan, D. A. and McCalla, W. J. Eigenvalue methods for sparse matrices. In Rose, D. J. and Willoughby, R. A., editors, Sparse Matrices and Their Applications, pages 25-30. Plenum Press, New York, 1972. Calahan, D. A. and Schlansker, M. S. Addendum to sparse matrix compiler manual. Tech. Report AFORS-TR-72-1973, Systems Engineering Lab., Univ. Michigan, Ann Arbor, 1972. Calamai, P. and More, J. Projected gradient methods for linearly constrained problems. Math. Programming, 39:93-116, 1987. Campagnolo, J. M., Martins, N., and Falcao, D. M. An efficient and robust eigenvalue method for small-signal stability assessment using parallel processing. Paper 94-SM-558-7-PWRS, Centro de Pesquisas em Energia Eletrica (CEPEL), Rio de Janeiro, 1994. (Presented at IEEE Winter Power Meeting). Campagnolo, J. M., Martins, N., and Falcao, D. M. Refactored bi-iteration : A high performance eigensolution method for large power system matrices. Technical report, Centro de Pesquisas em Energia Eletrica (CEPEL), Rio de Janeiro, 1995. (Submitted to 1995 IEEE Summer Power Meeting). Campagnolo, J. M., Martins, N., Pereira, J. L. R., and Falcao, D. M. Algoritmo paralelo para o calculo de autovalores associado a avaliacao da estabilidade a pequenas perturbacoes. In Anais do V Simposio Brasileiro de Arquitetura de Computadores e Processamento de Alto Desempenho - XIII Congresso da Sociedade Brasileira de Computacao, pages 562-576, 1993. Campagnolo, J. M., Martins, N., Pereira, J. L. R., Lima, L. T. G., Pinto, H. J. C. P., and Falcao, D. M. Fast small-signal stability assessment using parallel processing. IEEE Trans. Power Systems, PWRS-9(2):949-956, 1994. Cantin, G. An equation solver of very large capacity. Int. J. Numer. Meth. Eng., 3:379-388, 1971. Carlsson, M. and Scharmer, G. B. A new approach to multi-level non-LTE radiative transfer problems. Technical report, 1985. Carnahan, B., Luther, H. A., and Wilkes, J. O. Applied Numerical Methods. John Wiley & Sons, 1969. Carnahan, B. and Wilkes, J. O. Digital Computing and Numerical Methods with FORTRAN IV, WATFOR, and WATFIV Programming. John Wiley & Sons, 1973. Carnevali, P. et al. Efficient FORTRAN implementation of the Gaussian elimination and Householder reduction algorithms on the IBM˙3090 vector multiprocessor. Mathematical Modelling and Numerical Analysis, 23(1):63-86, 1989. Carpaneto, G., Fichetti, M., and Toth, P. New lower bounds for the symmetric travelling salesman problem. Mathematical Programming, 5:233-254, 1989. Carpentier, J. Ordered elimination. In Power System Computation Conference, London, 1963. Carr, S. Memory-Hierarchy Management. PhD thesis, Dept. of Computer Science, Rice Univ., 1992. Carr, S. and Kennedy, K. Improving the ratio of memory operations to floating-point operations in loops. Tech. Report CRPC-TR-92-284, Center for Research on Parallel Computation (CRPC), Rice Univ., Houston, Texas, 1992. Carre, B. A. The partitioning of network equations for block iteration. Computing J., 9:84-96, 1966. Carre, B. A. Graphs and Networks. Clarendon Press, 1979. Carter, L. RISC from a performance programmer's perspective. Tech. Report, Computer Science and Eng. Dept., San Diego Supercomputer Center, Univ. of California, San Diego. Carter, L. The RAM model and the performance programmer. Research Report RC-16319, IBM Thomas J. Watson Research Center, Yorktown Heights, 1990. Carter, L., Ferrante, J., and Hummel, S. F. Hierarchical tiling for improved superscalar performance. Tech. Report, Computer Science and Eng. Dept., San Diego Supercomputer Center, Univ. of California, San Diego. Cate, E. G. and Twigg, D. W. Algorithm 513 : Analysis of in-situ transposition. ACM Trans. Math. Software, 3(1):104-110, 1977. Cavers, I. Tiebreaking the minimum degree algorithm for ordering sparse symmetric positive definite matrices. Master's thesis, Dept. of Computer Science, Univ. of British Columbia, Vancouver, 1987. Celis, M. R., Dennis, J. E. Jr., and Tapia, R. A. A trust region strategy for nonlinear equality constrained optimization. In Boggs, P., Byrd, R., and Schnabel R., editors, Numerical Optimization 1984, pages 71-82. SIAM Publications, 1985. Celis, M. R., Dennis, J. E. Jr., and Tapia, R. A. An algorithm based on a convenient trust region subproblem for nonlinear programming. Tech. Report, Dept. of Mathematical Sciences, Rice Univ., Houston, Texas, 1988. Chaitin-Chatelin, F. and Fraysse, V. Lectures on Finite Precision Computations. SIAM Publications, 1996. (To be published). Chaitin, G. J., Auslander, M. A., Chandra, A. K., Cocke, J., Hopkins, M. E., and Markstein, P. W. Register allocation via coloring. Computer Languages, 6:47-57, 1982. Chan, S. M. and Brandwajn, V. Partial matrix refactorization. IEEE Trans. Power Systems, PWRS-1(1):193-200, 1986. Chan, T. F. and Saad, Y. Multigrid algorithms on the hypercube multiprocessor. IEEE Trans. Comput., C-35(11), 1986. Chan, W. M. and George, A. A linear time implementation of the reverse Cuthill-McKee algorithm. BIT, 20:8-14, 1980. Chandra, R., Eisenstat, S. C., and Schultz, M. H. Conjugate gradient methods for partial differential equations. In Vichnevetsky, R., editor, Proc. AICA International Symposium on Computer Methods for Partial Differential Equations, Bethlehem. Prentice-Hall, 1975. Chang, A. Application of sparse matrix methods in electric power system analysis. In Willoughby, R. A., editor, Sparse Matrix Proceedings, Symposium on Sparse Matrices and Their Applications, Yorktown Heights, New York, 1969. IBM Thomas J. Watson Research Center. Chang, S. F. Increasing Sparsity in Matrices for Large Scale Optimization : Theoretical Properties and Implementational Aspects. PhD thesis, Columbia Univ., 1989. Chang, S. F. and McCormick, S. T. A hierarchical algorithm for making sparse matrices sparser. Math. Programming, 56:1-30, 1992. Chang, S. F. and McCormick, S. T. Implementation and computational results for the hierarchical algorithm for making sparse matrices sparser. ACM Trans. Math. Software, 19(3):419-441, 1993. Chartres, B. A. Adaptation of the Jacobi method for a computer with magnetic-tape backing store. Computing J., 5:51-60, 1962. Chazan, D. and Miranker, W. L. Chaotic relaxation. Lin. Alg. Appl., 2:199-222, 1969. Chen, M. S. and Shin, K. G. Processor allocation in an N-Cube multiprocessor using gray codes. IEEE Trans. Comput., C-36:1396-1407, 1987. Chen, S., Kuck, D., and Sameh, A. Practical parallel band triangular systems solvers. ACM Trans. Math. Software, 4:270-277, 1978. Chen, T. C. Parallelism, pipelining and computer efficiency. Computer Design, pages 69-74, 1971. Chen, T. C. Overlap and parallel processing. In Stone, H. S., editor, Introduction to Computer Architecture, pages 427-486. Science Research Associates, Chicago, 1980. Chen, W. K. The inversion of matrices by flow graphs. SIAM J. Appl. Math., 12:676-685, 1964. Chen, W. K. On directed graph solution of linear algebraic equations. SIAM Review, 9:692-707, 1967. Chen, Y. T. Permutation of irreducible matrices to upper triangular forms. J. Inst. Math. Appl., 10:15-18, 1972. Chen, Y. T. Iterative Methods for Linear Least Squares Problems. PhD thesis, Dept. of Computer Science, Waterloo Univ., 1975. (Report CS-75-04). Chen, Y. T. and Tewarson, R. P. On the optimal choice of pivots for the Gaussian elimination. Computing, 9, 1972. Cheng, Y. C., Houck, D. J. Jr., Liu, J. M., Meketon, M. S., Slutsman, L., Vanderbei, R. J., and Wang, P. AT&T KORBX system. AT&T Technical Journal, 68(3):7-19, 1989. Cheriton, D. and Tarjan, R. E. Finding minimum spanning trees. SIAM J. Comput., 5:724-742, 1976. Chevalley, C. Theory of Lie Groups. Princeton University Press, 1946. Choi, I. C., Monma, C. L., and Shanno, D. F. Further development of a primal-dual interior point method. ORSA J. Computing, 2:304-311, 1990. Chow, F. C. and Hennessy, J. L. Register allocation by priority-based coloring. ACM SIGPLAN Notices, 19(6):222-232, 1984. (Presented at Proc. SIGPLAN '84 Compiler Construction). Chow, F. C., Himelstein, M., Killian, E., and Weber, L. Engineering a RISC compiler system. In Proc. COMPCON, pages 132-137, San Francisco, 1988. IEEE. Chow, T. S. and Kowalik, J. S. Computing with sparse matrices. Int. J. Numer. Meth. Eng., 7:211-223, 1973. Christensen, J. H. The structuring of process optimization. Amer. Inst. Chem. Eng. Journal, 16:177-184, 1970. Christofides, N. Graph Theory : An Algorithmic Approach. Academic Press, 1975. Chu, E. Orthogonal Decomposition of Dense and Sparse Matrices on Multiprocessors. PhD thesis, Univ. of Waterloo, 1988. Chu, E. C. H. and George, A. Sparse matrix methods research using the CSM testbed software system. Contractor Report CR-4219, NASA, 1989. Chu, E. C. H. and George, A. Sparse orthogonal decomposition on a hypercube multiprocessor. SIAM J. Matrix Anal. and Appl., 11:453-465, 1990. Chu, E. C. H., George, A., and Ng, E. ``User's Guide'' for SPARSPAK-A : Waterloo sparse linear equations package. Tech. Report CS-84-36, Univ. Waterloo, Canada, 1984. Chui, C. K. Multivariate Splines. SIAM Publications, 1988. Chvatal, V. Linear Programming. Freeman & Co., 1983. Clark, D. W. Cache performance of the VAX-11/780. ACM Trans. Computer Systems, 1(1):24-37, 1983. Clark, D. W. Pipelining and performance in the VAX 8800 processor. In Proc. 2^nd IEEE/ACM Conference on Architectural Support for Programming Languages and Operating Systems, pages 173-177, Palo Alto, 1987. Clark, D. W., Bannon, P. J., and Keller, J. B. Measuring VAX 8800 performance with a histogram hardware monitor. In Proc. 15^th Annual Symposium on Computer Architecture, pages 176-185, Honolulu, Hawaii, 1988. Clark, D. W. and Emer, J. S. Performance of the VAX-11/780 translation buffer : Simulation and measurement. ACM Trans. Computer Systems, 3(1):31-62, 1985. Clark, D. W. and Levy, H. Measurement and analysis of instruction set use in the VAX-11/780. In Proc. 9^th Annual Symposium on Computer Architecture, pages 9-17, Austin, Texas, 1982. Clarke, F. H. Methods of Dynamics and Nonsmooth Optimization. SIAM Publications, 1989. Clarke, F. H. Optimization and Nonsmooth Analysis. SIAM Publications, 1990. Cline, A. K., Golub, G. H., and Platzman, G. W. Calculations of normal modes of oceans using a Lanczos method. In Bunch, J. R. and Rose, D. J., editors, Sparse Matrix Computations, pages 409-426. Academic Press, 1976. Coates, C. L. Flow graph solutions of linear algebraic equations. IEEE Trans. Circuit Theory, CT-6:170-187, 1959. Cocke, J. Global common subexpression elimination. SIGPLAN Notices, 5:20-24, 1970. Cocke, J. and Schwartz, J. T. Programming Languages and Their Compilers. Courant Institute, 1970. Cody, W. J. Jr. and Waite, W. Software Manual for the Elementary Functions. Prentice-Hall, 1980. Coffman, E. G. and Denning, P. J. Operating Systems Theory. Prentice-Hall, 1973. Coleman, T. F. Large Sparse Numerical Optimization, volume 165 of Lecture Notes in Computer Science. Springer-Verlag, 1984. Coleman, T. F. and Conn, A. On the local convergence of quasi-Newton methods for the nonlinear programming problem. SIAM J. Numer. Anal., 21:755-769, 1984. Coleman, T. F., Edenbrandt, A., and Gilbert, J. R. Predicting fill for sparse orthogonal factorization. J. ACM, 33:517-532, 1986. Coleman, T. F., Garbow, B., and More, J. J. Software for estimating sparse Jacobian matrices. ACM Trans. Math. Software, 10:329-347, 1984. Coleman, T. F., Garbow, B., and More, J. J. Software for estimating sparse Hessian matrices. ACM Trans. Math. Software, 11:363-378, 1985. Coleman, T. F. and Hulbert, L. A direct active set algorithm for large sparse quadratic programs with simple bounds. Tech. Report 88-926, Cornell Univ., Ithaca, NY, 1988. Coleman, T. F. and Li, Y., editors. Large Scale Numerical Optimization. SIAM Publications, 1990. Coleman, T. F. and More, J. J. Estimation of sparse Jacobian matrices and graph coloring problems. SIAM J. Numer. Anal., 20:187-209, 1983. Coleman, T. F. and More, J. J. Estimation of sparse Hessian matrices and graph coloring problems. SIAM J. Numer. Anal., 28:243-270, 1984. Coleman, T. F. and Pothen, A. The null space problem - I : Complexity. SIAM J. Alg. and Discr. Methods, 7:527-537, 1986. Coleman, T. F. and Pothen, A. The null space problem - II : Algorithms. SIAM J. Alg. and Discr. Methods, 8:544-563, 1987. Coleman, T. F. and Van Loan, C. Handbook for Matrix Computations. SIAM Publications, 1988. Collatz, L. Numerische und Graphische Methoden, Handbuch der Physik, volume 2. Springer-Verlag, 1955. Comer, D. The ubiquitous B-Tree. ACM Computing Surveys, 11(2):121-137, 1979. Companhia Telefonica Brasileira, Departamento Geral de Desenvolvimento de Transmissao. Programacao FORTRAN para Aplicacoes Tecnicas e Cientificas, 1975. (Ref. TED-32-01-0005). Comstock, D. R. A note on multiplying boolean matrices - II. Comm. ACM, 7:13, 1964. Concus, P. and Golub, G. H. A generalized conjugate gradient method for nonsymmetric systems of linear equations. Tech. Report STAN-CS-75-535, Computer Science Dept., Stanford Univ., 1975. Concus, P., Golub, G. H., and O'Leary, D. P. A generalized conjugate gradient method for the numeric solution of elliptic partial differential equations. Tech. Report STAN-CS-75-533, Computer Science Dept., Stanford Univ., 1975. Conn, A. R. Penalty Function Methods. Nonlinear Optimization 1981. Academic Press, 1982. Conn, A. R., Gould, N., and Toint, Ph. L. Testing a class of methods for solving minimization problems with simple bounds on the variables. Tech. Report 86-3, Dept. of Mathematics, FUNDP, Namur, 1986. Conn, A. R., Gould, N., and Toint, Ph. L. Global convergence of a class of trust region algorithms for optimization problems with simple bounds. Tech. Report, Dept. of Computer Sciences, Univ. of Waterloo, Canada, 1988. Conn, A. R., Gould, N., and Toint, Ph. L., editors. Large Scale Optimization, volume 45 of Math. Programming, Series B, pages 373-568. North Holland, 1989. (Special Issue). Conte, S. D. and Dames, R. T. An alternating direction method for solving the biharmonic equation. Math. of Computation, 12:198-205, 1958. Conte, S. D. and de Boor, C. Elementary Numerical Analysis : An Algorithmic Approach. McGraw-Hill, 3^rd edition, 1980. CONTROL DATA. STAR-100 Computer System ``Hardware Reference Manual'', 1973. CONTROL DATA Corporation. Cook, S. A. The complexity of theorem-proving procedures. In Proc. 3^rd ACM Symposium on Theory of Computing, pages 151-158, 1971. Cooley, J. W. and Tukey, J. W. An algorithm for machine calculation of complex Fourier series. Math. of Computation, 19:297-301, 1965. Coppersmith, D. and Winograd, S. Matrix multiplication via arithmetic progression. In Proc. 19^th Annual ACM Symposium of Theory of Computing, pages 1-6, 1987. Cormen, T. H., Leiserson, C. E., and Rivest, R. L. Introduction to Algorithms. McGraw-Hill, 1990. Cottle, R. W. Major Cholesky. Manuscript, Dept. of Oper. Res., Stanford Univ., 1975. Couffignal, L. Resolution Numerique des Systemes d'Equations Lineaires. Gauthier et Villars, 1956. Courant, R. Methods of Mathematical Physics, volume 1. Interscience, 1953. Courant, R. and Hilbert, D. Methods of Mathematical Physics, volume 2. Interscience, 1962. Cowell, W. and Thompson, C. Transforming FORTRAN DO loops to improve performance on vector architectures. ACM Trans. Math. Software, 12:324-353, 1986. CPLEX Optimization, Inc., Incline Village, Nevada. Using the CPLEX Callable Library and CPLEX Mixed Integer Library, 1993. Crane, H., Gibbs, N. E., Poole, W. G. Jr., and Stockmeyer, P. K. Algorithm 508 : Matrix bandwidth and profile reduction. ACM Trans. Math. Software, 2:375-377, 1976. Crank, J. and Nicholson, P. A practical method for numerical evaluation of solutions of partial differential equations of the heat conduction type. Proc. Cambridge Philos. Soc., 43:50-67, 1947. Crawford, J. H. and Gelsinger, P. P. Programming the 80386. Sybex, Alameda, California, 1987. CRAY Research, Inc. SSGETRF : Factors a Real Sparse General Matrix ``Online Manual''. CRAY Research, Inc., 1993. Crespi-Reghizzi, S. and Morpurgo, R. A language for treating graphs. Comm. ACM, 13:319-323, 1970. Crout, P. D. A short method for evaluating determinants and solving systems of linear equations with real or complex coefficients. AIEE Trans. (supplement), 60:1235-1240, 1941. Curtis, A. R. and Chance, E. M. CHECK and CHEKMAT : Two chemical reaction kinetics programs. Tech. Report AERE-R-7345, HMSO, Harwell Laboratory, 1974. Curtis, A. R., Powell, M. J. D., and Reid, J. K. On the estimation of sparse Jacobian matrices. J. Inst. Math. Appl., 13:117-119, 1974. Curtis, A. R. and Reid, J. K. FORTRAN subroutines for the solution of sparse sets of linear equations. Tech. Report R-6844, Atomic Energy Res. Establishment, Harwell, 1971. Curtis, A. R. and Reid, J. K. The solution of large sparse systems of linear equations. In Proc. of IFIP. Atomic Energy Res. Establishment, Harwell, 1971. (Tech. Report TP-450). Curtis, A. R. and Reid, J. K. The solution of large sparse unsymmetric systems of linear equations. J. Inst. Math. Appl., 8:344-353, 1971. Curtis, A. R. and Reid, J. K. The solution of large sparse unsymmetric systems of linear equations. In Freiman, C. V., editor, Information Processing 71, Proc. IFIP Congress, pages 1240-1245, Ljubljana, 1972. North-Holland. Cuthill, E. H. Several strategies for reducing the bandwidth of matrices. In Rose, D. J. and Willoughby, R. A., editors, Sparse Matrices and Their Applications, pages 157-166. Plenum Press, New York, 1972. Cuthill, E. H. and McKee, J. Reducing the bandwidth of sparse symmetric matrices. In Proc. 24^th National Conference of the ACM, pages 157-172. ACM Press, 1969. Cuthill, E. H. and Varga, R. S. A method of normalized block iteration. J. ACM, 6:236-244, 1959. Cvetkovic, D., Doob, M., and Sachs, H. Spectra of Graphs. Academic Press, 1980. da Cruz Neto, J. X. Metodos Geodesicos na Programacao Matematica. PhD thesis, Depto. de Engenharia de Sistemas e Ciencias da Computacao, COPPE / Univ. Federal do Rio de Janeiro, 1995. da Cruz Neto, J. X. and Oliveira, P. R. Geodesic descent in linear and nonlinear programming. Tech. Report, Depto. de Engenharia de Sistemas e Ciencias da Computacao, COPPE / Univ. Federal do Rio de Janeiro, 1995. da Cruz Neto, J. X. and Oliveira, P. R. A unified view of primal methods through riemannian metrics. Tech. Report ES-363-95, Depto. de Engenharia de Sistemas e Ciencias da Computacao, COPPE / Univ. Federal do Rio de Janeiro, 1995. Dahl, D., Dijkstra, E. W., and Hoare, C. A. R. Structured Programming. Academic Press, 1972. Dahlhaus, E. and Karpinski, M. A fast parallel algorithm for computing all maximal cliques in a graph and the related problems. Tech. Report 8516-CS, Inst. fur Informatik der Univ. Bonn, 1987. Dahlquist, G. A numerical method for some ordinary differential equations with large Lipschitz constants. In Proc. IFIP Congress, Edinburgh, 1968. Dahlquist, G. and Bjorck, A. Numerical Methods. Prentice-Hall, 1974. Dantzig, G. B. Maximization of a linear function of variables subject to linear inequalities. In Koopmans, T. C., editor, Activity Analysis of Production and Allocation, pages 339-347. John Wiley & Sons, New York, 1951. Dantzig, G. B. Linear Programming and Extensions. Princeton University Press, 1962. Dantzig, G. B. Compact basis triangularization for the simplex method. In Graves, R. L. and Wolfe, P., editors, Recent Advances in Mathematical Programming, pages 125-132. McGraw-Hill, 1963. Dantzig, G. B. All shortest routes in a graph. In Theory of Graphs International Symposium, pages 91-92. Gordon and Breach, New York, 1967. Dantzig, G. B. Comments on Khachiyan's algorithm for linear programming. Tech. Report SOR-79-22, Dept. of Operations Res., Stanford Univ., 1979. Dantzig, G. B., Eisenstat, S. C., Magnante, T., Maier, S., McGrath, M., Nicholson, V., and Riedel, C. MPL : Mathematical Programming Language, ``Specification Manual''. Tech. Report STAN-CS-70-187, Stanford Univ., 1970. Dantzig, G. B., Harvey, R. P., McKnight, R. D., and Smith, S. S. Sparse matrix techniques in two mathematical programming codes. In Willoughby, R. A., editor, Sparse Matrix Proceedings, Symposium on Sparse Matrices and Their Applications, pages 85-99, Yorktown Heights, New York, 1969. IBM Thomas J. Watson Research Center. Dantzig, G. B. and Orchard-Hays, W. The product form of inverse in the simplex method. Math. of Computation, 8:64-67, 1954. Dantzig, G. B. and Van Slyke, R. M. Generalized upper bounding techniques. J. Computer Systems Sciences, 1:213-226, 1967. Dantzig, G. B. and Wolfe, P. Decomposition principle for linear programs. Operations Res., 8:101-111, 1960. Dantzig, G. B. and Wolfe, P. The decomposition algorithm for linear programs. Econometrica, 29:767-778, 1961. Datta, B. N. Parallel and large-scale matrix computations in control : Some ideas. Lin. Alg. Appl., 121:243-264, 1989. Daubechies, I. Ten Lectures on Wavelets. SIAM Publications, 1992. Davenport, J. L. H., Siret, Y., and Tournier, E. Computer Algebra : Systems and Algorithms for Algebraic Computations. Academic Press, 1988. Davidon, W. C. Variable metric methods for minimization. Tech. Report ANL-5990, Argonne National Laboratory, 1959. Davidon, W. C. Conic approximations and collinear scalings for optimizers. SIAM J. Numer. Anal., 17:268-281, 1980. Davis, G. Column LU factorization with pivoting on a hypercube multiprocessor. SIAM J. Alg. and Discr. Methods, 7, 1986. Davis, P. Interpolation and Approximation. Blaisdell Publishing Co., 1963. Davis, P. and Rabinowitz, P. Methods of Numerical Integration. Academic Press, 2^nd edition, 1984. Davis, T. A. PSOLVE : A concurrent algorithm for solving sparse systems of linear equations. Tech. Report 612, Center for Supercomputing Research and Development, Univ. of Illinois at Urbana-Champaign, 1986. Davis, T. A. Performance of an unsymmetric-pattern multifrontal method for sparse LU factorization. Tech. Report TR-92-014, Computer and Information Science Dept., Univ. of Florida, 1992. Davis, T. A. An unsymmetric pattern multifrontal method for sparse LU factorization. Tech. Report TR-93-018, Computer and Information Science Dept., Univ. of Florida, 1993. Davis, T. A. ``User's Guide'' for the unsymmetric-pattern multifrontal package (UMFPACK). Tech. Report TR-93-020, Computer and Information Sciences Dept., Univ. of Florida, 1993. Davis, T. A. A combined unifrontal/multifrontal method for unsymmetric sparse matrices. Tech. Report TR-94-005, Computer and Information Science Dept., Univ. of Florida, 1994. (Proc. of 5^th SIAM Conference on Applied Linear Algebra). Davis, T. A. User's guide for the unsymmetric-pattern multifrontal package (UMFPACK), version 1.1. Tech. Report TR-95-004, Computer and Information Science Dept., Univ. of Florida, 1995. Davis, T. A., Amestoy, P., and Duff, I. S. An approximate minimum degree ordering algorithm. Tech. Report TR-94-039, Computer and Information Science Dept., Univ. of Florida, 1994. (Revised July 1995). Davis, T. A. and Duff, I. S. Unsymmetric-pattern multifrontal methods for parallel sparse LU factorization. Tech. Report TR-91-023, Computer and Information Science Dept., Univ. of Florida, 1991. Davis, T. A. and Duff, I. S. An unsymmetric-pattern multifrontal method for sparse LU factorization. Tech. Report RAL-93-036, Rutherford Appleton Laboratory, Chilton, Didcot, Oxfordshire, 1994. Davis, T. A. and Duff, I. S. An unsymmetric-pattern multifrontal method for sparse LU factorization. Tech. Report TR-94-038, Computer and Information Science Dept., Univ. of Florida, 1994. Davis, T. A. and Duff, I. S. A combined unifrontal/multifrontal method for unsymmetric sparse matrices. Tech. Report TR-95-020, Computer and Information Science Dept., Univ. of Florida, 1995. Davis, T. A. and Yew, P. C. A nondeterministic parallel algorithm for general unsymmetric sparse LU factorization. SIAM J. Matrix Anal. and Appl., 11:383-402, 1990. Dayde, M. J. and Duff, I. S. Use of level-3 BLAS in LU factorization on the CRAY-2, the ETA-10P and the IBM 3090-200/VF. Tech. Report CSS-229, Computer Science and Systems Division, Harwell Laboratory, Oxon, England, 1988. Dayde, M. J. and Duff, I. S. 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. Tech. Report TR-TA-90-30, CERFACS, 1990. Dayde, M. J. and Duff, I. S. A block implementation of level 3 BLAS for RISC processors. Tech. Report, CERFACS, 1995. de Boor, C. A Practical Guide to Splines. Springer-Verlag, 1978. de Buchet, J. How to take into account the low density of matrices to design a mathematical programming package : Relevant effects on optimization and inversion algorithms. In Reid, J. K., editor, Large Sparse Sets of Linear Equations, pages 211-217. Academic Press, 1971. de Carvalho, M. L. B. On the minimization of work needed to factor a symmetric positive definite matrix. Manuscript ORC 87-14, Dept. of Industrial Eng. and Oper. Research, Univ. of California, Berkeley, 1987. de Carvalho, M. L. B., Carceroni, R. L., and Junior, W. M. Uma experiencia de implementacao de metodos de ordenacao paralelos em maquina SIMD. In Anais do V Simposio Brasileiro de Arquitetura de Computadores e Processamento de Alto Desempenho - XIII Congresso da Sociedade Brasileira de Computacao, pages 189-201, 1993. de Carvalho, M. L. B. and Junior, W. M. Simulacao de redes neuronais em ambientes heterogeneos e paralelos. In Anais do V Simposio Brasileiro de Arquitetura de Computadores e Processamento de Alto Desempenho - XIII Congresso da Sociedade Brasileira de Computacao, pages 217-231, 1993. de Carvalho, M. L. B., Lima, M. A. de C., Correa, W. T., and Junior, W. M. Uso da heterogeneidade para aceleracao de ray tracing. In Anais do V Simposio Brasileiro de Arquitetura de Computadores e Processamento de Alto Desempenho - XIII Congresso da Sociedade Brasileira de Computacao, pages 174-188, 1993. DEC. Special Issue dedicated to VAX 8800. Digital Technical Journal, 4, 1987. Decker, I. C., Falcao, D. M., and Kaszkurewicz, E. An efficient parallel method for transient stability analysis. In Proc. 10^th Power System Computation Conference (PSCC), pages 509-516, Graz, Austria, 1990. Decker, I. C., Falcao, D. M., and Kaszkurewicz, E. Parallel implementation of a power system simulation methodology using the conjugate gradient method. In IEEE Transactions on Power System Computation Conference, pages 509-519, 1991. Decker, I. C., Falcao, D. M., and Kaszkurewicz, E. Parallel implementation of a power system dynamic simulation methodology using the conjugate gradient method. IEEE Trans. Power Systems, PWRS-7:458-465, 1992. Decker, I. C., Falcao, D. M., and Kaszkurewicz, E. Algoritmos para a simulacao da dinamica de sistemas de energia eletrica em computadores paralelos. In Anais do V Simposio Brasileiro de Arquitetura de Computadores e Processamento de Alto Desempenho - XIII Congresso da Sociedade Brasileira de Computacao, pages 444-458, 1993. Decker, I. C., Falcao, D. M., and Kaszkurewicz, E. Esquema alternado entrelacado implicito paralelo : Aplicacao do metodo gradiente conjugado pre-condicionado as equacoes da rede eletrica. Relatorio Interno, Programa de Engenharia Eletrica, COPPE/UFRJ, 1993. Decker, I. C., Falcao, D. M., and Kaszkurewicz, E. Esquema simultaneo implicito paralelo no tempo : Aplicacao dos metodos gradiente biconjugado e bi-cgstab. Relatorio Interno, Programa de Engenharia Eletrica, COPPE/UFRJ, 1993. Dembart, B. and Erisman, A. M. Hybrid sparse matrix methods. IEEE Trans. Circuit Theory, CT-20:641-649, 1973. Dembart, B. et al. Improved mathematical techniques for dynamic analysis, volume 2. EPRI Project 670-2. Dembart, B. and Neves, K.W. Sparse triangular factorization on vector computers. In Exploring Applications of Parallel Processing, pages 22-25, Palo Alto, 1977. Electric Power Research Institute. (Report EL-566-QR). Dembo, R. S. Large-scale nonlinear optimization. In Powell, M. J. D., editor, Nonlinear Optimization 1981, pages 361-372. Academic Press, 1982. Dembo, R. S. NLPNET : A code for nonlinear network optimization problems. Working Paper Series B-70, Yale Univ., New Haven, 1983. Dembo, R. S. Solving box-constrained quadratic programming problems on a vector processor. Tech. Report, Dept. of Computer Science, Univ. of Toronto, Canada, 1987. Dembo, R. S., Eisenstat, S. C., and Steihaug, T. Inexact Newton methods. SIAM J. Numer. Anal., 19:400-408, 1982. Dembo, R. S. and Tulowitzki, U. On the minimization of quadratic functions subject to box constraints. Working Paper 71, School of Organization and Management, Yale Univ., New Haven, CT, 1983. Demidovich, B. P. and Maron, I. A. Computational Mathematics. Mir Publishers, 1976. Demmel, J. W., Gilbert, J. R., and Li, X. S. SuperLU ``User's Guide'', 1995. Eisenstat, S. C. Demmel, J. W., Gilbert, J. R., Li, X. S., and Liu, J. W. H. A supernodal approach to sparse partial pivoting. Tech. Report CSL-95-03, XEROX Palo Alto Research Center, 1995. Denis-Papin, M. and Kaufmann, A. Cours de Calcul Matriciel. Albin Michel, 1953. Denning, P. J. Virtual memory. ACM Computing Surveys, 2:153-189, 1970. Dennis, J. E. Jr. and More, J. Quasi-Newton methods, motivation and theory. SIAM Review, 19:46-89, 1974. Dennis, J. E. Jr. and Schnabel, R. B. Numerical Methods for Unconstrained Optimization and Nonlinear Equations. Prentice-Hall, 1983. Dennis, J. E. Jr. and Schnabel, R. B. A view of unconstrained optimization. In Nemhauser, G. L., Rinnooy Kan, A., and Todd, M. J., editors, Handbooks in Operations Research and Management Science, volume 1 : Optimization, chapter 1, pages 1-72. North-Holland, 1989. Dennis, J. E. Jr. and Torczon, V. Direct search methods on parallel machines. SIAM J. Optimization, 1(4):448-474, 1991. Dennis, J. E. Jr. and Turner, K. Generalized conjugate directions. Lin. Alg. Appl., 88:187-209, 1987. Deo, N. Graph Theory with Applications to Engineering and Computer Science. Prentice-Hall, 1974. Deo, N., Krishnamoorty, M. S., and Langston, M. A. Exact and approximate solutions for the gate matrix layout problem. IEEE Trans. on Computer Aided Design, 6:79-84, 1987. DeRosa, J., Glackemeyer, R., and Knight, T. Design and implementation of the VAX 8600 pipeline. Computer, 18(5):38-48, 1985. Dijkstra, E. W. A note on two problems in connection with graphs. Numerical Mathematics, 1(5):269-271, 1959. Dijkstra, E. W. GOTO statements considered harmful. Comm. ACM, 11:147-148, 1968. Dijkstra, E. W. A Discipline of Programming. Prentice-Hall, 1976. Dikin, I. I. Iterative solution of problems of linear and quadratic programming. In Doklady Akademii Nauk SSSR 174, pages 747-748, 1967. (Translated from Russian in Soviet Mathematics Doklady, 8:674-675). Dikin, I. I. On the convergence of an iterative process. Upravlyaemye Sistemii, 12:54-60, 1974. (In Russian). Director, S. W. A survey of decomposition techniques for analysis and design of electrical networks. In Himmelblau, D. M., editor, Decomposition of Large Scale Problems, pages 93-118. North-Holland, 1973. Ditzel, D. R. and McLellan, H. R. Branch folding in the CRISP microprocessor : Reducing the branch delay to zero. In Proc. 14^th Symposium on Computer Architecture, pages 2-7, Pittsburgh, 1987. Dixon, L. C. W. Global optima without convexity. Tech. Report, Numerical Optimization Centre, Hatfield Polytechnic, 1978. Dixon, L. C. W. The place of parallel computation in numerical optimization - I : The local problem. Tech. Report 118, Numerical Optimization Centre, The Hatfield Polytechnic, 1981. Dixon, L. C. W. and Szego, G. P. Towards Global Optimization, volume 1. North-Holland, 1975. Dixon, L. C. W. and Szego, G. P. Towards Global Optimization, volume 2. North-Holland, 1978. Dixon, P. B., Parmenter, B. R., Sutton, J., and Vincent, D. P. ORANI : A Multisectoral Model of the Australian Economy. North-Holland, 1982. Djidjev, H. N. and Gilbert, J. R. Separators in graphs with negative and multiple vertex weights. Tech. Report CSL-90-08, XEROX Palo Alto Research Center, 1990. (Revised at Tech. Report CSL-92-07). do Carmo, M. P. Riemannian Geometry. Birkhauser Verlag, Boston, 1992. Dobbie, J. M. A survey of search theory. Operations Res., 16:525-537, 1968. Dodson, D. S., Grimes, R. G., and Lewis, J. G. Algorithm 692 : Model implementation and test package for the sparse Basic Linear Algebra Subprograms. ACM Trans. Math. Software, 17(2):264-272, 1991. Dodson, D. S., Grimes, R. G., and Lewis, J. G. Sparse extensions to the FORTRAN Basic Linear Algebra Subprograms. ACM Trans. Math. Software, 17(2):253-263, 1991. Dodson, D. S. and Lewis, J. G. Issues relating to the extension of the Basic Linear Algebra subprograms. ACM SIGNUM Newsletter, 20(1):2-18, 1985. Dold, A. and Eckmann, B., editors. Proc. of the Symposium on Constructive and Computational Methods for Differential Equations. Springer-Verlag, 1974. Dommel, H. W. A method for solution of transient phenomena in multiphase systems. In Power System Computation Conference, Stockholm, 1966. Dommel, H. W. et al. Further developments in Newton's method for power system applications. Paper 70-CP-161, Bonneville Power Administration, 1970. (Presented at IEEE Winter Power Meeting, New York). Dommel, H. W. and Tinney, W. F. Optimal power flow solutions. IEEE Trans. Power Apparatus and Systems, PAS-88(10):1866-1876, 1969. Dongarra, J. J. A survey of high performance computers. In COMPCON, pages 8-11. IEEE, 1986. Dongarra, J. J., editor. Experimental Parallel Computing Architectures. North-Holland, 1987. Dongarra, J. J. Performance of various computers using standard linear equations software in a FORTRAN environment. Tech. Report CS-89-85, Univ. of Tennessee, 1990. Dongarra, J. J. NA-NET is up and running at Oak Ridge National Laboratory. SIAM News, 24(2):22, 1991. Dongarra, J. J., Du Croz, J., Duff, I. S., and Hammarling, S. A set of level 3 Basic Linear Algebra Subprograms. ACM Trans. Math. Software, 16:1-17, 1990. Dongarra, J. J., Du Croz, J., Hammarling, S., and Hanson, R. An extended set of FORTRAN Basic Linear Algebra Subroutines. ACM Trans. Math. Software, 14:1-32, 1988. Dongarra, J. J. and Duff, I. S. Performance of vector computers for direct and indirect addressing in FORTRAN. Tech. Report, Harwell Laboratory, 1986. Dongarra, J. J. and Duff, I. S. Advanced architecture computers. Tech. Report CS-89-90, Univ. of Tennessee, 1989. Dongarra, J. J., Duff, I. S., Sorensen, D. C., and van der Vorst, H. A. Solving Linear Systems on Vector and Shared Memory Computers. SIAM Publications, 1991. Dongarra, J. J. and Eisenstat, S. C. Squeezing the most out of an algorithm in CRAY FORTRAN. ACM Trans. Math. Software, 10(3):219-230, 1984. Dongarra, J. J. et al. LINPACK ``User's Guide''. SIAM Publications, 1979. Dongarra, J. J. and Grosse. E. Distribution of mathematical software via electronic mail. Comm. ACM, 30(5):403-407, 1987. Dongarra, J. J., Gustavson, F. G., and Karp, A. H. Implementing linear algebra algorithms for dense matrices on a vector pipeline machine. SIAM Review, 26:91-112, 1984. Dongarra, J. J. and Hinds, A. R. Unrolling loops in FORTRAN. Software Practice and Experience, 9:219-229, 1979. Dongarra, J. J, Messina, P., Sorensen, D. C., and Voigt, R. G., editors. Proc. 4^th SIAM Conference on Parallel Processing for Scientific Computing. SIAM Publications, 1990. Dongarra, J. J. and Sorensen, D. C. Linear algebra on high-performance computers. In Schendel, U., editor, Proc. of Parallel Computing '85, pages 3-32. North-Holland, 1986. Dongarra, J. J. and Sorensen, D. C. A fully parallel algorithm for the symmetric eigenvalue problem. SIAM J. Sci. and Stat. Comput., 8:s139-s154, 1987. Dongarra, J. J., Sorensen, D. C., Connolly, K., and Patterson, J. Programming methodology and performance issues for advanced computer architectures. Parallel Computing, 8:41-58, 1988. Dorn, W. S. and McCracken, D. D. Numerical Methods with FORTRAN IV Case Studies. John Wiley & Sons, 1972. Dorr, F. W. The direct solution of the discrete Poisson equation on a rectangle. SIAM Review, 12:248-263, 1970. Dorr, F. W. The direct solution of the discrete Poisson equation in O(n^2) operations. SIAM Review, 17:412-415, 1975. Du Croz, J. J., Nugent, S. M., Reid, J. K., and Taylor, D. B. Algorithm 578 : Solution of real linear equations in a paged virtual store. ACM Trans. Math. Software, 7(4):537-551, 1981. Du Croz, J. J., Nugent, S. M., Reid, J. K., and Taylor, D. B. Solving large full sets of linear equations in a paged virtual store. ACM Trans. Math. Software, 7(4):527-536, 1981. Duff, I. S. Network analysis and graph theory, 1970. (Dissertation for Dipl. Adv. Math., Oxford Univ.). Duff, I. S. Analysis of Sparse Systems. PhD thesis, Oxford Univ., England, 1972. (Chapters: On a Factored Form of the Inverse for Sparse Matrices, Selecting a Maximal Transversal). Duff, I. S. On the number of nonzeros added when Gaussian elimination is performed on sparse random matrices. Math. of Computation, 28(125):219-230, 1974. Duff, I. S. On algorithms for obtaining a maximum transversal. Tech. Report CSS-49, Harwell Laboratory, 1976. Duff, I. S. MA28 : A set of FORTRAN subroutines for sparse unsymmetric linear equations. Tech. Report R-8730, HMSO, AERE Harwell Laboratory, 1977. Duff, I. S. A survey of sparse matrix research. Proc. of the IEEE, 65(4):500-535, 1977. Duff, I. S. Some current approaches to the solution of large sparse systems of linear equations. Tech. Report CSS-65, Harwell Laboratory, 1978. Duff, I. S. Practical comparisons of codes for the solution of sparse linear systems. In Duff, I. S. and Stewart, G. W., editors, Sparse Matrix Proceedings 1978, pages 107-134. SIAM Publications, 1979. Duff, I. S. Recent developments in the solution of large sparse linear equations. Tech. Report CSS-80, AERE, Harwell Laboratory, 1980. Duff, I. S. Recent developments in the solution of large sparse linear equations. In Glowinski, R. and Lions, J. L., editors, Computing Methods in Applied Sciences and Engineering, pages 407-426. North-Holland, 1980. Duff, I. S. Algorithm 575 : Permutations for a zero-free diagonal. ACM Trans. Math. Software, 7(3):387-390, 1981. Duff, I. S. Full matrix techniques in sparse Gaussian elimination. Tech. Report CSS-114, AERE, Harwell Laboratory, 1981. Duff, I. S. MA32 : A package for solving sparse unsymmetric systems using the frontal method. Tech. Report R-10079, HMSO, AERE Harwell Laboratory, 1981. Duff, I. S. ME28 : A sparse unsymmetric linear equation solver for complex equations. ACM Trans. Math. Software, 7(4):505-511, 1981. Duff, I. S. On algorithms for obtaining a maximum transversal. ACM Trans. Math. Software, 7(3):315-330, 1981. Duff, I. S. A sparse future. In Duff, I. S., editor, Sparse Matrices and Their Uses, pages 1-29. Academic Press, 1981. Duff, I. S., editor. Sparse Matrices and Their Uses. Academic Press, 1981. Duff, I. S. MA27 : A set of FORTRAN subroutines for sparse symmetric linear equations. Tech. Report R-10533, HMSO, AERE Harwell Laboratory, 1982. Duff, I. S. Research directions in sparse matrix computations. Tech. Report AERE-R-10547, AERE, Harwell Laboratory, 1982. Duff, I. S. The solution of sparse linear equations on the CRAY-1. CRAY Channels, 4(3), 1982. Duff, I. S. A survey of sparse matrix software. Tech. Report R-10512, Computer Science and Systems Division, AERE Harwell Laboratory, Oxfordshire, 1982. Duff, I. S. Enhancements to the MA32 package for solving sparse unsymmetric equations. Tech. Report R-11009, HMSO, London, 1983. Duff, I. S. Data structures, algorithms and software for sparse matrices. Tech. Report 84-1846, Harwell Laboratory, 1984. Duff, I. S. Design features of a frontal code for solving sparse unsymmetric linear systems out of core. SIAM J. Sci. and Stat. Comput., 5(2):270-280, 1984. Duff, I. S. Direct methods for solving sparse systems of linear equations. SIAM J. Sci. and Stat. Comput., 5(3):605-619, 1984. Duff, I. S. The solution of sparse linear equations on the CRAY-1. In Kowalik, J. S., editor, Proceedings of the NATO Workshop on High Speed Computation, West Germany, volume F-7 of NATO ASI Series, pages 293-309. Springer-Verlag, 1984. Duff, I. S. Data structures, algorithms and software for sparse matrices. In Evans, D. J., editor, Sparsity and its Applications, pages 1-29. Cambridge University Press, 1985. Duff, I. S., editor. 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. Duff, I. S. The influence of vector and parallel processors on numerical analysis. Tech. Report AERE-R-12329, Computer Science and Systems Division, Harwell Laboratory, Oxon, England, 1986. Duff, I. S. Parallel implementation of multifrontal schemes. Parallel Computing, 3:193-204, 1986. Duff, I. S. The parallel solution of sparse linear equations. In Handler, W., Haupt, D., Jeltsch, R., Juling, W., and Lange, O., editors, CONPAR '86, volume 237 of Lecture Notes in Computer Science, pages 18-24. Springer-Verlag, 1986. Duff, I. S. The use of vector and parallel computers in the solution of large sparse linear equations. Tech. Report AERE-R-12393, Computer Science and Systems Division, Harwell Laboratory, Oxon, England, 1986. Duff, I. S. Multiprocessing a sparse matrix code on the ALLIANT FX/8. Tech. Report CSS-210, Computer Science and Systems Division, Harwell Laboratory, Oxon, England, 1987. Duff, I. S. Direct solvers. Computer Physics Reports, 11:21-50, 1989. Duff, I. S. Multiprocessing a sparse matrix code on the ALLIANT FX/8. J. Comput. Appl. Math., 27:229-239, 1989. Duff, I. S., Erisman, A. M., Gear, C. W., and Reid, J. K. Some remarks on inverses of sparse matrices. Tech. Report CSS-171, AERE Harwell Laboratory, 1985. (Also available as Report 51, Mathematics and Computer Science Division, Argonne National Laboratory). Duff, I. S., Erisman, A. M., and Reid, J. K. A comparison of sparsity orderings for obtaining a pivotal sequence in Gaussian elimination. J. Inst. Math. Appl., 14:281-291, 1974. Duff, I. S., Erisman, A. M., and Reid, J. K. Pivot selection and row ordering in Givens reduction on sparse matrices. Computing, 13:239-248, 1974. Duff, I. S., Erisman, A. M., and Reid, J. K. On George's nested dissection method. SIAM J. Numer. Anal., 13:686-695, 1976. Duff, I. S., Erisman, A. M., and Reid, J. K. Direct Methods for Sparse Matrices. Clarendon Press, Oxford, 1986. Duff, I. S., Gould, N., Lescrenier, M., and Reid, J. K. The multifrontal method in a parallel environment. Tech. Report CSS-211, Computer Science and Systems Division, Harwell Laboratory, Oxon, England, 1987. (Published at Advances in Numerical Computation, Cox, M. and Hammarling, S., eds., Oxford University Press, 1990). Duff, I. S., Grimes, R. G., and Lewis, J. G. Sparse matrix test problems. ACM Trans. Math. Software, 15(1):1-14, 1989. Duff, I. S., Grimes, R. G., and Lewis, J. G. ``User's Guide'' for the Harwell-Boeing sparse matrix collection (Release I). Tech. Report RAL-92-086, Rutherford Appleton Laboratory, 1992. Duff, I. S., Grimes, R. G., Lewis, J. G., and Poole, B. Sparse matrix test problems. ACM SIGNUM Newsletter, 17:22, 1982. Duff, I. S. and Gustavson, F. G. Implementations of the Hopcroft and Karp maximum matching algorithm. Duff, I. S. and Johnsson, L. The effect of orderings on the parallelization of sparse code. Tech. Memorandum, Mathematics and Computer Science Division, Argonne National Laboratory, 1986. Duff, I. S. and Johnsson, L. Node orderings and concurrency in sparse problems : An experimental investigation. In Proc. of International Conference on Vector and Parallel Computing, Loen, Norway, pages 2-6, 1986. Duff, I. S. and Johnsson, L. S. Node orderings and concurrency in structurally-symmetric sparse problems. In Carey, G. F., editor, Parallel Supercomputing: Methods, Algorithms, and Applications, pages 177-189. John Wiley & Sons, 1989. Duff, I. S. and Johnsson, S. L. Node orderings and concurrency in structurally-symmetric sparse problems. In Garey, G. F., editor, Parallel Supercomputing : Methods, Algorithms and Applications, pages 177-189. John Wiley & Sons, 1988. Duff, I. S., Marrone, M., and Radicati, G. A proposal for user level sparse BLAS. Tech. Report RAL-92-087, Rutherford Appleton Laboratory, 1992. Duff, I. S. and Meurant, G. The effect of ordering on preconditioned conjugate gradients. BIT, 29, 1989. Duff, I. S. and Reid, J. K. On the reduction of sparse matrices to condensed forms by similarity transformations. J. Inst. Math. Appl., 15:217-224, 1975. Duff, I. S. and Reid, J. K. A comparison of some methods for the solution of sparse overdetermined systems of linear equations. J. Inst. Math. Appl., 17:267-280, 1976. Duff, I. S. and Reid, J. K. Algorithm 529 : Permutations to block tridiagonal form. ACM Trans. Math. Software, 4(2):189-192, 1978. Duff, I. S. and Reid, J. K. An implementation of Tarjan's algorithm for the block triangulation of a matrix. ACM Trans. Math. Software, 4(2):137-147, 1978. Duff, I. S. and Reid, J. K. Performance evaluation of codes for sparse matrix problems. In Fosdick, L. D., editor, Performance Evaluation of Numerical Software, pages 121-135. North-Holland, 1979. Duff, I. S. and Reid, J. K. Some design features of a sparse matrix code. ACM Trans. Math. Software, 5(1):18-35, 1979. Duff, I. S. and Reid, J. K. Experience of sparse matrix codes on the CRAY-1. Comput. Phys. Comm., 76:293-302, 1982. Duff, I. S. and Reid, J. K. The multifrontal solution of indefinite sparse symmetric linear equations. ACM Trans. Math. Software, 9(3):302-325, 1983. Duff, I. S. and Reid, J. K. The multifrontal solution of unsymmetric sets of linear equations. SIAM J. Sci. and Stat. Comput., 5(3):633-641, 1984. Duff, I. S. and Reid, J. K. MA48: A FORTRAN code for direct solution of sparse unsymmetric linear systems of equations. Tech. Report RAL-93-072, Rutherford Appleton Laboratory, Oxon, 1993. Duff, I. S. and Reid, J. K. The design of MA48, a code for the direct solution of sparse unsymmetric linear systems of equations. ACM Trans. Math. Software, 1995. (To be published). Duff, I. S., Reid, J. K., Munksgaard, N., and Nielsen, H. B. Direct solution of sets of linear equations whose matrix is sparse, symmetric and indefinite. J. Inst. Math. Appl., 23:235-250, 1979. Duff, I. S., Reid, J. K., and Scott, J. A. The use of low profile reduction algorithms with a frontal code. Int. J. Numer. Meth. Eng., 28:2555-2568, 1989. Duff, I. S., Reid, J. K., and Scott, J. A. The use of profile reduction algorithms with a frontal code. Int. J. Numer. Meth. in Eng., 28:2555-2568, 1989. Duff, I. S. and Scott, J. A. MA42: A new frontal code for solving sparse unsymmetric systems. Tech. Report RAL-93-064, Rutherford Appleton Laboratory, 1993. (To be published in reduced form at ACM Trans. Math. Software). Duff, I. S. and Scott, J. A. The use of multiple fronts in gaussian elimination. In Lewis, J., editor, Proc. 5^th SIAM Conference on Applied Linear Algebra, pages 567-571. SIAM Publications, 1994. Duff, I. S. and Stewart, G. W., editors. Sparse Matrix Proceedings 1978. SIAM Publications, 1979. Duff, I. S. and Wiberg, T. Remarks on implementations of O(n^1/2 t) assignment algorithms. ACM Trans. Math. Software, 14(3):267-287, 1988. Dulmage, A. L. and Mendelsohn, N. S. On the inversion of sparse matrices. Math. of Computation, 16:494-496, 1962. Dulmage, A. L. and Mendelsohn, N. S. Two algorithms for bipartite graphs. SIAM J. Appl. Math., 11:183-194, 1963. Dunn, J. Global and asymptotic convergence rate estimates for a class of projected gradient processes. SIAM J. Control and Optim., 19:368-400, 1981. Dunn, J. On the convergence of projected gradient processes to singular critical points. J. of Optim. Theory Appl., 55:203-216, 1987. Dupont, T. A factorization procedure for the solution of elliptic difference equations. SIAM J. Numer. Anal., 5:735-782, 1968. Dupont, T., Kendall, R. P., and Rachford, H. H. Jr. An approximate factorization procedure for the solving self-adjoint elliptic difference equations. SIAM J. Numer. Anal., 5:559-573, 1968. Durand, E. Solutions Numeriques des Equations Algebriques, tome II : Systemes de Plusieurs Equations. Masson & Cie, 1972. Dwyer, P. S. Linear Computations. John Wiley & Sons, 1951. Dwyer, P. S. and Macphail, M. S. Symbolic matrix derivatives. Ann. Math. Stat., 19:517-534, 1948. Eckstein, J., Qi, R., Ragulin, V. I., and Zenios, S. A. Data parallel implementations of dense linear programming algorithms. Tech. Report TMC-230, Thinking Machines Corp., Cambridge, MA, 1992. (Also available as Decision Sciences Dept. Report 92-05-06, The Warton School, Univ. of Pennsylvania). Edelmann, H. Optimal strategies for the direct solution of systems of linear equations with sparse coefficient matrices. Math. Mech., 45:T13-T18, 1965. Edelmann, H. Ordered triangular factorization of matrices. In Power System Computation Conference, Stockholm, 1966. Edelsbrunner, H. Algorithms in combinatorial geometry. In Brauer, W., Rozenberg, G., and Salomaa, A., editors, EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1987. Edenbrandt, A. G. Combinatorial Problems in Matrix Computation. PhD thesis, Cornell Univ., 1985. Edmonds, J. Paths, trees, and flowers. Canadian J. Math., 17:449-467, 1965. Edmonds, J. Optimum branchings. J. Res. Nat. Bur. Standards, B71:233-240, 1967. Edmonds, J. and Karp, R. M. Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM, 19:248-264, 1972. Efimov, N. V. and Rozendorn, E. R. Linear Algebra and Multi-Dimensional Geometry. Mir Publishers, 1975. Eisenhart, L. Riemannian Geometry. Princeton University Press, 1925. Eisenstat, S. C. Complexity bounds for Gaussian elimination. Tech. Report, Yale Univ. Eisenstat, S. C. An implementation of the minimum degree algorithm. Tech. Report, Yale Univ. Eisenstat, S. C. Efficient implementation of a class of preconditioned conjugate gradient methods. SIAM J. Sci. and Stat. Comput., 2:1-4, 1981. Eisenstat, S. C., Elman, H. C., and Schultz, M. H. Variational iterative methods for nonsymmetric systems of linear equations. SIAM J. Numer. Anal., 20:345-357, 1983. Eisenstat, S. C., George, A., Grimes, R., Kincaid, D., and Sherman, A. H. Some comparisons of software packages for large sparse linear systems. In Vichnevetsky, R. and Stepleman, editors, Advances in Computer Methods for Partial Differential Equations III, pages 98-106. Publ. IMACE, 1979. Eisenstat, S. C., Gursky, M. C., Schultz, M. H., and Sherman, A. H. Yale Sparse Matrix Package (YSMP) - II : The non-symmetric codes. Tech. Report 114, Dept. of Computer Science, Yale Univ., 1977. Eisenstat, S. C., Gursky, M. C., Schultz, M. H., and Sherman, A. H. Yale Sparse Matrix Package (YSMP) - I : The symmetric codes. Int. J. Numer. Meth. in Eng., 18:1145-1151, 1982. Eisenstat, S. C., Heath, M., Henkel, C., and Romine, C. Modified cyclic algorithms for solving triangular systems on distributed-memory multiprocessors. SIAM J. Sci. and Stat. Comput., 9:589-600, 1988. Eisenstat, S. C. and Liu, J. W. H. Exploiting structural symmetry in unsymmetric sparse symbolic factorization. SIAM J. Matrix Anal. and Appl., 13(1):202-211, 1992. Eisenstat, S. C. and Liu, J. W. H. Exploiting structural symmetry in a sparse partial pivoting code. SIAM J. Sci. and Stat. Comput., 14:253-257, 1993. (Presented at 4^th SIAM Conference on Applied Linear Algebra, Minneapolis, 1991). Eisenstat, S. C., Schultz, M. H., and Sherman, A. H. Minimal storage band elimination. Tech. Report, Yale Univ. Eisenstat, S. C., Schultz, M. H., and Sherman, A. H. Minimal storage sparse elimination. Tech. Report, Yale Univ. Eisenstat, S. C., Schultz, M. H., and Sherman, A. H. Subroutines for the efficient implementation of sparse Gaussian elimination. Tech. Report, Yale Univ. Eisenstat, S. C., Schultz, M. H., and Sherman, A. H. The application of sparse matrix methods to the numerical solution of nonlinear elliptic partial differential equations. In Dold, A. and Eckmann, B., editors, Proc. of the Symposium on Constructive and Computational Methods for Differential Equations. Springer-Verlag, 1974. Eisenstat, S. C., Schultz, M. H., and Sherman, A. H. The application of sparse matrix methods to the numerical solution of nonlinear elliptic partial differential equations. In Dold, A. and Eckmann, B., editors, Proc. of the Symposium on Constructive and Computational Methods for Differential Equations, pages 131-153. Springer-Verlag, 1974. Eisenstat, S. C., Schultz, M. H., and Sherman, A. H. Application of sparse matrix methods to partial differential equations. In Vichnevetsky, R., editor, Proc. AICA International Symposium on Computer Methods for Partial Differential Equations, Bethlehem, pages 40-45. Prentice-Hall, 1975. Eisenstat, S. C., Schultz, M. H., and Sherman, A. H. Efficient implementation of sparse symmetric Gaussian elimination. In Vichnevetsky, R., editor, Proc. AICA International Symposium on Computer Methods for Partial Differential Equations, Bethlehem, pages 33-39. Prentice-Hall, 1975. Eisenstat, S. C., Schultz, M. H., and Sherman, A. H. Applications of an element model for Gaussian elimination. In Bunch, J. R. and Rose, D. J., editors, Sparse Matrix Computations, pages 85-96. Academic Press, 1976. Eisenstat, S. C., Schultz, M. H., and Sherman, A. H. Considerations in the design of software for sparse Gaussian elimination. In Bunch, J. R. and Rose, D. J., editors, Sparse Matrix Computations. Academic Press, 1976. Eisenstat, S. C., Schultz, M. H., and Sherman, A. H. Software for sparse Gaussian elimination with limited core storage. In Duff, I. S. and Stewart, G. W., editors, Sparse Matrix Proceedings 1978, pages 135-153. SIAM Publications, 1979. Eisenstat, S. C., Schultz, M. H., and Sherman, A. H. Algorithms and data structures for sparse symmetric Gaussian elimination. SIAM J. Sci. and Stat. Comput., 2(2):225-237, 1981. Eisenstat, S. C. and Sherman, A. H. Subroutines for envelope solution of sparse linear systems. Tech. Report 35, Dept. of Computer Science, Yale Univ., New Haven, 1974. Elliot, D. L. A note on systems of linear equations. SIAM Review, 3:66-69, 1961. Elmaghraby, S. E. An algebra for the analysis of generalized activity networks. Management Science, 10:494-514, 1964. Elman, H. A stability analysis of incomplete LU factorization. Math. of Computation, 47:191-218, 1986. Enbody, R. J and Du, H. C. Dynamic hashing schemes. ACM Computing Surveys, 20(2):85-113, 1988. Enns, M. K., Tinney, W. F., and Alvarado, F. L. Sparse matrix inverse factors. IEEE Trans. Power Systems, PWRS-5:466-473, 1990. Erisman, A. M. Sparse matrix approach to frequency domain analysis of linear passive electrical networks. In Rose, D. J. and Willoughby, R. A., editors, Sparse Matrices and Their Applications, pages 31-40. Plenum Press, New York, 1972. Erisman, A. M., Grimes, R. G., Lewis, J. G., and Poole, W. G. Jr. A structurally stable modification of Hellerman-Rarick's P^4 algorithm for reordering unsymmetric sparse matrices. SIAM J. Numer. Anal., 22:369-385, 1985. Erisman, A. M., Grimes, R. G., Lewis, J. G., Poole, W. G. Jr., and Simon, H. D. Evaluation of orderings for unsymmetric sparse matrices. SIAM J. Sci. and Stat. Comput., 7:600-624, 1986. Erisman, A. M., Neves, K. W., and Dwarakanath, M. H., editors. Electric Power Problems : The Mathematical Challenge. SIAM Publications, 1980. Erisman, A. M. and Spies, G. E. Exploiting problem characteristics in the sparse matrix approach to frequency domain analysis. IEEE Trans. Circuit Theory, CT-19:260-269, 1972. Erisman, A. M. and Tinney, W. F. On computing certain elements of the inverse of a sparse matrix. Comm. ACM, 18:177-179, 1975. Eskow, E. and Schnabel, R. B. Software for a new modified Cholesky factorization. ACM Trans. Math. Software, 17(3):306-312, 1991. Estrin, G., Bussel, B., Turn, R., and Bibb, J. Parallel processing on a restructurable computer system. IEEE Trans. Electronic Computers, EC-12:747-754, 1963. Estrin, G. and Turn, R. Automatic assignment of computations in a variable structure computer system. IEEE Trans. Electronic Computers, EC-12:755-773, 1963. Eufinger, J. Operations on directed graphs. J. Reine Angew Math., 247:146-154, 1971. Evans, D. J. The extrapolated modified Aitken iteration method for solving elliptic difference equations. Computing J., 6:193-201, 1963. Evans, D. J., editor. Software for Numerical Mathematics. Academic Press, 1974. Evans, D. J. On the numerical solution of sparse systems of finite element equations. In Whiteman, J., editor, The Mathematics of Finite Elements & Applications - III, Mafelap 1978 Conference Proceedings, pages 448-458. Academic Press, 1979. Evans, D. J., editor. Sparsity and its Applications. Cambridge University Press, 1985. Eve, J. On computing the transitive closure of a relation. Tech. Report STAN-CS-75-508, Computer Science Dept., Stanford Univ., 1975. Even, S. Graph Algorithms. Computer Science Press, 1979. Even, S. and Kariv, O. An O(n^5/2) algorithm for maximum matching in general graphs. Tech. Report, Weizmann Institute, Israel, 1975. Even, S. and Tarjan, R. E. Network flow and testing graph connectivity. SIAM J. Comput., 4:507-518, 1975. Everstine, G. C. A comparison of three resequencing algorithms for the reduction of matrix profile and wavefront. Int. J. Numer. Meth. Eng., 14:837-853, 1979. Faddeev, D. K. and Faddeeva, V. H. Computational Methods of Linear Algebra. Freeman & Co., 1963. (Translated from the Russian original). Faddeeva, V. H. Computational Methods of Linear Algebra. Dover Publications, 1959. (Translated from the 1950 Russian edition). Falkoff, A. D. Algorithms for parallel search memories. J. ACM, 9:488-501, 1962. Farkas, J. Theorie der einfachen Ungleichungen. Journal fur die reine und angewandte Mathematik, 124:1-27, 1902. Faybusovich, L. Hamiltonian structure of dynamical systems which solve linear programming problems. Physics, D53:217-232, 1991. Federenko, R. P. A relaxation method for solving elliptic difference equations. USSR Comp. Math. and Math. Phys., 4:1092, 1961. (Originally published at Zh. Vych. Mat., 1:922-927, 1961). Feingold, D. G. and Varga, R. S. Block diagonally dominant matrices and generalizations of the Gerschgorin circle. Pacific J. Math., 12:1241-1250, 1963. Felippa, C. A. and Clough, R. W. The finite element method in solid mechanics. In Birkhoff, G. and Varga, R. S., editors, Numerical Solution of Field Problems in Continuum Physics, pages 210-252. American Math. Soc., Providence, 1970. Fellipa, C. A. Solution of linear equations with skyline-stored symmetric matrix. Computer and Structures, 5:13-29, 1975. Fenichel, R. R. and Yochelson, J. C. A LISP garbage-collector for virtual memory computer systems. Comm. ACM, 12:611-612, 1969. Fenves, S. J. STRESS : Structural Engineering System Solver, A computer programming system for structural engineering problems. Tech. Report T-63-2, MIT, 1963. Fenves, S. J. Computer Methods in Civil Engineering. Prentice-Hall, 1967. Fenves, S. J. and Branin, F. H. Jr. A network-topological formulation of structural analysis. J. Amer. Soc. Civil Engrs., Structural Division, 89:483-514, 1963. Fenves, S. J., Perrone, N., Robinson, A. R., and Schnobrich, W. C., editors. Numerical and Computer Methods in Structural Mechanics. Academic Press, 1973. Feo, J. An analysis of the computational and parallel complexity of the Livermore loops. Parallel Computing, 7:163-186, 1988. Feuer, A. R. and Gehani, N., editors. Comparing and Assessing Programming Languages ADA, C, and PASCAL. Prentice-Hall, 1984. Fiacco, A. V. and McCormick, G. P. Nonlinear Programming : Sequential Unconstrained Minimization Techniques. John Wiley & Sons, 1968. (Republished by SIAM Publications, 1990). Fiedler, M. Algebraic connectivity of graphs. Czech. Math. J., 23:298-305, 1973. Fiedler, M. A property of eigenvectors of non-negative symmetric matrices and its application to graph theory. Czech. Math. J., 25:619-633, 1975. Fiedler, M. Inversion of bigraphs and connection with the gauss elimination. In Graphs, Hypergraphs, and Block Systems, pages 57-68. Zielona Gora, Czechoslovakia, 1976. Fike, C. T. Computer Evaluation of Mathematical Functions. Prentice-Hall, 1968. Fischer, H. and Ritter, K. An asynchronous parallel Newton method. Math. Programming, 42(2):363-374, 1988. Fisher, J. A. Trace scheduling : A technique for global microcode compaction. IEEE Trans. Comput., C-30(7):478-490, 1981. Fisher, J. A. Very long instruction word architectures and ELI-512. In Proc. 10^th Symposium on Computer Architecture, pages 140-150, Stockholm, 1983. Fletcher, R., editor. Optimization. Academic Press, 1969. Fletcher, R. Practical Methods of Optimization, volume 1 : Unconstrained Optimization. John Wiley & Sons, 1980. Fletcher, R. Practical Methods of Optimization, volume 2 : Constrained Optimization. John Wiley & Sons, 1981. Fletcher, R. and Powell, M. J. D. A rapidly convergent descent method for minimization. Computing J., 6:163-168, 1965. Fletcher, R. and Powell, M. J. D. On the modification of LDL^T factorizations. Math. of Computation, 28(128):1067-1087, 1974. Floyd, R. W. Algorithm 96 : Ancestor. Comm. ACM, 5:344-345, 1962. Floyd, R. W. Algorithm 97 : Shortest Path. Comm. ACM, 5:345, 1962. Floyd, R. W. Algorithm 245 : Treesort 3. Comm. ACM, 7:701, 1964. Flynn, M. Very high speed computing systems. Proc. of the IEEE, 54:1901-1909, 1966. Ford, B. Parameterization of the environment for transportable numerical software. ACM Trans. Math. Software, 4(2):100-103, 1978. Ford, L. R. and Fulkerson, D. R. Maximal flow through a network. Canadian J. Math., 8:399-404, 1956. Ford, L. R. and Fulkerson, D. R. Flows in Networks. Princeton Univ. Press, 1962. Forrest, J. J. H. and Goldfarb, D. Steepest-edge simplex algorithms for linear programming. Math. Programming, 57:341-374, 1992. Forrest, J. J. H. and Tomlin, J. A. Updating triangular factors of the basis to maintain sparsity in the product-form simplex method. Math. Programming, 2:263-278, 1972. Forrest, J. J. H. and Tomlin, J. A. Vector processing in simplex and interior methods for linear programming. Tech. Report RJ-6390-62372, IBM Thomas J. Watson Research Center, Yorktown Heights, 1988. Forrest, J. J. H. and Tomlin, J. A. Vector processing in simplex and interior methods for linear programming. Annals of Oper. Res., 22:71-100, 1990. Forrest, J. J. H. and Tomlin, J. A. What makes a linear programming difficult ? (Presented at ORSA/TIMS Joint National Meeting, San Francisco), 1992. Forsgren, A. L. and Murray, W. Newton methods for large-scale linear equality-constrained minimization. Tech. Report SOL-90-6, Dept. of Oper. Research, Stanford Univ., 1990. Forsythe, G. E. Algorithm 16 : Crout with pivoting. Comm. ACM, 3:507-508, 1960. Forsythe, G. E. Today's computational methods of linear algebra. SIAM Review, 9:489-515, 1967. Forsythe, G. E., Malcolm, M. A., and Moler, C. B. Computer Methods for Mathematical Computations. Prentice-Hall, 1977. Forsythe, G. E. and Moler, C. B. Computer Solution of Linear Algebraic Systems. Prentice-Hall, 1967. Forsythe, G. E. and Strauss, E. G. On best conditioned matrices. Proc. of the AMS, 6:340-345, 1955. Forsythe, G. E. and Wasow, W. R. Finite Difference Methods for Partial Differential Equations. John Wiley & Sons, 1960. Fortet, R. Algebre des Tenseurs et des Matrices, Problemes de Valeurs Propres. Fosdick, L. D., editor. Performance Evaluation of Numerical Software. North-Holland, 1979. Fosdick, L. D., Jessup, E. R., Schauble, C. J. C., and Domik, G. An Introduction to High-Performance Scientific Computing. MIT Press, 1995. Fourer, R. and Mehrotra, S. Performance of an augmented system approach for solving least-squares problems in an interior point method. COAL Newsletter, 19:26-31, 1991. Fourer, R. and Mehrotra, S. Solving symmetric indefinite systems in an interior point method for linear programming. Tech. Report 92-01, Dept. of Industrial Eng. and Manag. Sciences, Northwestern Univ., Evanston, 1992. Fourier, J. B. J. Solution d'une question particuliere du calcul des inegalites. Noveau Bulletin des Sciences par la Societe Philomathique de Paris, pages 99-100, 1826. Fox, B. L. Accelerating LP algorithms. Comm. ACM, 12:384-385, 1969. Fox, G. C. et al. FORTRAN D Language specification. Tech. Report TR-90-141, Computer Science Dept., Rice Univ., 1990. Fox, G. C., Johnson, M. A., Lyzenga, G. A., Otto, G. A., Salomon, J. K., and Walker, D. W. Solving Problems on Concurrent Processors. Prentice-Hall, 1988. Fox, L., editor. Numerical Solution of Ordinary and Partial Differential Equations. Addison-Wesley, 1962. Fox, L. An Introduction to Numerical Linear Algebra. Oxford University Press, 1965. Franck, H. and Fisch, I. T. Communications, Transmission and Transportation Networks. Addison-Wesley, 1971. Frazer, R. A., Duncan, W. J., and Collar, A. R. Elementary Matrices. Cambridge, 1950. Freiman, C. V., editor. Information Processing 71, Proc. IFIP Congress, Ljubljana, 1972. North-Holland. Frisch, K. The logarithmic potential method of convex programming. Internal Memorandum, University Institute of Economics, Olso, 1989. Froberg, C. E. Introduction to Numerical Analysis. Addison-Wesley, 2^nd edition, 1969. Fulkerson, D. R. and Wolfe, P. An algorithm for scaling matrices. SIAM Review, 4:142-146, 1962. Gabay, D. Minimizing a differentiable function over a differential manifold. JOTA, 37(2):177-218, 1982. Gabow, H. N. Implementation of Algorithms for Maximum Matching on Nonbipartite Graphs. PhD thesis, Dept. of Electrical Eng., Stanford Univ., 1973. Gabow, H. N. An efficient implementation of Edmond's algorithm for maximum matching on graphs. J. ACM, 23:221-234, 1976. Gabow, H. N., Galil, Z., Spencer, T., and Tarjan, R. E. Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. Combinatorica, 6:109-122, 1986. Gabow, H. N. and Tarjan, R. E. A linear time algorithm for a special case of disjoint set union. In Proc. 15^th Annual ACM Symposium on Theory of Computing, pages 246-251, 1983. Gabow, H. N. and Tarjan, R. E. A linear time algorithm for a special case of disjoint set union. J. Comput. Syst. Sci., 30:209-221, 1985. Gallagher, R. H. Finite Element Analysis Fundamentals. Prentice-Hall, 1975. Gallivan, K. A., Heath, M. T., Ng, E., Ortega, J., Peyton, B., Plemmons, R., Romine, C., Sameh, A., and Voigt, R. Parallel Algorithms for Matrix Computations. SIAM Publications, 1990. Gallivan, K. A., Jalby, W., Meier, U., and Sameh, A. H. Impact of hierarchical memory systems on linear algebra algorithm design. Int. J. of Supercomputer Appl., 2:12-48, 1988. Gallivan, K. A., Plemmons, R. J., and Sameh, A. H. Parallel algorithms for dense linear algebra computations. SIAM Review, 32(1):54-135, 1990. Gannon, D. Restructuring nested loops on the ALLIANT CEDAR cluster : A case study of Gaussian elimination of banded matrices. Tech. Report 543, Center for Supercomputing Research and Development, Univ. of Illinois at Urbana-Champaign, 1986. Gantmacher, F. R., editor. Matrizenrechnung - I. Berlin, 1958. Gantmacher, F. R. The Theory of Matrices, volume 2. Chelsea, New York, 1959. Garabedian, P. R., editor. Partial Differential Equations. John Wiley & Sons, 1964. Garcia, C. B. and Zangwill, W. I. Pathways to Solutions, Fixed Points, and Equilibria. Prentice-Hall, 1981. Garey, M. R. and Johnson, D. S. Some simplified NP-complete problems. In Proc. 6^th Annual ACM Symposium on Theory of Computing, pages 47-63, 1974. Garey, M. R. and Johnson, D. S. Strong NP-completeness results : Motivation, examples and implications. J. ACM, 25:499-508, 1978. Garey, M. R. and Johnson, D. S. Computers and Intractability : A Guide to the Theory of NP-Completeness. Freeman & Co., 1979. Garfinkel, R. S. and Nemhauser, G. L. Integer Programming. John Wiley & Sons, 1972. 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. Scalable Processor Architecture (SPARC). In COMPCON, pages 278-283, San Francisco, 1988. IEEE. Gass, S. I. Linear Programming : Methods and Applications. McGraw-Hill, 1958. Gauss, K. F. The Theory of Combination of Observations Least Subject to Errors - Part One, Part Two, Supplement. SIAM Publications, 1995. (Translated by Stewart, G. W.). Gavril, F. Algorithms for minimum coloring, maximum clique, minimum covering by cliques and maximum independent set of a chordal graph. SIAM J. Comput., 1:180-187, 1972. Gavril, F. The intersection graphs of subtrees in trees are exactly the chordal graphs. J. Combinatorial Theory B, 16:47-56, 1974. Gay, D. M. Computing optimal locally constrained steps. SIAM J. Sci. and Stat. Comput., 2:186-197, 1981. Gay, D. M. A trust region approach to linearly constrained optimization. In Griffiths, D. F., editor, Numerical Analysis, Proc. Dundee 1983, volume 1066 of Lecture Notes in Mathematics. Springer-Verlag, 1984. Gay, D. M. Electronic mail distribution of linear programming test problems. Mathematical Programming Society Committee on Algorithms Newsletter, 13, 1985. Gay, D. M. Sparse projections in Karmarkar's linear programming algorithm. Talk presented at ORSA/TIMS Joint National Meeting, Atlanta, AT&T BELL Labs., Murray Hill, 1985. Gay, D. M. Massive memory buys little speed for complete in-core sparse Cholesky factorizations on some scalar computers. Lin. Alg. Appl., 152:291-314, 1991. Gear, C. W. The automatic integration of stiff differential equations. In Proc. IFIP Congress, Edinburgh, 1968. Gear, C. W. Numerical Initial Value Problems in Ordinary Differential Equations. Prentice-Hall, 1971. Gear, C. W. Simultaneous numerical solution of differential algebraic equations. IEEE Trans. Circuit Theory, CT-18:89-95, 1971. Gehani, N. ADA : An Advanced Introduction. Prentice-Hall, 1983. Geist, G. A. Solving finite element problems with parallel multifrontal schemes. In Heath, M. T., editor, Hypercube Multiprocessors 1987, pages 656-661. SIAM Publications, 1987. Geist, G. A., Benguelim, A., Dongarra, J., Jiang, J., Manchek, R., and Sunderam, V. PVM 3.0 ``User's Guide'' and ``Reference Manual''. Oak Ridge National Laboratory, 1993. Geist, G. A. and Heath, M. T. Parallel Cholesky factorization on a hypercube multiprocessor. Tech. Report ORNL-6211, Oak Ridge National Laboratory, 1985. Geist, G. A. and Heath, M. T. Matrix factorization on a hypercube multiprocessor. In Heath, M. T., editor, Hypercube Multiprocessors 1986, pages 161-180. SIAM Publications, 1986. Geist, G. A. and Ng, E. A partitioning strategy for parallel sparse Cholesky factorization. Tech. Report ORNL-TM-10937, Oak Ridge National Laboratory, 1988. Geist, G. A. and Ng, E. Task scheduling for parallel sparse Cholesky factorization. Int. J. of Parallel Programming, 18(4):291-314, 1989. Gentleman, W. M. Least-squares computations by Givens transformations without square roots. J. Inst. Math. Appl., 12:329-336, 1973. Gentleman, W. M. Error analysis of QR decompositions by Givens transformations. Lin. Alg. Appl., 10:189-197, 1975. Gentleman, W. M. and George, A. Sparse matrix software. In Bunch, J. R. and Rose, D. J., editors, Sparse Matrix Computations. Academic Press, New York, 1976. George, A. Computer Implementation of the Finite Element Method. PhD thesis, Computer Science Dept., Stanford Univ., 1971. (Report STAN-CS-71-208). George, A. Block elimination on finite element systems of equations. In Rose, D. J. and Willoughby, R. A., editors, Sparse Matrices and Their Applications, pages 101-114. Plenum Press, New York, 1972. George, A. Nested dissection of a regular finite element mesh. SIAM J. Numer. Anal., 10:345-363, 1973. George, A. On block elimination for sparse linear systems. SIAM J. Numer. Anal., 11:585-603, 1974. George, A. A negative result on sparse matrix splitting and Gaussian elimination. Report, ICASE, Langley, 1975. George, A. An efficient band-oriented scheme for solving n by n grid problems. In Proc. 1972 FJCC, pages 1317-1321. AFIPS Press, Montvale, New Jersey, 1977. George, A. Numerical experiments using dissection methods to solve n by n grid problems. SIAM J. Numer. Anal., 14:161-179, 1977. George, A. Solution of linear systems of equations : Direct methods for finite element problems. In Barker, V. A., editor, Course in Advanced Sparse Matrix Techniques, volume 572 of Lecture Notes in Mathematics, pages 52-101. Springer-Verlag, 1977. George, A. An automatic one-way dissection algorithm for irregular finite element problems. In Proc. 1977 Dundee Conference on Numerical Analysis, volume 630 of Lecture Notes in Mathematics, pages 76-89. Springer-Verlag, 1978. George, A., Gilbert, J. R., and Liu, J. W. H., editors. Graph Theory and Sparse Matrix Computation. Springer-Verlag, 1993. George, A., Heath, M. T., and Liu, J. W. H. Parallel Cholesky factorization on a shared memory multiprocessor. Lin. Alg. Appl., 77:165-187, 1986. George, A., Heath, M. T., Liu, J. W. H., and Ng, E. Solution of sparse positive definite systems on a shared memory multiprocessor. Int. J. of Parallel Programming, 15:309-325, 1986. George, A., Heath, M. T., Liu, J. W. H., and Ng, E. Sparse Cholesky factorization on a local memory multiprocessor. SIAM J. Sci. and Stat. Comput., 9:327-340, 1988. George, A., Heath, M. T., Liu, J. W. H., and Ng, E. Solution of sparse positive definite systems on a hypercube. J. Comput. Applied. Math, 27:129-156, 1989. George, A., Heath, M. T., and Ng, E. Solution of sparse undetermined systems of linear equations. SIAM J. Sci. and Stat. Comput., 5(4):988-997, 1984. George, A., Heath, M. T., Ng, E., and Liu, J. W. H. Symbolic Cholesky factorization on a local-memory multiprocessor. Parallel Computing, 5:85-95, 1987. George, A. and Liu, J. W. H. An automatic partitioning and solution scheme for solving large sparse positive definite systems of linear algebraic equations. Tech. Report CS-75-17, Dept. of Computer Science, Univ. Waterloo, Ontario, Canada, 1975. George, A. and Liu, J. W. H. Some results and notes on fill for sparse matrices. SIAM J. Numer. Anal., 12(3):452-455, 1975. George, A. and Liu, J. W. H. Algorithms for matrix partitioning and the numerical solution of finite element systems. SIAM J. Numer. Anal., 15:297-327, 1978. George, A. and Liu, J. W. H. An automated nested dissection algorithm for irregular finite element problems. SIAM J. Numer. Anal., 15:1053-1069, 1978. George, A. and Liu, J. W. H. The design of a user interface for a sparse matrix package. ACM Trans. Math. Software, 5(2):139-162, 1979. George, A. and Liu, J. W. H. An implementation of a pseudoperipheral node finder. ACM Trans. Math. Software, 5(3):284-295, 1979. George, A. and Liu, J. W. H. A quotient graph model for symmetric factorization. In Duff, I. S. and Stewart, G. W., editors, Sparse Matrix Proceedings 1978. SIAM Publications, 1979. George, A. and Liu, J. W. H. A fast implementation of the minimum degree algorithm using quotient graphs. ACM Trans. Math. Software, 6(3):337-358, 1980. George, A. and Liu J. W. H. A minimal storage implementation of the minimum degree algorithm. SIAM J. Numer. Anal., 17(2):282-299, 1980. George, A. and Liu, J. W. H. An optimal algorithm for symbolic factorization of symmetric matrices. SIAM J. Comput., 9(3):583-593, 1980. George, A. and Liu, J. W. H. Computer Solution of Large Positive Definite Systems. Prentice-Hall, 1981. George, A. and Liu, J. W. H. The evolution of the minimum degree ordering algorithm. SIAM Review, 31(1):1-19, 1989. George, A., Liu, J. W. H., and Ng, E. Row ordering schemes for sparse Givens transformations - I : Bipartite graph model. Lin. Alg. Appl., 61:55-81, 1984. George, A., Liu, J. W. H., and Ng, E. Communication reduction in parallel sparse Cholesky factorization. In Proc. 2^nd Hypercube Conference, Knoxville, 1986. George, A., Liu, J. W. H., and Ng, E. Row ordering schemes for sparse Givens transformations - II : Implicit graph model. Lin. Alg. Appl., 75:203-223, 1986. George, A., Liu, J. W. H., and Ng, E. Communication results for parallel sparse Cholesky factorization on a hypercube. Parallel Computing, 10:287-298, 1989. George, A. and McIntyre, D. On the application of the minimum degree algorithm to finite element systems. SIAM J. Numer. Anal., 15:90-112, 1978. George, A. and McIntyre, D. On the application of the minimum degree algorithm to finite element systems. SIAM J. Numer. Anal., 15:90-111, 1978. George, A. and Ng, E. SPARSPAK : Waterloo sparse matrix package ``User's Guide'' for SPARSPAK-B. Research Report CS-84-37, Dept. of Computer Science, Univ. of Waterloo, 1984. George, A. and Ng, E. Waterloo sparse matrix package ``User's Guide'' for SPARSPAK-B. Tech. Report CS-84-37, Univ. Waterloo, Canada, 1984. George, A. and Ng, E. An implementation of Gaussian elimination with partial pivoting for sparse systems. SIAM J. Sci. and Stat. Comput., 6(2):390-409, 1985. George, A. and Ng, E. Symbolic factorization for sparse Gaussian elimination with partial pivoting. SIAM J. Sci. and Stat. Comput., 8(6):877-898, 1987. George, A. and Ng, E. On the complexity of sparse QR and LU factorization of finite-element matrices. SIAM J. Sci. and Stat. Comput., 9:849-861, 1988. George, A. and Ng, E. Parallel sparse Gaussian elimination with partial pivoting. Annals of Oper. Res., 22:219-240, 1990. George, A., Poole, W. G. Jr., and Voigt, R. G. Analysis of dissection algorithms for vector computers. J. Comp. and Math. with Appl., 4:287-304, 1978. George, A., Poole, W. G. Jr., and Voigt, R. G. Incomplete nested dissection for solving n by n grid problems. SIAM J. Numer. Anal., 15:662-673, 1978. George, A. and Rashwan, H. On symbolic factorization of partitioned sparse symmetric matrices. In Bjorck, A., Plemmons, R. J., and Schneider, H., editors, Large Scale Matrix Problems, pages 145-158. North-Holland, 1981. George, A. and Rashwan, H. Auxiliary storage methods for solving finite element systems. SIAM J. Sci. and Stat. Comput., 6(4):882-910, 1985. George, J. A. and Heath, M. T. Solution of sparse linear least squares problems using Givens rotations. Lin. Alg. Appl., 34:69-83, 1980. Gibbons, A. and Rytter, W. Efficient Parallel Algorithms. Cambridge University Press, 1988. Gibbons, P. B. and Muchnik, S. S. Efficient instruction scheduling for a pipelined processor. In SIGPLAN '86 Symposium on Compiler Construction, pages 11-16, Palo Alto, 1986. ACM. Gibbs, N. E. The Bandwidth of Graphs. PhD thesis, Purdue Univ., 1969. Gibbs, N. E. Algorithm 509 : A hybrid profile reduction algorithm. ACM Trans. Math. Software, 2:378-387, 1976. Gibbs, N. E., Poole, W. G. Jr., and Stockmeyer, P. K. An algorithm for reducing the bandwidth and profile of a sparse matrix. SIAM J. Numer. Anal., 13:236-250, 1976. Gibbs, N. E., Poole, W. G. Jr., and Stockmeyer, P.