Abstract: The Traveling salesman problem (TSP) is NP-hard in combinatorial optimization. The research shows the algorithms for TSP on the sparse graphs have the shorter computation time than those for TSP according to the complete graphs. We present an improved iterative algorithm to compute the sparse graphs for TSP by frequency graphs computed with frequency quadrilaterals. The iterative algorithm is enhanced by adjusting two parameters of the algorithm. The computation time of the algorithm is O(CNmaxn2) where C is the iterations, Nmax is the maximum number of frequency quadrilaterals containing each edge and n is the scale of TSP. The experimental results showed the computed sparse graphs generally have less than 5n edges for most of these Euclidean instances. Moreover, the maximum degree and minimum degree of the vertices in the sparse graphs do not have much difference. Thus, the computation time of the methods to resolve the TSP on these sparse graphs will be greatly reduced.
Abstract: Mixed convection of Cu-water nanofluid in an enclosure
with thick wavy bottom wall has been investigated numerically.
A co-ordinate transformation method is used to transform the
computational domain into an orthogonal co-ordinate system. The
governing equations in the computational domain are solved through
a pressure correction based iterative algorithm. The fluid flow
and heat transfer characteristics are analyzed for a wide range
of Richardson number (0.1 ≤ Ri ≤ 5), nanoparticle volume
concentration (0.0 ≤ ϕ ≤ 0.2), amplitude (0.0 ≤ α ≤ 0.1) of
the wavy thick- bottom wall and the wave number (ω) at a fixed
Reynolds number. Obtained results showed that heat transfer rate
increases remarkably by adding the nanoparticles. Heat transfer rate
is dependent on the wavy wall amplitude and wave number and
decreases with increasing Richardson number for fixed amplitude
and wave number. The Bejan number and the entropy generation are
determined to analyze the thermodynamic optimization of the mixed
convection.
Abstract: Migration of a core-shell soft particle under the
influence of an external electric field in an electrolyte solution is
studied numerically. The soft particle is coated with a positively
charged polyelectrolyte layer (PEL) and the rigid core is having
a uniform surface charge density. The Darcy-Brinkman extended
Navier-Stokes equations are solved for the motion of the ionized
fluid, the non-linear Nernst-Planck equations for the ion transport and
the Poisson equation for the electric potential. A pressure correction
based iterative algorithm is adopted for numerical computations. The
effects of convection on double layer polarization (DLP) and diffusion
dominated counter ions penetration are investigated for a wide range
of Debye layer thickness, PEL fixed surface charge density, and
permeability of the PEL. Our results show that when the Debye
layer is in order of the particle size, the DLP effect is significant
and produces a reduction in electrophoretic mobility. However, the
double layer polarization effect is negligible for a thin Debye layer
or low permeable cases. The point of zero mobility and the existence
of mobility reversal depending on the electrolyte concentration are
also presented.
Abstract: Model updating is an inverse eigenvalue problem which
concerns the modification of an existing but inaccurate model with
measured modal data. In this paper, an efficient gradient based
iterative method for updating the mass, damping and stiffness
matrices simultaneously using a few of complex measured modal
data is developed. Convergence analysis indicates that the iterative
solutions always converge to the unique minimum Frobenius norm
symmetric solution of the model updating problem by choosing a
special kind of initial matrices.
Abstract: In this paper, the improvement by deconvolution of
the depth resolution in Secondary Ion Mass Spectrometry (SIMS)
analysis is considered. Indeed, we have developed a new Tikhonov-
Miller deconvolution algorithm where a priori model of the solution
is included. This is a denoisy and pre-deconvoluted signal obtained
from: firstly, by the application of wavelet shrinkage algorithm,
secondly by the introduction of the obtained denoisy signal in an
iterative deconvolution algorithm. In particular, we have focused the
light on the effect of the iterations number on the evolution of the
deconvoluted signals. The SIMS profiles are multilayers of Boron in
Silicon matrix.
Abstract: High Peak to Average Power Ratio (PAPR) of the
transmitted signal is a serious problem in multicarrier systems (MC),
such as Orthogonal Frequency Division Multiplexing (OFDM), or in
Multi-Carrier Code Division Multiple Access (MC-CDMA) systems,
due to large number of subcarriers. This effect is possible reduce with
some PAPR reduction techniques. Spreading sequences at the
presence of Saleh and Rapp models of high power amplifier (HPA)
have big influence on the behavior of system. In this paper we
investigate the bit-error-rate (BER) performance of MC-CDMA
systems. Basically we can see from simulations that the MC-CDMA
system with Iterative algorithm can be providing significantly better
results than the MC-CDMA system. The results of our analyses are
verified via simulation.
Abstract: An inversion-free iterative algorithm is presented for
solving nonlinear matrix equation with a stepsize parameter t. The
existence of the maximal solution is discussed in detail, and the
method for finding it is proposed. Finally, two numerical examples
are reported that show the efficiency of the method.
Abstract: In this paper, we introduce a two-step iterative algorithm to prove a strong convergence result for approximating common fixed points of three contractive-like operators. Our algorithm basically generalizes an existing algorithm..Our iterative algorithm also contains two famous iterative algorithms: Mann iterative algorithm and Ishikawa iterative algorithm. Thus our result generalizes the corresponding results proved for the above three iterative algorithms to a class of more general operators. At the end, we remark that nothing prevents us to extend our result to the case of the iterative algorithm with error terms.
Abstract: By the real representation of the quaternionic matrix,
an iterative method for quaternionic linear equations Ax = b is
proposed. Then the convergence conditions are obtained. At last, a
numerical example is given to illustrate the efficiency of this method.
Abstract: Force sensor has been used as requisite for knowing information on the amount and the directions of forces on the skin surface. We have developed a four-degrees-of-freedom capacitive force sensor (approximately 20×20×5 mm3) that has a flexible structure and sixteen parallel plate capacitors. An iterative algorithm was developed for estimating four displacements from the sixteen capacitances using fourth-order polynomial approximation of characteristics between capacitance and displacement. The estimation results from measured capacitances had large error caused by deterioration of the characteristics. In this study, effective capacitors had major information were selected on the basis of the capacitance change range and the characteristic shape. Maximum errors in calibration and non-calibration points were 25%and 6.8%.However the maximum error was larger than desired value, the smallness of averaged value indicated the occurrence of a few large error points. On the other hand, error in non-calibration point was within desired value.
Abstract: In this paper channel estimation techniques are
considered as the support methods for OFDM transmission systems
based on Non Binary LDPC (Low Density Parity Check) codes.
Standard frequency domain pilot aided LS (Least Squares) and
LMMSE (Linear Minimum Mean Square Error) estimators are
investigated. Furthermore, an iterative algorithm is proposed as a
solution exploiting the NB-LDPC channel decoder to improve the
performance of the LMMSE estimator. Simulation results of signals
transmitted through fading mobile channels are presented to compare
the performance of the proposed channel estimators.
Abstract: Biclustering is a very useful data mining technique for
identifying patterns where different genes are co-related based on a
subset of conditions in gene expression analysis. Association rules
mining is an efficient approach to achieve biclustering as in
BIMODULE algorithm but it is sensitive to the value given to its
input parameters and the discretization procedure used in the
preprocessing step, also when noise is present, classical association
rules miners discover multiple small fragments of the true bicluster,
but miss the true bicluster itself. This paper formally presents a
generalized noise tolerant bicluster model, termed as μBicluster. An
iterative algorithm termed as BIDENS based on the proposed model
is introduced that can discover a set of k possibly overlapping
biclusters simultaneously. Our model uses a more flexible method to
partition the dimensions to preserve meaningful and significant
biclusters. The proposed algorithm allows discovering biclusters that
hard to be discovered by BIMODULE. Experimental study on yeast,
human gene expression data and several artificial datasets shows that
our algorithm offers substantial improvements over several
previously proposed biclustering algorithms.
Abstract: The stereophotogrammetry modality is gaining more widespread use in the clinical setting. Registration and visualization of this data, in conjunction with conventional 3D volumetric image modalities, provides virtual human data with textured soft tissue and internal anatomical and structural information. In this investigation computed tomography (CT) and stereophotogrammetry data is acquired from 4 anatomical phantoms and registered using the trimmed iterative closest point (TrICP) algorithm. This paper fully addresses the issue of imaging artifacts around the stereophotogrammetry surface edge using the registered CT data as a reference. Several iterative algorithms are implemented to automatically identify and remove stereophotogrammetry surface edge outliers, improving the overall visualization of the combined stereophotogrammetry and CT data. This paper shows that outliers at the surface edge of stereophotogrammetry data can be successfully removed automatically.
Abstract: In this paper the gradient based iterative algorithm is
presented to solve the linear matrix equation AXB +CXTD = E,
where X is unknown matrix, A,B,C,D,E are the given constant
matrices. It is proved that if the equation has a solution, then the
unique minimum norm solution can be obtained by choosing a special
kind of initial matrices. Two numerical examples show that the
introduced iterative algorithm is quite efficient.
Abstract: This paper describes a novel method for automatic
estimation of the contours of weld defect in radiography images.
Generally, the contour detection is the first operation which we apply
in the visual recognition system. Our approach can be described as a
region based maximum likelihood formulation of parametric
deformable contours. This formulation provides robustness against
the poor image quality, and allows simultaneous estimation of the
contour parameters together with other parameters of the model.
Implementation is performed by a deterministic iterative algorithm
with minimal user intervention. Results testify for the very good
performance of the approach especially in synthetic weld defect
images.
Abstract: An iterative algorithm is proposed and tested in Cournot Game models, which is based on the convergence of sequential best responses and the utilization of a genetic algorithm for determining each player-s best response to a given strategy profile of its opponents. An extra outer loop is used, to address the problem of finite accuracy, which is inherent in genetic algorithms, since the set of feasible values in such an algorithm is finite. The algorithm is tested in five Cournot models, three of which have convergent best replies sequence, one with divergent sequential best replies and one with “local NE traps"[14], where classical local search algorithms fail to identify the Nash Equilibrium. After a series of simulations, we conclude that the algorithm proposed converges to the Nash Equilibrium, with any level of accuracy needed, in all but the case where the sequential best replies process diverges.
Abstract: In the context of channel coding, the Generalized Belief Propagation (GBP) is an iterative algorithm used to recover the transmission bits sent through a noisy channel. To ensure a reliable transmission, we apply a map on the bits, that is called a code. This code induces artificial correlations between the bits to send, and it can be modeled by a graph whose nodes are the bits and the edges are the correlations. This graph, called Tanner graph, is used for most of the decoding algorithms like Belief Propagation or Gallager-B. The GBP is based on a non unic transformation of the Tanner graph into a so called region-graph. A clear advantage of the GBP over the other algorithms is the freedom in the construction of this graph. In this article, we explain a particular construction for specific graph topologies that involves relevant performance of the GBP. Moreover, we investigate the behavior of the GBP considered as a dynamic system in order to understand the way it evolves in terms of the time and in terms of the noise power of the channel. To this end we make use of classical measures and we introduce a new measure called the hyperspheres method that enables to know the size of the attractors.
Abstract: Let T and S be a subspace of Cn and Cm, respectively.
Then for A ∈ Cm×n satisfied AT ⊕ S = Cm, the generalized
inverse A(2)
T,S is given by A(2)
T,S = (PS⊥APT )†. In this paper, a
finite formulae is presented to compute generalized inverse A(2)
T,S
under the concept of restricted inner product, which defined as <
A,B >T,S=< PS⊥APT,B > for the A,B ∈ Cm×n. By this
iterative method, when taken the initial matrix X0 = PTA∗PS⊥, the
generalized inverse A(2)
T,S can be obtained within at most mn iteration
steps in absence of roundoff errors. Finally given numerical example
is shown that the iterative formulae is quite efficient.
Abstract: This paper presents a numerical approach for the static
and dynamic analysis of hydrodynamic radial journal bearings. In the
first part, the effect of shaft and housing deformability on pressure
distribution within oil film is investigated. An iterative algorithm that
couples Reynolds equation with a plane finite elements (FE)
structural model is solved. Viscosity-to-pressure dependency (Vogel-
Barus equation) is also included. The deformed lubrication gap and
the overall stress state are obtained. Numerical results are presented
with reference to a typical journal bearing configuration at two
different inlet oil temperatures. Obtained results show the great
influence of bearing components structural deformation on oil
pressure distribution, compared with results for ideally rigid
components. In the second part, a numerical approach based on
perturbation method is used to compute stiffness and damping
matrices, which characterize the journal bearing dynamic behavior.
Abstract: A kind of singularly perturbed boundary value problems is under consideration. In order to obtain its approximation, simple upwind difference discretization is applied. We use a moving mesh iterative algorithm based on equi-distributing of the arc-length function of the current computed piecewise linear solution. First, a maximum norm a posteriori error estimate on an arbitrary mesh is derived using a different method from the one carried out by Chen [Advances in Computational Mathematics, 24(1-4) (2006), 197-212.]. Then, basing on the properties of discrete Green-s function and the presented posteriori error estimate, we theoretically prove that the discrete solutions computed by the algorithm are first-order uniformly convergent with respect to the perturbation parameter ε.