[Home]   [  News]   [  Events]   [  People]   [  Research]   [  Education]   [Visitor Info]   [UCSD Only]   [Admin]
Home > Events > CCoM > Abstract
Search this site:

Randolph E. Bank
Philip E. Gill
Michael Holst

Administrative Contact:
Jennifer Trefftzs

Office: AP&M 7409
Phone: (858)534-9056
Fax: (858)534-5273
E-mail: jtrefftzs@ucsd.edu
Efficient Solvers and Sparse Discretizations for Very High-Order Finite Element Methods

Will Pazner
Lawrence Livermore National Laboratory


High-order numerical methods promise higher fidelity and more predictive power when compared with traditional low-order methods. Furthermore, many properties of these methods make them well-suited for modern computer architectures. However, the use of these methods also introduces several new challenges. For example, in the time-dependent setting, high-order spatial discretizations can result in severe time step restrictions, motivating the use of implicit solvers. The resulting systems are large and often ill-conditioned, posing a challenge for traditional solvers. In this talk, I will discuss the development of efficient solvers and preconditioners designed specifically for high-order finite element and discontinuous Galerkin methods. An entropy-stable sparse line-based discretization will be developed to make these methods suitable for use on GPU- and accelerator-based architectures. These methods will then be applied to relevant problems in compressible flow.

Tuesday, April 16, 2019
11:00AM AP&M 2402