Gaussian elimination
to transform it to echelon form. The method is to divide the first row by a11 and then subtract suitable multiples of the first row from the subsequent rows, to obtain a matrix of the form
(If a11 = 0, it is necessary to interchange two rows first.) The first row now remains untouched, and the process is repeated with the remaining rows, dividing the second row by 
to produce a 1 and subtracting suitable multiples of the new second row from the subsequent rows to produce zeros below that 1. The method continues in the same way. The essential point is that the corresponding set of equations at any stage has the same solution set as the original. (See also Gauss-Jordan elimination, simultaneous linear equations.)
- geodesic
- geodesic polar coordinates
- geometric distribution
- geometric mean
- geometric multiplicity
- geometric sequence
- geometric series
- geometric topology
- geometry
- Germain, (Marie) Sophie
- Germain prime, Sophie
- Gershgorin's Theorem
- Gibbs' inequality
- Gibbs, (Josiah) Willard
- giga‐
- Girard's theorem
- given
- glb
- glide reflection
- global maximum
- Goldbach, Christian
- Goldbach's conjecture
- golden ratio
- goodness‐of‐fit test
- googol