In this article, we construct the exact solutions for nonlinear partial differential equations with the variable coefficients in the mathematical physics via the generalized time- dependent variable coefficients KdV-mKdV equation and the coupled modified KdV equations with non-uniformity terms by ) - expansion method with the variable coefficients, where G satisfies the using a generalized ( Jacobi elliptic equation. Many of the exact solutions in terms of Jacobi elliptic functions are obtained. The proposed method is reliable and effective and gives more new exact solutions.

In this article a new preconditioner from class of (I+S)-type based on the Modified Accelerated Overrelaxation(MAOR) iterative method has been introduced and convergence properties of the proposed method have been analyzed and compared with the some other preconditioners. Moreover, comparisons between different splittings are derived. Numerical example is also given to illustrate our results.

Multi-dimensional discrete random number plays an important role in computer simulations. However, the existing high-level computer languages usually only give one-dimensional discrete random number, and can not appease the needs of computer simulation and experiment. Most existing studies focus on continuous distribution and one-dimensional discrete distribution. In this paper, theory and method on how to obtain random numbers subjected to an arbitrary multi-dimensional discrete probability distribution applying random numbers with uniform distribution are given.

This paper is concerned with analysis problem for the global exponential stability of a class of recurrent neural networks (RNNs) with mixed discrete and distributed delays. We give the sufficient condition of global exponential stability of cellular neural network with mixed discrete and distributed delays by employing the Lyapunov-Krasovskii functional and Young inequality, in addition, the example is provided to illustrate the applicability of the result.

The inverse eigenvalue problem of constructing bisymmetric matrices M , C and K of size n for the quadratic pencil so that has a prescribed subset of eigenvalues and eigenvectors is discussed. A general expression of solution to the problem is provided. The set of such solutions is denoted by S . The optimal approximation problem associated with is posed, that is: to find

In this paper, we consider the following Neumann boundary value problem

This paper presents the results of an early which compared the new algorithm to special matrices, purpose to calculate the value of determinant. Matrices which are numerically reliable techniques are used for this purpose. This technique permits for accuracy in the sense that it breaks down the new determinant for comparison to improve the existing numerical algorithms and to calculate the determinant of matrix.

This paper presents a robust approach for an automatic speech recognition system (ASR) when both additive and convolutional noises corrupt the speech signal. Robust features are derived by assuming that the corrupting noise is stationary and the channel effect is fixed during the utterance. In the proposed method the effect of additive and convolutional distortions are minimized by two stage filtering. The first filtering stage includes differential temporal filtering in the autocorrelation domain for reducing additive noise effects, followed by additional filtering in the logarithmic spectrum domain to reduce convolutional noise effects. Convolutional channel distortion is assumed to be linear and time invariant. A task of multispeaker isolated Hindi word recognition is conducted to demonstrate the effectiveness of using these robust features. The cases of channel filtered speech signal corrupted by white noise and different colored noises such as factory, babble and F16, which are further corrupted by channel distortion are tested. Experimental results show that the proposed method can significantly improve the performance of isolated Hindi word recognition system in noisy environment.

This paper presents a Simulated Annealing the Environmental/Economic Dispatch Problem (EED). This problem is formulated as a multi-objective one with two competing functions, namely economic cost and emission functions, subject to different constraints. The inequality constraints considered are maximum and minimum limits of power generation while the equality constraint is demand-generation balance. The results are obtained for a simple power 3-generator system. The advantage of the SA algorithm is its robustness to find the global for our problem.

In this paper, exact and numerical solutions are obtained for the Lienard’s equation by variational homotopy perturbation method (VHPM). Comparisons are made among the variational iteration method (VIM), the exact solutions and the proposed method. The results reveal that the proposed method is very effective and simple and can be applied for other nonlinear problems in mathematical.