Using dense matrix computations in the solution of sparse problems
On many high-speed computers the dense matrix technique is preferable to sparse matrix technique when the matrices are not very large, because the high computational speed compensates fully the disadvantages of using more arithmetic operations and more storage. Dense matrix techniques can still used if the computations are successively carried out in a sequence of large dense blocks. A method based on this idea will be discussed.
Unable to display preview. Download preview PDF.
- 1.Anderson, E., Bai, Z., Bischof C., Demmel J., Dongarra, J., Du Croz, J., Greenbaum, A., Hammarling, S., McKenney, A., Ostrouchov, S. and Sorensen, D., ”LAPACK: Users' guide”, SIAM, Philadelphia, 1992.Google Scholar
- 2.Duff, I. S., Grimes, R. G. and Lewis, J. G., ”Sparse matrix test problems”, ACM Trans. Math. Software, 15 (1989), 1–14.Google Scholar
- 3.Duin, A. C. N. van, Hansen, P. C., Ostromsky, Tz., Wijsoff, H. and Zlatev, Z., ”Improving the numerical stability and the performance of a parallel sparse solver”, Comput. Math. Applics., Vol. 30, No. 12 (1995), 81–96.Google Scholar
- 4.Gallivan, K., Hansen, P. C., Ostromsky, Tz. and Zlatev, Z., ”A locally optimized reordering algorithm and its application to a parallel sparse linear system solver”, Computing, 54 (1995), 39–67.Google Scholar
- 5.Zlatev, Z., ”Computational methods for general sparse matrices”, Kluwer Academic Publishers, Dordrecht-Toronto-London, 1991.Google Scholar