Gauss Row Operations: Solving by Hand?

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.
 
Mathematics 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.
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top