skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: A parallel adaptive nonlinear elimination preconditioned inexact Newton method for transonic full potential equation

; ;
Publication Date:
Sponsoring Org.:
OSTI Identifier:
Grant/Contract Number:
Resource Type:
Journal Article: Publisher's Accepted Manuscript
Journal Name:
Computers and Fluids
Additional Journal Information:
Journal Volume: 110; Journal Issue: C; Related Information: CHORUS Timestamp: 2017-06-23 15:38:33; Journal ID: ISSN 0045-7930
Country of Publication:
United Kingdom

Citation Formats

Hwang, Feng-Nan, Su, Yi-Cheng, and Cai, Xiao-Chuan. A parallel adaptive nonlinear elimination preconditioned inexact Newton method for transonic full potential equation. United Kingdom: N. p., 2015. Web. doi:10.1016/j.compfluid.2014.04.005.
Hwang, Feng-Nan, Su, Yi-Cheng, & Cai, Xiao-Chuan. A parallel adaptive nonlinear elimination preconditioned inexact Newton method for transonic full potential equation. United Kingdom. doi:10.1016/j.compfluid.2014.04.005.
Hwang, Feng-Nan, Su, Yi-Cheng, and Cai, Xiao-Chuan. 2015. "A parallel adaptive nonlinear elimination preconditioned inexact Newton method for transonic full potential equation". United Kingdom. doi:10.1016/j.compfluid.2014.04.005.
title = {A parallel adaptive nonlinear elimination preconditioned inexact Newton method for transonic full potential equation},
author = {Hwang, Feng-Nan and Su, Yi-Cheng and Cai, Xiao-Chuan},
abstractNote = {},
doi = {10.1016/j.compfluid.2014.04.005},
journal = {Computers and Fluids},
number = C,
volume = 110,
place = {United Kingdom},
year = 2015,
month = 3

Journal Article:
Free Publicly Available Full Text
Publisher's Version of Record at 10.1016/j.compfluid.2014.04.005

Citation Metrics:
Cited by: 4works
Citation information provided by
Web of Science

Save / Share:
  • The authors study parallel two-level overlapping Schwarz algorithms for solving nonlinear finite element problems, in particular, for the full potential equation of aerodynamics discretized in two dimensions with bilinear elements. The overall algorithm, Newton-Krylov-Schwarz (NKS), employs an inexact finite difference Newton method and a Krylov space iterative method, with a two-level overlapping Schwarz method as a preconditioner. They demonstrate that NKS, combined with a density upwinding continuation strategy for problems with weak shocks, is robust and economical for this class of mixed elliptic-hyperbolic nonlinear partial differential equations, with proper specification of several parameters. They study upwinding parameters, inner convergence tolerance,more » coarse grid density, subdomain overlap, and the level of fill-in in the incomplete factorization, and report their effect on numerical convergence rate, overall execution time, and parallel efficiency on a distributed-memory parallel computer.« less
  • In this paper, we consider an inexact Newton method applied to a second order nonlinear problem with higher order nonlinearities. We provide conditions under which the method has a mesh-independent rate of convergence. To do this, we are required to first, set up the problem on a scale of Hilbert spaces and second, to devise a special iterative technique which converges in a higher than first order Sobolev norm. We show that the linear (Jacobian) system solved in Newton's method can be replaced with one iterative step provided that the initial nonlinear iterate is accurate enough. The closeness criteria canmore » be taken independent of the mesh size. Finally, the results of numerical experiments are given to support the theory.« less
  • This paper extends previous results on nonlinear Schwarz preconditioning ([4]) to unstructured finite element elliptic problems exploiting now nonlocal (but small) subspaces. The non-local finite element subspaces are associated with subdomains obtained from a non-overlapping element partitioning of the original set of elements and are coarse outside the prescribed element subdomain. The coarsening is based on a modification of the agglomeration based AMGe method proposed in [8]. Then, the algebraic construction from [9] of the corresponding non-linear finite element subproblems is applied to generate the subspace based nonlinear preconditioner. The overall nonlinearly preconditioned problem is solved by an inexact Newtonmore » method. Numerical illustration is also provided.« less
  • Modeling large multicomponent reactive transport systems in porous media is particularly challenging when the governing partial differential algebraic equations (PDAEs) are highly nonlinear and tightly coupled due to complex nonlinear reactions and strong solution-media interactions. Here we present a preconditioned Jacobian-Free Newton-Krylov (JFNK) solution approach to solve the governing PDAEs in a fully coupled and fully implicit manner. A well-known advantage of the JFNK method is that it does not require explicitly computing and storing the Jacobian matrix during Newton nonlinear iterations. Our approach further enhances the JFNK method by utilizing physics-based, block preconditioning and a multigrid algorithm for efficientmore » inversion of the preconditioner. This preconditioning strategy accounts for self- and optionally, cross-coupling between primary variables using diagonal and off-diagonal blocks of an approximate Jacobian, respectively. Numerical results are presented demonstrating the efficiency and massive scalability of the solution strategy for reactive transport problems involving strong solution-mineral interactions and fast kinetics. We found that the physics-based, block preconditioner significantly decreases the number of linear iterations, directly reducing computational cost; and the strongly scalable algebraic multigrid algorithm for approximate inversion of the preconditioner leads to excellent parallel scaling performance.« less
  • The Inexact Adaptive Newton method (IAN) is a modification of the Adaptive Implicit Method/sup 1/ (AIM) with improved Newton convergence. Both methods simplify the Jacobian at each time step by zeroing coefficients in regions where saturations are changing slowly. The methods differ in how the diagonal block terms are treated. On test problems with up to 3,000 cells, IAN consistently saves approximately 30% of the CPU time when compared to the fully implicit method. AIM shows similar savings on some problems, but takes as much CPU time as fully implicit on other test problems due to poor Newton convergence.