Basic HTML version of Foils prepared 15 March 1996

Foil 20 Solution of SLOR -- Successive Line Over Relaxation

From Further PDE Solvers for the NAS Benchmarks CPSP713 Case studies in Computational Science -- Spring Semester 1996. by Geoffrey C. Fox
1 The SLOR equations can be solved as they are a set of NNAS tridiagonal equations soluble in 5NNAS operations
2 One can now use the usual over relaxation procedure
3 Note that upto a constant SLOR has the same complexity as original SOR
4 For Lapace's equation, one can show that if you choose the appropriate optimal w for both that SLOR is twice as fast as SOR -- as a SLOR calculation is somewhat more computation, one will not gain this full factor
in Table To:

Northeast Parallel Architectures Center, Syracuse University, npac@npac.syr.edu

If you have any comments about this server, send e-mail to webmaster@npac.syr.edu.

Page produced by wwwfoil on Sun Feb 22 1998