Math 2.0

definition

Coefficient matrix

Definition

Let FF be a field. Take a system of linear equations over FF with mm equations in nn unknowns, where equation ii is ai1x1+⋯+ainxn=bia_{i1} x_1 + \cdots + a_{in} x_n = b_i. The coefficient matrix of the system is the m×nm \times n matrix A=(aij)A = (a_{ij}). Its entry in row ii and column jj is the coefficient of xjx_j in equation ii.

Remarks

The system 2x+y=52x + y = 5, x−3y=0x - 3y = 0 has the coefficient matrix (211−3)\begin{pmatrix} 2 & 1 \\ 1 & -3 \end{pmatrix}. With x=(x1,…,xn)Tx = (x_1, \dots, x_n)^T and b=(b1,…,bm)Tb = (b_1, \dots, b_m)^T, the system is Ax=bAx = b. If AA is square and invertible, the system has exactly one solution, x=A−1bx = A^{-1} b.

Explanations

L1 human

The coefficient matrix keeps only the numbers in front of the unknowns, in a rectangular table. Each row is one equation, and each column is one unknown. This table lets us work with the whole system as one object.

What this node needs for W1
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What this needs

To read this node, read these 4 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Linear equation definition
  2. Matrix definition
  3. System of linear equations definition
  4. Coefficient matrix definition

What depends on this

2 nodes use this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Coefficient_matrix, lead section