next up previous
Next: About this document Up: Sparse Matrix Reordering Title Previous: Acknowledgements


M. W. Berry et al., SVDPACKC: Version 1.0 User's Guide, Tech. Report CS--93--194, University of Tennessee, Knoxville, TN, October 1993.

S. Browne, J. Dongarra, S. Green, K. Moore, T. Rowan, R. Wade, G. Fox, K. Hawick, K. Kennedy, J. Pool, R. Stevens, B. Olson, and T. Disz, The National HPCC Software Exchange, IEEE Computational Science and Engineering 2 (1995), no. 2, 62--69.

M. W. Berry, S. T. Dumais, and G.W. O'Brien, Using linear algebra for intelligent information retrieval, SIAM Review (1995), In press.

J. P. Benzécri, , Tome (Vol.) 1: La Taxinonmie, Tome 2: L'Analyse des Correspondances, Dunod, Paris, 1973.

M. W. Berry, Large scale singular value computations, International Journal of Supercomputer Applications 6 (1992), no. 1, 13--49.

Stephen T. Barnard, Alex Pothen, and Horst D. Simon, A spectral algorithm for envelope reduction of sparse matrices, Proc. Supercomputing '93, IEEE, 1993, pp. 493--502.

E. Chu, A. George, J. Liu, and E. Ng, Sparspak: Waterloo sparse matrix package user's guide for Sparspak-A, Tech. Report CS-84-36, Department of Computer Science, Univ. of Waterloo, Waterloo, Ontario, Canada, 1984.

S. Deerwester, S. Dumais, G. Furnas, T. Landauer, and R. Harshman, Indexing by latent semantic analysis, Journal of the American Society for Information Science 41 (1990), no. 6, 391--407.

S. T. Dumais, Improving the retrieval of information from external sources, Behavior Research Methods, Instruments, & Computers 23 (1991), no. 2, 229--236.

P. W. Foltz and S. T. Dumais, Personalized information delivery: An analysis of information filtering methods, Communications of the ACM 35 (1992), no. 12, 51--60.

Miroslav Fiedler, Algebraic connectivity of graphs, Czech. Math. Journal 23 (1973), 298--305.

Miroslav Fiedler, A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory, Czech. Math. Journal 25 (1975), 619--633.

A. George, Computer implementation of the finite-element method, Tech. Report CS-208, Department of Computer Science, Stanford University, 1971.

A. Gifi, Nonlinear multivariate analysis, John Wiley & Sons, Chichester, England, 1990.

A. George and J. Liu, Computer Solution of Large Sparse Positive Definite Systems, Prentice-Hall, Englewood Cliffs, NJ, 1981.

G. Golub and C. Van Loan, Matrix computations, second ed., Johns-Hopkins, Baltimore, 1989.

Stephen Guattery and Gary L. Miller, On the performance of the spectral graph partitioning methods, Proc. Sixth Annual ACM--SIAM Symp. on Discrete Algs., ACM--SIAM, 1995, pp. 233--42.

Alan George and Alex Pothen, An analysis of spectral envelope--reduction via quadratic assignment problems, Tech. Report ICASE Technical Report 94--81, NASA LaRC, Hampton, VA, September 1994.

M. J. Greenacre, Theory and applications of correspondence analysis, Academic Press, London, 1984.

B. Hendrickson and R. Leland, The Chaco User's Guide, Version 2.0, Tech. Report SAND94--2692, Sandia National Laboratories, Albuquerque, NM, October 1994.

Martin Juvan and Bojan Mohar, Optimal linear labelings and eigenvalues of graphs, Disc. Appl. Math. 36 (1992), 153--168.

J. Liu and A. Sherman, Comparative analysis of the Cuthill-McKee and Reverse Cuthill-McKee ordering algorithms for sparse matrices, SIAM Journal of Numerical Analysis 13 (1976), 198--213.

L. Mirsky, Symmetric gage functions and unitarilly invariant norms, Q. J. Math 11 (1960), no. 1, 50--59.

B. Mohar, The Laplacian spectrum of graphs, Graph Theory, Combinatorics and Applications (New York) (Y. Alavi et al., ed.), J. Wiley, New York, 1991, pp. 871--898.

B. Mohar, Laplace eigenvalues of graphs -- a survey, Disc. Math. 109 (1992), 171--183.

K. S. O'Yang, B. Srinivasan, and L. M. Goldschalger, Browsing hypertext in vector space, Proceedings of Second International Computer Science Conference (Hong Kong), 1992, pp. 16--22.

Glaucio Paulino, Ivan Menezes, Marcelo Gattass, and Subrata Mukherjee, Node and element resequencing using the Laplacian of a finite element graph: Part I -- general concepts and algorithm, Intl. J. Num.\ Methods Eng. 37 (1994), 1511--1530.

Glaucio Paulino, Ivan Menezes, Marcelo Gattass, and Subrata Mukherjee, Node and element resequencing using the Laplacian of a finite element graph: Part II -- implementation and numerical results, Intl. J. Num.\ Methods Eng. 37 (1994), 1531--1555.

A. Pothen, H. Simon, and K. Liou, Partitioning sparse matrices with eigenvectors of graphs, SIAM J. Matrix Anal. 11 (1990), no. 3, 430--452.

N. L. Sizemore, Knowledge-base graph recovery using sparse matrix techniques, Expert Systems With Applications 7 (1994), no. 2, 185--198.

Michael W. Berry (
Mon Jan 29 14:30:24 EST 1996