A class of optimized row projection methods for solving large nonsymmetric linear systems
type: Item
instance of: scholarly article
title: A class of optimized row projection methods for solving large nonsymmetric linear systems
zbMATH Open document ID: 1006.65029
DOI: 10.1016/S0168-9274(01)00131-3
author: M. T. Guardarucci
author: M. C. Vacchino
author: H. Scolnik
author: N. Echebest
published in: Applied Numerical Mathematics
publication date: 2002-08-22T00:00:00Z
review text: Purely theoretical paper on a projected aggregation method. A new search direction is determined to minimize the distance to the solution by the use of quadratic programming. An optimal row partitioning is defined. Numerical results will be published in another paper. So it is not possible to evaluate the merits of the new method.
Mathematics Subject Classification ID: 65F10
Mathematics Subject Classification ID: 65Y05
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 1787716
zbMATH Keywords: row projection methods
zbMATH Keywords: large nonsymmetric linear systems
zbMATH Keywords: parallel computing
zbMATH Keywords: projected aggregation method
zbMATH Keywords: quadratic programming
describes a project that uses: ITSOL
describes a project that uses: SPARSKIT
MaRDI profile type: Publication
cites work: Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
cites work: Q4868585
cites work: Row Projection Methods for Large Nonsymmetric Linear Systems
cites work: Parallel application of block-iterative methods in medical imaging and radiation therapy
cites work: Q4718793
cites work: Q4226179
cites work: Q3973671
cites work: Parallel Projected Aggregation Methods for Solving the Convex Feasibility Problem
cites work: The method of projections for finding the common point of convex sets
cites work: On certain iterative methods for solving linear systems
cites work: Conjugate Gradient-Like Algorithms for Solving Nonsymmetric Linear Systems
cites work: Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
full work available at URL: s0168-9274(01)00131-3
OpenAlex ID: W2077466915
Recommended article: Row Projection Methods for Large Nonsymmetric Linear Systems
Recommended article: A projection method for solving nonsymmetric linear systems on multiprocessors
Recommended article: On a class of row preconditioners for solving linear systems
Recommended article: Projection-minimization methods for nonsymmetric linear systems
Recommended article: Projected equation methods for approximate solution of large linear systems
Recommended article: A row relaxation method for large \(l_ 1\) problems
Recommended article: A Non-Krylov Subspace Method for Solving Large and Sparse Linear System of Equations
Recommended article: Q3643386
Recommended article: Row-Oriented Decomposition in Large-Scale Linear Optimization
Recommended article: On Row Relaxation Methods for Large Constrained Least Squares Problems
description: scientific article; zbMATH DE number 1787716