An Analysis of Approximate Nonlinear Elimination

Authors:
Paul J. Lanzkron;Donald J. Rose;James T. Wilkes
Affiliations:
-;-;-
Venue:
SIAM Journal on Scientific Computing
Year:
1996

Citing 0
Cited 2

A Domain Decomposition Based Parallel Inexact Newton's Method with Subspace Correction for Incompressible Navier-Stokes Equations

ICCS '09 Proceedings of the 9th International Conference on Computational Science: Part I
Inexact Newton Methods with Restricted Additive Schwarz Based Nonlinear Elimination for Problems with High Local Nonlinearity

SIAM Journal on Scientific Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

We present a method for solving systems of nonlinear equations suitable for problems where convergence of an approximate Newton method is initially slow. The method, nonlinear elimination (NlEm), eliminates the nonlinear equations and appropriate variables deemed to be causing the problem. An analysis of the method is given and leads to a detailed algorithm that reduces automatically to an approximate Newton method near the root of the system of nonlinear equations. Several examples are given that demonstrate the efficacy of the method.