High performance computing more and more is used in all kinds of fields. But, for the common user, there are several questions on implementing the process of competing on the specialized cluster: such as expense high, management difficulty and operation complex and so on. To these problems, this article designs and realizes the high performance computing environment based on Linux cluster after...

Advances in experimental biology, coupled with advances in computational power, bring new challenges to the interdisciplinary field of computational biology. One such broad challenge lies in the reverse engineering of gene networks, and goes from determining the structure of static networks, to reconstructing the dynamics of interactions from time series data. Here, we focus our attention on th...

The paper rst investigates Newton-type methods for generalized equations with compact solution sets. The analysis of their local convergence behavior is based, besides other conditions, on the upper Lipschitz-continuity of the local solution set mapping of a simply perturbed generalized equation. This approach is then applied to the KKT conditions of a nonlinear program with inequality constrai...

We analyse the elementwise convergence in the Jacobian of the classical Newton method as the solution of a non-linear system f(x) = 0 is approached. It is shown that each Jacobian element approaches a constant value at a rate determined by the nonlinearity of the relevant function with respect to the appropriate scalar variable. For many practical problems, this means that in the last steps of ...

In order to approximate any nonlinear system, not just affine nonlinear systems, generalized T-S fuzzy systems, where the control variables and the state variables, are all premise variables are introduced in the paper. Firstly, fuzzy spaces and rules were determined by using ant colony algorithm. Secondly, the state-space model parameters are identified by using genetic algorithm. The simulati...

We present a new linearization technique based upon differential approximation which is considerably simpler and more flexible than those used in our previous work.

We analyze the s-step biconjugate gradient algorithm in finite precision arithmetic and derive a bound for the residual norm in terms of a minimum polynomial of a perturbed matrix multiplied by an amplification factor. Our bound enables comparison of s-step and classical biconjugate gradient in terms of amplification factors. Our results show that for s-step biconjugate gradient, the amplificat...

For Tikhonov's regularization of ill-posed linear integral equations, numerical accuracy is estimated by a modulus of convergence, for which upper and lower bounds are obtained. Applications are made to the backward heat equation, to harmonic continuation, and to numerical differentiation.

Developing automotive electronic control units (ECUs) or sensors requires thorough immunity tests to prevent them from malfunctions caused by onboard or external electromagnetic noise. To reduce the development costs and time from repeating those tests, EM noise tolerance design at the design stage is important. If the estimation of intruding noise from wire harness into ECU or sensor becomes p...