该算法比已有的块三对角矩阵求逆算法的计算复杂度和计算时间低。
The computing complexity and computing time of this algorithm is lower than that of existed algorithms.
在保持了该算法快速收敛优点的同时，利用相关矩阵块三对角的特殊结构，降低了该算法的计算复杂度。
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.
根据三对角矩阵的特点，给出一种利用解线性方程组的方法求三对角矩阵的逆矩阵的算法。
In this paper, an algorithm for finding the inverse matrix of tridiagonal matrix by solving systems of linear algebraic equations is proposed.
本文根据分块循环三对角矩阵的特殊分解，给出了求解分块循环三对角方程组的一种新算法。
A new algorithm of solving circulant block tridiagonal systems is proposed, which is based on the special factorization of circulant block tridiagonal matrix.
根据块三对角矩阵的特殊分解，给出了求解块三对角方程组的新算法。
A new algorithm of solving block tridiagonal systems is proposed, which is based on the special factorization of block tridiagonal matrix.
即内层迭代是将物料平衡方程和相平衡方程联立，化为三对角矩阵形式，由之解出各板液相组成后，通过泡点计算法求定各板新的温度和相平衡常数。
The internal iterative calculation is to correlate the equations of mass and phase equilibrium into a triple diagonal matrix from which the liquid compositions can be found out.
本文用动态规划方法对一类对称的矩阵元三对角型线性方程组给出一种递推算法。
In this paper, a recurrence formula is given, by use of dynamic programming method, to solve the problem of linear algebraic equations with symmetric martrix element of...
本文用动态规划方法对一类对称的矩阵元三对角型线性方程组给出一种递推算法。
In this paper, a recurrence formula is given, by use of dynamic programming method, to solve the problem of linear algebraic equations with symmetric martrix element of tri-diagonal ty...
本文用动态规划方法对一类对称的矩阵元三对角型线性方程组给出一种递推算法。
In this paper, a recurrence formula is given, by use of dynamic programming method, to solve the problem of linear algebraic equations with symmetric martrix element of tri-diagonal ty...
应用推荐