Abstract
We compare the performance of two parallel preconditioners for a Newton–Krylov flow solver: an additive-Schwarz preconditioner and an approximate-Schur preconditioner. A previous study using only 24 processors was inconclusive regarding the relative performance of these preconditioners. In the present study, the approximate-Schur preconditioner is shown to be clearly superior when more than 100 processors are used. Overall, the Newton–Krylov algorithm with the approximate-Schur preconditioner produces a very efficient solver, ideal for serving as the core of an aerodynamic optimization algorithm.
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.
