### Table 1 Numerical results for the Laplace equation

59

### Table VIII. Computation speed for Laplace equation.

### Table 1: Performance of Laplace Equation Solver (time in sec. for 10 iterations)

1994

"... In PAGE 8: ... Hence the pro- gram uses the correct le in the next iteration. The performance of the Laplace equation solver on the Intel Touchstone Delta is given in Table1 . We compare the performance of the three methods | direct le access, ex- plicit communication and explicit communication with data reuse.... ..."

Cited by 20

### Table 3. SMF model: Laplace equation solver and Cholesky Decomposition graphs

"... In PAGE 13: ... Table 2 shows results for the FCFS model of communication when the various graphs are input. Table3 shows results for the SMF model of communication. Table 2 and Table 3 show results for Laplace Equation solver graph and Cholesky De- composition graph inputs.... In PAGE 13: ... Table 3 shows results for the SMF model of communication. Table 2 and Table3 show results for Laplace Equation solver graph and Cholesky De- composition graph inputs. It can be seen from the tables that the larger the size of the input, the better is the performance improvement due to our algorithm.... ..."

### Table 3: The Effect of Estimation on Performance #28Laplace Equations#29

1990

Cited by 142

### Table 2: Performance of Laplace Equation Solver (time in sec. for 10 iterations)

1995

"... In PAGE 8: ...columns, within the processor blocks. The performance of the Jacobi program on the Intel Touchstone Delta is given in Table2 . We use the out- of-core communication method and compare the perfor- mance of the three implementations|direct le access, explicit communication and explicit communication with data reuse.... ..."

Cited by 60

### Table 1: Performance of Laplace Equation Solver (time in sec. for 10 iterations)

1994

Cited by 20

### Table 7: Example 5. Laplace equation on an unbounded domain (Figure 7).

2005

"... In PAGE 22: ... The solution is set to be 1 on the boundary and approaches 0 at infinity. The performance is shown in Table7 . Figure 7(b) shows the potential field on several slices of the domain.... ..."

Cited by 4

### Table 2. FCFS model: Laplace Equation solver and Cholesky Decomposition graphs

"... In PAGE 12: ... These graphs occur in various numerical analysis computa- tions #5B4#5D. The node sizes were varied from 50 to 400 nodes and the average values for the schedule lengths have been tabulated in Table2 and Table 3. The NAS benchmark test program shows improvement in the schedule lengths... ..."

### Table 3: Execution times of the Laplace equation solver application for all the scheduling algorithms on the Intel Paragon and IBM SP2.

2000

"... In PAGE 14: ... The four matrix sizes used are 8, 16, 32, and 64. The application execution times using various algorithms and data size are shown in Table3 . Again, using the DCP algorithm, more than 400% improvement over randsch is obtained.... ..."

Cited by 6