Skip to main content
SpringerLink
Log in

Efficient Parallel Algorithms for Dense Cholesky Factorization

  • Conference paper
  • First Online:
Book cover Parallel Computation (ACPC 1999)

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

  • 421 Accesses

Abstract

Dense Cholesky factorization arises in area such as linear programming, boundary element methods and radiosity computations. In this paper we focus on designing efficient parallel algorithms for Cholesky factorization.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. D. Culler, R. Karp, D. Patterson, A. Sahay, E. Santos, K. Schauser, R. Subramonian and T. von Eicken. A Practical Model of Parallel Machine. Communications of ACM. November, 1996.

    Google Scholar 

  2. J.W. Demmel, et al. Parallel Numerical Linear Algebra. ACTA Numerica, 1992.

    Google Scholar 

  3. J.M. Ortega. Intro to Parallel and Vector solutions of Linear System. Plenum Press, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Lehigh University, Bethlehem, PA, 18015, USA

    Eunice E. Santos & Pei-Yue Pauline Chu

Authors
  1. Eunice E. Santos
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pei-Yue Pauline Chu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Forschungsinstitut für Softwaretechnologie, Hellbrunnerstr. 34, A-5020, Salzburg, Austria

    Peter Zinterhof

  2. Slovac Academy of Sciences, Institute of Mathematics, Laboratory for Informatics, Dubravska 9, P.O.Box 56, 840 00, Bratislava, Slovakia

    Marian Vajteršic

  3. Universität Salzburg, RIST++, Hellbrunnerstr. 34, A-5020, Salzburg, Austria

    Andreas Uhl

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Santos, E.E., Chu, PY.P. (1999). Efficient Parallel Algorithms for Dense Cholesky Factorization. In: Zinterhof, P., Vajteršic, M., Uhl, A. (eds) Parallel Computation. ACPC 1999. Lecture Notes in Computer Science, vol 1557. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49164-3_69

Download citation

  • DOI: https://doi.org/10.1007/3-540-49164-3_69

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-49164-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation