Skip to main content
SpringerLink
Log in

Validation and enclosure of solutions of linear complementarity problems

  • Published:
Computing Aims and scope Submit manuscript

Abstract

An inclusion condition is presented to guarantee the existence of the solution of the linear complementarity problem in a given domain. The condition can be tested numerically with very small computational cost. Based on the condition algorithms are designed to compute an interval to enclose the unknown solution. Numerical results are reported to support the theoretical analysis in the paper.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • G. E. Alefeld X. Chen F. A. Potra (1999) ArticleTitleNumerical validation of solutions of linear complementarity problems Numer. Math. 83 1–23 Occurrence Handle0933.65072 Occurrence Handle10.1007/s002110050437 Occurrence Handle1702615

    Article  MATH  MathSciNet  Google Scholar 

  • G. E. Alefeld G. Mayer (2000) ArticleTitleInterval analysis: theory and applications J. Comput. Appl. Math. 121 421–464 Occurrence Handle0995.65056 Occurrence Handle10.1016/S0377-0427(00)00342-3 Occurrence Handle1780057

    Article  MATH  MathSciNet  Google Scholar 

  • G. E. Alefeld U. Schäfer (2003) ArticleTitleIterative methods for linear complementarity problems with interval data Computing 70 235–259 Occurrence Handle1029.90072 Occurrence Handle2011611

    MATH  MathSciNet  Google Scholar 

  • G. E. Alefeld Z. Wang Z. Shen (2004) ArticleTitleEnclosing solutions of linear complementarity problems for H-matrices Reliab. Comput. 10 423–435 Occurrence Handle1074.65066 Occurrence Handle10.1023/B:REOM.0000047093.79994.8f Occurrence Handle2091076

    Article  MATH  MathSciNet  Google Scholar 

  • J. C. Bierlein (1975) ArticleTitleThe journal bearing Sci. Amer. 233 50–64 Occurrence Handle10.1038/scientificamerican0775-50

    Article  Google Scholar 

  • R. W. Cottle J. S. Pang R. E. Stone (1992) The linear complementarity problem Academic Press New York Occurrence Handle0757.90078

    MATH  Google Scholar 

  • C. W. Cryer (1971) ArticleTitleThe method of Christopherson for solving free boundary problems for infinite journal bearings by means of finite differences Math. Comp. 25 435–443 Occurrence Handle0223.65044 Occurrence Handle10.2307/2005205 Occurrence Handle298961

    Article  MATH  MathSciNet  Google Scholar 

  • M. C. Ferris J. S. Pang (1997) ArticleTitleEngineering and economic applications of complementarity problems SIAM Rev. 39 IssueID4 669–713 Occurrence Handle0891.90158 Occurrence Handle10.1137/S0036144595285963 Occurrence Handle1491052

    Article  MATH  MathSciNet  Google Scholar 

  • E. Hansen S. Sengupta (1981) ArticleTitleBounding solutions of systems of equations using interval analysis BIT 21 203–211 Occurrence Handle0455.65037 Occurrence Handle10.1007/BF01933165 Occurrence Handle627881

    Article  MATH  MathSciNet  Google Scholar 

  • C. Kelley E. Sachs (1994) ArticleTitleMultilevel algorithms for constrained compact fixed point problems SIAM J. Sci. Compt. 15 645–667 Occurrence Handle0804.65061 Occurrence Handle10.1137/0915042 Occurrence Handle1273157

    Article  MATH  MathSciNet  Google Scholar 

  • R. E. Moore (1977) ArticleTitleA test of existence of solutions to nonlinear systems SIAM J. Numer. Anal. 14 611–615 Occurrence Handle0365.65034 Occurrence Handle10.1137/0714040 Occurrence Handle657002

    Article  MATH  MathSciNet  Google Scholar 

  • A. Neumaier (1990) Interval methods for systems of equations Cambridge University Press Cambridge Occurrence Handle0715.65030

    MATH  Google Scholar 

  • J. M. Ortega W. C. Rheinbolt (1970) Iterative solution of nonlinear equations in several variables Academic Press New York Occurrence Handle0241.65046

    MATH  Google Scholar 

  • J. S. Pang (1990) ArticleTitleNewton’s method for B-differentiable equations Math. Oper. Res. 15 311–341 Occurrence Handle0716.90090 Occurrence Handle1051575 Occurrence Handle10.1287/moor.15.2.311

    Article  MATH  MathSciNet  Google Scholar 

  • R. J. Plemmons (1977) ArticleTitleM-matrix characterizations I: nonsingular M-matrices Linear Algebra Appl. 18 175–188 Occurrence Handle0359.15005 Occurrence Handle10.1016/0024-3795(77)90073-8 Occurrence Handle444681

    Article  MATH  MathSciNet  Google Scholar 

  • S. M. Rump (1999) INTLAB-INTerval LABoratory T. Csendes (Eds) Developments in Reliable Computing Kluwer Academic Publishers Dordrecht 77–104

    Google Scholar 

  • H. Samelson R. M. Thrall O. Wesler (1958) ArticleTitleA partition theorem for Euclidean n-space Proc. Amer. Math. Soc. 9 805–807 Occurrence Handle0117.37901 Occurrence Handle10.2307/2033091 Occurrence Handle97025

    Article  MATH  MathSciNet  Google Scholar 

  • U. Schäfer (2001) ArticleTitleAn enclosure method for free boundary problems based on a linear complementarity problem with interval data Numer. Funct. Anal. Optim. 22 991–1011 Occurrence Handle1022.90033 Occurrence Handle10.1081/NFA-100108319 Occurrence Handle1871871

    Article  MATH  MathSciNet  Google Scholar 

  • Varga, R.: Matrix iterative analysis. 2nd revised and expanded edition. Berlin Heidelberg New York: Springer 2000.

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Nanjing University, HanKouLu 22, Nanjing, 210093, China

    Z. Wang

  2. Institute of Computational Mathematics and Scientific/Engineering Computing, Chinese Academy of Sciences, ZhongGuanCun DongLu 55, Beijing, 100080, China

    Z. Wang

Authors
  1. Z. Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Z. Wang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, Z. Validation and enclosure of solutions of linear complementarity problems. Computing 79, 61–77 (2007). https://doi.org/10.1007/s00607-007-0218-2

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00607-007-0218-2

AMS Subject Classifications

Keywords

Search

Navigation