Para06 - Minisymposium - MS3

Monday, June 19, 2006, 10.30-12.30 - Loke

Recent Advances in Dense Linear Algebra (Part 1 of 2)

(part 2)

These last past years have seen a tremendous amount of new results in computational dense linear algebra. New algorithms have been developed to increase the speed of convergence of eigensolvers, to improve the final accuracy of solvers, to improve the parallel efficiency of applications, and to harness even better the capability of our computing platforms. Of particular interest for this minisymposium are new algorithms that outperform the algorithms used in Sca/LAPACK's current routines or match expected new functionality of the library.

• 10.30-10.50 Computing dense matrix factorizations to high relative accuracy[#187]
  Zlatko Drmač
• 10.50-11.10 Exploiting the Performance of 32 bit Floating Point Arithmetic in Obtaining 64 bit Accuracy (Revisiting Iterative Refinement for Linear Systems) [#231]
  Julie Langou, Julien Langou, Piotr Luszczek, Jakub Kurzak, Alfredo Buttari, Jack Dongarra
• 11.10-11.30 LAPACK-Style Codes for Pivoted Cholesky and QR Updating [#117]
  Sven Hammarling, Nick Higham, Craig Lucas
• 11.30-11.50 Inverse Iteration with Guaranteed Accuracy - a New Method for Computing Eigenvectors of Real Symmetric Tridiagonal Matrices[#14]
  Anna Matsekh
• 11.50-12.10 Specialized Spectral Division Algorithms for Generalized Eigenproblems via the Matrix Disk Function[#44]
  Mercedes Marqués, Enrique Quintana-Ortí, Gregorio Quintana-Ortí
• 12.10-12.30 Rank structured matrix operations[#125]
  Marc Van Barel, Raf Vandebril, Nicola Mastronardi, Steven Delvaux, Yvette Vanberghen