Application of Tree-like Structure of Graph to Matrix Analysis
From MaRDI portal
Abstract: 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.
This page was built for publication: Application of Tree-like Structure of Graph to Matrix Analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6470206)
