Skip to main content
SpringerLink
Log in
Book cover

Parallelism in Matrix Computations pp 79–89Cite as

General Linear Systems

  • Chapter
  • First Online:

  • 2790 Accesses

Part of the book series: Scientific Computation ((SCIENTCOMP))

Abstract

One of the most fundamental problems in matrix computations is solving linear systems of the form.

This is a preview of subscription content, 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   89.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   119.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover 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

Learn about institutional subscriptions

References

  1. Golub, G., Van Loan, C.: Matrix Computations, 4th edn. Johns Hopkins (2013)

    Google Scholar 

  2. Stewart, G.: Matrix Algorithms. Vol. I. Basic Decompositions. SIAM, Philadelphia (1998)

    Google Scholar 

  3. Grcar, J.: John Von Neumann’s analysis of Gaussian elimination and the origins of modern numerical analysis. SIAM Rev. 53(4), 607–682 (2011). doi:10.1137/080734716. http://dx.doi.org/10.1137/080734716

    Google Scholar 

  4. Stewart, G.: The decompositional approach in matrix computations. IEEE Comput. Sci. Eng. Mag. 50–59 (2000)

    Google Scholar 

  5. von Neumann, J., Goldstine, H.: Numerical inverting of matrices of high order. Bull. Am. Math. Soc. 53, 1021–1099 (1947)

    Article  MATH  Google Scholar 

  6. Householder, A.S.: The Theory of Matrices in Numerical Analysis. Dover Publications, New York (1964)

    MATH  Google Scholar 

  7. Skillicorn, D.: Understanding Complex Datasets: Data Mining using Matrix Decompositions. Chapman Hall/CRC Press, Boca Raton (2007)

    Book  Google Scholar 

  8. Dongarra, J., Kurzak, J., Luszczek, P., Tomov, S.: Dense linear algebra on accelerated multicore hardware. In: Berry, M., et al. (eds.) High-Performance Scientific Computing: Algorithms and Applications, pp. 123–146. Springer, New York (2012)

    Chapter  Google Scholar 

  9. Luszczek, P., Kurzak, J., Dongarra, J.: Looking back at dense linear algebrasoftware. J. Parallel Distrib. Comput. 74(7), 2548–2560 (2014). DOI http://dx.doi.org/10.1016/j.jpdc.2013.10.005

    Google Scholar 

  10. Igual, F.D., Chan, E., Quintana-Ortí, E.S., Quintana-Ortí, G., van de Geijn, R.A., Zee, F.G.V.: The FLAME approach: from dense linear algebra algorithms to high-performance multi-accelerator implementations. J. Parallel Distrib. Comput. 72, 1134–1143 (2012)

    Article  Google Scholar 

  11. Demmel, J., Grigori, L., Hoemmen, M., Langou, J.: Communication-optimal parallel and sequential QR and LU factorizations. SIAM J. Sci. Comput. 34(1), 206–239 (2012). doi:10.1137/080731992

    Google Scholar 

  12. Grigori, L., Demmel, J., Xiang, H.: CALU: a communication optimal LU factorization algorithm. SIAM J. Matrix Anal. Appl. 32(4), 1317–1350 (2011). doi:10.1137/100788926. http://dx.doi.org/10.1137/100788926

    Google Scholar 

  13. Irony, D., Toledo, S., Tiskin, A.: Communication lower bounds for distributed-memory matrix multiplication. J. Parallel Distrib. Comput. 64(9), 1017–1026 (2004). doi:10.1016/j.jpdc.2004.03.021. http://dx.doi.org/10.1016/j.jpdc.2004.03.021

    Google Scholar 

  14. Ballard, G., Carson, E., Demmel, J., Hoemmen, M., Knight, N., Schwartz, O.: Communication lower bounds and optimal algorithms for numerical linear algebra. Acta Numerica 23, 1–155 (2014)

    Article  MathSciNet  Google Scholar 

  15. Sameh, A.: Numerical parallel algorithms—a survey. In: Kuck, D., Lawrie, D., Sameh, A. (eds.) High Speed Computer and Algorithm Optimization, pp. 207–228. Academic Press, New York (1977)

    Google Scholar 

  16. Stern, J.: A fast Gaussian elimination scheme and automated roundoff error analysis on S.I.M.E. machines. Ph.D. thesis, University of Illinois (1979)

    Google Scholar 

  17. Sorensen, D.: Analysis of pairwise pivoting in Gaussian elemination. IEEE Trans. Comput. C-34(3), 274–278 (1985)

    Google Scholar 

  18. Quintana-Ortí, E.S., van de Geijn, R.A.: Updating an LU factorization with pivoting. ACM Trans. Math. Softw. (TOMS) 35(2), 11 (2008)

    Google Scholar 

  19. Dongarra, J., Duff, I., Sorensen, D., van der Vorst, H.: Numerical Linear Algebra for High-Performance Computers. SIAM, Philadelphia (1998)

    Book  MATH  Google Scholar 

  20. Stewart, G.: Modifying pivot elements in Gaussian elimination. Math. Comput. 28(126), 537–542 (1974)

    Google Scholar 

  21. Moler, C.: MATLAB incorporates LAPACK. Mathworks Newsletter (2000). http://www.mathworks.com/company/newsletters/articles/matlab-incorporates-lapack.html

  22. Gallivan, K., Jalby, W., Meier, U.: The use of BLAS3 in linear algebra on a parallel processor with a hierarchical memory. SIAM J. Sci. Statist. Comput. 8(6), 1079–1084 (1987)

    Article  MATH  Google Scholar 

  23. Gallivan, K., Jalby, W., Meier, U., Sameh, A.: The impact of hierarchical memory systems on linear algebra algorithm design. Int. J. Supercomput. Appl. 2(1) (1988)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Engineering and Informatics Department, University of Patras, Patras, Greece

    Efstratios Gallopoulos

  2. Campus de Beaulieu, INRIA/IRISA, Rennes Cedex, France

    Bernard Philippe

  3. Department of Computer Science, Purdue University, West Lafayette, IN, USA

    Ahmed H. Sameh

Authors
  1. Efstratios Gallopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bernard Philippe
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ahmed H. Sameh
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Efstratios Gallopoulos .

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Gallopoulos, E., Philippe, B., Sameh, A.H. (2016). General Linear Systems. In: Parallelism in Matrix Computations. Scientific Computation. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-7188-7_4

Download citation

  • DOI: https://doi.org/10.1007/978-94-017-7188-7_4

  • Published:

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-017-7187-0

  • Online ISBN: 978-94-017-7188-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation