نتایج جستجو برای: modified f expansion method
تعداد نتایج: 2204003 فیلتر نتایج به سال:
In this paper we provide a new method to generate hard k-SAT instances. Basically, we construct the bipartite incidence graph of a k-SAT instance where the left side represents the clauses and the right side represents the literals of our Boolean formula. Then, the clauses are filled by incrementally connecting both sides while keeping the girth of the graph as high as possible. That assures th...
we are concerned with the development of a k−step method for the numerical solution of fuzzy initial value problems. convergence and stability of the method are also proved in detail. moreover, a specific method of order 4 is found. the numerical results show that the proposed fourth order method is efficient for solving fuzzy differential equations.
Chromium-vanadium (Cr-V) bimetallic catalysts are prepared by the introduction of vanadium into the Phillips catalyst which is one of the most significant industrial ethylene polymerization catalysts for tuning the Phillips catalyst performances and improving polyethylene properties. In the present work, titanium species were introduced into the fluorine-modified chromium-vanadium bimetallic ca...
This article presents differential equations and solution methods for the functions of the form A(z) = F−1(G(z)), where F and G are cumulative distribution functions. Such functions allow the direct recycling of samples from one distribution into samples from another. The method may be developed analytically for certain special cases, and illuminate the idea that it is a more precise form of th...
Abstract In this paper, a new approach to the numerical solution of VolterraFredholm integral equations by using expansion method based on the composition of the inverse and direct discrete fuzzy transforms (shortly F-transforms) in combination with the collocation technique is proposed. First, the unknown function is approximated by using the composition of the inverse and direct discrete F-tr...
the burgers’ equation is a simplified form of the navier-stokes equations that very well represents their non-linear features. in this paper, numerical methods of the adomian decomposition and the modified crank – nicholson, used for solving the one-dimensional burgers’ equation, have been compared. these numerical methods have also been compared with the analytical method. in contrast to...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید