Skip to main content

Direct Sparse Equation Solvers

  • Chapter
  • First Online:
Finite Element Methods
  • 68 Accesses

Abstract

A detailed explanation (including examples) of sparse storage schemes for storing large sparse (stiffness) matrix, sparse symbolic factorization, sparse numerical factorization, sparse forward and backward solvers, different reordering algorithms (to minimize nonzero fills-in terms occurred during the symbolic factorization phase), super-nodes and unrolling strategies to improve computational efficiencies of Cholesky (and unsymmetrical) solvers, and alternative approach for handling indefinite system of linear equations are all presented in this chapter.

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

Access this chapter

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
Hardcover Book
USD 119.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

Institutional subscriptions

References

  1. D. T. Nguyen, Parallel-Vector Equation Solvers for Finite Element Engineering Applications, Kluwer/Plenum Publishers (2002)

    Book  Google Scholar 

  2. SGI sparse solver library sub-routine, Scientific Computing Software Library (SCSL) User’s Guide, document number 007-4325-001, published Dec. 30, 2003

    Google Scholar 

  3. I. S. Duff and J. K. Reid, “MA47, a FORTRAN Code for Direct Solution of Indefinite Sparse Symmetric Linear Systems,” RAL (Report) #95-001, Rutherford Appleton Laboratory, Oxon, OX11 OQX (Jan 1995)

    Google Scholar 

  4. G. Karypis and V. Kumar, “ParMETiS: Parallel Graph Partitioning and Sparse Matrix Ordering Library,” University of Minnesota, CS Dept., Version 2.0 (1998)

    Google Scholar 

  5. D. T. Nguyen, G. Hou, B. Han, and H. Runesha, “Alternative Approach for Solving Indefinite Symmetrical System of Equation,” Advances in Engineering Software, Vol. 31 (2000), pp. 581–584, Elsevier Science Ltd.

    Google Scholar 

  6. G. H. Golub and C. F. VanLoan, “Matrix Computations,” Johns Hopkins University Press, Baltimore, MD, 2nd edition (1989)

    Google Scholar 

  7. A. George and J. W. Liu, Computer Solution of Large Sparse Positive Definite Systems, Prentice-Hall (1981)

    Google Scholar 

  8. H. B. Runesha and D. T. Nguyen, “Vectorized Sparse Unsymmetrical Equation Solver for Computational Mechanics,” Advances in Engr. Software, volume 31, nos. 8–9, pp. 563–570 (Aug.–Sept. 2000), Elsevier

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Nguyen, D.T. (2024). Direct Sparse Equation Solvers. In: Finite Element Methods. Springer, Cham. https://doi.org/10.1007/978-3-031-48788-0_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-48788-0_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-48787-3

  • Online ISBN: 978-3-031-48788-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics