However, the performance of LDPC code depends on the girth of its bipartite graph, that is it depends on its sparse parity-check matrices H, especially the complexity of encoding with H.
而LDPC码性能的优劣，与其二分图中是否存在短长度的圈有关，也即与其奇偶校验矩阵的构造有关。
We consider the convergence of TOR-Type method under the conditions when the coefficient matrices are positive definite symmetric matrices, H-mat - rices, L-matrices.
本文考虑当系数矩阵为正定对称矩阵，H阵及L阵情况下TOR型方法的收敛性。
应用推荐