Journal article · 1986
Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices
SIAM Journal on Scientific and Statistical Computing, 7(3), 817–825 · Published 1 July 1986 · DOI 10.1137/0907054
In brief
“Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices” is a 1986 journal article by Ronald B. Morgan and David Sanborn Scott, published in SIAM Journal on Scientific and Statistical Computing. OpenAlex counts 170 citations as of 16 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.
- Citations
- 170
- Most cited in
- 2019 (7)
- Field-weighted impact
- 2.68
- References
- 6
- Authors
- 2
Abstract
This paper analyzes Davidson’s method for computing a few eigenpairs of large sparse symmetric matrices. An explanation is given for why Davidson’s method often performs well but occasionally performs very badly. Davidson’s method is then generalized to a method which offers a powerful way of applying preconditioning techniques developed for solving systems of linear equations… Read the full abstract at the publisher.
Excerpt. This paper is not open access.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Morgan, R. B., & Scott, D. S. (1986). Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices. SIAM Journal on Scientific and Statistical Computing, 7(3), 817–825. https://doi.org/10.1137/0907054
MLA 9
Morgan, Ronald B., and David Sanborn Scott. “Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices.” SIAM Journal on Scientific and Statistical Computing, vol. 7, no. 3, 1986, pp. 817–825. https://doi.org/10.1137/0907054.
Chicago
Morgan, Ronald B. and David Sanborn Scott. 1986. “Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices.” SIAM Journal on Scientific and Statistical Computing 7 (3): 817–825. https://doi.org/10.1137/0907054.
Harvard
Morgan, R. B. and Scott, D. S. (1986) ‘Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices’, SIAM Journal on Scientific and Statistical Computing, 7(3), pp. 817–825. doi:10.1137/0907054.
IEEE
R. B. Morgan and D. S. Scott, “Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices,” SIAM Journal on Scientific and Statistical Computing, vol. 7, no. 3, pp. 817–825, 1986, doi: 10.1137/0907054.
BibTeX
@article{morgan1986generalizations,
title = {{Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices}},
author = {Morgan, Ronald B. and Scott, David Sanborn},
journal = {SIAM Journal on Scientific and Statistical Computing},
year = {1986},
volume = {7},
number = {3},
pages = {817--825},
doi = {10.1137/0907054},
url = {https://doi.org/10.1137/0907054}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2017 | 5 | |
| 2018 | 3 | |
| 2019 | 7 | |
| 2020 | 5 | |
| 2021 | 4 | |
| 2022 | 2 | |
| 2023 | 2 | |
| 2024 | 2 | |
| 2025 | 3 | |
| 2026 | 6 |
Its field-weighted citation impact is 2.68: it has been cited 2.68 times as often as the average work of the same field, type and year (1.00 is the world average).
Topic and keywords
Physical Sciences › Computer Science › Computational Theory and Mathematics › Matrix Theory and Algorithms
- sparse symmetric matrices
- eigenvalue problem
- eigenvalues and eigenvectors
- preconditioning
- Krylov subspace methods
- large-scale linear algebra
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Morgan, R. B., & Scott, D. S. (1986). Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices. SIAM Journal on Scientific and Statistical Computing, 7(3), 817–825. https://doi.org/10.1137/0907054
How many times has this paper been cited?
170 times, according to OpenAlex on 16 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
OpenAlex records no free legal copy. Check your library's access, the authors' pages or a repository, or ask the corresponding author for a copy.
Who wrote this paper?
Ronald B. Morgan, David Sanborn Scott.
What is the DOI of this paper?
10.1137/0907054. The permanent link is https://doi.org/10.1137/0907054.
Bibliographic data from OpenAlex (CC0), last checked 16 November 2026. ResearchGuru does not host this paper; the links go to the publisher or the repository that does.