Abstract
We consider the iterative solution of symmetric positive-definite linear systems whose coefficient matrix may be expressed as the outer product of low-rank terms. We derive suitable preconditioners for such systems, and demonstrate their effectiveness on a number of test examples. We also consider combining these methods with existing techniques to cope with the commonly-occuring case where the coefficient matrix is the linear sum of elements, some of which are of very low rank. Copyright © 1999 John Wiley & Sons, Ltd.
Author supplied keywords
Cite
CITATION STYLE
Daydé, M. J., Décamps, J. P., & Gould, N. I. M. (1999). Subspace-by-subspace Preconditioners for Structured Linear Systems. Numerical Linear Algebra with Applications, 6(3), 213–234. https://doi.org/10.1002/(SICI)1099-1506(199904/05)6:3<213::AID-NLA161>3.0.CO;2-V
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.