Yatharth Malhotra

Hewlett-Packard Inc

Frontend Developer

June 25, 2026 – Present

Data-Structure-and-Algorithm

January 6, 2022 – January 6, 2022

java

gausian-elimination

October 1, 2020 – October 1, 2020

Use the code for Gaussian elimination discussed in class as a base to do the following. Create a separate program file for each part: a) Use the triangular form of the matrix after the elimination step to calculate the determinant of the matrix. [As a check confirm that you get the same answer as in question 1 for a matrix.] Notice how a simple transformation dramatically reduces the number of operations needed to compute the determinant. This is another aspect of programming that makes it both beautiful and fun. b) Using the triangular form of the matrix after the elimination step calculate the inverse of the matrix. You can use the code in part a) as a function. Create a .o file and a .h header file for the function that does elimination. Include the .h file in your code file for the inverse and then use the .o file when you generate the executable. c) Implement the following variation of Gaussian elimination called the Gauss-Jordan method. In the elimination step we zeroed out all e

github-slideshow

September 30, 2020 – September 30, 2020

A robot powered training repository :robot: