Return to search

Efficient time step parallelization of full multigrid techniques

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.
Date30 October 1998
CreatorsWeickert, J., Steidten, T.
PublisherTechnische Universit├Ąt Chemnitz
Source SetsHochschulschriftenserver (HSSS) der SLUB Dresden
Detected LanguageEnglish
Typedoc-type:preprint, info:eu-repo/semantics/preprint, doc-type:Text

Page generated in 0.0022 seconds