Multigrid Reduction in Time for Nonlinear Parabolic Problems
The need for parallelintime is being driven by changes in computer architectures, where future speedups will be available through greater concurrency, but not faster clock speeds, which are stagnant.This leads to a bottleneck for sequential time marching schemes, because they lack parallelism in the time dimension. Multigrid Reduction in Time (MGRIT) is an iterative procedure that allows for temporal parallelism by utilizing multigrid reduction techniques and a multilevel hierarchy of coarse time grids. MGRIT has been shown to be effective for linear problems, with speedups of up to 50 times. The goal of this work is the efficient solution of nonlinear problems with MGRIT, where efficient is defined as achieving similar performance when compared to a corresponding linear problem. As our benchmark, we use the pLaplacian, where p = 4 corresponds to a wellknown nonlinear diffusion equation and p = 2 corresponds to our benchmark linear diffusion problem. When considering linear problems and implicit methods, the use of optimal spatial solvers such as spatial multigrid imply that the cost of one time step evaluation is fixed across temporal levels, which have a large variation in time step sizes. This is not the case for nonlinear problems, where the work requiredmore »
 Authors:

^{[1]};
^{[2]};
^{[2]};
^{[1]}
 Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
 Univ. of Colorado, Boulder, CO (United States)
 Publication Date:
 OSTI Identifier:
 1236132
 Report Number(s):
 LLNLTR680499
 DOE Contract Number:
 AC5207NA27344
 Resource Type:
 Technical Report
 Research Org:
 Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
 Sponsoring Org:
 USDOE
 Country of Publication:
 United States
 Language:
 English
 Subject:
 97 MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE; 97 MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE
Enter terms in the toolbar above to search the full text of this document for pages containing specific keywords.