The paper shows that the global resolution of a general convex quadratic program with complementarity constraints (QPCC), possibly infeasible or unbounded, can be accomplished in finite time. The method constructs a minmax mixed integer formulation by introducing finitely many binary variables, one for each complementarity constraint. Based on the primal-dual relationship of a pair of convex qu...

Block iterative methods are applied to hydrodynamic simulations of a one-dimensional (1-D) submicrometer semiconductor device. We show that block successive underrelaxation (SUR) converges with a fixed relaxation factor w = 0.13 for simulations at 300 K and w = 0.04 at 77 K . To demonstrate the robustness of the block iterative method, we present numerical simulations of a steady-state electron...

We propose the new mechanism of neutrino flavour relaxation to explain the experimentally observed changes of initial neutrino flavour fluxes. The test of neutrino relaxation hypothesis is presented, using the data of modern reactor, solar and accelerator experiments. The final choice between the standard neutrino oscillations and the proposed neutrino flavour relaxation model can be done in fu...

This paper presents several new distributed algorithms to solve consensus based estimation problems in a decentralized way by adopting the well-known relaxation methods Jacobi, Gauss-Seidel and successive over-relaxation within a sensor network. In distributed estimation, all nodes collaborate to estimate the signals emitted from some common sources, employing iterative processing with one-hop ...

We consider the application of semi-iterative methods (SIM) to the standard (SOR) method with complex relaxation parameter ω, under the following two assumptions: (1) the associated Jacobi matrix J is consistently ordered and weakly cyclic of index 2, and (2) the spectrum σ(J ) of J belongs to a compact subset of the complex plane C, which is symmetric with respect to the origin. By using resul...

The successive overrelaxation (SOR) method is an example of a classical iterative method for the approximate solution of a system of linear equations. Its iteration matrix depends on a relaxation parameter. There is no explicit formula for the optimal relaxation parameter in terms of properties of the system matrix of a general system matrix. However, for the classical model problem of a finite...

Client with post cesarean section is suffering of pain. The pain can cause the anxiety. The anxiety state can be reduced by anxiety management. The anxiety management is not only pharmacological remedy, but also non pharmacological treatment. The aim of the study is to identify the reduction of anxiety level with Benson Relaxation Technique among client with post cesarean section. The design of...

This paper is concerned with the solvability and waveform relaxation methods of linear variable-coefficient differential-algebraic equations (DAEs). Most of the previous works have been focused on linear variable-coefficient DAEs with smooth coefficients and data, yet no results related to the convergence rate of the corresponding waveform relaxation methods has been obtained. In this paper, we...

The convergence of waveform relaxation techniques for solving functional-diierential equations is studied. New error estimates are derived that hold under linear and nonlinear conditions for the right-hand side of the equation. Sharp error bounds are obtained under generalized time-dependent Lipschitz conditions. The convergence of the waveform method and the quality of the a priori error bound...

Given a set of clients and a set of potential sites for facilities, the p-median problem consists of opening a set of p sites and assigning each client to the closest open facility to it. It can be viewed as a variation of the uncapacitated facility location problem. We propose a new formulation of this problem by a mixed integer linear problem. We show that this formulation, while it has the s...