This paper analyses the performance of a genetic algorithm using a new concept, namely a fractional-order dynamic fitness function, for the synthesis of combinational logic circuits. The experiments reveal superior results in terms of speed and convergence to achieve a solution. Keywords— Circuit Design, Fractional-Order Systems, Genetic Algorithms, Logic Circuits.

The following critical phenomenon was recently discovered. When a memoryless source is compressed using a variable-length fixed-distortion code, the fastest convergence rate of the (pointwise) compression ratio to R(D) is either O( √ n) or O(logn). We show it is always O( √ n), except for discrete, uniformly distributed sources. Keywords—Redundancy, rate-distortion theory, lossy data compression

This work proposes a recursive weighted ELS algorithm for system identification by applying numerically robust orthogonal Householder transformations. The properties of the proposed algorithm show it obtains acceptable results in a noisy environment: fast convergence and asymptotically unbiased estimates. Comparative analysis with others robust methods well known from literature are also presen...

A proof of convergence of a new continuation algorithm for computing the Analytic SVD for a large sparse parameter– dependent matrix is given. The algorithm itself was developed and numerically tested in [5]. Keywords—Analytic Singular Value Decomposition, large sparse parameter–dependent matrices, continuation algorithm of a predictorcorrector type.

An upwind difference approximation is used for a singularly perturbed problem in material science. Based on the discrete Green’s function theory, the error estimate in maximum norm is achieved, which is first-order uniformly convergent with respect to the perturbation parameter. The numerical experimental result is verified the valid of the theoretical analysis. Keywords—singularly perturbed, u...

Non monotone algorithms allow a possible increase of function values at certain iterations. This paper gives a suitable control on this increase to preserve the convergence properties of its monotone counterpart. A new efficient MultiLineal Search is also proposed for minimization algorithms. keywords: Non Monotone, Lineal Search, Trust Region.

This paper analyses the performance of a genetic algorithm using a new concept, namely a fractional-order dynamic fitness function, for the synthesis of combinational logic circuits. The experiments reveal superior results in terms of speed and convergence to achieve a solution. Keywords— Circuit Design, Fractional-Order Systems, Genetic Algorithms, Logic Circuits.

In this note, we consider a family of iterative formula for computing the weighted Minskowski inverses A ⊕ M,N in Minskowski space, and give two kinds of iterations and the necessary and sufficient conditions of the convergence of iterations. Keywords—iterative method, the Minskowski inverse, A ⊕ M,N inverse.

This paper analyses the performance of a genetic algorithm using a new concept, namely a fractional-order dynamic fitness function, for the synthesis of combinational logic circuits. The experiments reveal superior results in terms of speed and convergence to achieve a solution. Keywords— Circuit Design, Fractional-Order Systems, Genetic Algorithms, Logic Circuits.

We present a simple nonconforming approximation of the linear two–point boundary value problem which violates patch test requirements. Nevertheless the solutions, obtained from these type of approximations, converge to the exact solution. Keywords—generalized patch test, Irons’ patch test, nonconforming finite element, convergence