The authors propose a relaxation of the pivot selection criteria in the Bunch-Kaufman and Bunch-Parlett algorithms of {\it J. R. Bunch} and {\it L. Kaufman} [Math. Comput. 31, 163‒179 (1977; Zbl 0355.65023)] and {\it J. R. Bunch} and {\it 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.
Constantin Popa (Constanţa)
Start
Contact
Print
General Help
