
related topics 
{math, number, function} 
{work, book, publish} 
{@card@, make, design} 
{area, part, region} 

In linear algebra, Gaussian elimination is an algorithm for solving systems of linear equations, finding the rank of a matrix, and calculating the inverse of an invertible square matrix. The method is named after Carl Friedrich Gauss but it was not invented by him.
Elementary row operations are used to reduce a matrix to row echelon form. Gauss–Jordan elimination, an extension of this algorithm, reduces the matrix further to reduced row echelon form. Gaussian elimination alone is sufficient for many applications, and is cheaper than the Jordan version.
Contents
History
The method of Gaussian elimination appears in Chapter Eight, Rectangular Arrays, of the important Chinese mathematical text Jiuzhang suanshu or The Nine Chapters on the Mathematical Art. Its use is illustrated in eighteen problems, with two to five equations. The first reference to the book by this title is dated to 179 CE, but parts of it were written as early as approximately 150 BCE.^{[1]} It was commented on by Liu Hui in the 3rd century.
The method in Europe stems from the notes of Isaac Newton.^{[2]} In 1670, he wrote that all the algebra books known to him lacked a lesson for solving simultaneous equations, which Newton then supplied. Cambridge University eventually published the notes as Arithmetica Universalis in 1707 long after Newton left academic life. The notes were widely imitated, which made (what is now called) Gaussian elimination a standard lesson in algebra textbooks by the end of the 18th century. Carl Friedrich Gauss in 1810 devised a notation for symmetric elimination that was adopted in the 19th century by professional hand computers to solve the normal equations of leastsquares problems. The algorithm that is taught in high school was named for Gauss only in the 1950s as a result of confusion over the history of the subject.
Full article ▸


related documents 
Cardinal number 
Kernel (algebra) 
Huffman coding 
Numerical analysis 
Denotational semantics 
Sequence alignment 
Lua (programming language) 
Complete lattice 
Hash function 
Infinity 
Interval (mathematics) 
Absolute value 
Entropy (information theory) 
Stone–Čech compactification 
Simplex 
RSA 
Logic programming 
Proofs of Fermat's little theorem 
Ruby (programming language) 
Series (mathematics) 
Newton's method 
Integration by parts 
Compass and straightedge constructions 
Functor 
Direct sum of modules 
Boolean satisfiability problem 
Frame problem 
Riemann zeta function 
Factorial 
List of trigonometric identities 
