Abstract
Popular approaches for solving discrete-velocity BGK equation are explicit and semiimplicit methods, and both have certain constraints on the time step size. In this work, a fully implicit finite difference scheme is developed for the discrete-velocity BGK equation. We focus on a parallel, fully coupled, Newton-Krylov-RAS algorithm which imposes no limit on the time step size but requires the solution of a large sparse nonlinear system of equations at every time step. Here, RAS is a restricted additive Schwarz method. We show numerically that with such a preconditioned, nonlinearly implicit method the time step size is no longer constrained by the CFL condition, and scalable in terms of both strong and weak scalabilities on a supercomputer with thousands of processors.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
