Skip to main content
SpringerLink
Log in

Using dense matrix computations in the solution of sparse problems

  • Conference paper
  • First Online:
Numerical Analysis and Its Applications (WNAA 1996)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1196))

Included in the following conference series:

  • 247 Accesses

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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 

Download references

Author information

Authors and Affiliations

  1. Central Laboratory for Parallel Information Processing, Bulgarian Academy of Sciences, Acad. G.Bonchev str. bl. 25-A, 1113, Sofia, Bulgaria

    Tz. Ostromsky

  2. National Environmental Research Institute, Frederiksborgvej 399, P. O. Box 358, DK-4000, Roskilde, Denmark

    Z. Zlatev

Authors
  1. Tz. Ostromsky
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Z. Zlatev
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Lubin Vulkov Jerzy Waśniewski Plamen Yalamov

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ostromsky, T., Zlatev, Z. (1997). Using dense matrix computations in the solution of sparse problems. In: Vulkov, L., Waśniewski, J., Yalamov, P. (eds) Numerical Analysis and Its Applications. WNAA 1996. Lecture Notes in Computer Science, vol 1196. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62598-4_114

Download citation

  • DOI: https://doi.org/10.1007/3-540-62598-4_114

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62598-8

  • Online ISBN: 978-3-540-68326-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation