HPC2N
High Performance Computing Center North
Para06 - Minisymposium - MS19
Minisymposium - MS19 |
[MS18] [MS20] |
Tuesday, June 20, 2006, 14.00-15.40 - Loke
Recent Advances in Dense Linear Algebra (Part 2 of 2)
(part 1)
Organizers and Chair persons:
Daniel Kressner, University of Zagreb, Croatia and Umeå University
Julien Langou, The University of Tennessee, Knoxville, USA
Julien Langou, The University of Tennessee, Knoxville, USA
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.
- 14:00-14:20 Towards a Fast and Robust $\\mathcal O(n^2)$ Algorithm for the Bidiagonal SVD [#26]
Jesse Walters, Paul Willems - 14:20-14:40 Pipelined Shared Memory Implementation of Linear Algebra Routines with Arbitrary Lookahead - LU, Cholesky, QR [#188]
Jakub Kurzak, Jack Dongarra - 14:40-15:00 Parallel Algorithms for Standard and Generalized Triangular Sylvester-type Matrix Equations [#240]
Robert Granat, Bo Kågström - 15:00-15:20 The Multishift QZ Algorithm with Aggressive Early Deflation [#265]
Björn Adlerborn, Bo Kågström, Daniel Kressner - 15:20-15:40 Parallel Variants of the Multishift QZ Algorithm with Advanced Deflation Techniques [#263]
Björn Adlerborn, Daniel Kressner, Bo Kågström
Updated: 2024-04-17, 14:47