Abstract
This paper aims to introduce some prevalent techniques which have been used to solve linear systems. Firstly, we introduce the simplest method: how to eliminate variables in which the original systems would not be changed. We then introduce Gaussian eliminations, which work on the augmented matrix derived from a linear system. To the end, we present Cramer’s rule, which computes the solution to a linear system based on matrix determinants. These methods have their application scenarios. For instance, eliminating variables has no limited condition for its operations. However, Cramer’s rule needs to be under the condition of square matrices. At the same time, Gaussian elimination requires three elementary row operations, and Gaussian elimination paves the way for computing the rank of matrices. The choice between these methods depends on coefficient matrices in terms of dimensions and matrix properties such as singularity.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.