Advantages and disadvantages of gaussian elimination
Answers
Answered by
4
Mathematical algorithms are usually not described in terms of pro and con. But let’s see if we can make sense of this question.
What do you use Gaussian Elimination for? Solving a linear system. How else could you solve a linear system?
You could compute the inverse and multiply with that. You can compute the inverse in (at least) two ways: with Gaussian elimination (more precisely: the Gauss-Jordan algorithm), or Kramer’s rule. The latter is very expensive and probably unstable. But if you already already have the LU factorization from Gaussian elimination, you might as well use that, rather than first compute the inverse, not?More interesting is that you can use an iterative method for solving the linear system. In that case GE has the pro of being guaranteed to work (up to roundoff), while iterative methods can fail, or use an unpredictable amount of time. GE has the disadvantage in the practical case of sparse matrices that it needs way more memory, and potentially more time.
You can also use the LU factorization to compute the determinant of a matrix. Doing it that way is much faster than by Kramer’s rule.
Hm. With the LU factorization of a band matrix I can compute a banded part of the inverse, cheaper and faster than computing the whole inverse and taking a banded part. So that’s a pro without a con.
What do you use Gaussian Elimination for? Solving a linear system. How else could you solve a linear system?
You could compute the inverse and multiply with that. You can compute the inverse in (at least) two ways: with Gaussian elimination (more precisely: the Gauss-Jordan algorithm), or Kramer’s rule. The latter is very expensive and probably unstable. But if you already already have the LU factorization from Gaussian elimination, you might as well use that, rather than first compute the inverse, not?More interesting is that you can use an iterative method for solving the linear system. In that case GE has the pro of being guaranteed to work (up to roundoff), while iterative methods can fail, or use an unpredictable amount of time. GE has the disadvantage in the practical case of sparse matrices that it needs way more memory, and potentially more time.
You can also use the LU factorization to compute the determinant of a matrix. Doing it that way is much faster than by Kramer’s rule.
Hm. With the LU factorization of a band matrix I can compute a banded part of the inverse, cheaper and faster than computing the whole inverse and taking a banded part. So that’s a pro without a con.
Answered by
14
Answer:
There are following advantages and disadvantages of Gaussian method :
Advantages of Gaussian elimination:
This method is completely fair and dependable.
It can solve more than 2 linear equations simultaneously.
Disadvantages of Gaussian elimination:
This method is very slow procedure because of this it takes time.
Similar questions
English,
7 months ago
Science,
7 months ago
Math,
7 months ago
Geography,
1 year ago
Social Sciences,
1 year ago