A uniform approach to test computational complementarity

Studies of computational complementarity properties in finite state interactive automata may shed light on the nature of both quantum and classical computation. But, complementarity is difficult to test even for small-size automata. This paper introduces the concept of an observation graph of an automaton which is used as the main tool for the design of an algorithm which tests, in a uniform manner, two types of complementarity properties. Implementations have been run on a standard desktop computer examining all 5-state binary automata

On the Importance of Displacement History in Soft-Body Contact Models

Two approaches are commonly used for handling frictional contact within the framework of the discrete element method (DEM). One relies on the complementarity method (CM) to enforce a nonpenetration condition and the Coulomb dry-friction model at the interface between two bodies in mutual contact. The second approach, called the penalty method (PM), invokes an elasticity argument to produce a frictional contact force that factors in the local deformation and relative motion of the bodies in contact. We give a brief presentation of a DEM-PM contact model that includes multi-time-step tangential contact displacement history. We show that its implementation in an open-source simulation capability called Chrono is capable of accurately reproducing results from physical tests typical of the field of geomechanics, i.e., direct shear tests on a monodisperse material. Keeping track of the tangential contact displacement history emerges as a key element of the model. We show that identical simulations using contact models that include either no tangential contact displacement history or only single-time-step tangential contact displacement history are unable to accurately model the direct shear test

Enumeration of PLCP-orientations of the 4-cube

The linear complementarity problem (LCP) provides a unified approach to many problems such as linear programs, convex quadratic programs, and bimatrix games. The general LCP is known to be NP-hard, but there are some promising results that suggest the possibility that the LCP with a P-matrix (PLCP) may be polynomial-time solvable. However, no polynomial-time algorithm for the PLCP has been found yet and the computational complexity of the PLCP remains open. Simple principal pivoting (SPP) algorithms, also known as Bard-type algorithms, are candidates for polynomial-time algorithms for the PLCP. In 1978, Stickney and Watson interpreted SPP algorithms as a family of algorithms that seek the sink of unique-sink orientations of $n$-cubes. They performed the enumeration of the arising orientations of the $3$-cube, hereafter called PLCP-orientations. In this paper, we present the enumeration of PLCP-orientations of the $4$-cube.The enumeration is done via construction of oriented matroids generalizing P-matrices and realizability classification of oriented matroids.Some insights obtained in the computational experiments are presented as well

Smooth finite strain plasticity with non-local pressure support

The aim of this work is to introduce an alternative framework to solve problems of finite strain elastoplasticity including anisotropy and kinematic hardening coupled with any isotropic hyperelastic law. After deriving the constitutive equations and inequalities without any of the customary simplifications, we arrive at a new general elasto-plastic system. We integrate the elasto-plastic algebraico-differential system and replace the loading–unloading condition by a Chen–Mangasarian smooth function to obtain a non-linear system solved by a trust region method. Despite being non-standard, this approach is advantageous, since quadratic convergence is always obtained by the non-linear solver and very large steps can be used with negligible effect in the results. Discretized equilibrium is, in contrast with traditional approaches, smooth and well behaved. In addition, since no return mapping algorithm is used, there is no need to use a predictor. The work follows our previous studies of element technology and highly non-linear visco-elasticity. From a general framework, with exact linearization, systematic particularization is made to prototype constitutive models shown as examples. Our element with non-local pressure support is used. Examples illustrating the generality of the method are presented with excellent results

Revisiting minimum profit conditions in uniform price day-ahead electricity auctions

We examine the problem of clearing day-ahead electricity market auctions where each bidder, whether a producer or consumer, can specify a minimum profit or maximum payment condition constraining the acceptance of a set of bid curves spanning multiple time periods in locations connected through a transmission network with linear constraints. Such types of conditions are for example considered in the Spanish and Portuguese day-ahead markets. This helps describing the recovery of start-up costs of a power plant, or analogously for a large consumer, utility reduced by a constant term. A new market model is proposed with a corresponding MILP formulation for uniform locational price day-ahead auctions, handling bids with a minimum profit or maximum payment condition in a uniform and computationally-efficient way. An exact decomposition procedure with sparse strengthened Benders cuts derived from the MILP formulation is also proposed. The MILP formulation and the decomposition procedure are similar to computationally-efficient approaches previously proposed to handle so-called block bids according to European market rules, though the clearing conditions could appear different at first sight. Both solving approaches are also valid to deal with both kinds of bids simultaneously, as block bids with a minimum acceptance ratio, generalizing fully indivisible block bids, are but a special case of the MP bids introduced here. We argue in favour of the MP bids by comparing them to previous models for minimum profit conditions proposed in the academic literature, and to the model for minimum income conditions used by the Spanish power exchange OMIE