• Communications of the Korean Mathematical Society
• /
• v.34 no.2
• /
• pp.657-670
• /
• 2019

In this paper, we consider the preconditioned iterative methods for solving linear complementarity problem associated with an M-matrix. Based on the generalized Gunawardena's preconditioner, two preconditioned SSOR methods for solving the linear complementarity problem are proposed. The convergence of the proposed methods are analyzed, and the comparison results are derived. The comparison results showed that preconditioned SSOR methods accelerate the convergent rate of the original SSOR method. Numerical examples are used to illustrate the theoretical results.

• Journal of applied mathematics & informatics
• /
• v.29 no.5_6
• /
• pp.1463-1475
• /
• 2011

This paper proposes a new generalized iterative method (SSOR-like method) for solving augmented system. A functional equation relating two involved parameters is obtained, and some convergence conditions for this method are derived. This paper generalizes some foregone results. Numerical examples show that, this method is efficient by suitable choices of the involved parameters.

• Korean Journal of Mathematics
• /
• v.13 no.1
• /
• pp.113-122
• /
• 2005

We consider the iterative schemes for the large sparse linear system to solve partial differential equations. Using spectral radius of iteration matrices, the optimal relaxation parameters and good parameters can be obtained. With those parameters we compare the effectiveness of the SOR and SSOR algorithms. Applying Crank-Nicolson approximation, we observe the error distribution according to domain decomposition. The number of processors due to domain decomposition affects time and error. Numerical experiments show that effectiveness of SOR and SSOR can be reversed as time size varies, which is not the usual case. Finally, these phenomena suggest conjectures about equilibrium time grid for SOR and SSOR.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.1
• /
• pp.40-48
• /
• 2002

Three-Dimensional scene reconstruction from images acquired with different viewpoints is possible as estimating Fundamental matrix(F-matrix) that indicates the epipolar geometry of two images. Correspondence points required to calculate F-matrix of two images include noise such as miss matches, so generally it is hard to calculate F-matrix accurately. In this paper, we classify noise into two types; outlier and minute noise. we propose SSOR algorithm that estimate F-matrix effectively. SSOR algorithm is rejecting outlier step by step in a noise environment. To evaluate the performance of proposed algorithm we simulated with synthetic images and real images. As a result of simulation we show that proposed algorithm is better than conventional algorithms.

• Journal of applied mathematics & informatics
• /
• v.24 no.1_2
• /
• pp.273-282
• /
• 2007

In this paper, we study the convergence of both the multisplitting method and the relaxed multisplitting method associated with SOR or SSOR multisplittings for solving a linear system whose coefficient matrix is an M-matrix.

• The KIPS Transactions:PartA
• /
• v.10A no.2
• /
• pp.137-140
• /
• 2003

Recently, CG (Conjugate Gradient) scheme for the optimization of the Rayleigh quotient has been proven a very attractive and promising technique for interior eigenvalues for the following eigenvalue problem, Ax＝λx (1) The given matrix A is assummed to be large and sparse, and symmetric. Also, the method is very amenable to parallel computations. A proper choice of the preconditioner significantly improves the convergence of the CG scheme. We compare the parallel preconditioners for the computation of the interior eigenvalues of a symmetric matrix by CG-type method. The considered preconditioners are Point-SSOR, ILU (0) in the multi-coloring order, and Multi-Color Block SSOR (Symmetric Succesive OverRelaxation). We conducted our experiments on the CRAY­T3E with 128 nodes. The MPI (Message Passing Interface) library was adopted for the interprocessor communications. The test matrices are up to $512{\times}512$ in dimensions and were created from the discretizations of the elliptic PDE. All things considered the MC-BSSOR seems to be most robust preconditioner.

• Journal of applied mathematics & informatics
• /
• v.11 no.1_2
• /
• pp.305-316
• /
• 2003

Recently, an iterative algorithm for finding the interior eigenvalues of a definite matrix by CG-type method has been proposed. This method compares to the inverse power method. The given matrices A, and B are assumed to be large and sparse, and SPD( Symmetric Positive Definite) The CG scheme for the optimization of the Rayleigh quotient has been proven a very attractive and promising technique for large sparse eigenproblems for smallest eigenvalue. Also, it is very amenable to parallel computations, like the CG method for the linear systems. A proper choice of the preconditioner significantly improves the convergence of the CG scheme. But for parallel computations we need to find an efficient parallel preconditioner. Our candidates we ILU(0) in the wave-front order, ILU(0) in the multi-coloring order, Point-SSOR(Symmetric Successive Overrelaxation), and Multi-Color Block SSOR preconditioner. Wavefront order is a simple way to increase parallelism in the natural order, and Multi-coloring realizes a parallelism of order(N), where N is the order of the matrix. Another choice is the Multi-Color Block SSOR(Symmetric Successive OverRelaxation) preconditioning. Block SSOR is a symmetric preconditioner which is expected to minimize the interprocessor communication due to the blocking. We implemented the results on the CRAY-T3E with 128 nodes. The MPI (Message Passing Interface) library was adopted for the interprocessor communications. The test problem was drawn from the discretizations of partial differential equations by finite difference methods. The results show that for small number of processors Multi-Color ILU(0) has the best performance, while for large number of processors Multi-Color Block SSOR performs the best.

• Journal of the Chungcheong Mathematical Society
• /
• v.10 no.1
• /
• pp.57-70
• /
• 1997

In this paper two preconditioned GMRES and QMR methods are applied to the non-Hermitian system from the Petrov-Galerkin procedure for the Poisson equation and compared to each other. To our purpose the ILUT and the SSOR preconditioners are used.

• Journal of applied mathematics & informatics
• /
• v.30 no.3_4
• /
• pp.593-602
• /
• 2012

In this paper, we first introduce a special type of multisplitting method with different weighting scheme, and then we provide convergence results of multisplitting methods with different weighting schemes corresponding to both the AOR-like multisplitting and the SSOR-like multisplitting.

• Bulletin of the Korean Mathematical Society
• /
• v.49 no.5
• /
• pp.997-1006
• /
• 2012

In this paper, we study convergence of multisplitting methods with preweighting for solving a linear system whose coefficient matrix is an H-matrix corresponding to both the AOR multisplitting and the SSOR multisplitting. Numerical results are also provided to confirm theoretical results for the convergence of multisplitting methods with preweighting.