BEGIN:VCALENDAR
PRODID:-//Microsoft Corporation//Outlook MIMEDIR//EN
VERSION:1.0
BEGIN:VEVENT
DTSTART:20131120T001500Z
DTEND:20131120T020000Z
LOCATION:Mile High Pre-Function
DESCRIPTION;ENCODING=QUOTED-PRINTABLE:ABSTRACT: Solution of sparse triangular systems of linear equations is a=0Aperformance bottleneck in many methods for solving more general=0Asparse systems.  In both direct methods and iterative preconditioners,=0Ait is used to solve the system or refine the solution, often across=0Amany iterations.  Triangular solution is notoriously resistant to=0Aparallelism, however, and existing parallel linear algebra packages=0Aappear to be ineffective in exploiting much parallelism for this=0Aproblem.=0AWe develop a novel parallel algorithm based on various heuristics=0Athat adapts to the structure of the matrix and extracts parallelism=0Athat is unexploited by conventional methods.  By analysis and=0Areordering operations, our=0Aalgorithm can extract parallelism of many different sparse matrix structures.
SUMMARY:Structure-Aware Parallel Algorithm for Solution of Sparse Triangular Linear Systems
PRIORITY:3
END:VEVENT
END:VCALENDAR