goback enhancing the primme eigensolver for computing
play

GoBack Enhancing the PRIMME Eigensolver for Computing Accurately - PowerPoint PPT Presentation

GoBack Enhancing the PRIMME Eigensolver for Computing Accurately Singular Triplets of Large Matrices Lingfei Wu and Andreas Stathopoulos Department of Computer Science College of William and Mary April 10th, 2014 CopperMountain2014 1 / 24


  1. GoBack

  2. Enhancing the PRIMME Eigensolver for Computing Accurately Singular Triplets of Large Matrices Lingfei Wu and Andreas Stathopoulos Department of Computer Science College of William and Mary April 10th, 2014 CopperMountain2014 1 / 24

  3. Introduction: applications of SVD • Introduction Social network analysis: voting similarities among • The applications politicians • The problems • The methods • Convergence issue • Accuracy issue Related work primme svds: why choose the two stage strategy primme svds: how to develop the two stage strategy Evaluations Conclusions CopperMountain2014 2 / 24

  4. Introduction: applications of SVD • Introduction Social network analysis: voting similarities among • The applications politicians • The problems • The methods • Image-processing: calculation of Eigenfaces in face • Convergence issue • Accuracy issue recognition Related work primme svds: why choose the two stage strategy primme svds: how to develop the two stage strategy Evaluations Conclusions CopperMountain2014 2 / 24

  5. Introduction: applications of SVD • Introduction Social network analysis: voting similarities among • The applications politicians • The problems • The methods • Image-processing: calculation of Eigenfaces in face • Convergence issue • Accuracy issue recognition Related work • Textual database searching: Google, Yahoo, and Baidu primme svds: why choose the two stage strategy primme svds: how to develop the two stage strategy Evaluations Conclusions CopperMountain2014 2 / 24

  6. Introduction: applications of SVD • Introduction Social network analysis: voting similarities among • The applications politicians • The problems • The methods • Image-processing: calculation of Eigenfaces in face • Convergence issue • Accuracy issue recognition Related work • Textual database searching: Google, Yahoo, and Baidu primme svds: why • choose the two stage Numerical linear algebra: least square fitting, rank, strategy low-rank approximation, computation of pseudospectrum primme svds: how to develop the two stage strategy Evaluations Conclusions CopperMountain2014 2 / 24

  7. Introduction: applications of SVD • Introduction Social network analysis: voting similarities among • The applications politicians • The problems • The methods • Image-processing: calculation of Eigenfaces in face • Convergence issue • Accuracy issue recognition Related work • Textual database searching: Google, Yahoo, and Baidu primme svds: why • choose the two stage Numerical linear algebra: least square fitting, rank, strategy low-rank approximation, computation of pseudospectrum primme svds: how to develop the two stage • Variance reduction in Monte Carlo method strategy Evaluations Conclusions CopperMountain2014 2 / 24

  8. Introduction: what is SVD ? Assume A ∈ ℜ m × n is a large, sparse matrix: Introduction • The applications • The problems • The methods A = U Σ V T • Convergence issue U T U = I, V T V = I, Σ = Diag • Accuracy issue Related work primme svds: why choose the two stage strategy primme svds: how to develop the two stage strategy Evaluations Conclusions CopperMountain2014 3 / 24

  9. Introduction: what is SVD ? Assume A ∈ ℜ m × n is a large, sparse matrix: Introduction • The applications • The problems • The methods A = U Σ V T • Convergence issue U T U = I, V T V = I, Σ = Diag • Accuracy issue Related work primme svds: why Our Problem : find k smallest singular values and choose the two stage strategy corresponding left and right singular vectors of A primme svds: how to develop the two stage strategy Av i = σ i u i , σ 1 ≤ . . . ≤ σ k Evaluations Conclusions CopperMountain2014 3 / 24

  10. Introduction: how to compute SVD ? • Introduction A Hermitian eigenvalue problem on • The applications • The problems • The methods • Convergence issue • Accuracy issue Related work primme svds: why choose the two stage strategy primme svds: how to develop the two stage strategy Evaluations Conclusions CopperMountain2014 4 / 24

  11. Introduction: how to compute SVD ? • Introduction A Hermitian eigenvalue problem on • The applications Normal equations matrix C = A T A or C = AA T • The problems ◦ • The methods � � A T 0 • Convergence issue Augmented matrix B = ◦ • Accuracy issue A 0 Related work primme svds: why choose the two stage strategy primme svds: how to develop the two stage strategy Evaluations Conclusions CopperMountain2014 4 / 24

  12. Introduction: how to compute SVD ? • Introduction A Hermitian eigenvalue problem on • The applications Normal equations matrix C = A T A or C = AA T • The problems ◦ • The methods � � A T 0 • Convergence issue Augmented matrix B = ◦ • Accuracy issue A 0 Related work primme svds: why • Lanczos bidiagonalization method (LBD) choose the two stage strategy primme svds: how to develop the two stage strategy Evaluations Conclusions CopperMountain2014 4 / 24

  13. Introduction: how to compute SVD ? • Introduction A Hermitian eigenvalue problem on • The applications Normal equations matrix C = A T A or C = AA T • The problems ◦ • The methods � � A T 0 • Convergence issue Augmented matrix B = ◦ • Accuracy issue A 0 Related work primme svds: why • Lanczos bidiagonalization method (LBD) choose the two stage strategy A = PB d Q T primme svds: how to develop the two stage strategy Evaluations B d = X Σ Y T Conclusions Where U = PX and V = QY CopperMountain2014 4 / 24

  14. Introduction: difference between methods • Introduction Convergence speed • The applications • The problems • The methods • Convergence issue • Accuracy issue Related work primme svds: why choose the two stage strategy primme svds: how to develop the two stage strategy Evaluations Conclusions CopperMountain2014 5 / 24

  15. Introduction: difference between methods • Introduction Convergence speed • The applications ◦ Eigen fast for largest SVs • The problems • The methods methods on C ◦ slow for smallest SVs • Convergence issue • Accuracy issue Related work primme svds: why choose the two stage strategy primme svds: how to develop the two stage strategy Evaluations Conclusions CopperMountain2014 5 / 24

  16. Introduction: difference between methods • Introduction Convergence speed • The applications ◦ Eigen fast for largest SVs • The problems • The methods methods on C ◦ slow for smallest SVs • Convergence issue • Accuracy issue Related work primme svds: why Eigen ◦ slower for largest SVs choose the two stage methods on B strategy ◦ extremely slow for smallest SVs primme svds: how to (interior eigenvalue problem) develop the two stage strategy Evaluations Conclusions CopperMountain2014 5 / 24

  17. Introduction: difference between methods • Introduction Convergence speed • The applications ◦ Eigen fast for largest SVs • The problems • The methods methods on C ◦ slow for smallest SVs • Convergence issue • Accuracy issue Related work primme svds: why Eigen ◦ slower for largest SVs choose the two stage methods on B strategy ◦ extremely slow for smallest SVs primme svds: how to (interior eigenvalue problem) develop the two stage strategy Evaluations LBD on A ◦ fast for largest SVs Conclusions similar to C but exhibits irregular ◦ convergence for smallest SVs CopperMountain2014 5 / 24

  18. Introduction: difference between methods • Introduction Accuracy • The applications • The problems • The methods • Convergence issue • Accuracy issue Related work primme svds: why choose the two stage strategy primme svds: how to develop the two stage strategy Evaluations Conclusions CopperMountain2014 6 / 24

  19. Introduction: difference between methods • Introduction Accuracy • The applications ◦ Eigen can only achieve accuracy of • The problems • The methods methods on C O ( κ ( A ) � A � ǫ mach ) • Convergence issue • Accuracy issue Related work primme svds: why choose the two stage strategy primme svds: how to develop the two stage strategy Evaluations Conclusions CopperMountain2014 6 / 24

  20. Introduction: difference between methods • Introduction Accuracy • The applications ◦ Eigen can only achieve accuracy of • The problems • The methods methods on C O ( κ ( A ) � A � ǫ mach ) • Convergence issue • Accuracy issue Related work ◦ primme svds: why Eigen can achieve accuracy of choose the two stage methods on B O ( � A � ǫ mach ) strategy primme svds: how to develop the two stage strategy Evaluations Conclusions CopperMountain2014 6 / 24

  21. Introduction: difference between methods • Introduction Accuracy • The applications ◦ Eigen can only achieve accuracy of • The problems • The methods methods on C O ( κ ( A ) � A � ǫ mach ) • Convergence issue • Accuracy issue Related work ◦ primme svds: why Eigen can achieve accuracy of choose the two stage methods on B O ( � A � ǫ mach ) strategy primme svds: how to develop the two stage strategy LBD on A ◦ can achieve accuracy of Evaluations O ( � A � ǫ mach ) Conclusions CopperMountain2014 6 / 24

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend