### Table 2 Results of SPARK3 on the convection-diffusion equations (34).

2000

"... In PAGE 17: ... We have taken the absolute and relative error tolerances for each component equal to the same error tolerance TOL. We give some statistics obtained with the code SPARK3 on this problem in Table2 . Since this problem is linear, approximately only one Newton iteration per timestep was taken.... ..."

Cited by 1

### Table 1: The number of iterations of the parallel domain decomposition algorithm required to solve a typical three-dimensional convection-diffusion problem in [12].

"... In PAGE 5: ... Furthermore, it is applied to a class of convection- diffusion equations in three dimensions that is not covered by the underlying theory in [3]. Nevertheless, it proves to be surprisingly robust, as illustrated by the iteration counts shown in Table1 that are typical of the results in [12]. Furthermore, very creditable parallel performances are recorded, including parallel speed-ups in excess of 12 when using locally refined ... In PAGE 5: ...Table 1: The number of iterations of the parallel domain decomposition algorithm required to solve a typical three-dimensional convection-diffusion problem in [12]. The iteration counts shown in Table1 illustrate that the number of iterations of the parallel solver that are required to obtain a converged solution is essentially independent of the level of the finest mesh and the number of subdomains used. Hence, provided the sequential solver used on each processor (at step 4 of the algorithm in Figure 4) has a computational cost of O(N), the total cost of the parallel algorithm will also be approximately proportional to N.... ..."

### Table 11: CFD Convection Diffusion Problem Implemented on NCUBE2

"... In PAGE 10: ... Therefore they appear to be the right compromise class of method for highly parallel architectures. This is demon- strated n the results in Table11 which show the considrably faster performance of a multigrid algorithm.28 These results also demonstrate the fallacy to measure the performance of a parallel machine by MFLOPS alone, when co~paring different algorithms.... ..."

### Table 5.1 Comparison of BILUTM and ILUT for solving the convection-diffusion problem with different Re.

1999

Cited by 39

### Table 5.2 Comparison of high accuracy BILUTM and ILUT for solving the convection-diffusion problem with different Re.

1999

Cited by 39

### Table 5.1 Comparison of BILUTM and ILUT for solving the convection-diffusion problem with different Re.

1999

Cited by 39

### Table 5.2 Comparison of high accuracy BILUTM and ILUT for solving the convection-diffusion problem with different Re.

1999

Cited by 39

### TABLE 4.3 Pre-eigenvalues,targets and computed eigenvaluesfor the convection-diffusion problem.

1999

Cited by 3

### TABLE 4.3 Pre-eigenvalues, targets and computed eigenvalues for the convection-diffusion problem.

1999

Cited by 3

### Table 4.3 Pre-eigenvalues, targets, and computed eigenvalues for the convection-diffusion problem.

1999

Cited by 3