The effectiveness of pattern-match searching for the fragment on image using set of pseudo-gradient procedures covering all initial image by their workplaces is studied. Procedures control is managed to reduce computational expenses and based on analysis of penalty function and giving priority of making next iteration to procedure that has minimum value of penalty. It is considered that require...

This paper proposes a new method for real-time rigid body simulations for haptic interactions based on a penalty method regarding contact volume. Analytical methods for calculation of contact forces require too much time to maintain fast update rates for haptic controls. In addition, they prohibit direct connection of haptic interfaces. Penalty methods, which employ spring-damper models for cal...

Abstract. We present a new aggregation operator called the generalized ordered weighted proportional averaging (GOWPA) operator based on an optimal model with penalty function, which extends the ordered weighted geometric averaging (OWGA) operator. We investigate some properties and different families of the GOWPA operator. We also generalize the GOWPA operator. The key advantage of the GOWPA o...

Current spectral simulations of Einstein’s equations require writing the equations in first-order form, potentially introducing instabilities and inefficiencies. We present a new penalty method for pseudospectral evolutions of second order in space wave equations. The penalties are constructed as functions of Legendre polynomials and are added to the equations of motion everywhere, not only on ...

We study finite element methods for the displacement obstacle problem of clamped Kirchhoff plates. A unified convergence analysis is provided for C1 finite element methods, classical nonconforming finite element methods and C0 interior penalty methods. Under the condition that the obstacles are sufficiently smooth and that they are separated from each other and the zero displacement boundary co...

In this paper, a super spectral viscosity method using the Chebyshev differential operator of high order Ds = ( √ 1− x2∂x) is developed for nonlinear conservation laws. The boundary conditions are treated by a penalty method. Compared with the second-order spectral viscosity method, the super one is much weaker while still guaranteeing the convergence of the bounded solution of the Chebyshev–Ga...

The volume penalty method provides a simple, efficient approach for solving the incompressible Navier-Stokes equations in domains with boundaries or in the presence of moving objects. Despite the simplicity, the method suffers from poor convergence in the penalty parameter, thereby restricting accuracy of any numerical method. We demonstrate that one may achieve high order accuracy by introduci...

In this paper an exact penalty line search is introduced for solving constrained nonlinear programing. By this method it is possible to solve some problems with combining penalty method and SQP method, and in any iteration for producing new stepone can uses linear search and solves unconstrained optimization by exact penalty function. In this method a linear programming subproblem with trust ar...

We propose a penalty-function method for constrained molecular dynamics simulation by defining a quadratic penalty function for the constraints. The simulation with such a method can be done by using a conventional, unconstrained solver only with the penalty parameter increased in an appropriate manner as the simulation proceeds. More specifically, we scale the constraints with their force cons...