Implicit Preconditioning for Explicit Multigrid Solvers on Cut-Cell Cartesian Meshes
Speaker: Jonathan J. Chiew, Computational Aerosciences Branch, NASA Ames Research Center, Moffett Field, CA
Presentation
Seminar Slide Deck (PDF-3.4MB)
Abstract
Cut-cell Cartesian methods enable automated mesh generation and adaptation which are essential for vehicle design and optimization. However, optimizations may slow down or terminate if the solver is not able to converge. In this talk, we discuss an investigation into implicit preconditioning for strengthening the explicit multigrid solver utilized in the Cart3D simulation framework. A Jacobian-free Krylov subspace method is employed to solve the linear preconditioning equations, demonstrating improved multigrid convergence rates on a variety of problems. Sequential hybrid preconditioning is also studied as a method to reduce computational cost. The last portion of the talk will discuss a novel formulation of dual time stepping which encompasses both fully and diagonally implicit Runge-Kutta methods as well as BDF schemes in a unified framework.
Biography