Displaying similar documents to “Newton's iteration with a conjugate gradient based decomposition method for an elliptic PDE with a nonlinear boundary condition”

Convergent algorithms suitable for the solution of the semiconductor device equations

Miroslav Pospíšek (1995)

Applications of Mathematics

Similarity:

In this paper, two algorithms are proposed to solve systems of algebraic equations generated by a discretization procedure of the weak formulation of boundary value problems for systems of nonlinear elliptic equations. The first algorithm, Newton-CG-MG, is suitable for systems with gradient mappings, while the second, Newton-CE-MG, can be applied to more general systems. Convergence theorems are proved and application to the semiconductor device modelling is described.

A semi-smooth Newton method for solving elliptic equations with gradient constraints

Roland Griesse, Karl Kunisch (2009)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

Similarity:

Semi-smooth Newton methods for elliptic equations with gradient constraints are investigated. The one- and multi-dimensional cases are treated separately. Numerical examples illustrate the approach and as well as structural features of the solution.

A comparison of some efficient numerical methods for a nonlinear elliptic problem

Balázs Kovács (2012)

Open Mathematics

Similarity:

The aim of this paper is to compare and realize three efficient iterative methods, which have mesh independent convergence, and to propose some improvements for them. We look for the numerical solution of a nonlinear model problem using FEM discretization with gradient and Newton type methods. Three numerical methods have been carried out, namely, the gradient, Newton and quasi-Newton methods. We have solved the model problem with these methods, we have investigated the differences between...

Robust preconditioners for the matrix free truncated Newton method

Lukšan, Ladislav, Matonoha, Ctirad, Vlček, Jan

Similarity:

New positive definite preconditioners for the matrix free truncated Newton method are given. Corresponding algorithms are described in detail. Results of numerical experiments that confirm the efficiency and robustness of the preconditioned truncated Newton method are reported.

On diagonally preconditioning the 2-steps BFGS method with accumulated steps for supra-scale linearly constrained nonlinear programming.

Laureano F. Escudero (1982)

Qüestiió

Similarity:

We present an algorithm for supra-scale linearly constrained nonlinear programming (LNCP) based on the Limited-Storage Quasi-Newton's method. In large-scale programming solving the reduced Newton equation at each iteration can be expensive and may not be justified when far from a local solution; besides, the amount of storage required by the reduced Hessian matrix, and even the computing time for its Quasi-Newton approximation, may be prohibitive. An alternative based on the reduced...