MS-Th-D-11
Matrix computations using structures and other innovative techniques - Part I of III
For Part II, see MS-Th-E-11
For Part III, see MS-Fr-D-11

Date: August 13
Time: 13:30--15:30
Room: 203B

(Note: Click title to show the abstract.)

Organizer:
Xia, Jianlin (Purdue Univ.)
Chen, Jie (IBM Thomas J. Watson Research Center)

Abstract: This minisymposium is concerned with a wide range of innovative matrix computation techniques, including structures, randomization, splitting preconditioning, etc. The techniques make it feasible to develop new fast and reliable direct or iterative solutions. In particular, certain block or hierarchical structures can be used to obtain effective preconditioners or nearly linear complexity direct solvers for challenging numerical problems. Interesting applications to imaging, PDE/integral equation solutions, optimization, parallel computing, and engineering simulations will also be shown.


MS-Th-D-11-1
13:30--14:00
Randomized Algorithms for Numerical Linear Algebra
Gu, Ming (Univ. of California Berkeley)


MS-Th-D-11-2
14:00--14:30
Linear-Cost Storage and Computation with Kernel Matrices
Chen, Jie (IBM Thomas J. Watson Research Center)


MS-Th-D-11-3
14:30--15:00
The Multivariate Eigenvalue Problem
Zhang, Leihong (Shanghai Univ. of Finance & Economics)


MS-Th-D-11-4
15:00--15:30
An efficient method for counting the eigenvalues inside a region of the complex plane
Yin, Guojian (Shenzhen Inst.s of Advanced Tech., Chinese Acad. of Sci.)

Return


Footnote:
Code: Type-Date-Time-Room No.
Type : IL=Invited Lecture, SL=Special Lectures, MS=Minisymposia, IM=Industrial Minisymposia, CP=Contributed Papers, PP=Posters
Date: Mo=Monday, Tu=Tuesday, We=Wednesday, Th=Thursday, Fr=Friday
Time : A=8:30-9:30, B=10:00-11:00, C=11:10-12:10, BC=10:00-12:10, D=13:30-15:30, E=16:00-18:00, F=19:00-20:00, G=12:10-13:30, H=15:30-16:00
Room No.: TBA