A unified framework for the construction of various matrix multisplitting iterative methods for large sparse system of linear equations

From MaRDI portal

Publication:679294

Jump to:navigation, search

DOI10.1016/S0898-1221(96)00207-6zbMath0870.65025OpenAlexW2018561210MaRDI QIDQ679294

Jiachang Sun, Deren Wang, Zhong Zhi Bai

Publication date: 2 September 1997

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0898-1221(96)00207-6

zbMATH Keywords

convergence divergence relaxation method large sparse system parallel matrix multisplitting iterative methods

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05)

Related Items (69)

Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods ⋮ On the convergence of additive and multiplicative splitting iterations for systems of linear equations ⋮ Product-type skew-Hermitian triangular splitting iteration methods for strongly non-Hermitian positive definite linear systems ⋮ Convergence improvement of relaxed multisplitting USAOR methods for \(H\)-matrices linear systems ⋮ On the convergence of a new splitting iterative method for non-Hermitian positive definite linear systems ⋮ Parallel multisplitting methods with optimal weighting matrices for linear systems ⋮ Inexact multisplitting methods for linear complementarity problems ⋮ Convergence of waveform relaxation methods for Hermitian positive definite linear systems ⋮ Modified modulus‐based matrix splitting iteration methods for linear complementarity problems ⋮ New subclasses of block \(H\)-matrices with applications to parallel decomposition-type relaxation methods ⋮ A relaxed two-step splitting iteration method for computing PageRank ⋮ Practical convergent splittings and acceleration methods for non-Hermitian positive definite linear systems ⋮ The modified matrix splitting iteration method for computing PageRank problem ⋮ A globally convergent Newton-GMRES method for large sparse systems of nonlinear equations ⋮ Modulus-based synchronous multisplitting iteration methods for linear complementarity problems ⋮ Multisplitting iteration schemes for solving a class of nonlinear complementarity problems ⋮ Convergence theorems for block splitting iterative methods for linear systems ⋮ Modified quasi-Chebyshev acceleration to nonoverlapping parallel multisplitting method ⋮ A comparison of the Newton-Krylov method with high order Newton-like methods to solve nonlinear systems ⋮ Modulus-based synchronous multisplitting iteration methods without auxiliary variable for solving vertical linear complementarity problems ⋮ Modulus-based synchronous two-stage multisplitting iteration methods for linear complementarity problems ⋮ A preconditioned modulus-based matrix multisplitting block iteration method for the linear complementarity problems with Toeplitz matrix ⋮ Weight splitting iteration methods to solve quadratic nonlinear matrix equation \(MY^2+NY+P=0\) ⋮ Modulus-based synchronous multisplitting iteration methods for large sparse vertical linear complementarity problems ⋮ IGAOR and multisplitting IGAOR methods for linear complementarity problems ⋮ On hybrid preconditioning methods for large sparse saddle-point problems ⋮ On the convergence of parallel nonstationary multisplitting iteration methods. ⋮ On nonsingularity of block two-by-two matrices ⋮ Modulus-based Synchronous Multisplitting Iteration Methods for an Implicit Complementarity Problem ⋮ Modified parallel multisplitting iterative methods for non-Hermitian positive definite systems ⋮ Several relaxed iteration methods for computing PageRank ⋮ A two-step matrix splitting iteration for computing PageRank ⋮ Modulus-based matrix splitting iteration methods for a class of nonlinear complementarity problem ⋮ Parallel multisplitting iteration methods based on M-splitting for the PageRank problem ⋮ Preconditioned parallel multisplitting USAOR method for \(H\)-matrices linear systems ⋮ Convergence conditions for splitting iteration methods for non-Hermitian linear systems ⋮ Local convergence of Newton-HSS methods with positive definite Jacobian matrices under generalized conditions ⋮ A modified modulus method for symmetric positive-definite linear complementarity problems ⋮ Two-stage multisplitting iteration methods using modulus-based matrix splitting as inner iteration for linear complementarity problems ⋮ A parallel multisplitting method with self-adaptive weightings for solving \(H\)-matrix linear systems ⋮ On \(m\)-step Hermitian and skew-Hermitian splitting preconditioning methods ⋮ An iteration method for solving the linear system \(Ax=b\) ⋮ The general inner-outer iteration method based on regular splittings for the PageRank problem ⋮ An inexact parallel splitting augmented Lagrangian method for large system of linear equations ⋮ Two class of synchronous matrix multisplitting schemes for solving linear complementarity problems ⋮ Convergences of splitting iterative methods for symmetric indefinite linear systems ⋮ Generalizations of the nonstationary multisplitting iterative method for symmetric positive definite linear systems ⋮ Asynchronous multisplitting iteration with different weighting schemes ⋮ On parameterized block triangular preconditioners for generalized saddle point problems ⋮ Motivations and realizations of Krylov subspace methods for large sparse linear systems ⋮ On the convergence of nonstationary multisplitting two-stage iteration methods for Hermitian positive definite linear systems ⋮ Synchronous and asynchronous multisplitting iteration schemes for solving mixed linear complementarity problems with \(H\)-matrices ⋮ A wider convergence area for the MSTMAOR iteration methods for LCP ⋮ Modulus-based matrix splitting methods for horizontal linear complementarity problems ⋮ On the parallel GSAOR method for block diagonally dominant matrices ⋮ Preconditioned AOR iterative methods for \(M\)-matrices ⋮ Optimization of the parameterized Uzawa preconditioners for saddle point matrices ⋮ The spectral analysis of the matrix multisplitting method for the one-dimensional model problem ⋮ A class of asynchronous multisplitting two-stage iterations for large sparse block systems of weakly nonlinear equations ⋮ Modulus-based matrix splitting iteration methods for linear complementarity problems ⋮ Error Control Based on the Novel Proof of Convergence of the MSMAOR Methods for the LCP ⋮ A class of asynchronous parallel iterations for the systems of nonlinear algebraic equations ⋮ A general multi-splitting iteration method for computing PageRank ⋮ Chaotic iterative methods for the linear complementarity problems ⋮ Parallel multisplitting two-stage iterative methods with general weighting matrices for non-symmetric positive definite systems ⋮ On convergence of splitting iteration methods for non-Hermitian positive-definite linear systems ⋮ Convergence theorems for parallel multisplitting two-stage iterative methods for mildly nonlinear systems ⋮ New convergence proofs of modulus-based synchronous multisplitting iteration methods for linear complementarity problems ⋮ Asynchronous multisplitting relaxation methods for linear complementarity problems

Cites Work

This page was built for publication: A unified framework for the construction of various matrix multisplitting iterative methods for large sparse system of linear equations

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:679294&oldid=12584917"