### Table 4.1 Sparsification preliminaries for the incomplete LU decomposition.

### Table 5.8: Exection Times for Software Implemetations of LU decomposition

2007

### Table 5.10: DSP power analysis for LU decomposition

2007

### Table 4.10: Number of flops and running time of LU decomposition. Processors Memory size Mflop of LU Time for LU

1997

### Table 1 Time (in s) of LU decomposition on p processors using a static pivot search strategy.

"... In PAGE 4: ... This experiment allows us to examine the e ect of choosing a di erent data structure, without regard to other improvements. Table1 shows the time needed for parallel LU decomposition on a square mesh of p transputers. A comparison with the results for the PARPACK-LU algorithm [9] shows that the new algorithm is superior.... ..."

### Table 1: Predicted and measured time (in s) of parallel LU decomposition Predicted Measured n

1997

"... In PAGE 10: ... The theoretical timing formula (9) and the measured machine characteris- tics p; s; g, and l can be used to predict the total execution time and its three components. Table1 compares predicted and measured execution times. The table displays reasonable agreement for small n, but signi cant discrepancy for larger n.... ..."

Cited by 10

### Table 1: Predicted and measured time (in s) of parallel LU decomposition Predicted Measured n

1997

"... In PAGE 10: ... The theoretical timing formula (9) and the measured machine characteris- tics p; s; g, and l can be used to predict the total execution time and its three components. Table1 compares predicted and measured execution times. The table displays reasonable agreement for small n, but signi cant discrepancy for larger n.... ..."

Cited by 10

### Table 6: Pre-Analysis by Model : LU Decomposition N 1024 2048 3072 4096 5120 6144 7168

1994

Cited by 1

### Table 10: Post-Analysis by Modela : LU Decomposition N 1024 2048 3072 4096 5120 6144 7168

1994

Cited by 1