An inexact parallel splitting augmented Lagrangian method for large system of linear equations
type: Item
instance of: scholarly article
title: An inexact parallel splitting augmented Lagrangian method for large system of linear equations
zbMATH Open document ID: 1210.65081
author: Zheng Peng
author: Donghua Wu
published in: Applied Mathematics and Computation
publication date: 2010-05-21T00:00:00Z
review text: The authors propose a new iterative method for solving systems of linear equations -- the inexact parallel splitting augmented Lagrangian method. This method decomposes the cost of computational loads to each of the processors which participate in solving the problem and at the same time it can avoid the inverse matrix operator such that the complexity of each iteration is \({\mathcal{O}}(n^2)\) in theory and practice.
reviewed by: Constantin Popa
Mathematics Subject Classification ID: 65F10
Mathematics Subject Classification ID: 65Y05
Mathematics Subject Classification ID: 65Y20
zbMATH DE Number: 5710902
zbMATH Keywords: system of linear equations
zbMATH Keywords: matrix decomposition
zbMATH Keywords: iterative method
zbMATH Keywords: inexact parallel splitting augmented Lagrangian method
zbMATH Keywords: complexity
MaRDI profile type: Publication
full work available at URL: j.amc.2010.03.018
OpenAlex ID: W2027317352
cites work: Numerical Linear Algebra
cites work: Q4485695
cites work: A Unified Proof for the Convergence of Jacobi and Gauss–Seidel Methods
cites work: On inexact Hermitian and skew-Hermitian splitting methods for non-Hermitian positive definite linear systems
cites work: Convergence conditions for splitting iteration methods for non-Hermitian linear systems
cites work: On the convergence of additive and multiplicative splitting iterations for systems of linear equations
cites work: On the convergence of parallel nonstationary multisplitting iteration methods.
cites work: A unified framework for the construction of various matrix multisplitting iterative methods for large sparse system of linear equations
cites work: Models of asynchronous parallel matrix multisplitting relaxed iterations
cites work: A class of parallel decomposition-type relaxation methods for large sparse systems of linear equations
cites work: A CLASS OF ASYNCHRONOUS PARALLEL MATRIX MULTISPLITTING RELAXATION METHODS
cites work: New convergence results for alternating methods
cites work: Accelerated Overrelaxation Method
cites work: Convergence of relaxed parallel multisplitting methods
cites work: Convergence of parallel multisplitting iterative methods for M-matrices
cites work: A new method for a class of linear variational inequalities
cites work: Solution and applications of a class of general linear variational inequalities
cites work: Q3995612
cites work: Application of the alternating direction method of multipliers to separable convex programming problems
cites work: Parallel splitting augmented Lagrangian methods for monotone structured variational inequalities
cites work: Q3517221
DOI: 10.1016/J.AMC.2010.03.018
description: scientific article; zbMATH DE number 5710902