Skip to main content
SpringerLink
Log in

Solution of linear systems of equations: Direct methods for finite element problems

  • Conference paper
  • First Online:
Sparse Matrix Techniques

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 572))

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

8. References

  1. A.V. Aho, J.E. Hopcroft and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass. (1974).

    MATH  Google Scholar 

  2. P.O. Araldsen, \s`The application of the superelement method in the analysis and design of ship structures and machinery components\s`, National Symposium of Computerized Structural Analysis and Design, George Washington University, March 1971.

    Google Scholar 

  3. I. Arany, W.F. Smyth and L. Szoda, \s`An improved method for reducing the bandwidth of sparse symmetric matrices\s`, in Information Processing 71: Proceedings of IFIP Congress, North-Holland, Amsterdam, 1972.

    Google Scholar 

  4. C. Berge, The Theory of Graphs and its Applications, John Wiley & Sons Inc., New York, 1962.

    MATH  Google Scholar 

  5. G. Birkhoff and Alan George, \s`Elimination by nested dissection\s`, in Complexity of Sequential and Parallel Numerical Algorithms, edited by J.F. Traub, Academic Press, New York and London (1973).

    Google Scholar 

  6. H.L. Crane, Jr., N.E. Gibbs, W.G. Poole, Jr., and P.K. Stockmeyer, \s`Matrix bandwidth and profile minimization\s`, Report No. 75-9, ICASE Report (1975).

    Google Scholar 

  7. E. Cuthill, \s`Several strategies for reducing the bandwidth of matrices\s`, in Sparse Matrices and Their Applications, D. Rose and R. Willoughby, eds., Plenum Press, New York (1972).

    Google Scholar 

  8. E. Cuthill and J. McKee, \s`Reducing the bandwidth of sparse symmetric matrices\s`, Proc. 24th Nat. Conf., Assoc. Comput. Mach., ACM Publ. P-69, 1122 Ave. of the Americas, New York, N.Y. (1969).

    Google Scholar 

  9. I.S. Duff, A.M. Erisman and J.K. Reid, \s`On George's nested dissection algorithm\s`, SIAM J. Numer. Anal., to appear.

    Google Scholar 

  10. G.C. Everstine, \s`The BANDIT computer program for the reduction of matrix bandwidth for NASTRAN\s`, NSRDC Report 3827 (1972).

    Google Scholar 

  11. Carlos A. Felippa, \s`Solution of linear equations with skyline-stored symmetric matrix\s`, Computers and Structures, 5 (1975), pp. 13–29.

    Article  MATH  Google Scholar 

  12. Alan George, \s`Computer implementation of the finite element method\s`, Stanford Computer Science Dept., Technical Report STAN-CS-71-208, Stanford, California (1971).

    Google Scholar 

  13. Alan George, \s`Nested dissection of a regular finite element mesh\s`, SIAM J. Numer. Anal., 10 (1973), pp.345–363.

    Article  MathSciNet  MATH  Google Scholar 

  14. Alan George, \s`On block elimination for sparse linear systems\s`, SIAM J. Numer. Anal., 11 (1974), pp.585–603.

    Article  MathSciNet  Google Scholar 

  15. Alan George, \s`Numerical experiments using dissection methods to solve n by n grid problems\s`, SIAM J. Numer. Anal., to appear.

    Google Scholar 

  16. Alan George and Joseph W.H. Liu, \s`A note on fill for sparse matrices\s`, SIAM J. Numer. Anal., 12 (1975), pp.452–455.

    Article  MathSciNet  MATH  Google Scholar 

  17. Alan George and Joseph W.H. Liu, \s`An automatic partitioning and solution scheme for solving large sparse positive definite systems of linear algebraic equations\s`, Research Report CS-75-17, Dept. of Computer Science, University of Waterloo, Waterloo, Ontario, Canada (1975).

    Google Scholar 

  18. Alan George, \s`Sparse matrix aspects of the finite element method\s`, Proc. 2nd International Symposium on Computing Methods in Applied Science and Engineering, Springer-Verlag (1976).

    Google Scholar 

  19. Alan George and Joseph W.H. Liu, \s`Algorithms for matrix partitioning and the numerical solution of finite element systems\s`, Report CS-76-30, Dept. of Computer Science, University of Waterloo, Waterloo, Ontario, Canada (1976).

    Google Scholar 

  20. Alan George and Joseph W.H. Liu, \s`An algorithm for automatic nested dissection and its application to general finite element problems\s`, Report CS-76-38, Dept. of Computer Science, University of Waterloo, Waterloo, Ontario, Canada (1976).

    Google Scholar 

  21. N.E. Gibbs, W.G. Poole and P.K. Stockmeyer, \s`An algorithm for reducing the bandwidth and profile of a sparse matrix\s`, SIAM J. Numer. Anal., 13 (1976), pp.236–250.

    Article  MathSciNet  MATH  Google Scholar 

  22. F.G. Gustavson, \s`Some basic techniques for solving sparse systems of equations\s`, Sparse Matrices and their Applications, D.J. Rose and R.A. Willoughby eds., Plenum Press, New York (1972).

    Google Scholar 

  23. A. Jennings, \s`A compact storage scheme for the solution of simultaneous equations\s`, Comput. J., 9 (1966), pp.281–285.

    Article  MATH  Google Scholar 

  24. Joseph W.H. Liu and Andrew H. Sherman, \s`Comparative analysis of the Cuthill-McKee and the reverse Cuthill-McKee ordering algorithms for sparse matrices\s`, SIAM J. Numer. Anal., 13 (1975), pp.198–213.

    Article  MathSciNet  MATH  Google Scholar 

  25. Joseph W.H. Liu, \s`On reducing the profile of sparse symmetric matrices\s`, Rept. CS-76-07, Dept. of Computer Science, University of Waterloo, Waterloo, Ontario, Canada (February 1976).

    Google Scholar 

  26. Christian Meyer, \s`Solution of linear equations — State-of-the-art\s`, J. of the Struct. Div., ASCE, Proc. Paper 9861 (July 1973), pp.1507–1527.

    Google Scholar 

  27. S.V. Parter, \s`The use of linear graphs in Gauss elimination\s`, SIAM Rev., 3 (1961), pp.364–369.

    Article  MathSciNet  MATH  Google Scholar 

  28. W.C. Rheinboldt and C.K. Mestztenyi, \s`Programs for the solution of large sparse matrix problems based on the arc-graph structure\s`, Technical Report TR-262 (1973), Computer Science Centre, University of Maryland.

    Google Scholar 

  29. Gilbert W. Strang and George J. Fix, An Analysis of the Finite Element Method, Prentice-Hall, Inc., Englewood Cliffs, N.J. (1973).

    MATH  Google Scholar 

  30. K.L. Stewart and J. Baty, \s`Dissection of structures\s`, J. Struct. Div., ASCE, Proc. paper No.4665 (1966), pp.75–88.

    Google Scholar 

  31. James H. Wilkinson, The Algebraic Eigenvalue Problem, Clarendon Press, Oxford (1965).

    MATH  Google Scholar 

  32. O.C. Zienkiewicz, The Finite Element Method in Engineering Science, McGraw-Hill, London (1970).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Applied Analysis and Computer Science, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada

    J. Alan George

Authors
  1. J. Alan George
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

V. A. Barker

Rights and permissions

Reprints and permissions

Copyright information

© 1977 Springer-Verlag

About this paper

Cite this paper

George, J.A. (1977). Solution of linear systems of equations: Direct methods for finite element problems. In: Barker, V.A. (eds) Sparse Matrix Techniques. Lecture Notes in Mathematics, vol 572. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0116615

Download citation

  • DOI: https://doi.org/10.1007/BFb0116615

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08130-2

  • Online ISBN: 978-3-540-37430-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation