AbstractThe numerical implementation of the extended to the limit sparse LDLT factorization solution methods for three-dimensional self-adjoint elliptic partial differential equations [3] is given. Two FORTRAN routines for the approximate (or exact) factorization of the coefficient matrix and solution of the resulting finite difference equations are supplied. The amount of fill-in terms can be controlled by the user through parameters R1, R2 the limiting case being when the matrix is factorized exactly
Abstract. We study a method for parallel solution of elliptic partial di erential equations which de...
AbstractA new approximate sparse factorization (CSF) of discretized elliptic systems has been used t...
textabstractWe consider the systems of ordinary differential equations (ODEs) obtained by spatial di...
AbstractExtended-to-the-limit sparse root-free factorization procedures are introduced for solving l...
AbstractIn this paper, the application of preconditioning to improve the convergence rates of iterat...
AbstractA new class of Generalized Approximate Inverse Matrix (GAIM) techniques, based on the concep...
AbstractNormalized factorization procedures for the solution of large sparse linear finite element s...
This thesis is concerned with the solution of large systems of linear algebraic equations in which t...
AbstractEfficient numerical solution of large elliptic systems is often facilitated with an approxim...
Computational and algorithmic techniques for the solution of elliptic and parabolic partial differen...
In this paper we study the parallel scalability of variants of additive Schwarz preconditioners for ...
AbstractIn this paper we introduce the multiresolution LU factorization of non-standard forms (NS-fo...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/15...
We consider a method for solving elliptic boundary-value problems. The method arises from a finite-d...
AbstractNew normalized implicit methods are presented for the solution of self-adjoint elliptic P.D....
Abstract. We study a method for parallel solution of elliptic partial di erential equations which de...
AbstractA new approximate sparse factorization (CSF) of discretized elliptic systems has been used t...
textabstractWe consider the systems of ordinary differential equations (ODEs) obtained by spatial di...
AbstractExtended-to-the-limit sparse root-free factorization procedures are introduced for solving l...
AbstractIn this paper, the application of preconditioning to improve the convergence rates of iterat...
AbstractA new class of Generalized Approximate Inverse Matrix (GAIM) techniques, based on the concep...
AbstractNormalized factorization procedures for the solution of large sparse linear finite element s...
This thesis is concerned with the solution of large systems of linear algebraic equations in which t...
AbstractEfficient numerical solution of large elliptic systems is often facilitated with an approxim...
Computational and algorithmic techniques for the solution of elliptic and parabolic partial differen...
In this paper we study the parallel scalability of variants of additive Schwarz preconditioners for ...
AbstractIn this paper we introduce the multiresolution LU factorization of non-standard forms (NS-fo...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/15...
We consider a method for solving elliptic boundary-value problems. The method arises from a finite-d...
AbstractNew normalized implicit methods are presented for the solution of self-adjoint elliptic P.D....
Abstract. We study a method for parallel solution of elliptic partial di erential equations which de...
AbstractA new approximate sparse factorization (CSF) of discretized elliptic systems has been used t...
textabstractWe consider the systems of ordinary differential equations (ODEs) obtained by spatial di...