Kars Knook

2papers

2 Papers

41.8NAApr 21
Preconditioners for the Onsager-Stefan-Maxwell equations for multicomponent diffusion

Kars Knook, Aaron Baier-Reinio, Patrick E. Farrell

The Onsager-Stefan-Maxwell (OSM) equations are an important model of mass transport in multicomponent flows with multiple chemical species. They describe the coupling of diffusive fluxes between species, accounting for their interactions through frictional and thermodynamic driving forces. In this work we propose an augmented Lagrangian preconditioner and prove its discretization-robustness for a Picard linearization of the stationary OSM equations in the isobaric, isothermal, ideal gaseous setting. For the Newton linearization we employ the augmented Lagrangian preconditioner as a block diagonal smoother inside a monolithic geometric multigrid iteration and combine with vertex star Schwarz methods. This strategy is shown to be applicable in a wide variety of settings which incorporate cross-diffusion, nonideal mixing, thermal, pressure, convective, and electrochemical effects. We demonstrate robustness or mild dependence with respect to mesh refinement and polynomial degree of the proposed monolithic preconditioning strategy for different types of multicomponent flows in several applications: cross-diffusion in the human airways, separation of gases under a temperature gradient, nonideal mixing of benzene and cyclohexane, and electrolytic transport in a Hull cell undergoing electroplating.

40.5NAMar 19
Shifted HSS solvers for the indefinite Helmholtz equation

Colin J Cotter, Kars Knook, Joshua Hope-Collins

We provide an iterative solution approach for the indefinite Helmholtz equation discretised using finite elements, based upon a Hermitian Skew-Hermitian Splitting (HSS) iteration applied to the shifted operator, and prove that the iteration is k- and mesh-robust when O(k) HSS iterations are performed. The HSS iterations involve solving a shifted operator that is suitable for approximation by multigrid using standard smoothers and transfer operators, and hence we can use O(N) parallel processors in a high performance computing implementation, where N is the total number of degrees of freedom. We argue that the algorithm converges in O(k) wallclock time when within the range of scalability of the multigrid. We provide numerical results in both 2D and 3D verifying our proofs and demonstrating this claim, establishing a method that can make use of large scale high performance computing systems.