In this paper, we propose a new projection method for solving a general minimization problems with two L1-regularization terms for image denoising. It is related to the split Bregman method, but it avoids solving PDEs in the iteration. We employ the fast iterative shrinkage-thresholding algorithm (FISTA) to speed up the proposed method to a convergence rate O(k−2). We also show the convergence of the algorithms. Finally, we apply the methods to the anisotropic Lysaker, Lundervold and Tai (LLT) model and demonstrate their efficiency.

The multishift QR algorithm is efficient for computing all the eigenvalues of a dense, large-scale, non-Hermitian matrix. The major part of this algorithm can be performed by matrix-matrix multiplications and is therefore suitable for modern processors with hierarchical memory. A variant of this algorithm was recently proposed which can execute more computational parts by matrix-matrix multiplications. The algorithm is especially appropriate for recent coprocessors which contain many processor-elements such as the CSX600. However, the performance of the algorithm highly depends on the setting of parameters such as the numbers of shifts and divisions in the algorithm. Optimal settings are different depending on the matrix size and computational environments. In this paper, we construct a performance model to predict a setting of parameters which minimizes the execution time of the algorithm. Experimental results with the CSX600 coprocessor show that our model can be used to find the optimal setting.

In this paper, we propose a mixed Fourier-Jacobi spectral method for two dimensional Neumann boundary value problem. This method differs from the classical spectral method. The homogeneous Neumann boundary condition is satisfied exactly. Moreover, a tridiagonal matrix is employed, instead of the full stiffness matrix encountered in the classical variational formulation. For analyzing the numerical error, we establish the mixed Fourier-Jacobi orthogonal approximation. The convergence of proposed scheme is proved. Numerical results demonstrate the efficiency of this approach.