In this paper we perform a stability analysis of a fully discrete numerical method for the solution of a family of Boussinesq systems, consisting of a Fourier collocation spectral method for the spatial discretization and a explicit fourth order Runge–Kutta (RK4) scheme for time integration. Our goal is to determine the influence of the parameters, associated to this family of systems, on the efficiency and accuracy of the numerical method. This analysis allows us to identify which regions in the parameter space are most appropriate for obtaining an efficient and accurate numerical solution. We show several numerical examples in order to validate the accuracy, stability and applicability of our MATLAB implementation of the numerical method.
We consider the following inverse problem for an ordinary differential equation (ODE): given a set of data points $ P = \{(t_i,x_i),\; i = 1,\dots,N\} $, find an ODE $ x^\prime(t) = v (x) $ that admits a solution $ x(t) $ such that $ x_i \approx x(t_i) $ as closely as possible. The key to the proposed method is to find approximations of the recursive or discrete propagation function $ D(x) $ from the given data set. Afterwards, we determine the field $ v(x) $, using the conjugate map defined by Schröder's equation and the solution of a related Julia's equation. Moreover, our approach also works for the inverse problems where one has to determine an ODE from multiple sets of data points.We also study existence, uniqueness, stability and other properties of the recovered field $ v(x) $. Finally, we present several numerical methods for the approximation of the field $ v(x) $ and provide some illustrative examples of the application of these methods.