### Table 1: Compilation schema for a bottom-up bidirectional strategy

2001

Cited by 2

### Table 1: Compilation schema for a bottom-up bidirectional strategy

### Table 5. Bidirectional Relations

"... In PAGE 10: ... Once the hierarchies and their features have been identified a table to reflect bidirectional relations may be elaborated by means of assigning names with an uniform criteria. An example is shown in Table5 . Shades rows are self-evident relations between concepts shown in the Concepts Classifier Tree (see Fig.... ..."

### Table 14: Bidirectional Dictionary

1990

Cited by 22

### Table 1 Computational complexity ( ~ W-values) of a space-time multigrid V-cycle, F-cycle, and W-cycle, and of the full multigrid V-cycle algorithm, as a function of the spatial dimension d and the semi- coarsening strategy.

1993

"... In PAGE 6: ... can be derived from Table 8.3.1 and Table 8.3.2 in [17], and are presented in Table1 .... ..."

Cited by 14

### Table 11: Number of iterations of the multigrid method with di erent orderings of the grid points for solving Test 3.

"... In PAGE 22: ... The convergence histories analogous to the cases showing in Figure 3 are depicted in Figure 4. Further, the results in Table11 show that, with quot;?1 = 100, the multigrid method does not converge with any of the ordering strategies tested. This is surprising, since test results with a slightly di erent governing convection-di usion equation show convergence of the multigrid method with at least the natural rowwise ordering when quot;?1 = 100, although divergence is observed for larger values of quot;?1 [40].... ..."

### Table 3: Cost comparison for V and W-cycles using Full and J-Coarsened Multigrid.

"... In PAGE 12: ...nd all modes are rapidly damped as in Fig. 6a. The interaction of the preconditioner and multigrid algo- rithm is critical, since the preconditioner is chie y responsible for damping the convective modes and the coarsening strategy is essential to damping the acoustic modes. Cost bounds for full and J-coarsened cycles are presented in Table3 , where N is the cost of a single ow evaluation on the ne mesh. The cost of J- coarsened multigrid is independent of the number of dimensions since coarsening is performed in only one direction.... ..."

### Table 8: Number of iterations of the multigrid method with di erent orderings of the grid points for solving Test 2.

"... In PAGE 19: ... In addition to the ordering strategies used for Test 1, we add the FDPI ordering. Experimental data are listed in Table 7 for the point Gauss-Seidel, in Table8 for multigrid, and in Table 9 for GMRES/ILU(1). Table 7 shows that the performance of the point Gauss-Seidel method improves with... In PAGE 20: ... quot;?1 natural red-black four-color(a) four-color(b) FDPI 10 1552 1550 1548 1547 1532 50 711 707 703 703 665 100 368 364 361 361 327 200 190 187 183 184 159 500 176 163 161 158 135 1000 384 370 368 365 346 However, the good performance of the underlying relaxation method (point Gauss- Seidel in the current case) with the FDPI ordering does not necessarily carry over to the multigrid method. In Table8 , the multigrid method with FDPI ordering does not converge except in the di usion dominated case with quot;?1 = 10. All the other coloring strategies are shown to be better than the natural rowwise ordering with the multigrid method.... ..."

### Table 1. Qualitative comparison of the tree management strategies

2004

"... In PAGE 8: ... Assuming a proxim- ity-based assignment (clustering) of receivers to SRs, the latter approach caters for lower stretch (and stress) compared to the single SR. Table1 summarizes how each approach performs against the specified metrics. The bidirectional arrows in the PJIT row state that performance is strongly dependent on the number of pre-built/look-... ..."

Cited by 2