Error Estimates for the Solution of Linear Systems
Let Ax=b be a system of linear equations where A is a square and nonsingular matrix. When solving it by a direct or an iterative method, an approximate solution x* is obtained (x* denotes the current...
Let Ax=b be a system of linear equations where A is a square and nonsingular matrix. When solving it by a direct or an iterative method, an approximate solution x* is obtained (x* denotes the current...
A Restricted Additive Schwarz Preconditioner for General Sparse Linear Systems
We introduce some cheaper and faster variants of the classical additive Schwarz preconditioner (AS) for general sparse linear systems and show, by numerical examples, that the new methods are superio...
We introduce some cheaper and faster variants of the classical additive Schwarz preconditioner (AS) for general sparse linear systems and show, by numerical examples, that the new methods are superio...
You are not logged in to this journal. Log in
On Updating Problems in Latent Semantic Indexing
SIAM J. Sci. Comput. Volume 21, Issue 2, pp. 782-791 (1999)
Issue Date: 1999
Connotea
CiteULike
del.icio.us
BibSonomy
We develop new SVD-updating algorithms for three types of updating problems arising from latent semantic indexing (LSI) for information retrieval to deal with rapidly changing text document collections. We also provide theoretical justification for using a reduced-dimension representation of the original document collection in the updating process. Numerical experiments using several standard text document collections show that the new algorithms give higher (interpolated) average precisions than the existing algorithms, and the retrieval accuracy is comparable to that obtained using the complete document collection.
©1999 Society for Industrial and Applied Mathematics| Permalink: | http://dx.doi.org/10.1137/S1064827597329266 |
KEYWORDS and AMS
15A06, 15A18, 65A15
PUBLICATION DATA
1064-8275 (print)
1095-7197 (online)
SIAM