Gaussian elimination is indeed used in computer software to solve systems of linear equations, often with pivoting for improved numerical stability. However, it is not the only method available, and alternative techniques may be more effective in specific scenarios. For instance, methods like conjugate gradients are advantageous for sparse matrices, while matrix decomposition approaches are beneficial for solving Ax = b with multiple b values. LU decomposition, which is derived from Gaussian elimination, is one of several matrix decomposition methods utilized in these solutions. Other methods, such as Cholesky, LDLT, QR, and SVD, also play significant roles in solving linear equations.