Abstract
In this chapter direct methods for solving systems of linear equations
will be presented. Here A is a given n × n matrix, and b is a given vector. We assume in addition that A and b are real, although this restriction is inessential in most of the methods. In contrast to the iterative methods (Chapter 8), the direct methods discussed here produce the solution in finitely many steps, assuming computations without roundoff errors.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References for Chapter 4
Barker, V. A. (Ed.): Sparse Matrix Techniques. Lecture Notes in Mathematics 572. Berlin, Heidelberg, New York: Springer-Verlag (1977).
Bartels, R. H.: A stabilization of the simplex method. Numer. Math. 16, 414–434 (1971).
Bauer, F. L.: Genauigkeitsfragen bei der Lösung linearer Gleichungssysteme. ZAMM 46, 409–421 (1966).
Björck, A.: Least squares methods. In: Ciarlet, Lions, Eds. (1990), 465–647 (1990).
Blum, E., Oettli, W.: Mathematische Optimierung. Berlin, Heidelberg, New York: Springer (1975).
Ciarlet, P. G., Lions, J. L. (Eds): Handbook of Numerical Analysis, Vol. 1. Finite Difference Methods (Part 1), Solution of Equations in l“ (Part 1). Amsterdam: North Holland (1990).
Collatz, L.: Functional Analysis and Numerical Mathematics. New York: Academic Press (1966).
Daniel, J. W., Gragg, W. B., Kaufmann, L., Stewart, G. W.: Reorthogonalization and stable algorithms for updating the Gram-Schmidt QR factorization. Math. Comp. 30, 772–795 (1976).
Dantzig, G. B.: Linear Programming and Extensions. Princeton, N.J.: Princeton University Press (1963).
Dongarra, J. J., Bunch, J. R., Moler, C. B., Stewart, G. W.: UNPACK Users Guide. Philadelphia: SIAM Publications (1979).
Duff, I. S., Erisman, A. M., Reid, J. K.: Direct Methods for Sparse Matrices. Oxford: Oxford University Press (1986).
Duff, I. S., Erisman, A. M., Reid, J. K, Reid, J. K.: MA27: A set of FORTRAN subroutines for solving sparse symmetri sets of linear equations. Techn. Rep. AERE R 10533, Harwell, U.K. (1982).
Eisenstat, S. C., Gursky, M. C., Schultz, M. H., Sherman, A. H.: The Yale sparse matrix package I. The symmetric codes. Internat. J. Numer. Methods Engrg. 18, 1145–1151 (1982).
Forsythe, G. E., Moler, C. B.: Computer Solution of Linear Algebraic Systems. Series in Automatic Computation. Englewood Cliffs, N.J.: Prentice-Hall (1967).
Gass, S. T.: Linear Programming. 3d edition. New York: McGraw-Hill (1969).
George, J. A., Liu, J. W.: Computer Solution of Large Sparse Positive Definite Systems. Englewood Cliffs, N.J.: Prentice-Hall (1981).
George, J. A., Liu, J. W.: The evolution of the minimum degree ordering algorithm. SIAM Review 31, 1–19 (1989).
George, J. A., Liu, J. W.:, Ng, E. G.: Users guide for SPARSEPAK: Waterloo sparse linear equa-tions package. Tech. Rep. CS-78–30, Dept. of Computer Science, University of Waterloo, Waterloo (1980).
Gill, P. E., Golub, G. H., Murray, W., Saunders, M. A.: Methods for modifying matrix factorizations. Math. Comp. 28, 505–535 (1974).
Golub, G. H., van Loan, C. F.: Matrix Computations. Baltimore: The John Hopkins University Press (1983).
Grossmann, W.: Grundzüge der Ausgleichsrechnung. 3. Aufl. Berlin, Heidelberg, New York: Springer (1969).
Guest, P. G.: Numerical Methods of Curve Fitting. Cambridge: University Press (1961).
Hadley, G.: Linear Programming. Reading, MA: Addison-Wesley (1962). Householder, A. S.: The Theory of Matrices in Numerical Analysis. New York: Blaisdell (1964).
Lawson, C. L., Hanson, H. J.: Solving Least Squares Problems. Englewood Cliffs, N.J.: Prentice-Hall (1974).
Murty, K. G.: Linear and Combinatorial Programming. New York: Wiley (1976).
Prager, W., Oettli, W.: Compatibility of approximate solution of linear equations with given error bounds for coefficients and right hand sides. Num. Math. 6, 405–409 (1964).
Reid, J. K. (Ed): Large Sparse Sets of Linear Equations. London, New York: Academic Press (1971).
Rose, D. J.: 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 (1972).
Rose, D. J., Willoughby, R. A. (Eds.): Sparse Matrices and Their Applications. New York: Plenum Press (1972).
Sautter, W.: Dissertation TU München (1971).
Schwarz, H. R., Rutishauser, H., Stiefel, E.: Numerik symmetrischer Matrizen. Leitfäden der angewandten Mathematik, Bd. 11. Stuttgart: Teubner 1968.
Seber, G. A. F.: Linear Regression Analysis. New York: Wiley (1977).
Stewart, G. W.: Introduction to Matrix Computations. New York: Academic Press (1973).
Tewarson, R. P.: Sparse Matrices. New York: Academic Press (1973).
Wilkinson, J. H.: The Algebraic Eigenvalue Problem. Monographs on Numerical Analysis, Oxford: Clarendon Press (1965).
Wilkinson, J. H., Reinsch, Ch.: Linear Algebra. Handbook for Automatic Computation, Vol. II. Grundlehren der mathematischen Wissenschaften in Einzeldarstellungen, Bd. 186. Berlin, Heidelberg, New York: Springer (1971).
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer Science+Business Media New York
About this chapter
Cite this chapter
Stoer, J., Bulirsch, R. (1993). Systems of Linear Equations. In: Introduction to Numerical Analysis. Texts in Applied Mathematics, vol 12. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-2272-7_4
Download citation
DOI: https://doi.org/10.1007/978-1-4757-2272-7_4
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4757-2274-1
Online ISBN: 978-1-4757-2272-7
eBook Packages: Springer Book Archive