A new approach for solving nonlinear Thomas-Fermi equation based on fractional order of rational Bessel functions

In this paper, the fractional order of rational Bessel functions collocation method (FRBC) to solve Thomas-Fermi equation which is defined in the semi-infinite domain and has singularity at $x = 0$ and its boundary condition occurs at infinity, have been introduced. We solve the problem on semi-infinite domain without any domain truncation or transformation of the domain of the problem to a finite domain. This approach at first, obtains a sequence of linear differential equations by using the quasilinearization method (QLM), then at each iteration solves it by FRBC method. To illustrate the reliability of this work, we compare the numerical results of the present method with some well-known results in other to show that the new method is accurate, efficient and applicable

Numerical investigation of Differential Biological-Models via GA-Kansa Method Inclusive Genetic Strategy

In this paper, we use Kansa method for solving the system of differential equations in the area of biology. One of the challenges in Kansa method is picking out an optimum value for Shape parameter in Radial Basis Function to achieve the best result of the method because there are not any available analytical approaches for obtaining optimum Shape parameter. For this reason, we design a genetic algorithm to detect a close optimum Shape parameter. The experimental results show that this strategy is efficient in the systems of differential models in biology such as HIV and Influenza. Furthermore, we prove that using Pseudo-Combination formula for crossover in genetic strategy leads to convergence in the nearly best selection of Shape parameter.Comment: 42 figures, 23 page

A Laguerre spectral method for quadratic optimal control of nonlinear systems in a semi-infinite interval

This paper presents a Laguerre homotopy method for quadratic optimal control problems in semi-infinite intervals (LaHOC), with particular interests given to nonlinear interconnected large-scale dynamic systems. In LaHOC, the spectral homotopy analysis method is used to derive an iterative solver for the nonlinear two-point boundary value problem derived from Pontryagin\u27s maximum principle. A proof of local convergence of the LaHOC is provided. Numerical comparisons are made between the LaHOC, Matlab BVP5C generated results and results from the literature for two nonlinear optimal control problems. The results show that LaHOC is superior in both accuracy and efficiency

Low Complexity Regularization of Linear Inverse Problems

Inverse problems and regularization theory is a central theme in contemporary signal processing, where the goal is to reconstruct an unknown signal from partial indirect, and possibly noisy, measurements of it. A now standard method for recovering the unknown signal is to solve a convex optimization problem that enforces some prior knowledge about its structure. This has proved efficient in many problems routinely encountered in imaging sciences, statistics and machine learning. This chapter delivers a review of recent advances in the field where the regularization prior promotes solutions conforming to some notion of simplicity/low-complexity. These priors encompass as popular examples sparsity and group sparsity (to capture the compressibility of natural signals and images), total variation and analysis sparsity (to promote piecewise regularity), and low-rank (as natural extension of sparsity to matrix-valued data). Our aim is to provide a unified treatment of all these regularizations under a single umbrella, namely the theory of partial smoothness. This framework is very general and accommodates all low-complexity regularizers just mentioned, as well as many others. Partial smoothness turns out to be the canonical way to encode low-dimensional models that can be linear spaces or more general smooth manifolds. This review is intended to serve as a one stop shop toward the understanding of the theoretical properties of the so-regularized solutions. It covers a large spectrum including: (i) recovery guarantees and stability to noise, both in terms of $\ell^2$-stability and model (manifold) identification; (ii) sensitivity analysis to perturbations of the parameters involved (in particular the observations), with applications to unbiased risk estimation ; (iii) convergence properties of the forward-backward proximal splitting scheme, that is particularly well suited to solve the corresponding large-scale regularized optimization problem

A Parameterized multi-step Newton method for solving systems of nonlinear equations

We construct a novel multi-step iterative method for solving systems of nonlinear equations by introducing a parameter. to generalize the multi-step Newton method while keeping its order of convergence and computational cost. By an appropriate selection of theta, the new method can both have faster convergence and have larger radius of convergence. The new iterative method only requires one Jacobian inversion per iteration, and therefore, can be efficiently implemented using Krylov subspace methods. The new method can be used to solve nonlinear systems of partial differential equations, such as complex generalized Zakharov systems of partial differential equations, by transforming them into systems of nonlinear equations by discretizing approaches in both spatial and temporal independent variables such as, for instance, the Chebyshev pseudo-spectral discretizing method. Quite extensive tests show that the new method can have significantly faster convergence and significantly larger radius of convergence than the multi-step Newton method.Peer ReviewedPostprint (author's final draft

A fractional B-spline collocation method for the numerical solution of fractional predator-prey models

We present a collocation method based on fractional B-splines for the solution of fractional differential problems. The key-idea is to use the space generated by the fractional B-splines, i.e., piecewise polynomials of noninteger degree, as approximating space. Then, in the collocation step the fractional derivative of the approximating function is approximated accurately and efficiently by an exact differentiation rule that involves the generalized finite difference operator. To show the effectiveness of the method for the solution of nonlinear dynamical systems of fractional order, we solved the fractional Lotka-Volterra model and a fractional predator-pray model with variable coefficients. The numerical tests show that the method we proposed is accurate while keeping a low computational cost