Parallel Processing for Scientific ComputingMakoto Natori, Takashi Nodera |
From inside the book
Results 1-2 of 2
Page 61
... incompatible vertices , on the other hand , are associated to parallel computations . They are , in fact , starting points for parallel ILU factorizations . Their results indicated that quite a few orderings exist , whose convergence ...
... incompatible vertices , on the other hand , are associated to parallel computations . They are , in fact , starting points for parallel ILU factorizations . Their results indicated that quite a few orderings exist , whose convergence ...
Page 62
... ( Incompatible vertex ) A vertex is called incompatible , if it has the O / O elementary graph . A verter , which has ... vertices . Definition 4 ( Partially compatible ordering ) An ordering is called partially compatible , if the or- dering ...
... ( Incompatible vertex ) A vertex is called incompatible , if it has the O / O elementary graph . A verter , which has ... vertices . Definition 4 ( Partially compatible ordering ) An ordering is called partially compatible , if the or- dering ...