DATE2019-05-16 16:10-17:00


SPEAKER卓建宏 教授(中正大學數學系

TITLERemarks on the Computation of Blow-Up Problems

ABSTRACT An initial value problem is said to be a blow-up problem if its solution becomes unbounded in a finite time. The finite time is often called the blow-up time. In usual problems, a higher order scheme is often expected to have a better approximation for the exact solution. The smoothness for the exact solution plays an important role to say that a scheme is of high order, however, the solutions of blow-up problems lose their regularities at finite times. As a consequence, we would like to investigate in this talk a problem as to whether a higher order scheme always gives a better approximation for blow-up solutions. Several examples will be reported for these problems.