We consider a mathematical model which describes the contact between a deformable body and an obstacle, the so-called foundation. The body is assumed to have a viscoelastic behavior that we model with the Kelvin-Voigt constitutive law. The contact is frictionless and is modeled with the well-known Signorini condition in a form with a zero gap function. We present two alternative yet equivalent weak formulations of the problem and establish existence and uniqueness results for both formulations. The proofs are based on a general result on evolution equations with maximal monotone operators. We then study a semi-discrete numerical scheme for the problem, in terms of displacements. The numerical scheme has a unique solution. We show the convergence of the scheme under the basic solution regularity. Under appropriate regularity assumptions on the solution, we also provide optimal order error estimates.

An artificial retina is a plane circuit, consisting of a matrix of photocaptors; each has its own memory, consisting in a small number of cells (3 to 5), arranged in parallel planes. The treatment consists in logical operations between planes, plus translations of any plane: they are called “elementary operations” (EO). A retina operator (RO) is a transformation of the image, defined by a specific representation of a Boolean function of $n$ variables ($n$ is the number of neighboring cells taken into account). What is the best way to represent an RO by means of EO, considering the strong limitation of memory? For most retina operators, the complexity (i.e., the number of EO needed) is exponential, no matter what representation is used, but, for specific classes, threshold functions and more generally symmetric functions, we obtain a result several orders of magnitude better than previously known ones. It uses a new representation, called “Block Addition of Variables.” For instance, the threshold function $T_{25,12}$ (find if at least 12 pixels are at 1 in a square of $5\times 5$) required 62 403 599 EO to be performed. With our method, it requires only 38 084 operations, using three memory cells.