this paper deals with scrutinizing the convergence properties of iterative methods to solve linear system of equations. recently, several types of the preconditioners have been applied for ameliorating the rate of convergence of the accelerated overrelaxation (aor) method. in this paper, we study the applicability of a general class of the preconditioned iterative methods under certain conditio...

There are a large number of methods for solving under-determined linear inverse problem. Many of them have very high time complexity for large datasets. We propose a new method called Two-Stage Sparse Representation (TSSR) to tackle this problem. We decompose the representing space of signals into two parts, the measurement dictionary and the sparsifying basis. The dictionary is designed to app...

A new iteration scheme for computing the sign of a matrix which has no pure imaginary eigenvalues is presented. Then, by applying a well-known identity in matrix functions theory, an algorithm for computing the geometric mean of two Hermitian positive definite matrices is constructed. Moreover, another efficient algorithm for this purpose is derived free from the computation of principal matrix...

A biomarker selection system is proposed for identifying biomarkers related to prostate cancer. MS-spectra were obtained from the National Cancer Institute Clinical Proteomics Database. The system comprised two stages, a preprocessing stage, which is a sequence of MS-processing steps consisting of MSspectrum smoothing, novel iterative peak selection, peak alignment, and a classification stage e...

a systematic way is presented for the construction of multi-step iterative method with frozen jacobian. the inclusion of an auxiliary function is discussed. the presented analysis shows that how to incorporate auxiliary function in a way that we can keep the order of convergence and computational cost of newton multi-step method. the auxiliary function provides us the way to overcome the singul...

in this work, a new iterative method is proposed for obtaining the approximate solution of a class of hammerstein type integral equations system. the main structure of this method is based on the richardson iterative method for solving an algebraic linear system of equations. some conditions for existence and unique solution of this type equations are imposed. convergence analysis and error bou...

We develop a variant of an interior point method for solving two-stage stochastic linear programming problems. The problems are solved in a deterministic equivalent form in which the first stage variables appear as dense columns. To avoid their degrading influence on the adjacency structure AA (and the Cholesky factor) an iterative method is applied to compute orthogonal projections. Conjugate ...