Linear algebra is the study of linear sets of equations and their
transformation properties.
Linear algebra is central to almost all areas of mathematics.
A linear equation in the variables x₁, x₂, … , xn is an equation of the form
\[
a_1 x_1 + a_2 x_2 + \cdots + a_n x_n = b ,
\]
where b and the coefficients 𝑎1, 𝑎2, … , 𝑎n are given real or complex numbers. It is always assumed that not all coefficients are equal to zero. The subscript n can be any positive integer.
Observe that a linear equation does not involve products or roots of variable or any nonlinear function of these variables. All variables occur only to the first power and do not appear as their products.
A system of linear equations (or, more briefly, a linear system) is a collection of one or more linear equations involving the same variables---say x₁, x₂, … , xn. The variables are called unknowns. Sometimes, a system of linear equations is called a set of simultaneous equations; such terminology emphasizes that a solution is an assignment of values to each of the unknowns.
Let us start with a system of two linear equations with two unknowns, such as
To solve this system, one would take a combination of the two equations and eliminate one of the variables. We can multiply the first equation by 3 and subtract two times the first, giving us
So the solution of the given system is x = 2 and y = 1. Let us calculate how many arithmetic operations were needed to obtain this answer. Equation 19 y = 19 obtained with 7 arithmetic operations (6 multiplications and 1 subtraction). Division is required to get y = 1. Then we substitute this value for y into the first equation (with 1 multiplication). Finally division by 2 gives us the value of x. So totally, we made 10 arithmetic operations (called flops).
However, we can save 3 multiplications on expense of 1 division if we multiply the first row by 3/2 (a computer does not afraid of using rational numbers). This yields 8 flops (arithmetic operations) to solve the given linear system.
Do you know another option to solve this system of linear equations? Most likely you were taught that substitution will work. Indeed, expressing x from the first equation (with 3 arithmetic operations: 1 subtraction and 2 divisions), we obtain
\[
x = \frac{7}{2} - \frac{3}{2}\,y .
\]
Next we substitute this expression into the second equation (it requires 2 multiplications)
\[
3 \cdot \left(\frac{7}{2} - \frac{3}{2}\,y \right) - 5\, y = 1 \qquad \iff \qquad \frac{21}{2} - \frac{9}{2}\, y - 5\, y = 1 .
\]
Two arithmetic operations are required for simplification and one division provides the answer for y. Substituting back into expression for x and performing 2 arithmetic operation, we finally obtain the solution. Therefore, substitution procedure requires 9 arithmetic operations.
Another option to find the solution is to plot each equation and determine the intersection (if any). Maple helps
Since every linear equation in two unknowns x and y
\[
a\,x + b\,y = c ,
\]
where 𝑎 b and c are given constants, defines a straight line on the plane, we can visualize a system of linear equations
\[
\begin{cases}
a_1 x + b_1 y &= c_1 , \\ a_2 x + b_2 y &= c_2 , \end{cases}
\]
by plotting these two lines. Besides a unique solution as in the previous example, two lines can be parallel (no solution) or coincide (infinite many solutions). The following two equations illustrate these two situations.
\[
\begin{cases}
3\, x -2\, y &= 1 , \\ 3\, x -2\, y &= 2 , \end{cases} \qquad \begin{cases}
3\, x -2\, y &= 1 , \\ 6\, x -4\, y &= 2 . \end{cases}
\]
A linear equation in the variables x₁, x₂, … , xn is an equation of the form
\[
a_1 x_1 + a_2 x_2 + \cdots + a_n x_n = b ,
\]
where b and the coefficients 𝑎1, 𝑎2, … , 𝑎n are given real or complex numbers. It is always assumed that not all coefficients are equal to zero. The subscript n can be any positive integer.
Observe that a linear equation does not involve products or roots of variable or any nonlinear function of these variables. All variables occur only to the first power and do not appear as their products.
Example 2:
We can mix, under controlled
conditions, toluene C7H8 and nitric acid HNO3 to produce trinitrotoluene
C7H5O6N3 along with the byproduct water (conditions have to be very well
controlled — trinitrotoluene is better known as TNT). In what proportion should
we mix them? The number of atoms of each element present before the reaction
\[
x\,C_7 H_8 + y\,HNO_3 \,\to\, z C_7 H_5 O_6 N_3 + w\,H_2 O
\]
must equal the number present afterward. Applying that in turn to the elements
C, H, N, and O gives this system:
\[
\begin{split}
7x &= 7z ,
\\
8x + y &= 5z + 2w ,
\\
y &= 3z,
\\
3y &= 6z+ w .
\end{split}
\]
Example 3:
Let us solve the linear system
\[
\begin{split}
x + 3\,y &= 4,
\\
3\,x + 9\, y &= 12 .
\end{split}
\]
We can eliminate x from the second equation by adding −3 times the first equation to the second equation. This yields the simplified system
As the second equation imposes no restrictions on x and y, the solutions of the given system are those values of x and y that satisfy the single equation
\[
x + 3\,y = 4 \qquad \Longrightarrow \qquad x = 4 - 3\,y .
\]
End of Example 2
In general, we claim that a linear system of two equations with two unknowns either has a unique solution, or no solution, or infinitely many solutions.
Now we turn our attention to three linear equations in three unknowns:
\[
\begin{split}
a_1 x + b_1 y + c_1 z &= d_1 , \\ a_2 x + b_2 y + c_2 z &= d_2 , \\ a_3 x + b_3 y + c_3 z &= d_3 ,
\end{split}
\]
in which the graphs of the equations are planes. The solutions of the given system, if any, correspond to the points where all three planes intersect. So we plot eight possible cases.
Next figure shows that there is no solution. If we substitute z = 0 (from the first equation) into two other equations, we see that they have no common intersection.
Next figure shows that there are infinitely many solutions. If we substitute z = 0 (from the first equation) into two other equations, we see that they are equivalent.
Next figure shows that there are infinitely many solutions. If we substitute z = 0 (from the first equation) into two other equations, we see that they are equivalent.
We will develop a systematic way to do this for any number of equations with arbitrary number of unknowns (often denoted as x1, x2, x3, …) through the use of matrices and vectors.
A system of linear equations in the variables x1, x2, x3, …, xn is a finite set of m linear equations of
the form
A solution to the system of equations above is an ordered n-tuple of numbers s1, s2, s3, …, sn
that is a solution to each of the equations in the system. The set of all possible solutions is
called the solution set of the system (1).
The double subscripting on the coefficients 𝑎i,j of the given coefficients gives their location in the system---the first subscript indicates the equation in which the coefficient occurs, and the second indicates which unknown it multiplies. Foe example, 𝑎2,3 is the second equation and multiplies x3.
A system of linear equations (1) is called consistent if it has at least one solution, and it said to be inconsistent if it has no solution.
A special and important class of systems of linear equations that always have at least one
solution is the class of homogeneous equations. These are systems where every bi = 0, i = 1, 2, … , m. One
solution to such a system will always be when each variable is 0. This means for a system
of two or three variables, the graph of each equation in a homogeneous system passes
through the origin.
A system of linear equations (1) is called homogeneous (with accent on "ge") if all terms in right side of Eq.(1) are zeroes,
bi = 0, i = 1, 2, … , m. A system (1) is known as inhomogeneous or nonhomogeneous if at least one entry bi ≠ 0.
Matrix Notation
The essential information of a linear system of m equations in n unknowns can be recorded compactly in a standard rectangular array called a matrix.
For a given linear system (1), the matrix A = (𝑎ij), whose (i, j) entry is the coefficient 𝑎ij of the system (1) is called the coefficient matrix:
A matrix A whose elements are the coefficients 𝑎ij of a set of simultaneous linear equations (1) to which the column-vector b of right-hand side constant terms of Eq.(1) is appended, is called the augmented matrix. We denote the augmented matrix as
When write an augmented matrix, we will usually drop the vertical line separating the coefficient matrix from the input vector b.
The first known use of augmented matrices appeared between 200 B.C. and 100 B.C. in a Chinese manuscript entitled Nine Chapters of Mathematical Art. In this work, the coefficients were arranged in columns rather than in rows, as today in the majority of engineering, mathematical, and physical printings. However, the systems were successfully solved by performing operations on the columns. The actual use of the term augmented matrix appears to have been introduced by the American mathematician Maxime Bôcher (1867--1918) in his book Introduction to Higher Algebra, published in 1907. In addition to being an outstanding research mathematician and an expert in Latin, chemistry, philosophy, zoology, geography, meteorology, art, and music, Maxime Bôcher was an excellent expositor of mathematics whose elementary textbooks were greatly appreciated students and are still in demand today.
In the study of heat transfer, it is important to determine the steady-state temperature distribution of a thin plate when the temperature around the boundary is known (usually from an experiment or other measurement). Let us consider the plate shown in Figure below representing a cross section of a metal beam, with negligible heat flow in the direction perpendicular to the plate. Let t₁, t₂, t₃, t₄ denote the temperatures at the four interior nodes of the mesh in Figure. The temperature at a particular node is approximately equal to the average of the four nearest nodes---to the left, above, to the right, and below.
Write a system of four equations whose solution gives estimates for the temperatures t₁, t₂, t₃, t₄.
Cubic spline interpolation provides a polynomial approximation that has smaller error than some other interpolating polynomials such as Lagrange polynomial and Newton polynomial. Suppose you need to interpolate a function f on some interval [x₁, x₂] given its values at end points f₁ = f(x₁) and f₂ = f(x₂). If you know the values of derivatives at these end points g₁ = f'(x₁) and g₂ = f'(x₂), find a system of linear equations for coefficients of cubic polynomial p(x) = 𝑎 x³ + bx² + cx + d so that this polynomial matches the values of f at end points f₁, f₂ and the values of its derivatives at end points g₁, g₂.
Write a system of four equations for four unknowns 𝑎, b, c, and d.
Suppose you are given a parabola y = 𝑎 x² + bx + c that passes through the points (x₁, y₁), (x₂, y₂), and (x₃, y₃). Determine an augmented matrix for the corresponding system of linear equations in unknowns 𝑎, b, and c.
Suppose that you want to find values for 𝑎, b, and c such that the parabola y = 𝑎 x² + bx + c passes through the points (1, 2), (2, 5), and (−2, 3). Find (but do not solve) a system of linear equations whose solutions provide values for 𝑎, b, and c.
In each part of the problem, find a linear system in the unknowns x₁, x₂, x₃, …, that corresponds to the given augmented matrix.