Skip to main content

Structural dependence and systems of equations

Seminars

  • 557 Accesses

Part of the Lecture Notes in Mathematics book series (LNMCIME,volume 1403)

Abstract

Structural dependence in the incidence matrix associated with a system of equations may be used to detect misspecification of the underlying system. The incidence matrix can be represented as a bipartite graph G=(X,Y,E), with the node sets partitioned into the sets X1, X2, Y1 en Y2, such that (a) there are no edges between X1 en Y2, and (b) the cardinality of X1+Y2 is maximum. Such a partition corresponds with the detection of complete and maximal complementary subsets of structually dependent rows and columns. This problem is equivalent to finding a maximum independent vertex set or a minimum edge cover in thebipartite graph under the assumption of no isolated vertices. The problem of finding minimal and complete subsets of structurally dependent rows or columns is shown to be NP-complete. A heuristic approach for the detection of these minimal subsets based on Hall's transversal algorithm has worked satisfactorily in practice.

Keywords

  • Structural dependence
  • structural rank
  • structural nullity
  • matching
  • bipartite graph
  • transversal
  • system of distinct representatives
  • incidence matrix
  • NP-completeness

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   46.00
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bisschop, J. and Meeraus, A., "On the Development of a General Algebraic Modeling System in a Strategic Planning Environment", Mathematical Programming Study, Vol. 20 (1982) pp. 1–29.

    CrossRef  Google Scholar 

  2. Bunch, J.R., and Rose, D.J., Sparse Matrix Computations, Academic Press Inc. (1976) pp. 275–280.

    Google Scholar 

  3. Brooke, A., Drud, A., and Meeraus, A., "Modeling Systems and Nonlinear Programming in a Research Environment", in: Computer in Engineering 1985 Volume Three, Edited by R. Raghaven and S.M. Rohde, The American Society of Mechanical Engineers (1985) pp. 213–219.

    Google Scholar 

  4. Drud, A., Grais, W., and Pyatt, G., "The Transaction Value Approach — A Systematic Method of Defining Economywide Models Based on Social Accounting Matrices", in: Dynamic Modelling and Control of National Economies 1983, T. Basar and L.F. Pau, eds., Pergamon Press, New York (1983) pp. 241–248.

    Google Scholar 

  5. Fourer, R., "Modeling Languages Versus Matrix Generators for Linear Programming", ACM Transactions on Mathematical Software, Vol 9, No 2 (1983) pp. 143–183.

    CrossRef  Google Scholar 

  6. Gary, M.R., and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Company, 1979.

    Google Scholar 

  7. Hall, P., "On Representatives of Subsets", Journal of the London Mathematical Society, 10 (1935) pp. 26–30.

    Google Scholar 

  8. Lawler E., Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, 1976.

    Google Scholar 

  9. Pissanetzky, S., Sparse Matrix Technology, Academic Press, Inc., 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1989 Springer-Verlag

About this paper

Cite this paper

Bisschop, J., Dorhout, B., Drud, A. (1989). Structural dependence and systems of equations. In: Simeone, B. (eds) Combinatorial Optimization. Lecture Notes in Mathematics, vol 1403. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0083466

Download citation

  • DOI: https://doi.org/10.1007/BFb0083466

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51797-9

  • Online ISBN: 978-3-540-46810-3

  • eBook Packages: Springer Book Archive