TY - GEN

T1 - Application of Tree-like Structure of Graph to Matrix Analysis

AU - Buslov, V.A.

PY - 2000

Y1 - 2000

N2 - Formulas for matrix determinants, algebraic adjunctions, characteristic polynomial coefficients, components of eigenvectors are obtained in the form of signless sums of matrix elements products taking by special graphs. Signless formulas are very important for singular and stochastic problems. They are also useful for spectral analysis of large very sparse matrices.

AB - Formulas for matrix determinants, algebraic adjunctions, characteristic polynomial coefficients, components of eigenvectors are obtained in the form of signless sums of matrix elements products taking by special graphs. Signless formulas are very important for singular and stochastic problems. They are also useful for spectral analysis of large very sparse matrices.

UR - https://www.semanticscholar.org/paper/Application-of-Tree-like-Structure-of-Graph-to-V.A.Buslov/c02cc2b35575966dd0eb71bfd975f893ebc228bb

UR - https://arxiv.org/abs/math/0001163

M3 - Other contribution

ER -