Skip to main content
SpringerLink
Log in

Direkte Verfahren zur Lösung Linearer Gleichungssysteme

  • Chapter
Numerische lineare Algebra

Part of the book series: Teubner Studienbücher Mathematik ((TSBMA))

  • 127 Accesses

Zusammenfassung

Das in Kapitel I theoretisch beschriebene Gaußsche Eliminationsverfahren stellt die Grundlage dar für die direkten numerischen Verfahren zur Lösung linearer Gleichungssysteme Ax=b, wobei A eine reelle nichtsinguläre n×n-Matrix ist und b∈ℝn.

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 49.99
Price excludes VAT (USA)
  • Available as 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Hinweise

  1. GEORGE, A.; LIU, J.W.: Computer solution of large sparse definite systems. Englewood Cliffs, Prentice-Hall 1981

    MATH  Google Scholar 

  2. CUTHILL, E.; MCKEE, J.: Reducing the bandwidth of sparse symmetric matrices. in: Proc. 24th ACM Nat. Conf., New York, ACM Publ. 1969, 157–172

    Chapter  Google Scholar 

  3. CUTHILL, E.: Several strategies for reducing the bandwidth of matrices. in [235] 157–166

    Google Scholar 

  4. GEORGE, A.: Computer implementation of the finite element method. Tech. Rept. STAN-CS-208, Stanford University 1971

    Google Scholar 

  5. LIU, W.H.; SHERMAN, A.H.: Comparative analysis of the Cuthill-McKee and the reverse Cuthill-McKee ordering algorithms for sparse matrices. SIAM J. Numer. Anal. 13(1976) 198–213

    Article  MathSciNet  MATH  Google Scholar 

  6. GIBBS, N.E.; POOLE, W.G.; STOCKMEYER, P.K.: A comparison of several bandwidth and profile reduction algorithms. Trans. on Math. Software 2(1976) 322–330

    Article  MATH  Google Scholar 

  7. GIBBS, N.E.; POOLE, W.G.; STOCKMEYER, P.K.: An algorithm for reducing the bandwidth and profile of a sparse matrix. SIAM J. Numer. Anal. 13(1976) 236–250

    Article  MathSciNet  MATH  Google Scholar 

  8. GEORGE, A.; LIU, J.W.: An implementation of a pseudo-peripheral node finder. Trans. on Math. Software 5(1979) 286–295

    Google Scholar 

  9. ROSE, D.J.: A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations. in: Read, R. (ed.): Graph theory and computing. New York, Academic Press 1973, 183–217

    Google Scholar 

  10. PARTER, S.V.: The use of linear graphs in Gauss elimination. SIAM Review 3(1961) 119–130

    Article  MathSciNet  MATH  Google Scholar 

  11. ROSE, D.J.; TARJAN, R.E.; LUEKER, G.S.: Algorithmic aspects of vertex elimination on graphs. SIAM J. Computing 5(1976) 266–283

    Article  MathSciNet  MATH  Google Scholar 

  12. TARTAN, E.T.: Graph theory and Gaussian elimination. in [40] 3–20

    Google Scholar 

  13. ROSE, D.J.; TARJAN, R.E.: Algorithmic aspects of vertex elimination on directed graphs. SIAM J. Appl. Math. 34(1978) 176–197

    Article  MathSciNet  MATH  Google Scholar 

  14. MARTIN, R.S.; WILKINSON, J.H.: Reduction of the symmetric eigenproblem Ax=ABx and related problems to standard form. Numer. Math. 11(1968) 99–110 (s. auch [316] 303–314)

    Google Scholar 

  15. JENNINGS, A.: A compact storage scheme for the solution of symmetric linear simultaneous equations. Comput. J. 9(1966) 281–285

    Article  MATH  Google Scholar 

  16. GUSTAVSON, F.G.: Some basic techniques for solving sparse systems of linear equations. in [235] 41–52

    Google Scholar 

  17. DUFF, I.S.; REID, J.K.: A comparison of sparsity orderings for obtaining a pivotal sequence in Gaussian elimination. J. Inst. Math. Appl. 14(1974) 281–291

    Article  MathSciNet  MATH  Google Scholar 

  18. REID, J.K.: Solution of linear systems of equations: Direct methods. in [11] 102–129

    Google Scholar 

  19. REID, J.K.: Sparse matrices. in [135] 85–146

    Google Scholar 

  20. DUFF, I.S.: A survey of sparse matrix research. Proc. IEEE 65(1977) 500–535

    Article  Google Scholar 

  21. DUFF, I.S.: Practical comparisons of codes for the solution of sparse linear systems. in [78] 107–134

    Google Scholar 

  22. DUFF, I.S.: Sparse matrices and their uses. New York & London, Academic Press 1981

    MATH  Google Scholar 

  23. DUFF, I.S.: Sparse matrix software for elliptic PDE’s. in [122] 410–426

    Google Scholar 

  24. DUFF, I.S.; REID, J.K.; MUNKSGAARD, N.; NIELSEN, H.B.: Direct solution of sets of linear equations whose matrix is sparse, symmetric and indefinite. J. Inst. Math. Appl. 23(1979) 235–250

    Article  MathSciNet  MATH  Google Scholar 

  25. MANN, K.J.: Inversion of large sparse matrices: Direct methods. in [190] 313–366

    Google Scholar 

  26. BJÖRCK, â.: Methods for sparse linear least squares problems. in [40] 177–199

    Google Scholar 

  27. DUFF, I.S.; REID, J.K.: A comparison of some methods for the solution of sparse overdetermined systems of linear equations. J. Inst. Math. Appl. 7(1976) 267–280

    Article  MathSciNet  Google Scholar 

  28. BJÖRCK, X.; DUFF, I.S.: A direct method for the solution of sparse linear least squares problems. Lin. Alg. Appl. 34(1980) 43–67

    Article  MATH  Google Scholar 

  29. GEORGE, A.; HEATH, M.T.: Solution of sparse linear least squares problems using Givens rotation. Lin. Alg. Appl. 34(1980) 69–83

    Article  MathSciNet  MATH  Google Scholar 

  30. REID, J.K. (ed.): Large sparse sets of linear equations. New York-London, Academic Press 1971

    Google Scholar 

  31. ROSE, D.J.; WILLOUGHBY, R.A. (eds.): Sparse matrices and their applications. New York, Plenum Press 1972

    Google Scholar 

  32. BUNCH, J.R.; ROSE, D.J. (eds.): Sparse matrix computations. New York-London, Academic Press 1976

    MATH  Google Scholar 

  33. BARKER, V.A. (ed.): Sparse matrix techniques. Berlin-Heidelberg-New York, Springer 1977

    MATH  Google Scholar 

  34. DUFF, I.S.; STEWART, G.W, (eds.): Sparse matrix proceedings 1978. Philadelphia, Society for Industrial and Applied Mathematics 1979

    MATH  Google Scholar 

  35. BJÖRCK, X.; PLEMMONS, R.J.; SCHNEIDER, H. (eds.): Large scale matrix problems. (Sonderdruck von Lin. Alg. Appl. 34(1980)). New York-Oxford, North Holland 1981

    MATH  Google Scholar 

  36. HINZE, J. (ed.): Numerical integration of differential equations and large linear systems. Berlin-Heidelberg-New York, Springer 1982

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universität Bielefeld, Deutschland

    Dr. math. Wolfgang Bunse & Dr. math. Angelika Bunse-Gerstner

Authors
  1. Dr. math. Wolfgang Bunse
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dr. math. Angelika Bunse-Gerstner
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1985 B. G. Teubner, Stuttgart

About this chapter

Cite this chapter

Bunse, W., Bunse-Gerstner, A. (1985). Direkte Verfahren zur Lösung Linearer Gleichungssysteme. In: Numerische lineare Algebra. Teubner Studienbücher Mathematik. Vieweg+Teubner Verlag, Wiesbaden. https://doi.org/10.1007/978-3-322-96645-2_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-322-96645-2_2

  • Publisher Name: Vieweg+Teubner Verlag, Wiesbaden

  • Print ISBN: 978-3-519-02067-7

  • Online ISBN: 978-3-322-96645-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation