Application of generalized diagonal dominance in wireless sensor network optimization problems
From MaRDI portal
(Redirected from Publication:426481)
Recommendations
Cites work
- \(H\)-matrix theory vs. eigenvalue localization
- A new Geršgorin-type eigenvalue inclusion set
- A survey of game-theoretic approaches in wireless sensor networks
- Between Geršgorin and minimal Geršgorin sets
- Chaotic relaxation
- scientific article; zbMATH DE number 1233801 (Why is no real title available?)
- scientific article; zbMATH DE number 1243371 (Why is no real title available?)
- scientific article; zbMATH DE number 734901 (Why is no real title available?)
- scientific article; zbMATH DE number 2120941 (Why is no real title available?)
- New criteria for identifying \(H\)-matrices
Cited in
(6)- An infinity norm bound for the inverse of Dashnic-Zusmanovich type matrices with applications
- Fractional pseudospectra and their localizations
- Sensor network optimization of gearbox based on dependence matrix and improved discrete shuffled frog leaping algorithm
- Pseudospectra localizations and their applications.
- The dominant degree for Schur complement of \(S\)-strictly diagonally dominant matrix and its applications
- Infinity norm bounds for the inverse of S-Nekrasov type matrices and their applications
This page was built for publication: Application of generalized diagonal dominance in wireless sensor network optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q426481)