AbstractA new approximate sparse factorization (CSF) of discretized elliptic systems has been used to solve large model Dirichlet problems more efficiently than all other methods which share its applicablity to general elliptic systems. If this efficiency is sustained in general, CSF will revolutionize numerical solution of elliptic systems
AbstractWe derive simple analytical upper bounds on the spectral condition number associated with th...
An approximation factorisation (AF) scheme is presented here for the solution of the two dimensional...
This dissertation studies the extension of sparse optimization techniques to the numerical solution ...
AbstractEfficient numerical solution of large elliptic systems is often facilitated with an approxim...
AbstractExtended-to-the-limit sparse root-free factorization procedures are introduced for solving l...
The conditioning analysis of sparse approximate block factorizations of Stieltjes matrices developed...
This thesis is concerned with the solution of large systems of linear algebraic equations in which t...
For solving large sparse symmetric linear systems, arising from the discretization of elliptic probl...
An Alternating Direction Implicit (ADI), Approximate Factorization (AF) scheme is presented here for...
We consider a method for solving elliptic boundary-value problems. The method arises from a finite-d...
AbstractNormalized factorization procedures for the solution of large sparse linear finite element s...
We apply iterative subspace correction methods to elliptic PDE problems discretized by generalized s...
In this paper we introduce the multiresolution LU factorization of non-stan-dard forms (NS-forms) an...
The iterative methods for elliptic equations described in the preceding section have many attractive...
AbstractIn this paper we introduce the multiresolution LU factorization of non-standard forms (NS-fo...
AbstractWe derive simple analytical upper bounds on the spectral condition number associated with th...
An approximation factorisation (AF) scheme is presented here for the solution of the two dimensional...
This dissertation studies the extension of sparse optimization techniques to the numerical solution ...
AbstractEfficient numerical solution of large elliptic systems is often facilitated with an approxim...
AbstractExtended-to-the-limit sparse root-free factorization procedures are introduced for solving l...
The conditioning analysis of sparse approximate block factorizations of Stieltjes matrices developed...
This thesis is concerned with the solution of large systems of linear algebraic equations in which t...
For solving large sparse symmetric linear systems, arising from the discretization of elliptic probl...
An Alternating Direction Implicit (ADI), Approximate Factorization (AF) scheme is presented here for...
We consider a method for solving elliptic boundary-value problems. The method arises from a finite-d...
AbstractNormalized factorization procedures for the solution of large sparse linear finite element s...
We apply iterative subspace correction methods to elliptic PDE problems discretized by generalized s...
In this paper we introduce the multiresolution LU factorization of non-stan-dard forms (NS-forms) an...
The iterative methods for elliptic equations described in the preceding section have many attractive...
AbstractIn this paper we introduce the multiresolution LU factorization of non-standard forms (NS-fo...
AbstractWe derive simple analytical upper bounds on the spectral condition number associated with th...
An approximation factorisation (AF) scheme is presented here for the solution of the two dimensional...
This dissertation studies the extension of sparse optimization techniques to the numerical solution ...
DOI
Add to ORKG