3 citations found. Retrieving documents...
S.N. Gupta, M. Zubair and C.E. Grosch. . J. of Scientific Commput., 7:263--279, 1992.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
The Design of an Object-Oriented Runtime System For.. - Baille, Grunwald.. (1995)   (Correct)

....in x . In section x5 we present some experimental results on the KSR1. Finally we conclude in x6 with further extension and research directions. 2 Clive s Section The Multigrid Solver has received much attention due to it s importance and the challlenge of parallelizing the algorithm MG [5] [22] [6] 9] The basic idea of the Multigrid method is to obtain a initial approximation for a given grid by first solving on a coarser grid. Since the coarser grid is simple to compute, we can use a iterative method such as the Gauss Seidel method to get an approximation solution on the coarse grid ....

S.N. Gupta, M. Zubair and C.E. Grosch. . J. of Scientific Commput., 7:263--279, 1992.


Application of an Object-Oriented Parallel Run-Time.. - Baillie, Grunwald.. (1995)   (Correct)

....Storage (FAS) version of the multigrid algorithm. We employ grid coarsening only in the horizontal directions, using line Gauss Seidel relaxation in the vertical. The Multigrid technique has received much attention due to it s importance and the challenge of parallelizing the algorithm MG [4] [16] [6] 8] Multigrid algorithms are used to accelerate the convergence of relaxation methods like Gauss Seidel for the numerical solution of partial differential equations. They achieve this by using a hierarchy of coarser grids with larger spacings to provide corrections to the approximate ....

S.N. Gupta, M. Zubair and C.E. Grosch. . J. of Scientific Commput., 7:263--279, 1992.


The DUDE Runtime System: An Object-Oriented Macro-Dataflow .. - Grunwald, Vajracharya (1995)   (5 citations)  (Correct)

....shown earlier in Figure 1, with additional interaction between the two tasks. The combined data and task parallelism provides many opportunities for improving performance. The multigrid method has received much attention due to its fast convergence and the challenge of parallelizing the algorithm [6, 30, 8, 13]. The basic idea of the multigrid method is to obtain an initial approximation for a given grid by first solving on a coarser grid. Since the coarser grid is simple to compute, we can use a iterative method such as the Gauss Seidel method to get an approximation solution on the coarse grid and ....

S.N. Gupta, M. Zubair and C.E. Grosch. . J. of Scientific Commput., 7:263--279, 1992.

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