The numerical approximation methods of the differential problems solution are numerous and various. Their classifications are based on several criteria: Consistency, precision, stability, convergence, dispersion, diffusion, speed and many others. For this reason a great interest must be given to the construction and the study of the associated algorithm: indeed the algorithm must be simple, rob...

in this paper, we propose an algorithm for numerical solving an inverse non-linear diusion problem. in additional, the least-squares method is adopted to nd the solution. to regularize the resultant ill-conditioned linear system ofequations, we apply the tikhonov regularization method to obtain the stablenumerical approximation to the solution. some numerical experiments con- rm the utility of...

in this paper, we present a new computational technique for solving nonlinear fredholm integral equations of the second kind. this proposed method is based on galerkin method and is computationally very attractive. moreover, for reducing the operations in comparing similar works, we design our algorithm based on transformations of orthogonal polynomials in approximation coefficients calculating...

In this note, the cut C is referred as the cut-set and the size of the cut |C| as the size of the cut-set. For a graph, a maximum cut is a cut whose size is at least the size of any other cut. The problem of finding a maximum cut in a graph is known as the maximum cut problem. The problem is NP-hard. Simple 0.5approximation algorithms existed long time ago, but no improvement was made till 1990...

This paper presents a successive approximation method (SAM) for solving a large class of optimal control problems. The proposed analytical-approximate method, successively solves the Two-Point Boundary Value Problem (TPBVP), obtained from the Pontryagin's Maximum Principle (PMP). The convergence of this method is proved and a control design algorithm with low computational complexity is present...