Jump to content

Coefficient matrix

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Citation bot (talk | contribs) at 18:36, 12 December 2020 (Alter: url. URLs might have been internationalized/anonymized. Add: isbn. Upgrade ISBN10 to ISBN13. | You can use this bot yourself. Report bugs here. | Suggested by Abductive | Category:Linear algebra‎ | via #UCB_Category 276/306). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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

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

where are the unknowns and the numbers are the coefficients of the system. The coefficient matrix is the m × n matrix with the coefficient as the (i, j)th entry:[1]

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

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

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 nr free parameters; hence in such a case there are an infinitude of solutions, which can be found by imposing arbitrary values on nr 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

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

where A is n × n and y and c are n × 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

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

References

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