(mathematics) The method of solving a system of linear equations by means of determinants.
| Sci-Tech Dictionary: Cramer's rule |
(mathematics) The method of solving a system of linear equations by means of determinants.
| 5min Related Video: Cramer's rule |
| Wikipedia: Cramer's rule |
Cramer's rule is a theorem in linear algebra, which gives an expression for the solution of a system of linear equations with as many equations as unknowns, valid in those cases where there is unique solution; this solution is then expressed in terms of the determinants of the (square) coefficient matrix and of matrices obtained from it by replacing one column by the vector of right hand sides of the equations. It is named after Gabriel Cramer (1704–1752), who published the rule in his 1750 Introduction à l'analyse des lignes courbes algébriques, although Colin Maclaurin also published the method in his 1748 Treatise of Geometry (and probably knew of the method as early as 1729).[1]
Computationally, it is inefficient for large matrices and thus not used in practical applications which may involve many equations. However, as no pivoting is needed, it is more efficient than Gaussian elimination for small matrices, particularly when SIMD operations are used.
Cramer's rule is of theoretical importance in that it gives an explicit expression for the solution of the system.
| Wikibooks has a book on the topic of |
Consider the linear system


which in matrix format is

Then, x and y can be found with Cramer's rule as:

and

The rules for 3×3 are similar. Given:



which in matrix format is

x, y and z can be found as follows:

Consider a system of linear equations represented in matrix multiplication form as
|
|
![]() |
where the square matrix A is invertible and the vector
is the column vector of the variables.
Then the theorem states that:

where Ai is the matrix formed by replacing the ith column of A by the column vector b.
This formula is, however, of limited practical value for larger matrices, as there are other more efficient ways of solving systems of linear equations, such as by Gauss elimination or, even better, LU decomposition.
Let A be an n×n matrix. Then

where Adj(A) denotes the adjugate matrix of A, det(A) is the determinant, and I is the identity matrix. If det(A) is invertible in R, then the inverse matrix of A is

If R is a field (such as the field of real numbers), then this gives a formula for the inverse of A, provided det(A) ≠ 0. The formula is, however, of limited practical value for large matrices, as there are other more efficient ways of generating the inverse matrix, such as by Gauss–Jordan elimination.
The rule holds for systems of equations with coefficients and unknowns in any field, not just in the real numbers.
Cramer's rule is also extremely useful for solving problems in differential geometry. Consider the two equations
and
. When u and v are independent variables, we can define
and 
Finding an equation for
is a trivial application of Cramer's rule.
First, calculate the first derivatives of F, G, x, and y:




Substituting dx, dy into dF and dG, we have:


Since u, v are both independent, the coefficients of du, dv must be zero. So we can write out equations for the coefficients:




Now, by Cramer's rule, we see that:

This is now a formula in terms of two Jacobians:

Similar formulae can be derived for
,
, 
Cramer's rule can be used to prove the Cayley–Hamilton theorem of linear algebra, as well as Nakayama's lemma, which is fundamental in commutative ring theory.
Cramer's rule can be used to formulate the characteristic equation in eigenvalue problems. An eigenvector x is often expressed as

This can be viewed as a linear system of equations in which the coefficient matrix is the expression in the parentheses, the matrix of the unknowns is x, and the right hand side matrix is zero. According to Cramer's rule, solutions to x are expressed as a quotient. The numerator will always be zero, since here
(see Eq. 1). Hence to find the non-trivial solutions (not all zeros), the denominator must also equal zero; that is, the determinant of the coefficient matrix must be zero. Then the solutions of the equation are given by:

which is the familiar characteristic equation
Cramer's rule can be used to prove that an integer programming problem whose constraint matrix is totally unimodular and whose right-hand side is all integer has integer basic solutions. This makes the integer program substantially easier to solve.
| This article needs additional citations for verification. Please help improve this article by adding reliable references. Unsourced material may be challenged and removed. (August 2008) |
This entry is from Wikipedia, the leading user-contributed encyclopedia. It may not have been reviewed by professional editors (see full disclaimer)
| Best of the Web: Cramer's rule |
Some good "Cramer's rule" pages on the web:
Math mathworld.wolfram.com |
| Year 1750 (in Science & Technology) | |
| Year 1748 (in Science & Technology) | |
| Gabriel Cramer |
| How is Cramers Rule used in life? | |
| What are some examples of Cramer's rule when its applied to dependent or inconsistent systems? | |
| C program for exponential curve fitting using cramer's rule? |
Copyrights:
![]() | Sci-Tech Dictionary. McGraw-Hill Dictionary of Scientific and Technical Terms. Copyright © 2003, 1994, 1989, 1984, 1978, 1976, 1974 by McGraw-Hill Companies, Inc. All rights reserved. Read more | |
![]() | Wikipedia. This article is licensed under the Creative Commons Attribution/Share-Alike License. It uses material from the Wikipedia article "Cramer's rule". Read more |
Mentioned in