Abstract:In this paper we propose some parallel multisplitting methods for solving consistent symmetric positive semidefinite linear systems, based on modified diagonally compensated reduction. The semiconvergence of the parallel multisplitting method is discussed. The results here generalize some known results for the nonsingular linear systems to the singular systems. It is well known that if B is nonsingular, then a splitting B = M − N is convergent if and only if (M −1 N )<1. However, for the singular matrix B we h… Show more
“…In 14, we give a modified diagonal compensated reduction method, which is analogous to the method of diagonal compensated reduction proposed in 13.…”
Section: Semiconvergence Of Parallel Multisplittingsmentioning
confidence: 99%
“…In 13 a diagonally compensated reduction method for singular systems is proposed. Recently, we present in 14 a modified diagonal compensated reduction method. Using this idea, we investigate semiconvergence of the parallel multisplitting method.…”
In this paper we construct some parallel relaxed multisplitting methods for solving consistent symmetric positive semidefinite linear systems, based on modified diagonally compensated reduction and incomplete factorizations. The semiconvergence of the parallel multisplitting method, relaxed multisplitting method and relaxed two-stage multisplitting method are discussed. The results generalize some well-known results for the nonsingular linear systems to the singular systems.
“…In 14, we give a modified diagonal compensated reduction method, which is analogous to the method of diagonal compensated reduction proposed in 13.…”
Section: Semiconvergence Of Parallel Multisplittingsmentioning
confidence: 99%
“…In 13 a diagonally compensated reduction method for singular systems is proposed. Recently, we present in 14 a modified diagonal compensated reduction method. Using this idea, we investigate semiconvergence of the parallel multisplitting method.…”
In this paper we construct some parallel relaxed multisplitting methods for solving consistent symmetric positive semidefinite linear systems, based on modified diagonally compensated reduction and incomplete factorizations. The semiconvergence of the parallel multisplitting method, relaxed multisplitting method and relaxed two-stage multisplitting method are discussed. The results generalize some well-known results for the nonsingular linear systems to the singular systems.
“…Later, this technique was further studied by many authors; see e.g. [3], [14], [15], [23], [34], [35], [37], [16], [7], [8], [22], [12], [27], [28], [29], [20], [9], [39], [40], [41] [32], [33], [10], etc.…”
mentioning
confidence: 99%
“…Conditions on the splittings (1.2) and on the weighting matrices which ensure the convergence of Algorithm 1.1 in some important cases where given by O'Leary and White [24], Nabben [22], Neumann and Plemmons [23], Frommer et al [14], [15], Song et al [27], [28], [29], Li et el [20], Hadjidimos and Yeyios [16], Cao and Song [7], etc. They showed that Algorithm 1.1 (semi)converges when • A is Hermitian (or symmetric) positive definite and the splittings (1.2) are P −regular; • A is monotone and the splittings (1.2) are (weak) regular;…”
To solve non-Hermitian linear system Ax = b on parallel and vector machines, some paralell multisplitting methods are considered. In this work, in particular: i) We establish the convergence results of the paralell multisplitting methods, together with its relaxed version, some of which can be regarded as generalizations of analogous results for the Hermitian positive definite case; ii) We extend the positive-definite and skew-Hermitian splitting (PSS) method methods in [SIAM J. Sci. Comput., 26:844-863, 2005] to the parallel PSS methods and propose the corresponding convergence results.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.