نتایج جستجو برای: perturbation iteration algorithm

تعداد نتایج: 832281  

Journal: :iranian journal of mechanical engineering transactions of the isme 0
a. farshidianfar department of mechanical engineering ferdowsi university of mashhad n. nickmehr

the current paper focuses on some analytical techniques to solve the non-linear duffing oscillator with large nonlinearity. four different methods have been applied for solution of the equation of motion; the variational iteration method, he’s parameter expanding method, parameterized perturbation method, and the homotopy perturbation method. the results reveal that approximation obtained by th...

M. Matinfar Z. Raeisi

A. Noor et al. [7] analyze a technique by combining the variational iteration method and the homotopy perturbation method which is called the variational homotopy perturbation method (VHPM) for solving higher dimensional initial boundary value problems. In this paper, we consider the VHPM to obtain exact solution to Gas Dynamics equation.

2015
Mariam Sultana Javed Khan Muhammad Shoaib Gilli Martins

An all new technique has been devised to solve non-linear LaneEmden type equations. This novel technique is based on the Perturbation Iteration Algorithm. In this paper, a few examples are presented for the illustration of the power and wide usability of the proposed method. Moreover, a compare and contrast with the actual solution is provided. It has been evaluated that by employment of this m...

Journal: :computational methods for differential equations 0
esmail hesameddini shiraz university of technology azam rahimi shiraz university of technology

this paper has been devoted to apply the reconstruction of variational iteration method (rvim) to handle the systems of integro-differential equations. rvim has been induced with laplace transform from the variational iteration method (vim) which was developed from the inokuti method. actually, rvim overcome to shortcoming of vim method to determine the lagrange multiplier. so that, rvim method...

Journal: :Computers & Mathematics with Applications 2010
Yigit Aksoy Mehmet Pakdemirli

Perturbation–iteration theory is systematically generated for both linear and nonlinear second-order differential equations and applied to Bratu-type equations. Different perturbation–iteration algorithms depending upon the number of Taylor expansion terms are proposed. Using the iteration formulas derived using different perturbation–iteration algorithms, new solutions of Bratu-type equations ...

Journal: :computational methods for differential equations 0
ali beiranvand faculty of mathematical sciences, university of tabriz, tabriz, iran. karim ivaz university of tabriz, iran

we introduce and discuss the homotopy perturbation method, the adomian decomposition method and the variational iteration method for solving the stefan problem with kinetics. then, we give an example of the stefan problem with  kinetics and solve it by these methods.

In this article to prove existence of solution of infinite system of nonlinear integral equations, we consider the space of solution containing all convergence sequences with a finite limit, as with a suitable norm is a Banach space. By creating a generalization of Meir-Keeler condensing operators which is named as F-generalized Meir-Keeler condensing operators and measure of noncompactness, we...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه بوعلی سینا - دانشکده علوم پایه 1391

abstract: in this thesis, we focus to class of convex optimization problem whose objective function is given as a linear function and a convex function of a linear transformation of the decision variables and whose feasible region is a polytope. we show that there exists an optimal solution to this class of problems on a face of the constraint polytope of feasible region. based on this, we dev...

2002
Shinn-Ying Ho

Floorplanning is an essential step in physical design of VLSI. The floorplan design problem is how to place a set of circuit modules on a chip such that the resulting area is minimized. The best known solutions are obtained using simulated annealing based on sequence pairs representing the planning of modules. The conventional simulated annealing algorithm conducts a random perturbation operati...

2016
Mikhail Belkin Luis Rademacher James R. Voss

A number of important problems in theoretical computer science and machine learning can be interpreted as recovering a certain basis. These include certain tensor decompositions, Independent Component Analysis (ICA), spectral clustering and Gaussian mixture learning. Each of these problems reduces to an instance of our general model, which we call a “Basis Encoding Function” (BEF). We show that...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید