On rank-one corrections of complex symmetric matrices
Zapiski Nauchnykh Seminarov POMI, Computational methods and algorithms. Part XIX, Tome 334 (2006), pp. 78-83
Citer cet article
Voir la notice du chapitre de livre provenant de la source Math-Net.Ru
Let a matrix $A\in M_n(\mathbf C)$ be a rank-one perturbation of a complex symmetric matrix, i.e. $A=X+Y$ for some unknown matrices $X$ and $Y$ such that $X=X^T$ and $\mathrm{rank}\,Y=1$. The problem of determining the matrices $X$ and $Y$ is solved.
[1] M. Dana, Kh. D. Ikramov, “O malorangovykh korrektsiyakh ermitovykh i unitarnykh matrits”, Zh. vychisl. matem. matem. fiz., 44 (2004), 1331–1345 | MR | Zbl
[2] T. Barth, T. Manteuffel, “Multiple recursion conjugate gradient algorithms. I: Sufficient conditions”, SIAM J. Matrix Analys. Appl., 21 (2000), 768–796 | DOI | MR | Zbl
[3] A. Bunse-Gerstner, R. Stover, “On a conjugate gradient-type method for solving complex symmetric linear systems”, Linear Algebra Appl., 287 (1999), 105–123 | DOI | MR | Zbl
[4] R. Khorn, Ch. Dzhonson, Matrichnyi analiz, Mir, M., 1990 | MR