Abstract
In many evolution equations, solutions may become unbounded in finite time. This phenomenon is often called blow-up and the finite time is called the blow-up time. To numerically reproduce the finite-time blow-up phenomenon, schemes with adaptive time meshes were considered to be necessary. Since the numerical blow-up time is defined by an infinite sum, such a method can not be carried in real computation. As a consequence, we propose an algorithm accomplished by schemes with uniform time meshes for the computation of blow-up solutions. In this talk, we are concerned with a question: to what extent can this algorithm be applied to compute the blow-up solutions and reproduce the blow-up behavior?