This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: LU Decomposition (m_ludet): order of n 3 I approximated number of operations of LU algorithm to =+n k k n k n 1 2 ] ) 1 ( ) 1 [( which I further simplified into (n 3 +n 2 +n) n 3 . When I checked with my data, the best formula I got to calculate time needed was (n 3 /100000) milliseconds. Factors governing the speeds of functions: 1. Number of floating point operations involved. 2. Memory operations: In every iteration in recursive function, new matrix is being created and freed, these operations take time. We dont have this in LU. 3. Memory Accessibility: In recursive function, we have to store the matrix itself and also the minors. Once the Cache is full, accessing data from other memory locations is more time taking. In LU algorithm, we only have one matrix which for reasonable n, can fit in the Cache. Name: Kranthi Kode...
View
Full
Document
This note was uploaded on 06/17/2010 for the course CME 211 taught by Professor Staff during the Winter '10 term at Stanford.
 Winter '10
 Staff

Click to edit the document details