How to Solve a System Using Gaussian Elimination Without Backward Substitution?

[princejan7]

Homework Statement

I'm given a system of equations and I'm told to:
Solve this system by hand in 4-decimal digit arithmetic with rounding, using Gaussian elimination without
pivoting and backward substitution

Homework Equations

The Attempt at a Solution

When they say 'without backward substitution', what am I supposed to do instead?

 

[Mark44]

Homework Statement

I'm given a system of equations and I'm told to:
Solve this system by hand in 4-decimal digit arithmetic with rounding, using Gaussian elimination without
pivoting and backward substitution

Homework Equations

The Attempt at a Solution

When they say 'without backward substitution', what am I supposed to do instead?

I believe this means to completely reduce the matrix (reduced row-echelon form) so that the leading nonzero entry of each row is 1, and all entries above or below the 1 entry are 0.

In other words, it should look something like this:
$$\begin{bmatrix} 1 & 0 & ... & 0 & | & a \\ 0 & 1 & ... & 0 & | & b \\ . & . & ... & . &| . \\ 0 & 0 & ... & 1 & | & f \end{bmatrix}$$

 

[Ray Vickson]

Homework Statement

I'm given a system of equations and I'm told to:
Solve this system by hand in 4-decimal digit arithmetic with rounding, using Gaussian elimination without
pivoting and backward substitution

Homework Equations

The Attempt at a Solution

When they say 'without backward substitution', what am I supposed to do instead?

If you use Gaussian elimination you cannot avoid using back substitution. However, if you use Gauss-Jordan elimination you avoid back substitution.