Numerical Solution of a Junction Problem

Abstract

We consider the numerical solution of a junction problem involving bilateral restrictions and described by a variational inequality (V.I.). After a discretization phase, the resulting discrete V.I. is solved by an algorithm which combines fast methods for solving the bilateral obstacle problems and algorithms of Newton type for solving a convex optimization problem on the set (R+)^(R+1). The algorithm is highly efficient and finds the discrete solution in a finite number of steps.