Hi All,
I am running a code where the system I want to solve is time-dependent,
which means:
[image: 快快快.JPG]
So, I want to solve u_{n+1} by using u_{n} in each time step n.
If my code is broken suddenly ,at time step n=1000 for example, how to
restart it from time step t_n = 1001, not t_n=1?
Hi Shawn,
> 3 нояб. 2018 г., в 2:28, Yuxiang Wang
> написал(а):
>
> Hi Denis,
>
> Thank you for the pointer! This is very helpful.
>
> The below is my understanding (and please let me know if I am wrong):
>
> 1. If we do the L2 projection over a domain of elements, then it smooths the
> str
