Efficient time step parallelization of full multigrid techniques

• Main Authors: Weickert, J., Steidten, T.
• Other Authors: TU Chemnitz, SFB 393
• Format: Others
• Language: English
• Published: Universitätsbibliothek Chemnitz 1998
• Subjects: MSC 65N55; ddc:510
• Online Access: http://nbn-resolving.de/urn:nbn:de:bsz:ch1-199800466; http://nbn-resolving.de/urn:nbn:de:bsz:ch1-199800466; http://www.qucosa.de/fileadmin/data/qucosa/documents/4126/data/b001.pdf; http://www.qucosa.de/fileadmin/data/qucosa/documents/4126/data/b001.ps; http://www.qucosa.de/fileadmin/data/qucosa/documents/4126/19980046.txt

This paper deals with parallelization methods for time-dependent problems where the time steps are shared out among the processors. A Full Multigrid technique serves as solution algorithm, hence information of the preceding time step and of the coarser grid is necessary to compute the solution at each new grid level. Applying the usual extrapolation formula to process this information, the parallelization will not be very efficient. We developed another extrapolation technique which causes a much higher parallelization effect. Test examples show that no essential loss of exactness appears, such that the method presented here shall be well-applicable.