AbstractResults are given concerning the LU factorization of H-matrices, and Gaussian elimination with column-diagonal-dominant pivoting is shown to be applicable to H-matrices. This algorithm, which uses a symmetric permutation to exchange the most diagonally dominant column of the unreduced submatrix into the pivotal position, is shown to be numerically stable by deriving an upper bound on the growth factor associated with the backward error analysis for Gaussian elimination
Many of the currently popular 'block algorithms' are scalar algorithms in which the operations have ...
Complex symmetric matrices whose real and imaginary parts are positive definite are shown to have a ...
AbstractThe existence of block LU factorization without pivoting for complex symmetric block tridiag...
AbstractResults are given concerning the LU factorization of H-matrices, and Gaussian elimination wi...
AbstractAhac and Olesky have shown that by using the most diagonal-dominat column as a pivot element...
Many of the currently popular ‘block algorithms’ are scalar algorithms in which the operations have ...
AbstractIn this paper we analyze the Gauss-Huard algorithm. From a description of the algorithm in t...
As the standard method for solving systems of linear equations, Gaussian elimination (GE) is one of ...
We combine the idea of the direct LU factorization with the idea of the pivoting strategy in the usu...
AbstractBy a block representation of LU factorization for a general matrix introduced by Amodio and ...
We present the LU decomposition with panel rank revealing pivoting (LU_PRRP), an LU factorization al...
Recent work by Sweet and Brent on the fast factorization of Cauchy-like matrices through a fast vers...
This paper considers elimination methods to solve dense linear systems, in particular a variant of G...
Incomplete LU-factorizations have been very successful as preconditioners for solving sparse linear ...
In this article, we present several new permutations for I-matrices making these more suitable for i...
Many of the currently popular 'block algorithms' are scalar algorithms in which the operations have ...
Complex symmetric matrices whose real and imaginary parts are positive definite are shown to have a ...
AbstractThe existence of block LU factorization without pivoting for complex symmetric block tridiag...
AbstractResults are given concerning the LU factorization of H-matrices, and Gaussian elimination wi...
AbstractAhac and Olesky have shown that by using the most diagonal-dominat column as a pivot element...
Many of the currently popular ‘block algorithms’ are scalar algorithms in which the operations have ...
AbstractIn this paper we analyze the Gauss-Huard algorithm. From a description of the algorithm in t...
As the standard method for solving systems of linear equations, Gaussian elimination (GE) is one of ...
We combine the idea of the direct LU factorization with the idea of the pivoting strategy in the usu...
AbstractBy a block representation of LU factorization for a general matrix introduced by Amodio and ...
We present the LU decomposition with panel rank revealing pivoting (LU_PRRP), an LU factorization al...
Recent work by Sweet and Brent on the fast factorization of Cauchy-like matrices through a fast vers...
This paper considers elimination methods to solve dense linear systems, in particular a variant of G...
Incomplete LU-factorizations have been very successful as preconditioners for solving sparse linear ...
In this article, we present several new permutations for I-matrices making these more suitable for i...
Many of the currently popular 'block algorithms' are scalar algorithms in which the operations have ...
Complex symmetric matrices whose real and imaginary parts are positive definite are shown to have a ...
AbstractThe existence of block LU factorization without pivoting for complex symmetric block tridiag...