Dynamic adaptation for parabolic equations

A. V. Mazhukin ; V. I. Mazhukin

Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 47 (2007) no. 11, pp. 1913-1936

Résumé

A dynamic adaptation method is presented that is based on the idea of using an arbitrary time-dependent system of coordinates that moves at a velocity determined by the unknown solution. Using some model problems as examples, the generation of grids that adapt to the solution is considered for parabolic equations. Among these problems are the nonlinear heat transfer problem concerning the formation of stationary and moving temperature fronts and the convection-diffusion problems described by the nonlinear Burgers and Buckley-Leverette equations. A detailed analysis of differential approximations and numerical results shows that the idea of using an arbitrary time-dependent system of coordinates for adapted grid generation in combination with the principle of quasi-stationarity makes the dynamic adaptation method universal, effective, and algorithmically simple. The universality is achieved due to the use of an arbitrary time-dependent system of coordinates that moves at a velocity determined by the unknown solution. This universal approach makes it possible to generate adapted grids for time-dependent problems of mathematical physics with various mathematical features. Among these features are large gradients, propagation of weak and strong discontinuities in nonlinear transport and heat transfer problems, and moving contact and free boundaries in fluid dynamics. The efficiency is determined by automatically fitting the velocity of the moving nodes to the dynamics of the solution. The close relationship between the adaptation mechanism and the structure of the parabolic equations allows one to automatically control the nodes’ motion so that their trajectories do not intersect. This mechanism can be applied to all parabolic equations in contrast to the hyperbolic equations, which do not include repulsive components. The simplicity of the algorithm is achieved due to the general approach to the adaptive grid generation, which is independent of the form and type of the differential equations.