Difference: CodeOrderGaussianElimination (1 vs. 2)

Revision 22005-11-18 - MatthewChan

Line: 1 to 1
 This is for Gaussian Elimination. The algorithm should work for general matrix with arbitrary size M * N. Equivalently, we can just write LU decomposition for this.

  • First bullet
  • Second bullet
Changed:
<
<
>
>
 

Revision 12005-11-17 - MatthewChan

Line: 1 to 1
Added:
>
>		This is for Gaussian Elimination. The algorithm should work for general matrix with arbitrary size M * N. Equivalently, we can just write LU decomposition for this.

  • First bullet
  • Second bullet

View topic | History: r2 < r1 | More topic actions...
 
This site is powered by the TWiki collaboration platform Powered by PerlCopyright © 2008-2024 by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
Ideas, requests, problems regarding TWiki? Send feedback