A meaningful rank as well as efficient methods for computing such a rank are necessary in many areas of applications. Major methodologies for ranking often exploit principal eigenvectors. Kleinberg’s HITS model is one of such methodologies. The standard approach for computing the HITS rank is the power method. Unlike the PageRank calculations where many acceleration schemes have been proposed, ...

A genetic algorithm technique for the approximation of nonlinear transfer functions is proposed in this paper. It is shown that the GA approximation method gives better accuracy than the classical Chebyshev approximation, which is sometimes considered to be the best one on the minimax criterion. Application of this technique to behavioral-level simulation is also discussed. Keywords– genetic al...

This paper presents an improved technique for accelerating the process of doing logic programming in discrete Hopfield neural network by integrating fuzzy logic and modifying activation function. Generally Hopfield networks are suitable for solving combinatorial optimization problems and pattern recognition problems. However Hopfield neural networks also face some limitations; one of the major ...

In this paper, a numerical method for solving the Fredholm and Volterra integral equations is presented. The method is based upon the second Chebyshev wavelet approximation. The properties of the second Chebyshev wavelet are first presented and then operational matrix of integration of the second Chebyshev wavelets basis and product operation matrix of it are derived. The second Chebyshev wavel...

The Chebyshev orthogonal collocation is a powerful and accurate numerical technique, which is also relatively easy to implement using modern mathematical software (e.g., MATHEMATICA and MATLAB). This technique allows the elucidation of engineering problems involving partial differentials equations or boundary value problems. Six chemical engineering problems concerning the transfer of momentum,...

A Chebyshev or Fourier series may be evaluated on the standard collocation grid by the fast Fourier transform (FFT). Unfortunately, the FFT does not apply when one needs to sum a spectral series at N points which are spaced irregularly. The cost becomes O(N’) operations instead of the FFTs O(N log N). This sort of “off-grid” interpolation is needed by codes which dynamically readjust the grid e...

We study approximate solutions of a nonlinear integral equation of Hammerstein type. We describe the principle of discrete Adomian decomposition method (DADM). DADM is considered in the case we evaluate numerical integration by using Chebyshev roots. This technique gives an accurate solutions as will shown by illustrate examples.