LAPACK and LINPACK both solve symmetric indefinite linear systems using the diagonal pivoting method with the partial pivoting strategy of Bunch and Kaufman (1977). No proof of the stability of this method has appeared in the literature. It is tempting to argue that the diagonal pivoting method is stable for a given pivoting strategy if the growth factor is small. We show that this argument is false in general, and give a sufficient condition for stability. This condition is not satisfied by the partial pivoting strategy, because the multipliers are unbounded. Nevertheless, using a more specific approach we are able to prove the stability of partial pivoting, thereby filling a gap in the body of theory supporting LAPACK and LINPACK. Key wo...
AbstractIn this paper, we study the direct solvers for the linear system Ax=b, where A is symmetric ...
For the solution of a linear system Ax = b using Gaussian elimination, some new properties of scaled...
The stability of the Gauss-Jordan algorithm with partial pivoting for the solution of general system...
LAPACK and LINPACK both solve symmetric indefinite linear systems using the diagonal pivoting method...
AbstractThe LDLT factorization of a symmetric indefinite matrix, although efficient computationally,...
AbstractFor symmetric indefinite tridiagonal matrices, block LDLT factorization without interchanges...
Partial pivoting strategies for the decomposition of symmetric matrices are discussed for solving sy...
SUMMARY The LBL T factorization of Bunch for solving linear systems involving a symmetric indefinite...
The performance of a sparse direct solver is dependent upon the pivot sequence that is chosen before...
This paper illustrates how the communication due to pivoting in the solution of symmetric indefinite...
Complex symmetric matrices whose real and imaginary parts are positive definite are shown to have a ...
We combine the idea of the direct LU factorization with the idea of the pivoting strategy in the usu...
Abstract. Sparse linear equations Kd r are considered, where K is a specially structured symmetric i...
We consider the $LBL^T$ factorization of a symmetric matrix where $L$ is unit lower triangular and ...
Our goal is to solve a sparse skew-symmetric linear system efficiently. We propose a slight modifica...
AbstractIn this paper, we study the direct solvers for the linear system Ax=b, where A is symmetric ...
For the solution of a linear system Ax = b using Gaussian elimination, some new properties of scaled...
The stability of the Gauss-Jordan algorithm with partial pivoting for the solution of general system...
LAPACK and LINPACK both solve symmetric indefinite linear systems using the diagonal pivoting method...
AbstractThe LDLT factorization of a symmetric indefinite matrix, although efficient computationally,...
AbstractFor symmetric indefinite tridiagonal matrices, block LDLT factorization without interchanges...
Partial pivoting strategies for the decomposition of symmetric matrices are discussed for solving sy...
SUMMARY The LBL T factorization of Bunch for solving linear systems involving a symmetric indefinite...
The performance of a sparse direct solver is dependent upon the pivot sequence that is chosen before...
This paper illustrates how the communication due to pivoting in the solution of symmetric indefinite...
Complex symmetric matrices whose real and imaginary parts are positive definite are shown to have a ...
We combine the idea of the direct LU factorization with the idea of the pivoting strategy in the usu...
Abstract. Sparse linear equations Kd r are considered, where K is a specially structured symmetric i...
We consider the $LBL^T$ factorization of a symmetric matrix where $L$ is unit lower triangular and ...
Our goal is to solve a sparse skew-symmetric linear system efficiently. We propose a slight modifica...
AbstractIn this paper, we study the direct solvers for the linear system Ax=b, where A is symmetric ...
For the solution of a linear system Ax = b using Gaussian elimination, some new properties of scaled...
The stability of the Gauss-Jordan algorithm with partial pivoting for the solution of general system...