An Implementation and Analysis of the Refined Projection Method For - - PowerPoint PPT Presentation

an implementation and analysis of the refined projection
SMART_READER_LITE
LIVE PREVIEW

An Implementation and Analysis of the Refined Projection Method For - - PowerPoint PPT Presentation

An Implementation and Analysis of the Refined Projection Method For (Jacobi-)Davidson Type Methods Lingfei Wu Department of Computer Science College of William and Mary Advisor: Professor Andreas Stathopoulos March 18, 2015 SIAM CSE15 1 / 13


slide-1
SLIDE 1

SIAM CSE15 1 / 13

An Implementation and Analysis of the Refined Projection Method For (Jacobi-)Davidson Type Methods

Lingfei Wu Department of Computer Science College of William and Mary Advisor: Professor Andreas Stathopoulos

March 18, 2015

slide-2
SLIDE 2

Standard eigenvalue problem

Introduction

  • The problem
  • Related work

Analysis of the Refined Projection Method Efficient Computation of Interior Eigenvalues Numerical Evaluation Conclusion and future work

SIAM CSE15 2 / 13

Find k eigenvalues and associated eigenvectors of a large, sparse symmetric matrix A ∈ ℜn×n:

Axi = λixi, λ1 ≤ . . . ≤ λk

Our problem: compute a few λi closest to a shift τ or multiple shifts τ1, τ2, . . . , τk Our focus: efficiency and accuracy in general subspace (not Krylov subspace)

slide-3
SLIDE 3

Problem of standard Rayleigh-Ritz

Introduction

  • The problem
  • Related work

Analysis of the Refined Projection Method Efficient Computation of Interior Eigenvalues Numerical Evaluation Conclusion and future work

SIAM CSE15 3 / 13

Standard Rayleigh-Ritz extracts Ritz pairs (θ, u) where u ∈ V by imposing Galerkin condition

Au − θu ⊥ V

Best convergence for extreme eigenvalues, but not for interior eigenvalues due to spurious Ritz values Reason for spurious Ritz values: the associated Ritz vector is a combination of nearby eigenvectors → meaningless vector Trouble and effect causing by spurious Ritz values: difficult to select appropriate vectors and cause irregular convergence

slide-4
SLIDE 4

Harmonic and refined Rayleigh-Ritz

Introduction

  • The problem
  • Related work

Analysis of the Refined Projection Method Efficient Computation of Interior Eigenvalues Numerical Evaluation Conclusion and future work

SIAM CSE15 4 / 13

Harmonic Rayleigh-Ritz extracts harmonic Ritz pairs (

θi, ui)

by imposing Petrov-Galerkin condition

(A − θiI) ui ⊥ (A − τI)V

Refined Rayleigh-Ritz replaces Ritz vector with a vector ˆ

u ∈ V

minimize Aˆ

ui − θiˆ ui, i = 1, 2, . . . , k.

Refined Rayleigh-Ritz achieves monotonic convergence while computational costs are much more expensive Our goal: develop an efficient approach with similar costs to Rayleigh-Ritz

slide-5
SLIDE 5

Computation and accuracy of refined projection

Introduction Analysis of the Refined Projection Method

  • Analysis
  • Comparison

Efficient Computation of Interior Eigenvalues Numerical Evaluation Conclusion and future work

SIAM CSE15 5 / 13

Approach I: Solve a set of skinny tall SVD problems 1. compute (A − θiI)V = QiRi, i = 1, 2, . . . , k. 2. solve a set of small SVD problems on each Ri. Merits: numerically stable; Drawbacks: O(knm3) per restart Approach II: Solve a set of small eigenvalue problems 1. compute λmin(V TATAV − 2θiV TAV + θ2

i I)

Merits: O(km4) per restart; Drawbacks: numerically unstable Approach III: Solve one skinny tall SVD problem 1. Compute a set of the smallest singular triplets of R1. Merits: numerically stable; Drawbacks: O(nm3) per restart and effectiveness of ˆ

ui, i = 2, . . . , k may reduce

slide-6
SLIDE 6

Computation and accuracy of refined projection

Introduction Analysis of the Refined Projection Method

  • Analysis
  • Comparison

Efficient Computation of Interior Eigenvalues Numerical Evaluation Conclusion and future work

SIAM CSE15 6 / 13

Approach IV: Solve one small eigenvalue problem 1. Compute a set of the smallest eigenpairs of

λmin(V TATAV − 2θ1V TAV + θ2

1I).

Merits: O(m4) per restart; Drawbacks: numerically unstable

1000 2000 3000 4000 5000 6000 10

  • 6

10

  • 4

10

  • 2

10 10

2

Number of MatVecs Residual norm Matrix nos3: shift = 99.5 Refined - App I Refined - App II Refined - App III Refined - App IV ||A||*1e-8

(a) Seeking one

2000 4000 6000 8000 10000 10

  • 6

10

  • 4

10

  • 2

10 10

2

Number of MatVecs Residual norm Matrix nos3: shift = 99.95 Refined - App I Refined - App II Refined - App III Refined - App IV ||A||*1e-8

(b) Seeking a few

Approaches III and IV converge faster than approaches I and II

slide-7
SLIDE 7

An efficient and accurate hybrid method

Introduction Analysis of the Refined Projection Method Efficient Computation of Interior Eigenvalues

  • Hybrid method

Numerical Evaluation Conclusion and future work

SIAM CSE15 7 / 13

Hybrid Approach: combining Approach III and IV

500 1000 1500 10

  • 15

10

  • 10

10

  • 5

10 10

5

Number of MatVecs Residual norm Matrix Nos3: shift = 10 Refined - App III Refined - App IV Refined - DynSwitch ||A||*1e-15

(a) Seeking one

500 1000 1500 2000 2500 10

  • 15

