Cramer's rule
(mathematics) The method of solving a system of linear equations by means of determinants.
|
Results for Cramer's rule
|
On this page:
|
(mathematics) The method of solving a system of linear equations by means of determinants.
Cramer's rule is a theorem in linear algebra, which gives the solution of a system of linear equations in terms of determinants. It is named after Gabriel Cramer (1704 - 1752).
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.
The system of equations is represented in matrix multiplication form as:

where the square matrix A is invertible and the vector x is the column vector of the variables: (xi).
The theorem then states that:
|
|
![]() |
where Ai is the matrix formed by replacing the ith column of A by the column vector c. For simplicity, sometimes a single symbol like Δ is used to represent det(A) and the notation Δi is used to represent det(Ai). Thus, Equation (1) can be compactly written as

Let R be a commutative ring, A an n×n matrix with coefficients in R. Then

where Adj(A) denotes the adjugate of A, det(A) is the determinant, and I is the identity matrix.
A good way to use Cramer's rule on a 2×2 matrix is to use this formula:
Given
and
, which in matrix format is
x and y can be found with Cramer's rule as:
The rules for 3×3 are similar. Given
,
and
, which in matrix format is
x, y and z can be found like so:
, Failed to parse (unknown function\color): y = \frac { \begin{vmatrix} a & {\color{red}j} & c \\ d & {\color{red}k} & f \\ g & {\color{red}l} & i \end{vmatrix} } { \begin{vmatrix} a & b & c \\ d & e & f \\ g & h & i \end{vmatrix} } , and Failed to parse (unknown function\color): z = \frac { \begin{vmatrix} a & b & {\color{red}j} \\ d & e & {\color{red}k} \\ g & h & {\color{red}l} \end{vmatrix} } { \begin{vmatrix} a & b & c \\ d & e & f \\ g & h & i \end{vmatrix} }
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 ∂x / ∂u 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 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 entry is from Wikipedia, the leading user-contributed encyclopedia. It may not have been reviewed by professional editors (see full disclaimer)
Some good "Cramer's rule" pages on the web:
Math mathworld.wolfram.com |
Join the WikiAnswers Q&A community. Post a question or answer questions about "Cramer's rule" at WikiAnswers.
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 GNU Free Documentation License. It uses material from the Wikipedia article "Cramer's rule". Read more |
Mentioned In: