Coefficient matrix

In linear algebra, a coefficient matrix is a matrix consisting of the coefficients of the variables in a set of linear equations. The matrix is used in solving systems of linear equations.

Coefficient matrix edit

In general, a system with $m$ linear equations and $n$ unknowns can be written as

{\begin{aligned}a_{11}x_{1}+a_{12}x_{2}+\cdots +a_{1n}x_{n}&=b_{1}\\a_{21}x_{1}+a_{22}x_{2}+\cdots +a_{2n}x_{n}&=b_{2}\\&\;\;\vdots \\a_{m1}x_{1}+a_{m2}x_{2}+\cdots +a_{mn}x_{n}&=b_{m}\end{aligned}}

where $x_{1},x_{2},\ldots ,x_{n}$ are the unknowns and the numbers $a_{11},a_{12},\ldots ,a_{mn}$ are the coefficients of the system. The coefficient matrix is the $m \times n$ matrix with the coefficient $a ij$ as the $(i, j)$ th entry:^[1]

{\begin{bmatrix}a_{11}&a_{12}&\cdots &a_{1n}\\a_{21}&a_{22}&\cdots &a_{2n}\\\vdots &\vdots &\ddots &\vdots \\a_{m1}&a_{m2}&\cdots &a_{mn}\end{bmatrix}}

Then the above set of equations can be expressed more succinctly as

A\mathbf {x} =\mathbf {b}

where $A$ is the coefficient matrix and $b$ is the column vector of constant terms.

Relation of its properties to properties of the equation system edit

By the Rouché–Capelli theorem, the system of equations is inconsistent, meaning it has no solutions, if the rank of the augmented matrix (the coefficient matrix augmented with an additional column consisting of the vector $b$ ) is greater than the rank of the coefficient matrix. If, on the other hand, the ranks of these two matrices are equal, the system must have at least one solution. The solution is unique if and only if the rank $r$ equals the number $n$ of variables. Otherwise the general solution has $n - r$ free parameters; hence in such a case there are an infinitude of solutions, which can be found by imposing arbitrary values on $n - r$ of the variables and solving the resulting system for its unique solution; different choices of which variables to fix, and different fixed values of them, give different system solutions.

Dynamic equations edit

A first-order matrix difference equation with constant term can be written as

\mathbf {y} _{t+1}=A\mathbf {y} _{t}+\mathbf {c} ,

where $A$ is $n \times n$ and $y$ and $c$ are $n \times 1$ . This system converges to its steady-state level of $y$ if and only if the absolute values of all $n$ eigenvalues of $A$ are less than 1.

A first-order matrix differential equation with constant term can be written as

{\frac {d\mathbf {y} }{dt}}=A\mathbf {y} (t)+\mathbf {c} .

This system is stable if and only if all $n$ eigenvalues of $A$ have negative real parts.

References edit

^ Liebler, Robert A. (December 2002). Basic Matrix Algebra with Algorithms and Applications. CRC Press. pp. 7–8. ISBN 9781584883333. Retrieved 13 May 2016.

[Liebler-1] Liebler, Robert A. (December 2002). Basic Matrix Algebra with Algorithms and Applications. CRC Press. pp. 7–8. ISBN 9781584883333. Retrieved 13 May 2016.

[1]