Resolution of the 1D regularized Burgers equation using a spatial wavelet approximation
暂无分享,去创建一个
Abstract : The Burgers equation with a small viscosity term, initial and periodic boundary conditions is resolved numerically using a spatial approximation constructed from an orthonormal basis of wavelets. The algorithm is directly derived from the notions of multiresolution analysis and tree algorithms. Before the numerical algorithm is described these notions are first recalled. The methods uses extensively the localization properties of the wavelets in the physical and Fourier spaces. Moreover, we take advantage of the fact that the involved linear operators have constant coefficients. Finally, the algorithm can be considered as a time marching version of the tree algorithm. The most important point is that an adaptative version of the algorithm exists: it allows one to reduce in a significant way the number of degrees of freedom required for a good computation of the solution. Numerical results and description of the different elements of the algorithm are provided in combination with different mathematical comments on the method and some comparison with more classical numerical algorithms.
[1] C. Basdevant,et al. Spectral and finite difference solutions of the Burgers equation , 1986 .
[2] S. Mallat,et al. Multiresolution representations and wavelets , 1988 .
[3] G. Battle. A block spin construction of ondelettes. Part I: Lemarié functions , 1987 .
[4] D. Gottlieb,et al. Numerical analysis of spectral methods : theory and applications , 1977 .