http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
ON A SPLITTING PRECONDITIONER FOR SADDLE POINT PROBLEMS
SALKUYEH, DAVOD KHOJASTEH,ABDOLMALEKI, MARYAM,KARIMI, SAEED The Korean Society for Computational and Applied M 2018 Journal of applied mathematics & informatics Vol.36 No.5
Cao et al. in (Numer. Linear. Algebra Appl. 18 (2011) 875-895) proposed a splitting method for saddle point problems which unconditionally converges to the solution of the system. It was shown that a Krylov subspace method like GMRES in conjunction with the induced preconditioner is very effective for the saddle point problems. In this paper we first modify the iterative method, discuss its convergence properties and apply the induced preconditioner to the problem. Numerical experiments of the corresponding preconditioner are compared to the primitive one to show the superiority of our method.
ON A SPLITTING PRECONDITIONER FOR SADDLE POINT PROBLEMS
Davod Khojasteh Salkuyeh,MARYAM ABDOLMALEKI,SAEED KARIMI 한국전산응용수학회 2018 Journal of applied mathematics & informatics Vol.36 No.5
Cao et al. in (Numer. Linear. Algebra Appl. 18 (2011) 875-895) proposed a splitting method for saddle point problems which un- conditionally converges to the solution of the system. It was shown that a Krylov subspace method like GMRES in conjunction with the induced preconditioner is very eective for the saddle point problems. In this paper we rst modify the iterative method, discuss its convergence properties and apply the induced preconditioner to the problem. Numerical experiments of the corresponding preconditioner are compared to the primitive one to show the superiority of our method.