Skip to main content

Parallel Linear Algebra

  • Chapter
  • First Online:
Introduction to HPC with MPI for Data Science

Part of the book series: Undergraduate Topics in Computer Science ((UTICS))

  • 5179 Accesses

Abstract

The field of algorithms covering implementations is very rich and versatile. In computer science, we ubiquitously use computational linear algebra in algorithms, often by using a dedicated software library that hides the tedious nitty-gritty details of the optimized implementations of the fundamental algorithms (mainly matrix arithmetic operations and factorization primitives).

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 49.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

Notes

  1. 1.

    Freely available online at http://www.scilab.org/.

  2. 2.

    A matrix is said symmetric positive definite if and only if: \(\forall x\not =0, x^\top M x>0\). Positive definite matrices have all positive eigenvalues.

  3. 3.

    By terminology, the precision matrix is the inverse of the covariance matrix.

  4. 4.

    A matrix is Toeplitz if all its diagonals are constant.

  5. 5.

    http://www.netlib.org/blas/.

  6. 6.

    http://www.boost.org/doc/libs/1_57_0/libs/numeric/ublas/doc/.

  7. 7.

    http://www.netlib.org/scalapack/.

References

  1. Golub, G.H., Van Loan, C.F.: Matrix Computations. Johns Hopkins University Press, Baltimore (1996)

    MATH  Google Scholar 

  2. Le, F.-G.: Powers of tensors and fast matrix multiplication. arXiv preprint arXiv:1401.7714 (2014)

  3. Elliot, L.C.: A cellular computer to implement the Kalman filter algorithm. Ph.D. thesis, Montana State University, Bozeman (1969) AAI7010025

    Google Scholar 

  4. Fox, G.C., Otto, S.W., Hey, A.J.G.: Matrix algorithms on a hypercube I: Matrix multiplication. Parallel Comput. 4(1), 17–31 (1987)

    Article  MATH  Google Scholar 

  5. Calvin, L., Lawrence, S.: A matrix product algorithm and its comparative performance on hypercubes. In: Proceedings of the Scalable High Performance Computing Conference, SHPCC-92, IEEE, pp. 190–194 (1992)

    Google Scholar 

  6. Casanova, H., Legrand, A., Robert, Y.: Parallel Algorithms. Chapman & Hall/CRC Numerical Analysis and Scientific Computing. CRC Press, Boca Raton (2009)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Frank Nielsen .

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Nielsen, F. (2016). Parallel Linear Algebra. In: Introduction to HPC with MPI for Data Science. Undergraduate Topics in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-319-21903-5_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-21903-5_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-21902-8

  • Online ISBN: 978-3-319-21903-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics