, Large tridiagonal and block tridiagonal linear systems on vector and parallel computers, Parallel Comput., 5 (1987), pp. 45--54. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Templates for the Solution of Linear Systems.. - Barrett, Berry.. (1993) (358 citations) (Correct)
....the parallelism in incomplete factorizations are based on a renumbering of the problem variables. For instance, on rectangular domains one could start numbering the variables from all four corners simultaneously, thereby creating four fold parallelism (see Dongarra, et al. 68] Van der Vorst [197, 199]) The most extreme case is the red black ordering (or for more general matrices the multi color ordering) which gives the absolute minimum number of sequential steps. Multi coloring is also an attractive method for vector computers. Since points of one color are uncoupled, they can be processed ....
, Large tridiagonal and block tridiagonal linear systems on vector and parallel computers, Parallel Comput., 5 (1987), pp. 45--54.
Templates for the Solution of Linear Systems.. - Barrett, Berry.. (1994) (358 citations) Self-citation (Linear) (Correct)
....are based on a renumbering of the problem variables. For instance, on rectangular domains one could start numbering the variables from all four corners simultaneously, thereby creating four simultaneous wavefronts, and therefore four fold parallelism (see Dongarra, et al. 71] Van der Vorst [202, 204]) The most extreme case is the red black ordering (or for more general matrices the multi color ordering) which gives the absolute minimum number of sequential steps. Multi coloring is also an attractive method for vector computers. Since points of one color are uncoupled, they can be processed ....
, Large tridiagonal and block tridiagonal linear systems on vector and parallel computers, Parallel Comput., 5 (1987), pp. 45--54.
ParIC: A Family of Parallel Incomplete Cholesky Preconditioners - Made, van der Vorst (2000) Self-citation (Van der vorst) (Correct)
....process, we will say that P s is pseudo overlapped by P r . The rate of convergence of a parallel IC(0) executed under the conditions as described above, will degrade as the number of subdomains increases (p 2 for stripes type partitionings [3, 15] and p 4 for more general partitionings [8, 23, 24]; see also [11, 12, 19] In order to explain why this occurs, we make, in Fig. 3, a zoom of an interface between two adjacent subdomains. We use a stencil graph notation [13] a diagonal entry a i;i is represented by circle number i; the edge fi; jg (here horizontal and vertical lines) ....
H.A. van der Vorst: Large tridiagonal and block tridiagonal linear systems on vector and parallel computers. Parallel Comput. 5, (1987) 54--54.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC