## Abstract

It is often necessary to filter out an eigenspace of a given matrix A before performing certain computations with it. The eigenspace usually corresponds to undesired eigenvalues in the underlying application. One such application is in information retrieval, where the method of latent semantic indexing replaces the original matrix with a lower-rank one using tools based on the singular value decomposition. Here the low-rank approximation to the original matrix is used to analyze similarities with a given query vector. Filtering has the effect of yielding the most relevant part of the desired solution while discarding noise and redundancies in the underlying problem. Another common application is to compute an invariant subspace of a symmetric matrix associated with eigenvalues in a given interval. In this case, it is necessary to filter out eigenvalues that are not in the interval of the wanted eigenvalues. This paper presents a few conjugate gradient-like methods to provide solutions to these types of problems by iterative procedures which utilize only matrix-vector products.

Original language | English (US) |
---|---|

Pages (from-to) | 845-870 |

Number of pages | 26 |

Journal | SIAM Journal on Matrix Analysis and Applications |

Volume | 28 |

Issue number | 3 |

DOIs | |

State | Published - 2006 |

### Bibliographical note

Funding Information:This work was supported by NIH Grant AM 28236. I am grateful to Ms. Gay Blackwell for patiently typing the manuscript and Dr. N. C. Adragna and Dr. D. K. Smith for carefully editing it, and I thank Drs. P. B. Dunham, J. Gargus, M. Haas, T. J. McManus, N. Owen, J. Russell, C. L. Slayman, and P. DeWeer for permitting me to quote in advance from their work in press.

## Keywords

- Conjugate gradient
- Conjugate residual
- Interior eigenvalues
- Polynomial filtering
- Principal component analysis