The software package PROPACK contains a set of functions for computing the singular value decomposition of large and sparse or structured matrices. The SVD routines are based on the Lanczos bidiagonalization algorithm with partial reorthogonalization (BPRO). The Lanczos routines can also be used directly, and form the basis of efficient algorithms for solving linear systems of equations and linear least squares problems, in particular for systems with multiple right-hand sides.

References in zbMATH (referenced in 79 articles )

Showing results 1 to 20 of 79.
Sorted by year (citations)

1 2 3 4 next

  1. Cai, Jian-Feng; Wang, Tianming; Wei, Ke: Fast and provable algorithms for spectrally sparse signal reconstruction via low-rank Hankel matrix completion (2019)
  2. Alekseenko, Alexander; Nguyen, Truong; Wood, Aihua: A deterministic-stochastic method for computing the Boltzmann collision integral in (\mathcalO(MN)) operations (2018)
  3. Cai, Jian-Feng; Wang, Tianming; Wei, Ke: Spectral compressed sensing via projected gradient descent (2018)
  4. Fithian, William; Mazumder, Rahul: Flexible low-rank statistical modeling with missing data and side information (2018)
  5. He, Hongjin; Hou, Liusheng; Xu, Hong-Kun: A partially isochronous splitting algorithm for three-block separable convex minimization problems (2018)
  6. Niu, Datian; Meng, Jiana; Li, Hongying: A new shift strategy for the implicitly restarted refined harmonic Lanczos method (2018)
  7. Shabat, Gil; Shmueli, Yaniv; Aizenbud, Yariv; Averbuch, Amir: Randomized LU decomposition (2018)
  8. Gaaf, Sarah W.; Simoncini, Valeria: Approximating the leading singular triplets of a large matrix function (2017)
  9. Goldfarb, Donald; Mu, Cun; Wright, John; Zhou, Chaoxu: Using negative curvature in solving nonlinear programs (2017)
  10. Scott, Tony C.; Therani, Madhusudan; Wang, Xing M.: Data clustering with quantum mechanics (2017)
  11. Wen, Zaiwen; Zhang, Yin: Accelerating convergence by augmented Rayleigh-Ritz projections for large-scale eigenpair computation (2017)
  12. Wu, Lingfei; Romero, Eloy; Stathopoulos, Andreas: PRIMME_SVDS: a high-performance preconditioned SVD solver for accurate large-scale computations (2017)
  13. Cui, Li; Liu, Lu; Chen, Di-Rong; Xie, Jian-Feng: Recovery of low rank symmetric matrices via Schatten (p) norm minimization (2016)
  14. Friedlander, Michael P.; Macêdo, Ives: Low-rank spectral optimization via gauge duality (2016)
  15. He, Hongjin; Han, Deren: A distributed Douglas-Rachford splitting method for multi-block convex minimization problems (2016)
  16. Hou, Liusheng; He, Hongjin; Yang, Junfeng: A partially parallel splitting method for multiple-block separable convex programming with applications to robust PCA (2016)
  17. Jin, Zheng-Fen; Wan, Zhongping; Jiao, Yuling; Lu, Xiliang: An alternating direction method with continuation for nonconvex low rank minimization (2016)
  18. Mikhalev, A. Yu.; Oseledets, I. V.: Iterative representing set selection for nested cross approximation. (2016)
  19. Mu, Cun; Zhang, Yuqian; Wright, John; Goldfarb, Donald: Scalable robust matrix recovery: Frank-Wolfe meets proximal methods (2016)
  20. Sorensen, D. C.; Embree, Mark: A DEIM induced CUR factorization (2016)

1 2 3 4 next