On structure-oriented hybrid two-stage iteration methods for the large and sparse blocked system of linear equations
type: Item
instance of: scholarly article
title: On structure-oriented hybrid two-stage iteration methods for the large and sparse blocked system of linear equations
zbMATH Open document ID: 1194.65057
author: Yi Zheng
author: Wenbin Guo
author: Jianli Zhao
author: Nan Wang
published in: Journal of Computational and Applied Mathematics
publication date: 2010-06-22T00:00:00Z
Mathematics Subject Classification ID: 65F10
Mathematics Subject Classification ID: 65F50
zbMATH DE Number: 5724556
zbMATH Keywords: two-stage iteration method
zbMATH Keywords: saddle point problem
zbMATH Keywords: convergence
zbMATH Keywords: matrix multisplitting
zbMATH Keywords: classical Uzawa method
zbMATH Keywords: large and sparse blocked system of linear equations
zbMATH Keywords: numerical experiments
MaRDI profile type: Publication
full work available at URL: j.cam.2010.03.017
OpenAlex ID: W2015745524
cites work: A class of parallel hybrid two-stage iteration methods for block bordered linear systems
cites work: Convergence conditions for splitting iteration methods for non-Hermitian linear systems
cites work: Generalized multisplitting asynchronous iteration
cites work: Models of parallel chaotic iteration methods
cites work: On the convergence of the parallel multisplitting AOR algorithm
cites work: Accelerated Overrelaxation Method
cites work: On the convergence of some generalized iterative methods
cites work: Convergence of parallel multisplitting iterative methods for M-matrices
cites work: Convergence of nested classical iterative methods for linear systems
cites work: Multi-Splittings of Matrices and Parallel Solution of Linear Systems
cites work: Two-Stage and Multisplitting Methods for the Parallel Solution of Linear Systems
cites work: A CLASS OF ASYNCHRONOUS PARALLEL MATRIX MULTISPLITTING RELAXATION METHODS
cites work: On local Hermitian and skew-Hermitian splitting iteration methods for generalized saddle point problems
cites work: On generalized successive overrelaxation methods for augmented linear systems
cites work: On parameterized inexact Uzawa methods for generalized saddle point problems
cites work: Analysis of the Inexact Uzawa Algorithm for Saddle Point Problems
cites work: Uzawa type algorithms for nonsymmetric saddle point problems
cites work: Hermitian and Skew-Hermitian Splitting Methods for Non-Hermitian Positive Definite Linear Systems
cites work: A Preconditioner for Generalized Saddle Point Problems
cites work: Restrictively preconditioned conjugate gradient methods for systems of linear equations
cites work: Q5448146
cites work: Q4947421
cites work: Matrix computation and the theory of moments
cites work: Eigenvalues of rank-one updated matrices with some applications
cites work: Limits for the characteristic roots of a matrix. IV. Applications to stochastic matrices
cites work: Fast QR Eigenvalue Algorithms for Hessenberg Matrices Which Are Rank‐One Perturbations of Unitary Matrices
cites work: Constraint-Style Preconditioners for Regularized Saddle Point Problems
cites work: Eigenvalues and Jordan canonical form of a successively rank-one updated complex matrix with applications to Google's PageRank problem
DOI: 10.1016/J.CAM.2010.03.017
description: scientific article; zbMATH DE number 5724556