AbstractSecond degree normalized implicit conjugate gradient methods for the numerical solution of self-adjoint elliptic partial differential equations are developed. A proposal for the selection of certain values of the iteration parameters ϱi, γi involved in solving two and three-dimensional elliptic boundary-value problems leading to substantial savings in computational work is presented. Experimental results for model problems are given
Graduation date: 1987The conjugate gradient method is an efficient means of solving\ud large sparse ...
A modified conjugate gradient algorithm is proposed which uses a gradient average window to pro-vide...
. The well known two grid method is used to solve the large, sparse, linear system resulting from a ...
This thesis is concerned with the solution of large systems of linear algebraic equations in which t...
IMPLEMENTATION Abstract: In the paper we report on a second stage of our efforts towards a library d...
AbstractNew normalized implicit methods are presented for the solution of self-adjoint elliptic P.D....
A new class of normalized explicit approximate inverse matrix techniques, based on normalized approx...
We have studied previously a generalized conjugate gradient method for solving sparse positive-defin...
AbstractIn this paper, the application of preconditioning to improve the convergence rates of iterat...
Includes bibliographical references (page 62)A new iterative method for the solution of large, spars...
AbstractIn this paper we consider various iterative methods for the numerical solution of very large...
Abstract. Block preconditionings for the conjugate gradient method are investigated for solving posi...
The conjugate gradient methods are noted to be exceedingly valuable for solving large-scale unconstr...
This work is primarily concerned with solving the large sparse linear systems which arise in connect...
A numerical study of the efficiency of the modified conjugate gradients (MCG) is performed using dif...
Graduation date: 1987The conjugate gradient method is an efficient means of solving\ud large sparse ...
A modified conjugate gradient algorithm is proposed which uses a gradient average window to pro-vide...
. The well known two grid method is used to solve the large, sparse, linear system resulting from a ...
This thesis is concerned with the solution of large systems of linear algebraic equations in which t...
IMPLEMENTATION Abstract: In the paper we report on a second stage of our efforts towards a library d...
AbstractNew normalized implicit methods are presented for the solution of self-adjoint elliptic P.D....
A new class of normalized explicit approximate inverse matrix techniques, based on normalized approx...
We have studied previously a generalized conjugate gradient method for solving sparse positive-defin...
AbstractIn this paper, the application of preconditioning to improve the convergence rates of iterat...
Includes bibliographical references (page 62)A new iterative method for the solution of large, spars...
AbstractIn this paper we consider various iterative methods for the numerical solution of very large...
Abstract. Block preconditionings for the conjugate gradient method are investigated for solving posi...
The conjugate gradient methods are noted to be exceedingly valuable for solving large-scale unconstr...
This work is primarily concerned with solving the large sparse linear systems which arise in connect...
A numerical study of the efficiency of the modified conjugate gradients (MCG) is performed using dif...
Graduation date: 1987The conjugate gradient method is an efficient means of solving\ud large sparse ...
A modified conjugate gradient algorithm is proposed which uses a gradient average window to pro-vide...
. The well known two grid method is used to solve the large, sparse, linear system resulting from a ...