Computing the smallest singular triplets of a large matrix
In this paper we present a new type of restarted Krylov methods for calculating the smallest singular triplets of a large sparse matrix, A. The new framework avoids the Lanczos bidiagonalization process and the use of polynomial filtering. This simplifies the restarting mechanism and allows the intr...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier
2019-10-01
|
| Series: | Results in Applied Mathematics |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S2590037419300068 |