Relaxed forms of BBK algorithm and FBP algorithm for symmetric indefinite linear systems (Q2426900)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Relaxed forms of BBK algorithm and FBP algorithm for symmetric indefinite linear systems |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Relaxed forms of BBK algorithm and FBP algorithm for symmetric indefinite linear systems |
scientific article |
Statements
Relaxed forms of BBK algorithm and FBP algorithm for symmetric indefinite linear systems (English)
0 references
14 May 2008
0 references
The authors propose a relaxation of the pivot selection criteria in the Bunch-Kaufman and Bunch-Parlett algorithms of \textit{J. R. Bunch} and \textit{L. Kaufman} [Math. Comput. 31, 163--179 (1977; Zbl 0355.65023)] and \textit{J. R. Bunch} and \textit{B. N. Parlett} [SIAM J. Numer. Anal. 8, No.~3, 639--655 (1970; Zbl 0199.49802)] for solving \(Ax = b\), with \(A\) a symmetric indefinite matrix.
0 references
symmetric indefinite matrices
0 references
symmetric pivoting
0 references
direct solvers
0 references
numerical examples
0 references
fast Bunch-Parlett algorithm (FBP)
0 references
bounded Bunch-Kaufman algorithm (BBK)
0 references
0.8698268
0 references
0.85982573
0 references
0 references
0.8488996
0 references
0.8468838
0 references
0.8413389
0 references
0 references
