Gauss Row Operations: Solving by Hand?

  • Context: Undergrad 
  • Thread starter Thread starter THE 1
  • Start date Start date
  • Tags Tags
    Gauss Operations Row
Click For Summary
SUMMARY

This discussion focuses on solving systems of linear equations using Gauss Row Operations by hand. The preferred algorithm involves dividing the first row by the pivot element, then eliminating entries below the pivot by subtracting scaled versions of the first row from subsequent rows. The process is repeated for each column, ensuring that if a pivot is zero, rows must be swapped to continue. The discussion concludes that if a pivot and all entries below it are zero, the matrix cannot be transformed into upper triangular form.

PREREQUISITES
  • Understanding of Gauss Elimination Method
  • Familiarity with matrix operations
  • Knowledge of pivot elements in linear algebra
  • Basic arithmetic skills for manual calculations
NEXT STEPS
  • Study the Gauss-Jordan elimination technique for further insights
  • Learn about matrix rank and its implications on solvability
  • Explore computational tools for matrix operations, such as MATLAB or NumPy
  • Investigate the concept of linear independence and its relation to pivot positions
USEFUL FOR

Students of linear algebra, educators teaching matrix operations, and anyone interested in manual methods for solving systems of equations.

THE 1
Messages
20
Reaction score
0
I am just interested is there anyway to solve these through a specific method by hand. I know that you can produce an algorithm so that you can solve these into upper triangle form but is there a way to do it by hand other than by inspection.
 
Physics news on Phys.org
I've always done them "by hand" (I learned all this in the years "B.C."- Before Calculators!). The 'algorithm' I preferred was : Divide the first row by whatever number was in "first row, first column"(the "pivot"). Now look at each succeeding row. You can get a 0 there by "multiply that new first row by the number in first column, nth row and subtract from the nth row". Once you've done that your first column has a 1 at the "pivot" and 0's below. Now move on to the second column. Divide the second row by whatever number is in the "pivot" (second column second row). For every succeeding row (you can ignore the first row and first column) multiply the second row by the number in "second column nth row" and subtract that from the nth row. Once you done that the second column has a 1 in the "pivot" and 0s below. Work your way across the columns that way.

Of course, if, at any time, the "pivot" is 0 so that you CAN'T divide the row by it, you will need to swap that row with a lower row. If, at any time, a "pivot" and all numbers below it in that column are 0, you are DONE. You CAN'T get that matrix is "upper triangular" form.
 

Similar threads

  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 6 ·
Replies
6
Views
4K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 12 ·
Replies
12
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
Replies
16
Views
2K