A class of optimized row projection methods for solving large nonsymmetric linear systems
The optimal and the accelerated row projection methods for solving large nonsymmetric linear systems were discussed. These algorithms use a partition strategy into blocks based on sequential estimations of their condition numbers. These algorithms are extremely fast and efficient, but they do not co...
Guardado en:
Autores principales: | , , , |
---|---|
Formato: | JOUR |
Materias: | |
Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_01689274_v41_n4_p499_Scolnik |
Aporte de: |
id |
todo:paper_01689274_v41_n4_p499_Scolnik |
---|---|
record_format |
dspace |
spelling |
todo:paper_01689274_v41_n4_p499_Scolnik2023-10-03T15:06:47Z A class of optimized row projection methods for solving large nonsymmetric linear systems Scolnik, H. Echebest, N. Guardarucci, M.T. Vacchino, M.C. Parallel iterative methods Projected aggregate methods Row partition strategies Convergence of numerical methods Heuristic methods Linear systems Matrix algebra Optimization Parallel algorithms Partial differential equations Quadratic programming Vectors Projected aggregate methods (PAM) Row partition strategies Iterative methods The optimal and the accelerated row projection methods for solving large nonsymmetric linear systems were discussed. These algorithms use a partition strategy into blocks based on sequential estimations of their condition numbers. These algorithms are extremely fast and efficient, but they do not converge always. A block splitting algorithm which fulfills the conditions based on the sequential estimations of the condition numbers was also discussed. The performance of the projection methods was highly dependent on the way in which the rows of the matrix were split into blocks. JOUR info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by/2.5/ar http://hdl.handle.net/20.500.12110/paper_01689274_v41_n4_p499_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 |
Parallel iterative methods Projected aggregate methods Row partition strategies Convergence of numerical methods Heuristic methods Linear systems Matrix algebra Optimization Parallel algorithms Partial differential equations Quadratic programming Vectors Projected aggregate methods (PAM) Row partition strategies Iterative methods |
spellingShingle |
Parallel iterative methods Projected aggregate methods Row partition strategies Convergence of numerical methods Heuristic methods Linear systems Matrix algebra Optimization Parallel algorithms Partial differential equations Quadratic programming Vectors Projected aggregate methods (PAM) Row partition strategies Iterative methods Scolnik, H. Echebest, N. Guardarucci, M.T. Vacchino, M.C. A class of optimized row projection methods for solving large nonsymmetric linear systems |
topic_facet |
Parallel iterative methods Projected aggregate methods Row partition strategies Convergence of numerical methods Heuristic methods Linear systems Matrix algebra Optimization Parallel algorithms Partial differential equations Quadratic programming Vectors Projected aggregate methods (PAM) Row partition strategies Iterative methods |
description |
The optimal and the accelerated row projection methods for solving large nonsymmetric linear systems were discussed. These algorithms use a partition strategy into blocks based on sequential estimations of their condition numbers. These algorithms are extremely fast and efficient, but they do not converge always. A block splitting algorithm which fulfills the conditions based on the sequential estimations of the condition numbers was also discussed. The performance of the projection methods was highly dependent on the way in which the rows of the matrix were split into blocks. |
format |
JOUR |
author |
Scolnik, H. Echebest, N. Guardarucci, M.T. Vacchino, M.C. |
author_facet |
Scolnik, H. Echebest, N. Guardarucci, M.T. Vacchino, M.C. |
author_sort |
Scolnik, H. |
title |
A class of optimized row projection methods for solving large nonsymmetric linear systems |
title_short |
A class of optimized row projection methods for solving large nonsymmetric linear systems |
title_full |
A class of optimized row projection methods for solving large nonsymmetric linear systems |
title_fullStr |
A class of optimized row projection methods for solving large nonsymmetric linear systems |
title_full_unstemmed |
A class of optimized row projection methods for solving large nonsymmetric linear systems |
title_sort |
class of optimized row projection methods for solving large nonsymmetric linear systems |
url |
http://hdl.handle.net/20.500.12110/paper_01689274_v41_n4_p499_Scolnik |
work_keys_str_mv |
AT scolnikh aclassofoptimizedrowprojectionmethodsforsolvinglargenonsymmetriclinearsystems AT echebestn aclassofoptimizedrowprojectionmethodsforsolvinglargenonsymmetriclinearsystems AT guardaruccimt aclassofoptimizedrowprojectionmethodsforsolvinglargenonsymmetriclinearsystems AT vacchinomc aclassofoptimizedrowprojectionmethodsforsolvinglargenonsymmetriclinearsystems AT scolnikh classofoptimizedrowprojectionmethodsforsolvinglargenonsymmetriclinearsystems AT echebestn classofoptimizedrowprojectionmethodsforsolvinglargenonsymmetriclinearsystems AT guardaruccimt classofoptimizedrowprojectionmethodsforsolvinglargenonsymmetriclinearsystems AT vacchinomc classofoptimizedrowprojectionmethodsforsolvinglargenonsymmetriclinearsystems |
_version_ |
1807322993511104512 |