CONVERGENCE OF MULTISPLITTING METHODS WITH PREWEIGHTING FOR AN H-MATRIX
نویسندگان
چکیده
منابع مشابه
A parallel multisplitting method with self-adaptive weightings for solving H-matrix linear systems
In this paper, a parallel multisplitting iterative method with the self-adaptive weighting matrices is presented for the linear system of equations when the coefficient matrix is an H-matrix. The zero pattern in weighting matrices is determined in advance, while the non-zero entries of weighting matrices are determined by finding the optimal solution in a hyperplane of α points generated by the...
متن کاملConvergence analysis of the global FOM and GMRES methods for solving matrix equations $AXB=C$ with SPD coefficients
In this paper, we study convergence behavior of the global FOM (Gl-FOM) and global GMRES (Gl-GMRES) methods for solving the matrix equation $AXB=C$ where $A$ and $B$ are symmetric positive definite (SPD). We present some new theoretical results of these methods such as computable exact expressions and upper bounds for the norm of the error and residual. In particular, the obtained upper...
متن کاملConvergence of non-stationary parallel multisplitting methods for hermitian positive definite matrices
Non-stationary multisplitting algorithms for the solution of linear systems are studied. Convergence of these algorithms is analyzed when the coefficient matrix of the linear system is hermitian positive definite. Asynchronous versions of these algorithms are considered and their convergence investigated.
متن کاملdeterminant of the hankel matrix with binomial entries
abstract in this thesis at first we comput the determinant of hankel matrix with enteries a_k (x)=?_(m=0)^k??((2k+2-m)¦(k-m)) x^m ? by using a new operator, ? and by writing and solving differential equation of order two at points x=2 and x=-2 . also we show that this determinant under k-binomial transformation is invariant.
15 صفحه اولNonstationary Relaxed Multisplitting Methods for Solving Linear Complementarity Problems with H−matrices
In this paper we consider some non stationary relaxed synchronous and asynchronous multisplitting methods for solving the linear complementarity problems with their coefficient matrices being H−matrices. The convergence theorems of the methods are given,and the efficiency is shown by numerical tests.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Korean Mathematical Society
سال: 2012
ISSN: 1015-8634
DOI: 10.4134/bkms.2012.49.5.997