Newton’s iteration is studied for the numerical solution of an elliptic PDE with nonlinear boundary conditions. At each iteration of Newton’s method, a conjugate gradient based decomposition method is applied to the matrix of the linearized system. The decomposition is such that all the remaining linear systems have the same constant matrix. Numerical results confirm the savings with respect to the computational cost, compared with the classical Newton method with factorization at each step
The author proves in a systematic and unifying way stability, convergence and computing results for ...
The preconditioned conjugate gradient (CG) method is becoming accepted as a powerful tool for solvin...
In this paper we describe the numerical solution of elliptic problems with nonconstant coefficients ...
A conjugate gradient (CG)-type algorithm CG Plan is introduced for calculating an approximate soluti...
This thesis is concerned with the solution of large systems of linear algebraic equations in which t...
We have studied previously a generalized conjugate gradient method for solving sparse positive-defin...
The finite element setting for nonlinear elliptic PDEs directly leads to the minimization of convex ...
The Conjugate Gradient method has always been successfully used in solving the symmetric and positi...
IMPLEMENTATION Abstract: In the paper we report on a second stage of our efforts towards a library d...
We consider numerical approximations of nonlinear, monotone, and Lipschitz-continuous elliptic probl...
AbstractSecond degree normalized implicit conjugate gradient methods for the numerical solution of s...
In this research work, we have studied the finite difference method and used it to solve elliptic pa...
AbstractA nonlinear conjugate gradient method has been introduced and analyzed by J.W. Daniel. This ...
Abstract. Semi-smooth Newton methods for elliptic equations with gradi-ent constraints are investiga...
Solving systems of nonlinear equations is a relatively complicated problem for which a number of dif...
The author proves in a systematic and unifying way stability, convergence and computing results for ...
The preconditioned conjugate gradient (CG) method is becoming accepted as a powerful tool for solvin...
In this paper we describe the numerical solution of elliptic problems with nonconstant coefficients ...
A conjugate gradient (CG)-type algorithm CG Plan is introduced for calculating an approximate soluti...
This thesis is concerned with the solution of large systems of linear algebraic equations in which t...
We have studied previously a generalized conjugate gradient method for solving sparse positive-defin...
The finite element setting for nonlinear elliptic PDEs directly leads to the minimization of convex ...
The Conjugate Gradient method has always been successfully used in solving the symmetric and positi...
IMPLEMENTATION Abstract: In the paper we report on a second stage of our efforts towards a library d...
We consider numerical approximations of nonlinear, monotone, and Lipschitz-continuous elliptic probl...
AbstractSecond degree normalized implicit conjugate gradient methods for the numerical solution of s...
In this research work, we have studied the finite difference method and used it to solve elliptic pa...
AbstractA nonlinear conjugate gradient method has been introduced and analyzed by J.W. Daniel. This ...
Abstract. Semi-smooth Newton methods for elliptic equations with gradi-ent constraints are investiga...
Solving systems of nonlinear equations is a relatively complicated problem for which a number of dif...
The author proves in a systematic and unifying way stability, convergence and computing results for ...
The preconditioned conjugate gradient (CG) method is becoming accepted as a powerful tool for solvin...
In this paper we describe the numerical solution of elliptic problems with nonconstant coefficients ...