AbstractIn this paper, we study the direct solvers for the linear system Ax=b, where A is symmetric and indefinite. We discuss the so-called BBK algorithm and FBP algorithm and propose relaxed forms of them which provide options for fast pivot selection. We also present some numerical tests to show the efficiency of our algorithms
Sparse symmetric indefinite problems arise in a large number of important application areas; they ar...
Sparse symmetric indefinite linear systems of equations arise in numerous practical applications. In...
Partial pivoting strategies for the decomposition of symmetric matrices are discussed for solving sy...
AbstractIn this paper, we study the direct solvers for the linear system Ax=b, where A is symmetric ...
AbstractThe LDLT factorization of a symmetric indefinite matrix, although efficient computationally,...
This paper illustrates how the communication due to pivoting in the solution of symmetric indefinite...
Abstract. This paper discusses new pivoting factorization methods for solving sparse symmetric inden...
The performance of a sparse direct solver is dependent upon the pivot sequence that is chosen before...
LAPACK and LINPACK both solve symmetric indefinite linear systems using the diagonal pivoting method...
AbstractFor symmetric indefinite tridiagonal matrices, block LDLT factorization without interchanges...
SUMMARY The LBL T factorization of Bunch for solving linear systems involving a symmetric indefinite...
LAPACK and LINPACK both solve symmetric indefinite linear systems using the diagonal pivoting method...
This thesis studies the classical finite pivot methods for solving linear programs and their efficie...
Abstract. Maximum weight matchings have become an important tool for solving highly indefinite unsym...
This paper describes the design, implementation and performance of parallel direct dense symmetric...
Sparse symmetric indefinite problems arise in a large number of important application areas; they ar...
Sparse symmetric indefinite linear systems of equations arise in numerous practical applications. In...
Partial pivoting strategies for the decomposition of symmetric matrices are discussed for solving sy...
AbstractIn this paper, we study the direct solvers for the linear system Ax=b, where A is symmetric ...
AbstractThe LDLT factorization of a symmetric indefinite matrix, although efficient computationally,...
This paper illustrates how the communication due to pivoting in the solution of symmetric indefinite...
Abstract. This paper discusses new pivoting factorization methods for solving sparse symmetric inden...
The performance of a sparse direct solver is dependent upon the pivot sequence that is chosen before...
LAPACK and LINPACK both solve symmetric indefinite linear systems using the diagonal pivoting method...
AbstractFor symmetric indefinite tridiagonal matrices, block LDLT factorization without interchanges...
SUMMARY The LBL T factorization of Bunch for solving linear systems involving a symmetric indefinite...
LAPACK and LINPACK both solve symmetric indefinite linear systems using the diagonal pivoting method...
This thesis studies the classical finite pivot methods for solving linear programs and their efficie...
Abstract. Maximum weight matchings have become an important tool for solving highly indefinite unsym...
This paper describes the design, implementation and performance of parallel direct dense symmetric...
Sparse symmetric indefinite problems arise in a large number of important application areas; they ar...
Sparse symmetric indefinite linear systems of equations arise in numerous practical applications. In...
Partial pivoting strategies for the decomposition of symmetric matrices are discussed for solving sy...
DOI
Add to ORKG