Abstract
AbstractMatrix‐free implicit treatments are now commonly used for computing compressible flow problems: a reduced cost per iteration and low‐memory requirements are their most attractive features. This paper explains how it is possible to preserve these features for all‐speed flows, in spite of the use of a low‐Mach preconditioning matrix. The proposed approach exploits a particular property of a widely used low‐Mach preconditioner proposed by Turkel. Its efficiency is demonstrated on some steady and unsteady applications. Copyright © 2008 John Wiley & Sons, Ltd.
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 callMore From: International Journal for Numerical Methods in Fluids
Disclaimer: 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.
