片语

laplace spectral radiuslaplace谱半径

Signless Laplacian spectral radius无符号Laplace谱半径

essential spectral radius本质谱半径

joint spectral radiusIn mathematics, the joint spectral radius is a generalization of the classical notion of spectral radius of a matrix, to sets of matrice In recent years this notion has found applications in a large number of engineering fields and is still a topic of active research.

estimation of spectral radius谱半径估计

general spectral radius广义谱半径

adjacency spectral radius邻接谱半径

spectral radius of matrix矩阵的谱半径

matrix with spectral radius矩阵的谱半径

Laplacian spectral radiusLaplace谱半径

英汉例句

• Finally, for the spectral radius of a graph with a cut vertex, we give an inequality concerning the spectral radius of the graph and its subgraphs.

  最后，对于有割点的图的谱半径给出一个与子图的谱半径有关的一个不等式。

• Using matrix theory, we present a sharp upper bound on the spectral radius of digraphs and strongly connected diagraphs.

  首先，我们给出一些图的邻接谱半径的一些新的可达上界，并说明这些新结果在一定情形下比已有的结果要好。

• For solving the linear system with the iterative method, it is very important to estimate the spectral radius of the iterative matrices and give the convergence analysis.

  在用迭代法求解线性方程组时，迭代矩阵的谱半径估计及其收敛性分析是非常重要的。

• Conclusion Norm of operator is very important to estimate the spectral radius of operator.

  结论算子范数对于估计有界线性算子乘积与和的谱半径是至关重要的。

• Estimate for the spectral radius of iterative matrices.

  迭代矩阵的谱半径估计。

• It is proved in this paper that the minimal characterizing number of a matrix is equal to the spectral radius of the corresponding non-negative matrix.

  本文对一个矩阵的最小示性数进行了研究，并证明了一个矩阵的最小示性数等于其对应的非负矩阵的谱半径。

• Firstly, we present some sharp upper bounds on the adjacency spectral radius of graphs, and show that these bounds are somewhat better than the known ones.

  首先，我们给出一些图的邻接谱半径的一些新的可达上界，并说明这些新结果在一定情形下比已有的结果要好。