a truly meshless local petrov-galerkin (mlpg) method is developed for solving 3d elasto-static problems. using the general mlpg concept, this method is derived through the local weak forms of the equilibrium equations, by using test functions, namely, the heaviside function. the moving least squares (mls) are chosen to construct the shape functions, for the mlpg method. the penalty approximatio...

We introduce a port (interface) approximation and a posteriori error bound framework for a general component–based static condensation method in the context of parameter–dependent elliptic partial differential equations. The key ingredients are i) efficient empirical port approximation spaces — the dimensions of these spaces may be chosen small in order to reduce the computational cost associat...

Pneumatic artificial muscles exhibit highly non-linear static characteristics especially due to inherent properties of their materials and compressibility of air. Therefore, it is difficult to control them without adequate modeling and simulation. The paper deals with the numerical approximation of the static characteristics of McKibben pneumatic artificial muscle. The muscle force dependence o...

The phase diagram of the random energy model in a transverse field is investigated. Using the replica method and the static approximation, we show that the phase diagram consists of four phases: Quantum paramagnetic, classical paramagnetic, ferromagnetic, and spin-glass phases. We show that the static approximation is valid in the ferromagnetic phase in the limit p → ∞ by using the large-p expa...

The phase diagram of the p-spin-interacting spin glass model in a transverse field is investigated in the limit p → ∞ under the presence of ferromagnetic bias. Using the replica method and the static approximation, we show that the phase diagram consists of four phases: Quantum paramagnetic, classical paramagnetic, ferromagnetic, and spin-glass phases. We also show that the static approximation...

Current feasibility tests for the static priority scheduling of periodic task systems run in pseudo-polynomial time. We present an approximation scheme for feasibility in static priority systems that runs in polynomial time. This test is an approximation with respect to the amount of processor’s capacity that must be “sacrificed” for the test to become exact. We show that an arbitrary level of ...

A key application for static analysis is automatic bug-finding. Given the program source, a static analyzer computes an approximation of dynamic program states occurring at each program point, and reports possible bugs by examining the approximate states. From such static bug-finding analysis, false alarms are inevitable. Because static analysis is done at compile-time, exact computation of the...

We present an approximation scheme for calculating observables and strength functions of finite fermionic systems at finite temperature such as hot nuclei. The approach is formulated within the framework of the HubbardStratonovich transformation and goes beyond the static path approximation and the RPA by taking into account small amplitude time-dependent fluctuations around each static value o...