2. Direct methods
The first conceivable method for solving the above linear system is Gauss's method of elimination (or its variants, such as Crout's method or Cholesky's method, etc.).), whose complexity, i.e. the number of arithmetic operations, is of the order of ; if A is a symmetrical matrix, the number of arithmetic operations reduces to ; however, as we have seen, in the case of...
You do not have access to this resource.
Exclusive to subscribers. 97% yet to be discovered!
Already subscribed?
Log in!
Ongoing reading
Direct methods