نتایج جستجو برای: perturbation iteration algorithm
تعداد نتایج: 832281 فیلتر نتایج به سال:
In this paper, an efficient modification of homotopy perturbation method, namely optimal homotopy perturbation method, is introduced for solving linear and nonlinear partial differential equations with large solution domain based on a new homotopy perturbation method and Padé approximation method. We compare the performance of the method with those of new homotopy perturbation and optimal varia...
in this paper, a new continuous ant colony optimization (caco) algorithm is proposed for optimal reservoir operation. the paper presents a new method of determining and setting a complete set of control parameters for any given problem, saving the user from a tedious trial and error based approach to determine them. the paper also proposes an elitist strategy for caco algorithm where best solut...
Increasing data throughput of Multipath time-varying HF channel by employing decision feedback equalization is addressed. In this paper, we propose multichannel FQRD-RLS adaptive filtering algorithm employing weight extraction in Decision-directed mode. A comparison between this technique and IQRD-RLS algorithm is performed. Simulation is conducted under channel parameters with respect to MIL-S...
This paper presents a new variable step-size normalized subband adaptive filter (VSS-NSAF) algorithm. The proposed algorithm uses the prior knowledge of the system impulse response statistics and the optimal step-size vector is obtained by minimizing the mean-square deviation(MSD). In comparison with NSAF, the VSS-NSAF algorithm has faster convergence speed and lower MSD. To reduce the computa...
in this paper, we present an ecient numerical algorithm for solving fuzzy systemsof linear equations based on homotopy perturbation method. the method is discussed indetail and illustrated by solving some numerical examples.
The multiple traveling salesman problem (MTSP) involves scheduling m > 1 salesmen to visit a set of n > m nodes so that each node is visited exactly once. The objective is to minimize the total distance traveled by all the salesmen. The MTSP is an example of combinatorial optimization problems, and has a multiplicity of applications, mostly in the areas of routing and scheduling. In this paper,...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید