Discretization of a self-adjoint elliptic partial differential equation by finite differences or finite elements yields a large, sparse, symmetric system of equations, <em>Ax=b</em>. We use the preconditioned conjugate gradient method with domain decomposition to develop an effective, vectorizable preconditioner which is suitable for solving large two-dimensional problems on vector and parallel machines
We investigate the in uence of the value of de ation vectors at interfaces on the rate of convergenc...
Abstract. The presented comparative analysis concerns two iterative solvers for 3D linear boundary v...
A numerical study of the efficiency of the modified conjugate gradients (MCG) is performed using dif...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/16...
In this article we address the question of efficiently solving the algebraic linear system of equati...
AbstractThe idea of solving large problems using domain decomposition technique appears particularly...
. The Neumann-Neumann algorithm is known to be an efficient domain decomposition preconditioner with...
The domain decomposition strategies proposed in this thesis are efficient preconditioning techniques...
This paper is concerned with the solution of a linear system of equations which have the form of AX ...
In this paper we review several methods for solving large sparse linear systems arising from discret...
Abstract. Block preconditionings for the conjugate gradient method are investigated for solving posi...
Abstract. The balancing Neumann-Neumann (BNN) and the additive coarse grid correction (BPS) precondi...
The balancing Neumann-Neumann (BNN) and the additive coarse grid correction (BPS) preconditioner are...
AbstractIn this paper, the application of preconditioning to improve the convergence rates of iterat...
We consider a parallel implementation of the additive two-level Schwarz domain decomposition techniq...
We investigate the in uence of the value of de ation vectors at interfaces on the rate of convergenc...
Abstract. The presented comparative analysis concerns two iterative solvers for 3D linear boundary v...
A numerical study of the efficiency of the modified conjugate gradients (MCG) is performed using dif...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/16...
In this article we address the question of efficiently solving the algebraic linear system of equati...
AbstractThe idea of solving large problems using domain decomposition technique appears particularly...
. The Neumann-Neumann algorithm is known to be an efficient domain decomposition preconditioner with...
The domain decomposition strategies proposed in this thesis are efficient preconditioning techniques...
This paper is concerned with the solution of a linear system of equations which have the form of AX ...
In this paper we review several methods for solving large sparse linear systems arising from discret...
Abstract. Block preconditionings for the conjugate gradient method are investigated for solving posi...
Abstract. The balancing Neumann-Neumann (BNN) and the additive coarse grid correction (BPS) precondi...
The balancing Neumann-Neumann (BNN) and the additive coarse grid correction (BPS) preconditioner are...
AbstractIn this paper, the application of preconditioning to improve the convergence rates of iterat...
We consider a parallel implementation of the additive two-level Schwarz domain decomposition techniq...
We investigate the in uence of the value of de ation vectors at interfaces on the rate of convergenc...
Abstract. The presented comparative analysis concerns two iterative solvers for 3D linear boundary v...
A numerical study of the efficiency of the modified conjugate gradients (MCG) is performed using dif...