AbstractExtended-to-the-limit sparse root-free factorization procedures are introduced for solving large sparse symmetric structured linear systems of algebraic equations, which are derived from the finite-difference discretization of self-adjoint elliptic PDEs in three space dimensions. Theoretical results on the rate of convergence of relevant approximate matrix-factorization semidirect methods for three space variables are also presented
AbstractWe derive simple analytical upper bounds on the spectral condition number associated with th...
Abstract. The presented comparative analysis concerns two iterative solvers for 3D linear boundary v...
Discretization of a self-adjoint elliptic partial differential equation by finite differences or fin...
AbstractA new approximate sparse factorization (CSF) of discretized elliptic systems has been used t...
AbstractThe numerical implementation of the extended to the limit sparse LDLT factorization solution...
AbstractNormalized factorization procedures for the solution of large sparse linear finite element s...
AbstractEfficient numerical solution of large elliptic systems is often facilitated with an approxim...
This thesis is concerned with the solution of large systems of linear algebraic equations in which t...
In this paper we introduce the multiresolution LU factorization of non-stan-dard forms (NS-forms) an...
AbstractIn this paper, the application of preconditioning to improve the convergence rates of iterat...
AbstractIn this paper we introduce the multiresolution LU factorization of non-standard forms (NS-fo...
In this paper we review several methods for solving large sparse linear systems arising from discret...
For solving large sparse symmetric linear systems, arising from the discretization of elliptic probl...
The iterative methods for elliptic equations described in the preceding section have many attractive...
We apply iterative subspace correction methods to elliptic PDE problems discretized by generalized s...
AbstractWe derive simple analytical upper bounds on the spectral condition number associated with th...
Abstract. The presented comparative analysis concerns two iterative solvers for 3D linear boundary v...
Discretization of a self-adjoint elliptic partial differential equation by finite differences or fin...
AbstractA new approximate sparse factorization (CSF) of discretized elliptic systems has been used t...
AbstractThe numerical implementation of the extended to the limit sparse LDLT factorization solution...
AbstractNormalized factorization procedures for the solution of large sparse linear finite element s...
AbstractEfficient numerical solution of large elliptic systems is often facilitated with an approxim...
This thesis is concerned with the solution of large systems of linear algebraic equations in which t...
In this paper we introduce the multiresolution LU factorization of non-stan-dard forms (NS-forms) an...
AbstractIn this paper, the application of preconditioning to improve the convergence rates of iterat...
AbstractIn this paper we introduce the multiresolution LU factorization of non-standard forms (NS-fo...
In this paper we review several methods for solving large sparse linear systems arising from discret...
For solving large sparse symmetric linear systems, arising from the discretization of elliptic probl...
The iterative methods for elliptic equations described in the preceding section have many attractive...
We apply iterative subspace correction methods to elliptic PDE problems discretized by generalized s...
AbstractWe derive simple analytical upper bounds on the spectral condition number associated with th...
Abstract. The presented comparative analysis concerns two iterative solvers for 3D linear boundary v...
Discretization of a self-adjoint elliptic partial differential equation by finite differences or fin...