Abstract
In this paper we consider the complementarity problem NCP(f) with f(x) = Mx + φ(x), where M ∈ R n×n is a real matrix and φ is a so-called tridiagonal (nonlinear) mapping. This problem occurs, for example, if certain classes of free boundary problems are discretized. We compute error bounds for approximations \({\hat x}\) to a solution x* of the discretized problems. The error bounds are improved by an iterative method and can be made arbitrarily small. The ideas are illustrated by numerical experiments.
Similar content being viewed by others
References
Alefeld GE, Chen X, Potra FA (1999) Validation of solution to linear complementarity problems. Numer Math 83: 1–23
Alefeld GE, Mayer G (2000) Interval analysis: theory and applications. J Comp Appl Math 121: 421–464
Alefeld GE, Chen X, Potra FA (2002) Numerical validation of solutions of complementarity problems: the nonlinear case. Numer Math 92: 1–16
Alefeld GE, Schäfer U (2003) Iterative methods for linear complementarity problems with interval data. Computing 70: 235–259
Alefeld GE, Wang Z, Shen Z (2004) Enclosing solutions of linear complementarity problems for H-matrices. Reliab Comput 10: 423–435
Alefeld GE, Wang Z (2005) Verification of solutions for almost linear complementarity problems. Ann Eur Acad Sci 211–231
Alefeld GE, Wang Z (2008) Error estimation for nonlinear complementarity problems via linear systems with interval data. Numer Funct Anal Optim 29(3–4): 243–267
Chen B (2001) Error bounds for R0-type and monotone nonlinear complementarity problems. J Optim Theory Appl 108: 297–316
Chen X, Xiang S (2006) Computation of error bounds for P-matrix linear complementarity problems. Math Prog Ser A 106: 513–525
Collatz L (1966) The numerical treatment of differential equations. 2nd Printing of the 3rd edn. Springer, Berlin
Facchinei F, Pang JS (2003) Finite-dimensional variational inequalities and complementarity problems. Springer, New York
Ferris MC, Mangasarian OL (1993) Error bounds and strong upper semicontinuity for monotone affine variational inequalities. Ann Oper Res 47: 293–305
Ferris MC, Pang JS (1997) Engineering and economic applications of complementarity problems. SIAM Rev 39(4): 669–713
Mangasarian OL, Ren J (1994) New improved error bounds for the linear complementarity problem. Math Prog 66: 241–257
Mathias R, Pang JS (1990) Error bounds for the linear complementarity problem with a P-matrix. Linear Algebra Appl 132: 123–136
Neumaier A (1990) Interval methods for systems of equations. Cambridge University Press, Cambridge
Pang JS (1997) Error bounds in mathematical programming. Math Prog 79: 199–332
Rump SM (1999) INTLAB-INTerval LABoratory. In: Csendes T (eds) Developments in reliable computing. Kluwer, Dordrecht, pp 77–104
Varga RS (1962) Matrix iterative analysis. Prentice-Hall, Englewood Cliffs
Wang Z (2007) Validation and enclosure of solutions of linear complementarity problems. Computing 79: 61–77
Author information
Authors and Affiliations
Corresponding author
Additional information
The work of Z. Wang was supported in part by a grant from the State of Baden-Württemberg and by grant-10771099 from the National Natural Science Foundation of China. Z. Wang would also like to appreciate Universität Karlsruhe for the kind invitation.
Rights and permissions
About this article
Cite this article
Alefeld, G., Wang, Z. Error bounds for complementarity problems with tridiagonal nonlinear functions. Computing 83, 175–192 (2008). https://doi.org/10.1007/s00607-008-0021-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00607-008-0021-8