Skip to main content

Algorithms for the Parallel Direct Solution of Sparse Linear Systems

  • Conference paper
DIANA Computational Mechanics ‘94
  • 319 Accesses

Abstract

The direct solution of a sparse system of a linear set of equations forms the most computation-intensive part in large-scale finite element analyses. A brief overview is given of some strategies which are well-suited for sequential and parallel processing. Experimental results for a number of typical FE models are presented to demonstrate the effectiveness of these (parallel) solution methods.

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 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. A. George, J.W. Liu, ‘Computer Solution of Large Sparse Positive Definite Systems’, Prentice Hall, 1981.

    Google Scholar 

  2. B. Speelpenning, ‘The generalized element method’, Report UIUCDCS-R-78–946, Department of Computer Science, University of Illinois.

    Google Scholar 

  3. N.E. Gibbs, N.G. Poole Jr and P.K. Stockmeyer, ‘An algorithm for reducing the bandwidth and profile of a sparse matrix’SIAM J. Numer. Anal. 13236–250 (1976).

    Article  MathSciNet  MATH  Google Scholar 

  4. N.E. Gibbs, ‘A hybrid profile reduction algorithm’ACM Trans. Math. Software 2378–387 (1976).

    Article  Google Scholar 

  5. H.X. Lin, ‘A Methodology for Parallel Direct Solution of Finite Systems’, PhD Thesis, Delft University of Technology, 1993.

    Google Scholar 

  6. Charbel Farhat, ‘Parallel Computational Strategies for Large Space and Aerospace Flexible Structures: Algorithms, Implementations and Performance.’ In Supercomputing in Engineering Structures, Computational Mechanics Publications, Springer Verlag, Berlin (1989)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer Science+Business Media Dordrecht

About this paper

Cite this paper

Nauta, P. (1994). Algorithms for the Parallel Direct Solution of Sparse Linear Systems. In: Kusters, G.M.A., Hendriks, M.A.N. (eds) DIANA Computational Mechanics ‘94. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-1046-4_29

Download citation

  • DOI: https://doi.org/10.1007/978-94-011-1046-4_29

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-010-4454-7

  • Online ISBN: 978-94-011-1046-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics