Article ID Journal Published Year Pages File Type
471236 Computers & Mathematics with Applications 2008 7 Pages PDF
Abstract

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.

Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computer Science (General)
Preview
Relaxed forms of BBK algorithm and FBP algorithm for symmetric indefinite linear systems
Authors
, ,