Improved bounds for the recursion width in congruent type methods for solving systems of linear equations
Zapiski Nauchnykh Seminarov POMI, Computational methods and algorithms. Part XXII, Tome 367 (2009), pp. 33-44
Voir la notice de l'article provenant de la source Math-Net.Ru
The iterative method MINRES-CN is examined as a tool for solving systems of linear equations whose coefficient matrices are low-rank perturbations of symmetric and conjugate-normal matrices. Certain possibilities of improving a priori bounds for the recursion width in this method are indicated. Bibl. – 11 titles.
@article{ZNSL_2009_367_a3,
author = {Kh. D. Ikramov},
title = {Improved bounds for the recursion width in congruent type methods for solving systems of linear equations},
journal = {Zapiski Nauchnykh Seminarov POMI},
pages = {33--44},
publisher = {mathdoc},
volume = {367},
year = {2009},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ZNSL_2009_367_a3/}
}
TY - JOUR AU - Kh. D. Ikramov TI - Improved bounds for the recursion width in congruent type methods for solving systems of linear equations JO - Zapiski Nauchnykh Seminarov POMI PY - 2009 SP - 33 EP - 44 VL - 367 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/ZNSL_2009_367_a3/ LA - ru ID - ZNSL_2009_367_a3 ER -
Kh. D. Ikramov. Improved bounds for the recursion width in congruent type methods for solving systems of linear equations. Zapiski Nauchnykh Seminarov POMI, Computational methods and algorithms. Part XXII, Tome 367 (2009), pp. 33-44. http://geodesic.mathdoc.fr/item/ZNSL_2009_367_a3/