Temporal Splitting algorithms for non-stationary multiscale problems

11/11/2020 ∙ by Yalchin Efendiev, et al. ∙ 0

In this paper, we study temporal splitting algorithms for multiscale problems. The exact fine-grid spatial problems typically require some reduction in degrees of freedom. Multiscale algorithms are designed to represent the fine-scale details on a coarse grid and, thus, reduce the problems' size. When solving time-dependent problems, one can take advantage of the multiscale decomposition of the solution and perform temporal splitting by solving smaller-dimensional problems, which is studied in the paper. In the proposed approach, we consider the temporal splitting based on various low dimensional spatial approximations. Because a multiscale spatial splitting gives a "good" splitting of the solution space, one can achieve an efficient temporal splitting. We present a theoretical result, which was derived in our earlier paper and adopted in this paper for multiscale problems. Numerical results are presented to demonstrate the efficiency of the proposed splitting algorithm.



There are no comments yet.


page 9

page 10

page 11

page 12

page 13

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.