【摘要】 在分析对称正定矩阵的校正分解算法的基础上 ,提出了解决对称不定矩阵的校正分解算法 .一对称不定矩阵的Bunch Parlett分解需要 0 (n3)次运算 ,而根据对称不定矩阵的Bunch Parlett分解得到的Bunch Parlett校正分解算法仅需 0 (n2 )次运算 ,数值结果也比较稳定更多还原

【Abstract】 Previous research has been concerned with updating factorization of a symmetric positive definite matrix. Here, a numerical algorithm is presented for updating Bunch Parlet factorization of a symmetric indefinite matrix. The Bunch Parlett factorization of a symmetric indefinite matrix requires 0( n 3) arithmetic operations. According to its factorization, an updating factorization when modified by a rank one is received, it only requires 0( n 2) arithmetic operations and its numerical result is stable更多还原