In this paper we consider the computation of some eigenpairs with smallest eigenvalues in modulus of large-scale polynomial eigenvalue problem. Recently, a partially orthogonal projection method and its refinement scheme were presented for solving the polynomial eigenvalue problem. The methods preserve the structures and properties of the original polynomial eigenvalue problem. Implicitly updating the starting vector and constructing better projection subspace, we develop an implicitly restarted version of the partially orthogonal projection method. Combining the implicit restarting strategy with the refinement scheme, we present an implicitly restarted refined partially orthogonal projection method. In order to avoid the situation that the converged eigenvalues converge repeatedly in the later iterations, we propose a novel explicit non-equivalence low-rank deflation technique. Finally some numerical experiments show that the implicitly restarted refined partially orthogonal projection method with the explicit non-equivalence low-rank deflation technique is efficient and robust.

For symmetric eigenvalue problems, we constructed a three-term recurrence polynomial filter by means of Chebyshev polynomials. The new filtering technique does not need to solve linear systems and only needs matrix-vector products. It is a memory conserving filtering technique for its three-term recurrence relation. As an application, we use this filtering strategy to the Davidson method and propose the filtered-Davidson method. Through choosing suitable shifts, this method can gain cubic convergence rate locally. Theory and numerical experiments show the efficiency of the new filtering technique.

In this paper, we consider two innovative structured matrices, CUPL-Toeplitz matrix and CUPL-Hankel matrix. The inverses of CUPL-Toeplitz and CUPL-Hankel matrices can be expressed by the Gohberg-Heinig type formulas, and the stability of the inverse matrices is verified in terms of 1-, ∞- and 2-norms, respectively. In addition, two algorithms for the inverses of CUPL-Toeplitz and CUPL-Hankel matrices are given and examples are provided to verify the feasibility of these algorithms.

In this paper, we present a preconditioned positive-definite and skew-Hermitian splitting (PPSS) iteration method for continuous Sylvester equations AX + XB = C with positive definite/semi-definite matrices. The analysis shows that the PPSS iteration method will converge under certain assumptions. An inexact variant of the PPSS iteration method (IPPSS) has been presented and the analysis of its convergence property in detail has been discussed. Numerical results show that this new method is more efficient and robust than the existing ones.

The space fractional coupled nonlinear Schrödinger (CNLS) equations are discretized by an implicit conservative difference scheme with the fractional centered difference formula, which is unconditionally stable. The coefficient matrix of the discretized linear system is equal to the sum of a complex scaled identity matrix which can be written as the imaginary unit times the identity matrix and a symmetric Toeplitz-plusdiagonal matrix. In this paper, we present new preconditioners based on Hermitian and skew-Hermitian splitting (HSS) for such Toeplitz-like matrix. Theoretically, we show that all the eigenvalues of the resulting preconditioned matrices lie in the interior of the disk of radius 1 centered at the point (1,0). Thus Krylov subspace methods with the proposed preconditioners converge very fast. Numerical examples are given to illustrate the effectiveness of the proposed preconditioners.

In this paper, we propose a new SSOR-like method with four parameters to solve the augmented system. And we analyze the convergence of the method and get the optimal convergence factor under suitable conditions. It is proved that the optimal convergence factor is the same as the GMPSD method [M.A. Louka and N.M. Missirlis, A comparison of the extrapolated successive overrelaxation and the preconditioned simultaneous displacement methods for augmented systems, Numer. Math. 131(2015) 517-540] with five parameters under the same assumption.

There has been a lot of study on the SOR-like methods for solving the augmented system of linear equations since the outstanding work of Golub, Wu and Yuan (BIT 41(2001)71-85) was presented fifteen years ago. Based on the SOR-like methods, we establish a class of accelerated SOR-like methods for large sparse augmented linear systems by making use of optimization technique, which will find the optimal relaxation parameter ω by optimization models. We demonstrate the convergence theory of the new methods under suitable restrictions. The numerical examples show these methods are effective.

In this paper we consider new perturbation bounds analysis of a kind of generalized saddle point systems. We provide perturbation upper bounds for the solutions of generalized saddle point systems, which extend the corresponding results in [W.-W. Xu, W. Li, New perturbation analysis for generalized saddle point systems, Calcolo., 46(2009), pp. 25-36] to more general cases.

Mean curvature-based image registration model firstly proposed by Chumchob-Chen-Brito (2011) offered a better regularizer technique for both smooth and nonsmooth deformation fields. However, it is extremely challenging to solve efficiently this model and the existing methods are slow or become efficient only with strong assumptions on the smoothing parameter β. In this paper, we take a different solution approach. Firstly, we discretize the joint energy functional, following an idea of relaxed fixed point is implemented and combine with Gauss-Newton scheme with Armijo's Linear Search for solving the discretized mean curvature model and further to combine with a multilevel method to achieve fast convergence. Numerical experiments not only confirm that our proposed method is efficient and stable, but also it can give more satisfying registration results according to image quality.

Preconditioned modified Hermitian and skew-Hermitian splitting method (PMHSS) is an unconditionally convergent iteration method for solving large sparse complex symmetric systems of linear equations, and uses one parameter α. Adding another parameter β, the generalized PMHSS method (GPMHSS) is essentially a twoparameter iteration method. In order to accelerate the GPMHSS method, using an unexpected way, we propose an accelerated GPMHSS method (AGPMHSS) for large complex symmetric linear systems. Numerical experiments show the numerical behavior of our new method.

Retinex theory explains how the human visual system perceives colors. The goal of retinex is to decompose the reflectance and the illumination from the given images and thereby compensating for non-uniform lighting. The existing methods for retinex usually use a single image with a fixed exposure to restore the reflectance of the image. In this paper, we propose a variational model for retinex problem by utilizing multi-exposure images of a given scene. The existence and uniqueness of the solutions of the proposed model have been elaborated. An alternating minimization method is constructed to solve the proposed model and its convergence is also demonstrated. The experimental results show that the proposed method is effective for reflectance recovery in retinex problem.

Based on the shift-splitting technique and the idea of Hermitian and skew-Hermitian splitting, a fast shift-splitting iteration method is proposed for solving nonsingular and singular nonsymmetric saddle point problems in this paper. Convergence and semi-convergence of the proposed iteration method for nonsingular and singular cases are carefully studied, respectively. Numerical experiments are implemented to demonstrate the feasibility and effectiveness of the proposed method.

Based on the relaxed factorization techniques studied recently and the idea of the simple-like preconditioner, a modified relaxed positive-semidefinite and skew-Hermitian splitting (MRPSS) preconditioner is proposed for generalized saddle point problems. Some properties, including the eigenvalue distribution, the eigenvector distribution and the minimal polynomial of the preconditioned matrix are studied. Numerical examples arising from the mixed finite element discretization of the Oseen equation are illustrated to show the efficiency of the new preconditioner.

Based on a preconditioned shift-splitting of the (1,1)-block of non-Hermitian saddle-point matrix and the Uzawa iteration method, we establish a new Uzawa-type iteration method. The convergence properties of this iteration method are analyzed. In addition, based on this iteration method, a preconditioner is proposed. The spectral properties of the preconditioned saddle-point matrix are also analyzed. Numerical results are presented to verify the robustness and the efficiency of the new iteration method and the preconditioner.