The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Large-Scale Sparse Singular Value Computations
Abstract
We present four numerical methods for computing the singular value decomposition (SVD) of large sparse matrices on a multiprocessor architecture. We emphasize Lanczos and subspace iteration-based methods for determining several of the largest singular triplets (singular values and corresponding left- and right-singular vectors) for sparse matrices arising from two practical applications: information retrieval and seismic reflection tomography. The target architectures for our implementations are the CRAY-2S/4–128 and Alliant FX/80. The sparse SVD problem is well motivated by recent information-retrieval techniques in which dominant singular values and their corresponding singular vectors of large sparse term-document matrices are desired, and by nonlinear inverse problems from seismic tomography applications which require approximate pseudo-inverses of large sparse Jacobian matrices. This research may help advance the development of future out-of-core sparse SVD methods, which can be used, for example, to handle extremely large sparse matrices 0 × (10 6) rows or columns associated with extremely large databases in query-based information-retrieval applications.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Indexing by latent semantic analysis
Deerwester, S., Dumais, S. T., Furnas, G. W., Landauer, T. K., & Harshman, R. (1990) · Journal of the American Society for Information Science · doi:10.1002/(sici)1097-4571(199009)41:6<391::aid-asi1>3.0.co;2-9 · Cited by 12,751
The algebraic eigenvalue problem
Wilkinson, J. H. (1965) · Cited by 5,833
Varga, R. S. (2000) · Springer Series in Computational Mathematics · doi:10.1007/978-3-642-05156-2 · Cited by 5,811
The Symmetric Eigenvalue Problem
Parlett, B. N. (1998) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971163 · Cited by 3,192
Introduction to linear and nonlinear programming
Luenberger, D. G. (1973) · Medical Entomology and Zoology · Cited by 1,915
Calculating the Singular Values and Pseudo-Inverse of a Matrix
Golub, G., & Kahan, W. (1965) · Journal of the Society for Industrial and Applied Mathematics Series B Numerical Analysis · doi:10.1137/0702016 · Cited by 1,786
Dongarra, J. J., Moler, C. B., Bunch, J. R., & Stewart, G. W. (1979) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971811 · Cited by 1,738
Lanczos Algorithms for Large Symmetric Eigenvalue Computations: Vol. I: Theory
Cullum, J. K., & Willoughby, R. A. (2002) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719192 · Cited by 1,291
An extended set of FORTRAN basic linear algebra subprograms
Dongarra, J. J., Du Croz, J., Hammarling, S., & Hanson, R. J. (1988) · ACM Transactions on Mathematical Software · doi:10.1145/42288.42291 · Cited by 887
Cited by
An introduction to latent semantic analysis
Landauer, T. K., Foltz, P. W., & Laham, D. (1998) · Discourse Processes · doi:10.1080/01638539809545028 · Cited by 4,880
The text mining handbook: advanced approaches in analyzing unstructured data
(2007) · Choice Reviews Online · doi:10.5860/choice.44-5684 · Cited by 1,598
Performance of recommender algorithms on top-n recommendation tasks
Cremonesi, P., Koren, Y., & Turrin, R. (2010) · Proceedings of the fourth ACM conference on Recommender systems · doi:10.1145/1864708.1864721 · Cited by 1,410
Random projection in dimensionality reduction: applications to image and text data
Bingham, E., & Mannila, H. (2001) · Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/502512.502546 · Cited by 1,274
Singular Value Decomposition and Principal Component Analysis
Wall, M. E., Rechtsteiner, A., & Rocha, L. M. (2005) · A Practical Approach to Microarray Data Analysis · doi:10.1007/0-306-47815-3_5 · Cited by 1,215
Metadata
- Authors
- Berry, M. W.
- Venue
- The International Journal of Supercomputing Applications
- Publisher
- SAGE Publications
- Published
- 1992-04
- Volume
- 6
- Issue
- 1
- Pages
- 13-49
- ISSN
- 0890-2720 (ISSN-L)
- OpenAlex
- W1918870341
- Cited by
- 402
- References
- 31
- FWCI
- 7.45
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Large-Scale Sparse Singular Value Computations. https://app.cochat.ai/papers/10.1177/109434209200600103
- The paper
- Berry, M. W. (1992). Large-Scale Sparse Singular Value Computations. The International Journal of Supercomputing Applications. https://doi.org/10.1177/109434209200600103
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.