A class of optimized row projection methods for solving large nonsymmetric linear systems
From MaRDI portal
Publication:1612435
DOI10.1016/S0168-9274(01)00131-3zbMath1006.65029OpenAlexW2077466915MaRDI QIDQ1612435
M. C. Vacchino, M. T. Guardarucci, H. D. Scolnik, Nélida E. Echebest
Publication date: 22 August 2002
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0168-9274(01)00131-3
quadratic programmingparallel computinglarge nonsymmetric linear systemsrow projection methodsprojected aggregation method
Applications of mathematical programming (90C90) Quadratic programming (90C20) Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05)
Related Items
Enhancement of the Kaczmarz algorithm with projection adjustment ⋮ On the incomplete oblique projections method for solving box constrained least squares problems ⋮ Iterative method for solving the linear feasibility problem ⋮ Incomplete oblique projections for solving large inconsistent linear systems ⋮ Implicit regularization of the incomplete oblique projections method ⋮ Incomplete alternating projection method for large inconsistent linear systems ⋮ Projection methods in Krylov subspaces ⋮ An accelerated iterative method with diagonally scaled oblique projections for solving linear feasibility problems ⋮ A class of optimized row projection methods for solving large nonsymmetric linear systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parallel application of block-iterative methods in medical imaging and radiation therapy
- A class of optimized row projection methods for solving large nonsymmetric linear systems
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
- On certain iterative methods for solving linear systems
- Conjugate Gradient-Like Algorithms for Solving Nonsymmetric Linear Systems
- Row Projection Methods for Large Nonsymmetric Linear Systems
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Parallel Projected Aggregation Methods for Solving the Convex Feasibility Problem
- The method of projections for finding the common point of convex sets