Incomplete oblique projections for solving large inconsistent linear systems

The authors introduced in previously published papers acceleration schemes for Projected Aggregation Methods (PAM), aiming at solving consistent linear systems of equalities and inequalities. They have used the basic idea of forcing each iterate to belong to the aggregate hyperplane generated in the...

Descripción completa

Guardado en:
Detalles Bibliográficos
Publicado: 2008
Materias:
Acceso en línea:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_00255610_v111_n1-2_p273_Scolnik
http://hdl.handle.net/20.500.12110/paper_00255610_v111_n1-2_p273_Scolnik
Aporte de:
id paper:paper_00255610_v111_n1-2_p273_Scolnik
record_format dspace
spelling paper:paper_00255610_v111_n1-2_p273_Scolnik2023-06-08T14:53:11Z Incomplete oblique projections for solving large inconsistent linear systems Incomplete projections Inconsistent system Projected Aggregation Methods Algorithms Convergence of numerical methods Iterative methods Least squares approximations Matrix algebra Problem solving Incomplete projections Inconsistent system Linear equalities Projected Aggregation Methods (PAM) Linear systems The authors introduced in previously published papers acceleration schemes for Projected Aggregation Methods (PAM), aiming at solving consistent linear systems of equalities and inequalities. They have used the basic idea of forcing each iterate to belong to the aggregate hyperplane generated in the previous iteration. That scheme has been applied to a variety of projection algorithms for solving systems of linear equalities or inequalities, proving that the acceleration technique can be successfully used for consistent problems. The aim of this paper is to extend the applicability of those schemes to the inconsistent case, employing incomplete projections onto the set of solutions of the augmented system Ax - r = b. These extended algorithms converge to the least squares solution. For that purpose, oblique projections are used and, in particular, variable oblique incomplete projections are introduced. They are defined by means of matrices that penalize the norm of the residuals very strongly in the first iterations, decreasing their influence with the iteration counter in order to fulfill the convergence conditions. The theoretical properties of the new algorithms are analyzed, and numerical experiences are presented comparing their performance with several well-known projection methods. © Springer-Verlag 2007. 2008 https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_00255610_v111_n1-2_p273_Scolnik http://hdl.handle.net/20.500.12110/paper_00255610_v111_n1-2_p273_Scolnik
institution Universidad de Buenos Aires
institution_str I-28
repository_str R-134
collection Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA)
topic Incomplete projections
Inconsistent system
Projected Aggregation Methods
Algorithms
Convergence of numerical methods
Iterative methods
Least squares approximations
Matrix algebra
Problem solving
Incomplete projections
Inconsistent system
Linear equalities
Projected Aggregation Methods (PAM)
Linear systems
spellingShingle Incomplete projections
Inconsistent system
Projected Aggregation Methods
Algorithms
Convergence of numerical methods
Iterative methods
Least squares approximations
Matrix algebra
Problem solving
Incomplete projections
Inconsistent system
Linear equalities
Projected Aggregation Methods (PAM)
Linear systems
Incomplete oblique projections for solving large inconsistent linear systems
topic_facet Incomplete projections
Inconsistent system
Projected Aggregation Methods
Algorithms
Convergence of numerical methods
Iterative methods
Least squares approximations
Matrix algebra
Problem solving
Incomplete projections
Inconsistent system
Linear equalities
Projected Aggregation Methods (PAM)
Linear systems
description The authors introduced in previously published papers acceleration schemes for Projected Aggregation Methods (PAM), aiming at solving consistent linear systems of equalities and inequalities. They have used the basic idea of forcing each iterate to belong to the aggregate hyperplane generated in the previous iteration. That scheme has been applied to a variety of projection algorithms for solving systems of linear equalities or inequalities, proving that the acceleration technique can be successfully used for consistent problems. The aim of this paper is to extend the applicability of those schemes to the inconsistent case, employing incomplete projections onto the set of solutions of the augmented system Ax - r = b. These extended algorithms converge to the least squares solution. For that purpose, oblique projections are used and, in particular, variable oblique incomplete projections are introduced. They are defined by means of matrices that penalize the norm of the residuals very strongly in the first iterations, decreasing their influence with the iteration counter in order to fulfill the convergence conditions. The theoretical properties of the new algorithms are analyzed, and numerical experiences are presented comparing their performance with several well-known projection methods. © Springer-Verlag 2007.
title Incomplete oblique projections for solving large inconsistent linear systems
title_short Incomplete oblique projections for solving large inconsistent linear systems
title_full Incomplete oblique projections for solving large inconsistent linear systems
title_fullStr Incomplete oblique projections for solving large inconsistent linear systems
title_full_unstemmed Incomplete oblique projections for solving large inconsistent linear systems
title_sort incomplete oblique projections for solving large inconsistent linear systems
publishDate 2008
url https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_00255610_v111_n1-2_p273_Scolnik
http://hdl.handle.net/20.500.12110/paper_00255610_v111_n1-2_p273_Scolnik
_version_ 1768543834349764608