variational iteration method using he's polynomials can be used to construct solitary solution and  compacton-like solution for nonlinear dispersive equatioons. the chosen initial solution can be determined in compacton-like form or in solitary form with some compacton-like or solitary forms with some unknown parameters, which can be determined in the solution procedure. the compacton-like solu...

in this paper, we represent an inexact inverse subspace iteration method for com- puting a few eigenpairs of the generalized eigenvalue problem ax = bx[q. ye and p. zhang, inexact inverse subspace iteration for generalized eigenvalue problems, linear algebra and its application, 434 (2011) 1697-1715 ]. in particular, the linear convergence property of the inverse subspace iteration is preserved.

We prove a strong convergence theorem for the modified Noor iterations‎ ‎in the framework of CAT(0) spaces‎. ‎Our results extend and improve the corresponding results of‎ ‎X‎. ‎Qin‎, ‎Y‎. ‎Su and M‎. ‎Shang‎, ‎T‎. ‎H‎. ‎Kim and H‎. ‎K‎. ‎Xu and S‎. ‎Saejung‎ ‎and some others‎.

In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...

the purpose of this study is to implement a new modification of the variational iteration method (h-s-vim), which is a combination of spectral method and variational iteration method for heat transfer problems with high nonlinearity order. the merit of this method is that it does not require the solution of any linear or nonlinear system of equations unlike spectral method. furthermore the prop...

We are concernedwith the nonnegative constraints optimization problems. It is well known that the conjugate gradientmethods are efficient methods for solving large-scale unconstrained optimization problems due to their simplicity and low storage. Combining the modified Polak-Ribière-Polyak method proposed by Zhang, Zhou, and Li with the Zoutendijk feasible direction method, we proposed a conjug...