Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2012, Article ID 305415, 26 pages
http://dx.doi.org/10.1155/2012/305415
Research Article

A Graph Approach to Observability in Physical Sparse Linear Systems

Grupo Integrado de Ingeniería, Universidade da Coruña, Mendizábal S/N, 15403 Ferrol, Spain

Received 28 November 2011; Revised 2 March 2012; Accepted 16 March 2012

Academic Editor: Massimiliano Ferronato

Copyright © 2012 Santiago Vazquez-Rodriguez et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. R. E. Kalman, “Mathematical description of linear dynamical systems,” SIAM Journal on Control and Optimization, vol. 1, pp. 152–192, 1963. View at Google Scholar · View at Zentralblatt MATH
  2. J. Li, L. L. H. Andrew, C. H. Foh, M. Zukerman, and H. H. Chen, “Connectivity, coverage and placement in wireless sensor networks,” Sensors, vol. 9, no. 10, pp. 7664–7693, 2009. View at Publisher · View at Google Scholar · View at Scopus
  3. C. T. Lin, “Structural controllability,” IEEE Transactions on Automatic Control, vol. 19, pp. 201–208, 1974. View at Google Scholar · View at Zentralblatt MATH
  4. J.-M. Dion, C. Commault, and J. van der Woude, “Generic properties and control of linear structured systems: a survey,” Automatica, vol. 39, no. 7, pp. 1125–1144, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  5. T. Boukhobza, F. Hamelin, and S. Martinez-Martinez, “State and input observability for structured linear systems: a graph-theoretic approach,” Automatica, vol. 43, no. 7, pp. 1204–1210, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  6. T. Boukhobza and F. Hamelin, “Observability analysis for structured bilinear systems: a graph-theoretic approach,” Automatica, vol. 43, no. 11, pp. 1968–1974, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  7. F. C. Schweppe, “Power system static-state estimation, parts I,II and III,” IEEE Transactions on Power Apparatus and Systems, vol. 89, no. 1, pp. 120–135, 1970. View at Google Scholar
  8. A. Monticelli and F. F. Wu, “Network observability: theory,” IEEE Transactions on Power Apparatus and Systems, vol. 104, no. 5, pp. 1042–1048, 1985. View at Google Scholar · View at Scopus
  9. G. R. Krumpholz, K. A. Clements, and P. W. David, “Power system observability: a practical algorithm using network topology,” IEEE Transactions on Power Apparatus and Systems, vol. 99, no. 4, pp. 1534–1542, 1980. View at Google Scholar · View at Scopus
  10. E. Castillo, P. Jiménez, J. M. Menéndez, and A. J. Conejo, “The observability problem in traffic models: Algebraic and topological methods,” IEEE Transactions on Intelligent Transportation Systems, vol. 9, no. 2, pp. 275–287, 2008. View at Publisher · View at Google Scholar · View at Scopus
  11. V. Veverka and F. Madron, Material and Energy Balancing in the Process Industries: from Microscopic Balances to Large Plants, Computeraided Chemical Engineering, Elsevier Science, 1997.
  12. V. H. Quintana, A. Simoes-Costa, and A. Mandel, “Power system topological observability using a direct graph-theoretic approach,” IEEE Transactions on Power Apparatus and Systems, vol. 101, no. 3, pp. 617–626, 1982. View at Google Scholar · View at Scopus
  13. R. R. Nucera and M. L. Gilles, “Observability analysis: a new topological algorithm,” IEEE Transactions on Power Systems, vol. 6, no. 2, pp. 466–475, 1991. View at Publisher · View at Google Scholar · View at Scopus
  14. G. N. Korres and P. J. Katsikas, “A hybrid method for observability analysis using a reduced network graph theory,” IEEE Transactions on Power Systems, vol. 18, no. 1, pp. 295–304, 2003. View at Publisher · View at Google Scholar · View at Scopus
  15. S. Vazquez-Rodriguez, A. Faina, and B. Neira-Duenas, “An evolutionary technique with fast convergence for power system topological observability analysis,” in Proceedings of the IEEE Congress on Evolutionary Computation (CEC '06), pp. 3086–3090, 2006.
  16. J. R. Rice, Matrix Computations and Mathematical Software, McGraw-Hill Computer Science Series, McGraw-Hill, New York, NY, USA, 1983.
  17. H. J. Kim, “A new algorithm for solving ill-conditioned linear systems,” IEEE Transactions on Magnetics, vol. 32, no. 3, pp. 1373–1376, 1996. View at Google Scholar · View at Scopus
  18. S. K. Kurtzl, “A direct algorithm for solving ill-conditioned linear algebraic systems,” Advances, vol. 42, pp. 629–633, 2000. View at Google Scholar
  19. M. Cosnard and L. Grigori, “Using postordering and static symbolic factorization for parallel sparse lu,” in Proceedings of the 14th International Parallel and Distributed Processing Symposium (IPDPS '00), pp. 807–812, 2000.
  20. W. F. Tinney, V. Brandwajn, and S. M. Chan, “Sparse vector methods,” IEEE Transactions on Power Apparatus and Systems, vol. 104, no. 2, pp. 295–301, 1985. View at Google Scholar · View at Scopus
  21. J. R. Bunch and D. J. Rose, “Partitioning, tearing and modification of sparse linear systems,” Journal of Mathematical Analysis and Applications, vol. 48, pp. 574–593, 1974. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  22. K. A. Clements, G. R. Krumpholz, and P. W. Davis, “Power system state estimation with measurement deficiency: an algorithm that determines the maximal observable subnetwork,” IEEE Transactions on Power Apparatus and Systems, vol. 101, no. 9, pp. 3044–3052, 1982. View at Google Scholar · View at Scopus
  23. S. Nguyen and C. Dupuis, “An efficient method for computing traffic equilibria in networks with asymmetric transportation costs,” Transportation Science, vol. 18, no. 2, pp. 185–202, 1984. View at Google Scholar · View at Scopus