Search

In this paper, two numerical techniques are presented to solve the nonlinear inverse generalized Benjamin–Bona–Mahony–Burgers equation using noisy data. These two methods are the quartic B-spline and Haar wavelet methods combined with the Tikhonov regularization method. We show that the convergence rate of the proposed methods is $$\textit{O}(k^2+h^3)$$ and $$\textit{O}\left( \frac{1}{M}\right) $$ for the quartic B-spline and Haar wavelet method, respectively. In fact, this work considers a comparative study between quartic B-spline and Haar wavelet methods to solve some nonlinear inverse problems. Results show that an excellent estimation of the unknown functions of the nonlinear inverse problem has been obtained.

In this paper, based on the cubic B-spline finite element (CBSFE) and the radial basis functions (RBFs) methods, the inverse problems of finding the nonlinear source term for system of reaction–diffusion equations are studied. The approach of the proposed methods are to approximate unknown coefficients by a polynomial function whose coefficients are determined from the solution of minimization problem based on the overspecified data. In fact, this work considers a comparative study between the cubic B-spline finite element method and radial basis functions method. The stability and convergence analysis for these problems are investigated and some examples are given to illustrate the results.

In this paper, we discuss a numerical method for solving an inverse Rosenau equation with Dirichlet’s boundary conditions. The approach used is based on collocation of a quintic B-spline over finite elements so that we have continuity of dependent variable and it first four derivatives throughout the solution range. We apply quintic B-spline for spatial variable and derivatives which produce an ill-posed system. We solve this system using Tikhonov regularization method. The accuracy of the proposed method is demonstrated by applying it on a test problem. Figures and comparisons have been presented for clarity. The main advantage of the resulting scheme is that the algorithm is very simple, so it is very easy to implement.