In this paper we find the exact solution of Burger's equation after reducing it to Bernoulli equation. We compare this solution with that given by Kaya where he used Adomian decomposition method, the solution given by chakrone where he used the Variation iteration method (VIM)and the solution given by Eq(5)in the paper of M. Javidi. We notice that our solution is better than their solutions.
An approximate solution of the liner system of ntegral cquations fot both fredholm(SFIEs)and Volterra(SIES)types has been derived using taylor series expansion.The solusion is essentailly
This paper introduces the Multistep Modified Reduced Differential Transform Method (MMRDTM). It is applied to approximate the solution for Nonlinear Schrodinger Equations (NLSEs) of power law nonlinearity. The proposed method has some advantages. An analytical approximation can be generated in a fast converging series by applying the proposed approach. On top of that, the number of computed terms is also significantly reduced. Compared to the RDTM, the nonlinear term in this method is replaced by related Adomian polynomials prior to the implementation of a multistep approach. As a consequence, only a smaller number of NLSE computed terms are required in the attained approximation. Moreover, the approximation also converges rapidly over a
... Show MoreIn this paper two ranking functions are employed to treat the fuzzy multiple objective (FMO) programming model, then using two kinds of membership function, the first one is trapezoidal fuzzy (TF) ordinary membership function, the second one is trapezoidal fuzzy weighted membership function. When the objective function is fuzzy, then should transform and shrinkage the fuzzy model to traditional model, finally solving these models to know which one is better
This article aims to determine the time-dependent heat coefficient together with the temperature solution for a type of semi-linear time-fractional inverse source problem by applying a method based on the finite difference scheme and Tikhonov regularization. An unconditionally stable implicit finite difference scheme is used as a direct (forward) solver. While by the MATLAB routine lsqnonlin from the optimization toolbox, the inverse problem is reformulated as nonlinear least square minimization and solved efficiently. Since the problem is generally incorrect or ill-posed that means any error inclusion in the input data will produce a large error in the output data. Therefore, the Tikhonov regularization technique is applie
... Show MoreIn this paper we prove the boundedness of the solutions and their derivatives of the second order ordinary differential equation x ?+f(x) x ?+g(x)=u(t), under certain conditions on f,g and u. Our results are generalization of those given in [1].
In parallel with the shell model using the harmonic oscillator's single-particle wave functions, the Hartree-Fock approximation was also used to calculate the neutron skin thickness, the mirror charge radii, and the differences in proton radii for 13O-13B and 13N-13C mirror nuclei. The calculations were done for both mirror nuclei in the psdpn model space. Depending on the type of potential used, the calculated values of skin thickness are affected. The symmetry energy and the symmetry energy's slope at nuclear saturation density were also determined, and the ratio of the density to the saturation density of nuclear matter and the symmetry energy has a nearly linear correlation. The mirror ener
... Show MoreElzaki Transform Adomian decomposition technique (ETADM), which an elegant combine, has been employed in this work to solve non-linear Riccati matrix differential equations. Solutions are presented to demonstrate the relevance of the current approach. With the use of figures, the results of the proposed strategy are displayed and evaluated. It is demonstrated that the suggested approach is effective, dependable, and simple to apply to a range of related scientific and technical problems.
In this paper, a new hybrid algorithm for linear programming model based on Aggregate production planning problems is proposed. The new hybrid algorithm of a simulated annealing (SA) and particle swarm optimization (PSO) algorithms. PSO algorithm employed for a good balance between exploration and exploitation in SA in order to be effective and efficient (speed and quality) for solving linear programming model. Finding results show that the proposed approach is achieving within a reasonable computational time comparing with PSO and SA algorithms.