BEGIN:VCALENDAR
VERSION:2.0
X-WR-TIMEZONE:America/Chicago
PRODID:-//Apple Inc.//iCal 3.0//EN
CALSCALE:GREGORIAN
X-WR-CALNAME:MueLu: Designing a New Multigrid Solver for the Trilinos Project
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:America/Chicago
BEGIN:DAYLIGHT
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
DTSTART:20070311T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
TZNAME:CDT
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
DTSTART:20071104T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
TZNAME:CST
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
SEQUENCE:2
DTSTART;TZID=America/Chicago:20101116T171500
DESCRIPTION:ABSTRACT: Smoothed Aggregation (SA) multigrid is a widely used algorithm for the scalable solution of linear systems that are at the heart of many DOE parallel scientific computations.  However\, SA's cost grows unacceptably for problems involving multiple physics and large number of near-kernel components. This issue becomes more pronounced for stretched meshes large material variation\, and higher dimensionality.  To address SA's shortcomings\, we have developed a new algorithm that allows explicit control of the grid transfer operators' sparsity patterns. This ensures low cost while tailoring performance for anisotropic problems.  A key to the new algorithm is keeping good convergence by minimizing energies of grid transfer operators while capturing important near-kernel components.  This algorithm is the basis of a new parallel multigrid solver in the Trilinos project. The solver will leverage the modern Trilinos software stack that abstracts the notion of a compute node in order to harness multi-core CPUs and GPUs.
UID:post118@sc10.supercomputing.org
SUMMARY:MueLu: Designing a New Multigrid Solver for the Trilinos Project
DTEND;TZID=America/Chicago:20101116T190000
LOCATION:Main Lobby
END:VEVENT
END:VCALENDAR