Abstract
A derivation of the total number of multiplications (NOM) required for evaluating a determinant is presented. Four popular numerical methods for solving number of linear equations simultaneously are: (i) Using Cramer’s rule, (ii) Matrix inversion method (iii) Gaussian Elimination method and (iv) Gauss-Jordan Elimination method. We introduce one more method. For all the five methods, relations for the total NOM are derived and compared. It is found that Gaussian Elimination method requires the least NOM. Eliminating a variable in Gaussian Elimination is similar to eliminating a loop in electrical circuit. This is illustrated with an example using source transformation and Thevenin equivalent circuits. However, electrical circuits have certain limitations; therefore, all equations cannot be handled.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
