讨论了一类块三对角矩阵的求逆问题。
The inverse of a class of block tridiagonal matrices is investigated.
该算法比已有的块三对角矩阵求逆算法的计算复杂度和计算时间低。
The computing complexity and computing time of this algorithm is lower than that of existed algorithms.
由块三对角矩阵的LU分解，得到了其逆矩阵块元素的显式表达式。
With the LU decomposition of the block tridiagonal matrix, an explicit expression of the block inverse elements is obtained.
根据块三对角矩阵的特殊分解，给出了求解块三对角方程组的新算法。
A new algorithm of solving block tridiagonal systems is proposed, which is based on the special factorization of block tridiagonal matrix.
由离散解得到的非对称线性方程组，对于QPNS采用块三对角法，对于FNS采用GMRES算法。
The nonsymmetric and linear equations from the discrete solution are solved by using block tridiagonal systems for the QPNS equations and by GMRES algorithm for the FNS equations.
在保持了该算法快速收敛优点的同时，利用相关矩阵块三对角的特殊结构，降低了该算法的计算复杂度。
This new method reduces the computational complexity by using the block tridiagonal structure of the input sample correlation matrix, and at the same time keeps the property of fast convergence.
基于并行计算的分治思想，对于严格块对角占优的块三对角线性方程组提出一个可扩展的块重叠分割并行近似求解方法（PBOA方法）。
A high efficiency scalable parallel algorithm, parallel block overlapped partition approximate(PBOA) algorithm, is proposed for solving block tri-diagonal linear systems on multiple computers.
基于并行计算的分治思想，对于严格块对角占优的块三对角线性方程组提出一个可扩展的块重叠分割并行近似求解方法（PBOA方法）。
A high efficiency scalable parallel algorithm, parallel block overlapped partition approximate(PBOA) algorithm, is proposed for solving block tri-diagonal linear systems on multiple computers.
应用推荐