A class of optimized row projection methods for solving large nonsymmetric linear systems

  • Authors:
  • H. Scolnik;N. Echebest;M. T. Guardarucci;M. C. Vacchino

  • Affiliations:
  • Departamento de Computación, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires, Buenos Aires, Argentina;Departamento de Matemática, Universidad de La Plata, Buenos Aires, Argentina;Departamento de Matemática, Universidad de La Plata, Buenos Aires, Argentina;Departamento de Matemática, Universidad de La Plata, Buenos Aires, Argentina

  • Venue:
  • Applied Numerical Mathematics
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present in this paper optimal and accelerated row projection algorithms arising from the use of quadratic programming, that allow us to define the iterate xk+1 as the projection of xk onto a hyperplane which minimizes its distance to the solution x*. These algorithms also use a novel partition strategy into blocks based on sequential estimations of their condition numbers.