Parallel Quasi-chebyshev Acceleration to Nonoverlapping Multisplitting Iterative Methods Based on Optimization
نویسندگان
چکیده
In this paper, we present a parallel quasi-Chebyshev acceleration applied to the nonoverlapping multisplitting iterative method for the linear systems when the coefficient matrix is either an H-matrix or a symmetric positive definite matrix. First, m parallel iterations are implemented in m different processors. Second, based on l1-norm or l2-norm, the m optimization models are parallelly treated in m different processors. The convergence theories are established for the parallel quasi-Chebyshev accelerated method. Finally, the numerical examples show that the parallel quasi-Chebyshev technique can significantly accelerate the nonoverlapping multisplitting iterative method. Mathematics subject classification: 65F10, 65F50, 15A06.
منابع مشابه
CHEBYSHEV ACCELERATION TECHNIQUE FOR SOLVING FUZZY LINEAR SYSTEM
In this paper, Chebyshev acceleration technique is used to solve the fuzzy linear system (FLS). This method is discussed in details and followed by summary of some other acceleration techniques. Moreover, we show that in some situations that the methods such as Jacobi, Gauss-Sidel, SOR and conjugate gradient is divergent, our proposed method is applicable and the acquired results are illustrate...
متن کاملModified parallel multisplitting iterative methods for non-Hermitian positive definite systems
In this paper we present three modified parallel multisplitting iterative methods for solving non-Hermitian positive definite systems Ax = b . The first is a direct generalization of the standard parallel multisplitting iterative method for solving this class of systems. The other two are the iterative methods obtained by optimizing the weighting matrices based on the sparsity of the coefficien...
متن کاملGRPM-style methods and comparisons of convergent and divergent rates
Relaxed technique is one of techniques for improving convergence rate of splitting iterative methods. Based on local relaxed method and system relaxed method of parallel multisplitting Frommer andMayer [A. Frommer, G. Mayer, Convergence of relaxed parallel multisplitting methods, Linear Algebra Appl. 119 (1989) 141–152], we give the global relaxed parallel multisplitting (GRPM) method by introd...
متن کاملNon - Stationary Parallel Multisplitting Aor Methods ∗
Non-stationary parallel multisplitting iterative methods based on the AOR method are studied for the solution of nonsingular linear systems. Convergence of the synchronous and asyn-chronous versions of these methods is studied for H–matrices. Furthermore, computational results about these methods on both shared and distributed memory multiprocessors are discussed. The numerical examples present...
متن کاملNon-stationary Parallel Multisplitting Two-Stage Iterative Methods with Self-AdaptiveWeighting Schemes
In this paper, we study the non-stationary parallel multisplitting two-stage iterative methods with selfadaptive weighting matrices for solving a linear system whose coefficient matrix is symmetric positive definite. Two choices of Self-adaptive weighting matrices are given, especially, the nonnegativity is eliminated. Moreover, we prove the convergence of the non-stationary parallel multisplit...
متن کامل