John G. Lewis
- 1 CRANE, H.L., JR., GIBBS, N.E., POOLE, W.G., JR., AND STOCKMEYER, P.K. Matrix bandwidth and profile reduction. ACM Trans. Math Softw 2, 4 (Dec. 1976), 375-377. Google Scholar
- 2 DUFF, I.S. A survey of sparse matrix research. Proc. IEEE 65, 4 (April 1977), 500-535.Google Scholar
- 3 EISENSTAT, S.C., SCHULTZ, M.A., AND SHERMAN, A.W. Efficient implementation of sparse symmetric Gaussian elimination. In Proc. AICA Int. Syrup. on Computer Methods for PDE's (Bethlehem, Pa., 1975), 33-39.Google Scholar
- 4 EVERSTINE, G.C. A comparison of three resequencmg algorithms for the reduction of matrix profile and wavefront. Int J. Numer. Methods ~n Eng. 14 (1979), 837-853.Google Scholar
- 5 GEORGE, A. Solution of linear systems of equations. Dtrect methods for finite element problems. In Sparse Matrix Techniques, Copenhagen 1976, A. Dold and B. Eckman (Eds), Springer-Verlag, New York, 1977.Google Scholar
- 6 GEORGE, A., AND LIU, J.W.H. An implementatlon of a pseudoperipheral node finder. ACM Trans. Math. Softw. 5, 3 (Sept. 1979), 284-295. Google Scholar
- 7 GEORGE, A, AND LIU, J W.H Algorithms for matrix partitioning and the numerical solution of fimte element systems. SIAM J Numer. Anal. 15, 2 (April 1978), 297-327.Google Scholar
- 8 GEORGE, A., LIu, J., AND NG, E. User Guide for Sparspak" Waterloo Sparse Linear Equations Package, Dep. Computer Science, Univ. of Waterloo, Waterloo, Ont., Canada, 1979.Google Scholar
- 9 GIBBS, N.E A hybrid profile reduction algorithm. ACM Trans. Math. Softw. 2, 4 (Dec. 1976), 378-387. Google Scholar
- 10 GIBBS, N.E, POOLE, W.G., JR., AND STOCKMEYER, P.K. A comparison of several bandwidth and profile reduction algorithms. ACM Trans. Math. Softw. 2, 4 (Dec. 1976), 322-330. Google Scholar
- 11 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, 2 (April 1976), 236-250.Google Scholar
- 12 JENNINGS, A. Matrix Computations for Engineers and Scwnt~sts. Wiley, New York, 1977.Google Scholar
- 13 KNUTH, D.E. The Art of Computer Programmzng, Vol. 3, Sorting and Searching. Addison- Wesley, Reading, Mass., 1973. Google Scholar
- 14 SEDGEWICK, R Implementing Quicksort programs. Commun ACM 21, 10 (Oct. 1978), 847-857. Google Scholar
- 15 THIERER, A A Comparison of Ordermg Schemes for Profde Minimization of Sparse Symmetric Matrwes. Center for Numerical Analysis, Rep CNA-146, Univ. of Texas, Austin, 1978.Google Scholar
Index Terms
- Implementation of the Gibbs-Poole-Stockmeyer and Gibbs-King Algorithms
Recommendations
Implementation an Experimental Evaluation of Graph Connectivity Algorithms Using LEDA
WAE '99: Proceedings of the 3rd International Workshop on Algorithm EngineeringIn this paper we describe robust and efficient implementations of two graph connectivity algorithms. The implementations are based on the LEDA library of efficient data types and algorithms [18,19]. Moreover, we provide experimental evaluations of the ...
Hardware implementation perspectives of digital video watermarking algorithms
We consider hardware implementation aspects of the digital watermarking problem through the implementation of a well-known video watermarking algorithm called just another watermarking system (JAWS); we discuss the time and area constraints that must be ...
Comments