The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Augmented Implicitly Restarted Lanczos Bidiagonalization Methods
Open accessAbstract
New restarted Lanczos bidiagonalization methods for the computation of a few of the largest or smallest singular values of a large matrix are presented. Restarting is carried out by augmentation of Krylov subspaces that arise naturally in the standard Lanczos bidiagonalization method. The augmenting vectors are associated with certain Ritz or harmonic Ritz vectors. Computed examples show the new methods to be competitive with available schemes.
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. H., & Loan, C. F. V. (1996) · Johns Hopkins University Press eBooks · Cited by 6,027
Numerical Methods for Least Squares Problems
Björck, Å. (1996) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971484 · Cited by 3,257
Numerical methods for least squares problems
(1996) · Choice Reviews Online · doi:10.5860/choice.34-1602 · Cited by 3,007
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
Implicit Application of Polynomial Filters in a k -Step Arnoldi Method
Sorensen, D. C. (1992) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/0613025 · Cited by 1,236
Deflation Techniques for an Implicitly Restarted Arnoldi Iteration
Lehoucq, R. B., & Sorensen, D. C. (1996) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479895281484 · Cited by 618
Tracking a few extreme singular values and vectors in signal processing
Comon, P., & Golub, G. H. (1990) · Proceedings of the IEEE · doi:10.1109/5.58320 · Cited by 489
Thick-Restart Lanczos Method for Large Symmetric Eigenvalue Problems
Wu, K., & Simon, H. (2000) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479898334605 · Cited by 306
Lanczos Bidiagonalization With Partial Reorthogonalization
Larsen, R. M. (1998) · DAIMI Report Series · doi:10.7146/dpb.v27i537.7070 · Cited by 304
Updating the singular value decomposition
Bunch, J. R., & Nielsen, C. P. (1978) · Numerische Mathematik · doi:10.1007/bf01397471 · Cited by 283
Approximate solutions and eigenvalue bounds from Krylov subspaces
Paige, C. C., Parlett, B. N., & van der Vorst, H. A. (1995) · Numerical Linear Algebra with Applications · doi:10.1002/nla.1680020205 · Cited by 260
Computing interior eigenvalues of large matrices
Morgan, R. B. (1991) · Linear Algebra and its Applications · doi:10.1016/0024-3795(91)90381-6 · Cited by 221
On restarting the Arnoldi method for large nonsymmetric eigenvalue problems
Morgan, R. (1996) · Mathematics of Computation · doi:10.1090/s0025-5718-96-00745-4 · Cited by 170
Numerical methods for large eigenvalue problems
Sorensen, D. C. (2002) · Acta Numerica · doi:10.1017/s0962492902000089 · Cited by 162
Low-Rank Matrix Approximation Using the Lanczos Bidiagonalization Process with Applications
Simon, H. D., & Hongyuan Zha, B. (2000) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827597327309 · Cited by 137
Dynamic Thick Restarting of the Davidson, and the Implicitly Restarted Arnoldi Methods
Stathopoulos, A., Saad, Y. E.-M., & Wu, K. J. (1998) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827596304162 · Cited by 123
Implicitly Restarted Arnoldi Methods and Subspace Iteration
Lehoucq, R. B. (2001) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479899358595 · Cited by 96
An implicit shift bidiagonalization algorithm for ill-posed systems
Björck, Å., Grimme, E., & Dooren, P. M. V. (1994) · BIT Numerical Mathematics · doi:10.1007/bf01934265 · Cited by 71
A harmonic restarted Arnoldi algorithm for calculating eigenvalues and determining multiplicity
Morgan, R. B., & Zeng, M. (2005) · Linear Algebra and its Applications · doi:10.1016/j.laa.2005.07.024 · Cited by 71
IRBL: An Implicitly Restarted Block-Lanczos Method for Large-Scale Hermitian Eigenproblems
Baglama, J., Calvetti, D., & Reichel, L. (2003) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827501397949 · Cited by 70
Self-citationComputing smallest singular triplets with implicitly restarted Lanczos bidiagonalization
Kokiopoulou, E., Bekas, C., & Gallopoulos, E. (2004) · Applied Numerical Mathematics · doi:10.1016/j.apnum.2003.11.011 · Cited by 67
Iterative methods for the computation of a few eigenvalues of a large symmetric matrix
Baglama, J., Calvetti, D., & Reichel, L. (1996) · BIT Numerical Mathematics · doi:10.1007/bf01731924 · Cited by 61
Self-citationHochstenbach, M. E. (2004) · BIT Numerical Mathematics · doi:10.1007/s10543-004-5244-2 · Cited by 52
Restarting techniques for the (Jacobi-)Davidson symmetric eigenvalue methods
Stathopoulos, A., & Saad, Y. E.-M. (1998) · Cited by 44
Cited by
Integrating single-cell transcriptomic data across different conditions, technologies, and species
Butler, A., Hoffman, P., Smibert, P., Papalexi, E., & Satija, R. (2018) · Nature Biotechnology · doi:10.1038/nbt.4096 · Cited by 13,174
Reversed graph embedding resolves complex single-cell trajectories
Qiu, X., Mao, Q., Tang, Y., Wang, L., Chawla, R., Pliner, H. A., & Trapnell, C. (2017) · Nature Methods · doi:10.1038/nmeth.4402 · Cited by 5,070
Single-cell chromatin state analysis with Signac
Stuart, T., Srivastava, A., Madad, S., Lareau, C. A., & Satija, R. (2021) · Nature Methods · doi:10.1038/s41592-021-01282-5 · Cited by 1,769
ArchR is a scalable software package for integrative single-cell chromatin accessibility analysis
Granja, J. M., Corces, M. R., Pierce, S. E., Bagdatli, S. T., Choudhry, H., Chang, H. Y., & Greenleaf, W. J. (2021) · Nature Genetics · doi:10.1038/s41588-021-00790-6 · Cited by 1,392
hdWGCNA identifies co-expression networks in high-dimensional transcriptomics data
Morabito, S., Reese, F., Rahimzadeh, N., Miyoshi, E., & Swarup, V. (2023) · Cell Reports Methods · doi:10.1016/j.crmeth.2023.100498 · Cited by 773
Metadata
- Authors
- Baglama, J., & Reichel, L.
- Venue
- SIAM Journal on Scientific Computing
- Published
- 2005-01
- Volume
- 27
- Issue
- 1
- Pages
- 19-42
- ISSN
- 1064-8275 (ISSN-L)
- 1095-7197
- OpenAlex
- W1977361006
- Cited by
- 334
- References
- 24
- FWCI
- 1.26
- Type
- journal article
- Language
- en
- Open access
- green
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
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.