<span> Function values can be positive or negative, and they can </span>increase or decrease<span> as the input </span>increases.<span> Well positive means that the value of the function is greater than zero.</span>
To see the steps to the diagonal form see the step-by-step explanation. The solution to the system is , , and
Step-by-step explanation:
Gauss elimination method consists in reducing the matrix to a upper triangular one by using three different types of row operations (this is why the method is also called row reduction method). The three elementary row operations are:
Swapping two rows
Multiplying a row by a nonzero number
Adding a multiple of one row to another row
To solve the system using the Gauss elimination method we need to write the augmented matrix of the system. For the given system, this matrix is:
For this matrix we need to perform the following row operations:
(multiply 1 row by 1 and subtract it from 2 row)
(multiply 1 row by 1 and add it to 3 row)
(multiply 1 row by 1 and subtract it from 4 row)
(interchange the 2 and 3 rows)
(divide the 2 row by 2)
(multiply 2 row by 1 and subtract it from 1 row)
(multiply 2 row by 1 and subtract it from 4 row)
(multiply the 3 row by -1)
(multiply 3 row by 1 and subtract it from 2 row)
(multiply 3 row by 3 and add it to 4 row)
(divide the 4 row by 4.5)
After this step, the system has an upper triangular form
The triangular matrix looks like:
If you later perform the following operations you can find the solution to the system.
(multiply 4 row by 0.5 and add it to 1 row)
(multiply 4 row by 0.5 and add it to 2 row)
(multiply 4 row by 2 and subtract it from 3 row)
After this operations, the matrix should look like: