A NONLINEAR ELIMINATION PRECONDITIONED INEXACT NEWTON ALGORITHM

13Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A nonlinear elimination preconditioned inexact Newton (NEPIN) algorithm is proposed for problems with localized strong nonlinearities. Due to unbalanced nonlinearities ("nonlinear stiffness"), the traditional inexact Newton method often exhibits a long plateau in the norm of the nonlinear residual or even fails to converge. NEPIN implicitly removes the components causing trouble for the global convergence through a correction based on nonlinear elimination within a subspace that provides a modified direction for the global Newton iteration. Numerical experiments show that NEPIN can be more robust than global inexact Newton algorithms and maintain fast convergence even for challenging problems, such as full potential transonic flows. NEPIN complements several previously studied nonlinear preconditioners with which it compares favorably experimentally on a classic shocked duct flow problem considered herein. NEPIN is shown to be fairly insensitive to mesh resolution and "bad" subproblem identification based on the local Mach number or the local nonlinear residual for transonic flow over a wing.

Cite

CITATION STYLE

APA

Liu, L., Hwang, F. N., Luo, L., Cai, X. C., & Keyes, D. E. (2022). A NONLINEAR ELIMINATION PRECONDITIONED INEXACT NEWTON ALGORITHM. SIAM Journal on Scientific Computing, 44(3), A1579–A1605. https://doi.org/10.1137/21M1416138

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free