Application of generalized diagonal dominance in wireless sensor network optimization problems
From MaRDI portal
Publication:426481
DOI10.1016/J.AMC.2011.10.023zbMATH Open1245.90132OpenAlexW2083668760MaRDI QIDQ426481FDOQ426481
Authors: Ljiljana Cvetković, Vladimir Kostić 
Publication date: 11 June 2012
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2011.10.023
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- \(H\)-matrix theory vs. eigenvalue localization
- A new Geršgorin-type eigenvalue inclusion set
- Chaotic relaxation
- A survey of game-theoretic approaches in wireless sensor networks
- Between Geršgorin and minimal Geršgorin sets
- New criteria for identifying \(H\)-matrices
Cited In (5)
- The dominant degree for Schur complement of \(S\)-strictly diagonally dominant matrix and its applications
- An infinity norm bound for the inverse of Dashnic-Zusmanovich type matrices with applications
- Pseudospectra localizations and their applications
- Fractional pseudospectra and their localizations
- Sensor network optimization of gearbox based on dependence matrix and improved discrete shuffled frog leaping algorithm
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)