10

  • 10

10

  • 5

10 10

5

Number of MatVecs Residual norm Matrix Nos3: shift = 10 Refined - App III Refined - DynSwitch ||A||*1e-15

(b) Seeking a few

Advantages of hybrid approach: 1) converges similarly with approach III 2) needs much less computation cost

slide-8
SLIDE 8

Evaluation: Test matrices

Introduction Analysis of the Refined Projection Method Efficient Computation of Interior Eigenvalues Numerical Evaluation

  • Test matrices
  • Experiment I
  • Experiment II

Conclusion and future work

SIAM CSE15 8 / 13

Table 1: Properties of the test matrices

Matrix pde2961 dw2048 SiNa Kuu

  • rder

2961 2048 5743 7102 nnz(A) 14585 10114 198787 340200

κ(A)

9.5E+2 5.3E+3 5.0E+2 1.6E+4

A2

1.0E+1 1.0E+0 2.6E+1 5.4E+1 Application Model Dielectric Quantum Structural PDE waveguide chemistry problem

Two types of problems: 1) Seek smallest magnitude eigenvalue of B =

AT A

  • 2) Seek interior eigenvalue of real symmetric A
slide-9
SLIDE 9

Seek smallest magnitude eigenvalue of B

Introduction Analysis of the Refined Projection Method Efficient Computation of Interior Eigenvalues Numerical Evaluation

  • Test matrices
  • Experiment I
  • Experiment II

Conclusion and future work

SIAM CSE15 9 / 13

1000 2000 3000 4000 5000 6000 10

  • 12

10

  • 10

10

  • 8

10

  • 6

10

  • 4

10

  • 2

10 Number of MatVecs Residual norm Matrix pde2961: shift = 0.0001 Refined - App III Refined - DynSwitch ||A||*1e-13

(a) Seeking one

0.5 1 1.5 2 x 10

4

10

  • 15

10

  • 10

10

  • 5

10 Number of MatVecs Residual norm Matrix pde2961: shift = 0.0001 Refined - App III Refined - DynSwitch ||A||*1e-15

(b) Seeking a few

1000 2000 3000 4000 5000 6000 10

  • 10

10

  • 5

10 Number of MatVecs Residual norm Matrix dw2048: shift = 0.0001 Refined - App III Refined - DynSwitch ||A||*1e-13

(c) Seeking one

0.5 1 1.5 2 x 10

4

10

  • 15

10

  • 10

10

  • 5

10 Number of MatVecs Residual norm Matrix dw2048: shift = 0.0001 Refined - App III Refined - DynSwitch ||A||*1e-15

(d) Seeking a few

slide-10
SLIDE 10

Seek interior eigenvalue of real symmetric A

Introduction Analysis of the Refined Projection Method Efficient Computation of Interior Eigenvalues Numerical Evaluation

  • Test matrices
  • Experiment I
  • Experiment II

Conclusion and future work

SIAM CSE15 10 / 13

1000 2000 3000 4000 5000 10

  • 12

10

  • 10

10

  • 8

10

  • 6

10

  • 4

10

  • 2

10 Number of MatVecs Residual norm Matrix SiNa: shift = 2 Refined - App III Refined - DynSwitch ||A||*1e-13

(a) Seeking one

5000 10000 15000 10

  • 12

10

  • 10

10

  • 8

10

  • 6

10

  • 4

10

  • 2

10 Number of MatVecs Residual norm Matrix SiNa: shift = 2 Refined - App III Refined - DynSwitch ||A||*1e-13

(b) Seeking a few

2000 4000 6000 8000 10000 10

  • 12

10

  • 10

10

  • 8

10

  • 6

10

  • 4

10

  • 2

10 Number of MatVecs Residual norm Matrix Kuu: shift = 1 Refined - App III Refined - DynSwitch ||A||*1e-13

(c) Seeking one

0.5 1 1.5 2 2.5 3 3.5 x 10

4

10

  • 12

10

  • 10

10

  • 8

10

  • 6

10

  • 4

10

  • 2

10 Number of MatVecs Residual norm Matrix Kuu: shift = 1 Refined - App III Refined - DynSwitch ||A||*1e-13

(d) Seeking a few

slide-11
SLIDE 11

Comparing Matvecs and Time

Introduction Analysis of the Refined Projection Method Efficient Computation of Interior Eigenvalues Numerical Evaluation

  • Test matrices
  • Experiment I
  • Experiment II

Conclusion and future work

SIAM CSE15 11 / 13

Table 2: Seeking one

Mat:

pde2961 dw2048 SiNa Kuu

App MV Sec MV Sec MV Sec MV Sec

RR

7014 62 7536 56 4833 49 12774 292

III

6054 123 5215 85 4458 102 9215 412

Hyd

5892 78 5023 52 4771 65 9468 280

Table 3: Seeking a few

Mat:

pde2961 dw2048 SiNa Kuu

App MV Sec MV Sec MV Sec MV Sec

RR

17572 180 17602 135 12668 137 45325 577

III

17313 362 14399 227 15424 367 34451 888

Hyd

17862 249 14069 161 15433 228 33149 556

slide-12
SLIDE 12

Conclusion and future work

Introduction Analysis of the Refined Projection Method Efficient Computation of Interior Eigenvalues Numerical Evaluation Conclusion and future work

  • Conclusion
  • SIAM CSE15

12 / 13

Refined and Harmonic Rayleigh-Ritz methods are useful tools to tackle interior eigenvalue problems.

  • Present a promising novel efficient approach for computing

refined Ritz vectors

  • A robust metric to monitor the error of the desired Ritz vector
  • Study similar issues in the harmonic projection method
  • Study an efficient approach for refined harmonic projection

method

slide-13
SLIDE 13

Thank you for your attention! Any Question?