Chein-Shan Liu1
CMC-Computers, Materials & Continua, Vol.8, No.2, pp. 53-66, 2008, DOI:10.3970/cmc.2008.008.053
Abstract Proposed is a time-marching algorithm to solve a nonlinear system of complementarity equations: Pi(xj) ≥ 0, Qi(xj) ≥ 0 , Pi(xj)Qi(xj) = 0, i, j = 1,...,n, resulting from a discretization of nonlinear obstacle problem. We transform the above nonlinear complementarity problem (NCP) into a nonlinear algebraic equations (NAEs) system: Fi(xj) = 0 with the aid of the Fischer-Burmeister NCP-function. Such NAEs are semi-smooth, highly nonlinear and usually implicit, being hard to handle by the Newton-like method. Instead of, a first-order system of ODEs is derived through a fictitious time equation. The time-stepping equations are obtained by applying a numerical… More >
Login
Register
