Abstract: The objective of this paper is to present a
comparative study of Homotopy Perturbation Method (HPM),
Variational Iteration Method (VIM) and Homotopy Analysis
Method (HAM) for the semi analytical solution of Kortweg-de
Vries (KdV) type equation called KdV. The study have been
highlighted the efficiency and capability of aforementioned methods
in solving these nonlinear problems which has been arisen from a
number of important physical phenomenon.
Abstract: We study the semiconvergence of Gauss-Seidel iterative
methods for the least squares solution of minimal norm of rank
deficient linear systems of equations. Necessary and sufficient conditions
for the semiconvergence of the Gauss-Seidel iterative method
are given. We also show that if the linear system of equations is
consistent, then the proposed methods with a zero vector as an initial
guess converge in one iteration. Some numerical results are given to
illustrate the theoretical results.
Abstract: In the present work, the performance of the particle
swarm optimization and the genetic algorithm compared as a typical
geometry design problem. The design maximizes the heat transfer
rate from a given fin volume. The analysis presumes that a linear
temperature distribution along the fin. The fin profile generated using
the B-spline curves and controlled by the change of control point
coordinates. An inverse method applied to find the appropriate fin
geometry yield the linear temperature distribution along the fin
corresponds to optimum design. The numbers of the populations, the
count of iterations and time to convergence measure efficiency.
Results show that the particle swarm optimization is most efficient
for geometry optimization.
Abstract: This paper describes a new method for affine parameter
estimation between image sequences. Usually, the parameter
estimation techniques can be done by least squares in a quadratic
way. However, this technique can be sensitive to the presence
of outliers. Therefore, parameter estimation techniques for various
image processing applications are robust enough to withstand the
influence of outliers. Progressively, some robust estimation functions
demanding non-quadratic and perhaps non-convex potentials adopted
from statistics literature have been used for solving these. Addressing
the optimization of the error function in a factual framework for
finding a global optimal solution, the minimization can begin with
the convex estimator at the coarser level and gradually introduce nonconvexity
i.e., from soft to hard redescending non-convex estimators
when the iteration reaches finer level of multiresolution pyramid.
Comparison has been made to find the performance of the results
of proposed method with the results found individually using two
different estimators.
Abstract: This paper describes an efficient and practical method
for economic dispatch problem in one and two area electrical power
systems with considering the constraint of the tie transmission line
capacity constraint. Direct search method (DSM) is used with some
equality and inequality constraints of the production units with any
kind of fuel cost function. By this method, it is possible to use several
inequality constraints without having difficulty for complex cost
functions or in the case of unavailability of the cost function
derivative. To minimize the number of total iterations in searching,
process multi-level convergence is incorporated in the DSM.
Enhanced direct search method (EDSM) for two area power system
will be investigated. The initial calculation step size that causes less
iterations and then less calculation time is presented. Effect of the
transmission tie line capacity, between areas, on economic dispatch
problem and on total generation cost will be studied; line
compensation and active power with reactive power dispatch are
proposed to overcome the high generation costs for this multi-area
system.
Abstract: Knowledge about the magnetic quantities in a magnetic circuit is always of great interest. On the one hand, this information is needed for the simulation of a transformer. On the other hand, parameter studies are more reliable, if the magnetic quantities are derived from a well established model. One possibility to model the 3-phase transformer is by using a magnetic equivalent circuit (MEC). Though this is a well known system, it is often not an easy task to set up such a model for a large number of lumped elements which additionally includes the nonlinear characteristic of the magnetic material. Here we show the setup of a solver for a MEC and the results of the calculation in comparison to measurements taken. The equations of the MEC are based on a rearranged system of the nodal analysis. Thus it is possible to achieve a minimum number of equations, and a clear and simple structure. Hence, it is uncomplicated in its handling and it supports the iteration process. Additional helpful tasks are implemented within the solver to enhance the performance. The electric circuit is described by an electric equivalent circuit (EEC). Our results for the 3-phase transformer demonstrate the computational efficiency of the solver, and show the benefit of the application of a MEC.
Abstract: A fully implicit finite-difference method has been proposed for the numerical solutions of one dimensional coupled nonlinear Burgers’ equations on the uniform mesh points. The method forms a system of nonlinear difference equations which is to be solved at each iteration. Newton’s iterative method has been implemented to solve this nonlinear assembled system of equations. The linear system has been solved by Gauss elimination method with partial pivoting algorithm at each iteration of Newton’s method. Three test examples have been carried out to illustrate the accuracy of the method. Computed solutions obtained by proposed scheme have been compared with analytical solutions and those already available in the literature by finding L2 and L∞ errors.
Abstract: The electrical interaction between two axisymmetric
spheroidal particles in an electrolyte solution is examined numerically.
A Galerkin finite element method combined with a Newton-Raphson
iteration scheme is proposed to evaluate the spatial variation in the
electrical potential, and the result obtained used to estimate the
interaction energy between two particles. We show that if the surface
charge density is fixed, the potential gradient is larger at a point, which
has a larger curvature, and if surface potential is fixed, surface charge
density is proportional to the curvature. Also, if the total interaction
energy against closest surface-to-surface curve exhibits a primary
maximum, the maximum follows the order (oblate-oblate) >
(sphere-sphere)>(oblate-prolate)>(prolate-prolate), and if the curve
has a secondary minimum, the absolute value of the minimum follows
the same order.
Abstract: In this work, we present a reliable framework to solve boundary value problems with particular significance in solid mechanics. These problems are used as mathematical models in deformation of beams. The algorithm rests mainly on a relatively new technique, the Variational Iteration Method. Some examples are given to confirm the efficiency and the accuracy of the method.
Abstract: On the basis of the linearized Phillips-Herffron model of a single-machine power system, a novel method for designing unified power flow controller (UPFC) based output feedback controller is presented. The design problem of output feedback controller for UPFC is formulated as an optimization problem according to with the time domain-based objective function which is solved by iteration particle swarm optimization (IPSO) that has a strong ability to find the most optimistic results. To ensure the robustness of the proposed damping controller, the design process takes into account a wide range of operating conditions and system configurations. The simulation results prove the effectiveness and robustness of the proposed method in terms of a high performance power system. The simulation study shows that the designed controller by Iteration PSO performs better than Classical PSO in finding the solution.
Abstract: This paper describes a new algorithm of arrangement
in parallel, based on Odd-Even Mergesort, called division and
concurrent mixes. The main idea of the algorithm is to achieve that
each processor uses a sequential algorithm for ordering a part of the
vector, and after that, for making the processors work in pairs in
order to mix two of these sections ordered in a greater one, also
ordered; after several iterations, the vector will be completely
ordered. The paper describes the implementation of the new
algorithm on a Message Passing environment (such as MPI). Besides,
it compares the obtained experimental results with the quicksort
sequential algorithm and with the parallel implementations (also on
MPI) of the algorithms quicksort and bitonic sort. The comparison
has been realized in an 8 processors cluster under GNU/Linux which
is running on a unique PC processor.
Abstract: The objective of this paper is to analyse the
application of the Half-Sweep Gauss-Seidel (HSGS) method by using
the Half-sweep approximation equation based on central difference
(CD) and repeated trapezoidal (RT) formulas to solve linear fredholm
integro-differential equations of first order. The formulation and
implementation of the Full-Sweep Gauss-Seidel (FSGS) and Half-
Sweep Gauss-Seidel (HSGS) methods are also presented. The HSGS
method has been shown to rapid compared to the FSGS methods.
Some numerical tests were illustrated to show that the HSGS method
is superior to the FSGS method.
Abstract: Signal processing applications which are iterative in
nature are best represented by data flow graphs (DFG). In these
applications, the maximum sampling frequency is dependent on the
topology of the DFG, the cyclic dependencies in particular. The
determination of the iteration bound, which is the reciprocal of the
maximum sampling frequency, is critical in the process of hardware
implementation of signal processing applications. In this paper, a
novel technique to compute the iteration bound is proposed. This
technique is different from all previously proposed techniques, in the
sense that it is based on the natural flow of tokens into the DFG
rather than the topology of the graph. The proposed algorithm has
lower run-time complexity than all known algorithms. The
performance of the proposed algorithm is illustrated through
analytical analysis of the time complexity, as well as through
simulation of some benchmark problems.
Abstract: Given a large sparse signal, great wishes are to
reconstruct the signal precisely and accurately from lease number of
measurements as possible as it could. Although this seems possible
by theory, the difficulty is in built an algorithm to perform the
accuracy and efficiency of reconstructing. This paper proposes a new
proved method to reconstruct sparse signal depend on using new
method called Least Support Matching Pursuit (LS-OMP) merge it
with the theory of Partial Knowing Support (PSK) given new method
called Partially Knowing of Least Support Orthogonal Matching
Pursuit (PKLS-OMP).
The new methods depend on the greedy algorithm to compute the
support which depends on the number of iterations. So to make it
faster, the PKLS-OMP adds the idea of partial knowing support of its
algorithm. It shows the efficiency, simplicity, and accuracy to get
back the original signal if the sampling matrix satisfies the Restricted
Isometry Property (RIP).
Simulation results also show that it outperforms many algorithms
especially for compressible signals.
Abstract: Human pose estimation can be executed using Active Shape Models. The existing techniques for applying to human-body research using Active Shape Models, such as human detection, primarily take the form of silhouette of human body. This technique is not able to estimate accurately for human pose to concern two arms and legs, as the silhouette of human body represents the shape as out of round. To solve this problem, we applied the human body model as stick-figure, “skeleton". The skeleton model of human body can give consideration to various shapes of human pose. To obtain effective estimation result, we applied background subtraction and deformed matching algorithm of primary Active Shape Models in the fitting process. The images which were used to make the model were 600 human bodies, and the model has 17 landmark points which indicate body junction and key features of human pose. The maximum iteration for the fitting process was 30 times and the execution time was less than .03 sec.
Abstract: A Picard-Newton iteration method is studied to accelerate the numerical solution procedure of a class of two-dimensional nonlinear coupled parabolic-hyperbolic system. The Picard-Newton iteration is designed by adding higher-order terms of small quantity to an existing Picard iteration. The discrete functional analysis and inductive hypothesis reasoning techniques are used to overcome difficulties coming from nonlinearity and coupling, and theoretical analysis is made for the convergence and approximation properties of the iteration scheme. The Picard-Newton iteration has a quadratic convergent ratio, and its solution has second order spatial approximation and first order temporal approximation to the exact solution of the original problem. Numerical tests verify the results of the theoretical analysis, and show the Picard-Newton iteration is more efficient than the Picard iteration.
Abstract: The cellular network is one of the emerging areas of
communication, in which the mobile nodes act as member for one
base station. The cluster based communication is now an emerging
area of wireless cellular multimedia networks. The cluster renders
fast communication and also a convenient way to work with
connectivity. In our scheme we have proposed an optimization
technique for the fuzzy cluster nodes, by categorizing the group
members into three categories like long refreshable member, medium
refreshable member and short refreshable member. By considering
long refreshable nodes as static nodes, we compute the new
membership values for the other nodes in the cluster. We compare
their previous and present membership value with the threshold value
to categorize them into three different members. By which, we
optimize the nodes in the fuzzy clusters. The simulation results show
that there is reduction in the cluster computational time and
iterational time after optimization.
Abstract: By means of Contractor Iteration Method, we solve and visualize the Lane-Emden(-Fowler) equation Δu + up = 0, in Ω, u = 0, on ∂Ω. It is shown that the present method converges quadratically as Newton’s method and the computation of Contractor Iteration Method is cheaper than the Newton’s method.
Abstract: Optimal design of structure has a main role in reduction of material usage which leads to deduction in the final cost of construction projects. Evolutionary approaches are found to be more successful techniques for solving size and shape structural optimization problem since it uses a stochastic random search instead of a gradient search. By reviewing the recent literature works the problem found was the optimization of weight. A new meta-heuristic algorithm called as Cuckoo Search (CS) Algorithm has used for the optimization of the total weight of the truss structures. This paper has used set of 10 bars and 25 bars trusses for the testing purpose. The main objective of this work is to reduce the number of iterations, weight and the total time consumption. In order to demonstrate the effectiveness of the present method, minimum weight design of truss structures is performed and the results of the CS are compared with other algorithms.
Abstract: Solving Ordinary Differential Equations (ODEs) by
using Partitioning Block Intervalwise (PBI) technique is our aim in
this paper. The PBI technique is based on Block Adams Method and
Backward Differentiation Formula (BDF). Block Adams Method
only use the simple iteration for solving while BDF requires Newtonlike
iteration involving Jacobian matrix of ODEs which consumes a
considerable amount of computational effort. Therefore, PBI is
developed in order to reduce the cost of iteration within acceptable
maximum error