Multiple-Rank Updates to Matrix Factorizations Zack 8/30/2013 - - PowerPoint PPT Presentation

multiple rank updates to matrix factorizations
SMART_READER_LITE
LIVE PREVIEW

Multiple-Rank Updates to Matrix Factorizations Zack 8/30/2013 - - PowerPoint PPT Presentation

Multiple-Rank Updates to Matrix Factorizations Zack 8/30/2013 Outline u Introduction u Multiple-rank Update Theory u Sparse Matrix Factorization by Multiple-rank Update u Symmetric Factorization by Multiple-rank Update u Conclusion Introduction


slide-1
SLIDE 1

Multiple-Rank Updates to Matrix Factorizations

Zack 8/30/2013

slide-2
SLIDE 2

Outline

u Introduction u Multiple-rank Update Theory u Sparse Matrix Factorization by Multiple-rank Update u Symmetric Factorization by Multiple-rank Update u Conclusion

slide-3
SLIDE 3

Introduction

u Dirext method

u Left-looking method u Right-looking method

u Computation effort

u O(n3) for dense matrix u O(n1.05-2) for sparse matrix

slide-4
SLIDE 4

Introduction

u

slide-5
SLIDE 5

Multiple-rank Update Theory

u

slide-6
SLIDE 6

Multiple-rank Update Theory

u

slide-7
SLIDE 7

Multiple-rank Update Theory

u

slide-8
SLIDE 8

Multiple-rank Update Theory

u

slide-9
SLIDE 9

Multiple-rank Update Theory

u

slide-10
SLIDE 10

Multiple-rank Update Theory

u

slide-11
SLIDE 11

Multiple-rank Update Theory

u

slide-12
SLIDE 12

Multiple-rank Update Theory

u

slide-13
SLIDE 13

Multiple-rank Update Theory

u

slide-14
SLIDE 14

Multiple-rank Update Theory

u

slide-15
SLIDE 15

Multiple-rank Update Theory

u

slide-16
SLIDE 16

Multiple-rank Update Theory

u

slide-17
SLIDE 17

Multiple-rank Update Theory

u

slide-18
SLIDE 18

Multiple-rank Update Theory

u

slide-19
SLIDE 19

Multiple-rank Update Theory

u

slide-20
SLIDE 20

Multiple-rank Update Theory

u

slide-21
SLIDE 21

Multiple-rank Update Theory

u

slide-22
SLIDE 22

Multiple Rank-1s Update

slide-23
SLIDE 23

Group Update

slide-24
SLIDE 24

Group Update

slide-25
SLIDE 25

Multiple-rank Update Theory

Methods Flops Comments

Left-looking LU O(n2) memory write, bad in parallel Right-looking LU O(n3) memory write, good in parallel QR O(n3) memory write, good in parallel n rank-1 updates O(n3) memory write, good in parallel

slide-26
SLIDE 26

Multiple-rank Update Theory

u

slide-27
SLIDE 27

Sparse Matrix Factorization by Multiple- rank Update

u

slide-28
SLIDE 28

Sparse Matrix Factorization by Multiple- rank Update

u The path of a rank-1 update follow exactly the path of the

elimination tree.

u Tridiagonal matrix’s elimination tree.

slide-29
SLIDE 29

Sparse Matrix Factorization by Multiple- rank Update

u Base-camp Theory

slide-30
SLIDE 30

Symmetric Factorization by Multiple- rank Update

u

slide-31
SLIDE 31

Symmetric Factorization by Multiple- rank Update

u

slide-32
SLIDE 32

Symmetric Factorization by Multiple- rank Update

u

slide-33
SLIDE 33

Symmetric Factorization by Multiple- rank Update

u

slide-34
SLIDE 34

Symmetric Factorization by Multiple- rank Update

u

slide-35
SLIDE 35

Symmetric Factorization by Multiple- rank Update

u

slide-36
SLIDE 36

Symmetric Factorization by Multiple- rank Update

u

slide-37
SLIDE 37

Symmetric Factorization by Multiple- rank Update

u

slide-38
SLIDE 38

Symmetric Factorization by Multiple- rank Update

u

slide-39
SLIDE 39

Symmetric Factorization by Multiple- rank Update

u

slide-40
SLIDE 40

Conclusion

u Introduced multiple 1-rank update method u Optimized the method when matrix is sparse. u Optimized the method when matrix is symmetry.

slide-41
SLIDE 41

References

u Deng L. Multiple-rank Updates to Matrix Factorizations for Nonlinear Analysis

and Circuit Design[D]. Stanford University, 2010.

slide-42
SLIDE 42

THANK YOU