Relaxed forms of BBK algorithm and FBP algorithm for symmetric indefinite linear systems

In this paper, we study the direct solvers for the linear system Ax=bAx=b, where AA 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.