Zusammenfassung
In diesem Abschnitt werden direkte Methoden zur Lösung von linearen Gleichungssystemen
dargestellt. Hier ist A eine gegebene n × n-Matrix, b ∈ ℝ n ein gegebener Vektor. Wir nehmen zusätzlich an, daß A und b reell sind, obwohl diese Einschränkung bei den meisten Verfahren unwesentlich ist. Im Gegensatz zu den iterativen Methoden (Kapitel 8), liefern die hier besprochenen direkten Verfahren die Lösung in endlich vielen Schritten, rundungsfehlerfreie Rechnung vorausgesetzt.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Literatur zu Kapitel 4
Barker, V.A. (Ed.) (1977): Sparse matrix techniques. Lecture Notes in Mathematics 572. Berlin-Heidelberg-New York: Springer.
Bartels, R.H. (1971): A stabilization of the simplex method. Numer. Math. 16, 414–434.
Bauer, F.L. (1966): Genauigkeitsfragen bei der Lösung linearer Gleichungssysteme. ZAMM 46, 409–421.
Bixby, R.E. (1990): Implementing the simplex method: The initial basis. Techn. Rep. TR 90–32, Department of Mathematical Sciences, Rice University, Houston, Texas.
Björck, A. (1990): Least squares methods. In: Ciarlet, Lions, Eds. (1990), 465–647.
Businger, P., Golub, G.H. (1965): Linear least squares solutions by Householder transformations. Numer. Math. 7, 269–276.
Ciariet, P.G., Lions, J.L. (Ed.) (1990): Handbook of numerical analysis, Vol. 1. Finite difference methods (Part 1), Solution of equations in ℝ (Part 1). Amsterdam: North Holland.
Collatz, L. (1968): Funktionalanalysis und numerische Mathematik. Die Grundlehren der mathematischen Wissenschaften in Einzeldarstellungen, Bd. 120. Berlin-Heidelberg-New York: Springer.
Daniel, J.W., Gragg, W.B., Kaufmann, L., Stewart, G.W. (1976): Reorthogonali-zation and stable algorithms for updating the Gram-Schmidt QR factorization. Math. Comp. 30, 772–795.
Dantzig, G.B. (1963): Linear programming and extensions. Princeton, N.J.: Princeton University Press.
Dongarra, J.J., Bunch, J.R., Moler, C.B., Stewart, G.W. (1979): LINPACK users guide. Philadelphia: SIAM Publications.
Duff, I.S., Erisman, A.M., Reid, J.K (1986): Direct methods for sparse matrices. Oxford: Oxford University Press.
Duff, I.S., Reid, J.K. (1982): MA27: A set of FORTRAN subroutines for solving sparse symmetric sets of linear equations. Techn. Rep. AERE R 10533, Harwell, U.K.
Eisenstat, S.C., Gursky, M.C., Schultz, M.H., Sherman, A.H. (1982): The Yale sparse matrix package. I. The symmetric codes. Internat. J. Numer. Methods Engrg. 18, 1145–1151.
Forsythe, G.E., Moler, C.B. (1967): Computer solution of linear algebraic systems. Series in automatic computation. Englewood Cliffs, N.J.: Prentice-Hall.
Gass, S.T. (1969): Linear programming. 3d edition. New York: McGraw-Hill.
George, J. A., Liu, J.W. (1981): Computer solution of large sparse positive definite systems. Englewood Cliffs, N.J.: Prentice-Hall.
George, J. A., Liu, J.W. (1989): The evolution of the minimum degree ordering algorithm. SIAM Review 31, 1–19.
George, J. A., Liu, J.W., Ng, E.G. (1980): Users guide for SPARSEPACK: Waterloo sparse linear equations package. Tech. Rep. CS-78–30, Dept. of Computer Science, University of Waterloo, Waterloo.
Gill, P.E., Golub, G.H., Murray, W., Saunders, M.A. (1974): Methods for modifying matrix factorizations. Math. Comp. 28, 505–535.
Golub, G.H., van Loan, C.F. (1983): Matrix computations. Baltimore: The John Hopkins University Press.
Grossmann, W. (1969): Grundzüge der Ausgleichsrechnung. 3. Aufl. Berlin-Heidelberg-New York: Springer.
Guest, P.G. (1961): Numerical methods of curve fitting. Cambridge: University Press.
Hadley, G. (1962): Linear programming. Reading, MA: Addison-Wesley.
Householder, A.S. (1964): The theory of matrices in numerical analysis. New York: Blaisdell.
Lawson, C.L., Hanson, H.J. (1974): Solving least squares problems. Englewood Cliffs, N.J.: Prentice-Hall.
Murty, K.G. (1976): Linear and combinatorial programming. New York: Wiley.
Prager, W., Oettli, W. (1964): Compatibility of approximate solution of linear equations with given error bounds for coefficients and right hand sides. Num. Math. 6, 405–409.
Reid, J.K. (Ed) (1971): Large sparse sets of linear equations. London, New York: Academic Press.
Rose, D.J. (1972): A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations, pp. 183–217. In: Graph theory and computing, R.C. Read, ed., New York: Academic Press.
Rose, D. J. Willoughby, R. A. (Eds.) (1972): Sparse matrices and their applications. New York: Plenum Press.
Sautter, W. (1971): Dissertation TU München.
Schrijver, A. (1986): Theory of linear and integer programming. Wiley, Chichester.
Schwarz, H.R., Rutishauser, H., Stiefel, E. (1968).: Numerik symmetrischer Matrizen. Leitfäden der angewandten Mathematik, Bd. 11. Stuttgart: Teubner.
Seber, G.A.F. (1977): Linear regression analysis. New York: Wiley.
Stewart, G.W. (1973): Introduction to matrix computations. New York: Academic Press.
Tewarson, R.P. (1973): Sparse matrices. New York: Academic Press.
Wilkinson, J.H. (1965): The algebraic eigenvalue problem. Monographs on Numerical Analysis, Oxford: Clarendon Press.
Wilkinson, J.H., Reinsch, Ch. (1971): Linear algebra. Handbook for Automatic Computation, Vol. II. Grundlehren der mathematischen Wissenschaften in Einzeldarstellungen, Bd. 186. Berlin-Heidelberg-New York: Springer.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Stoer, J. (1994). Lineare Gleichungssysteme. In: Numerische Mathematik 1. Springer-Lehrbuch. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-09023-7_4
Download citation
DOI: https://doi.org/10.1007/978-3-662-09023-7_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57823-9
Online ISBN: 978-3-662-09023-7
eBook Packages: Springer Book Archive