We study the trace class perturbations of half-line, discrete Laplacian and obtain a new bound for perturbation determinant corresponding non-self-adjoint Jacobi operator. Based on this bound, we Lieb–Thirring inequalities such operators. The spectral enclosure spectrum embedded eigenvalues are also discussed.

Let K be a symmetric indefinite matrix. Suppose that K 1⁄4 LJL is the generalized Cholesky factorization of K. In this paper we present perturbation analysis for the generalized Cholesky factorization. We obtain the first-order bound on the norm of the perturbation in the generalized Cholesky factor. Also, we give rigorous perturbation bounds. 2002 Elsevier Inc. All rights reserved.

I In this paper, we propose an algorithm base on decomposition technique for solving the mixed integer linear multiplicative-linear bilevel problems. In fact, this algorithm is an application of the algorithm given by G. K. Saharidis et al for the case in which the first level objective function is linear multiplicative. We use properties of quasi-concave of bilevel programming problems and dec...

We introduce in this paper a new algorithm for Multi-Armed Bandit (MAB) problems. A machine learning paradigm popular within Cognitive Network related topics (e.g., Spectrum Sensing and Allocation). We focus on the case where the rewards are exponentially distributed, which is common when dealing with Rayleigh fading channels. This strategy, named Multiplicative Upper Confidence Bound (MUCB), a...

Klein [Klein, A. S. (2006). Separating transducer nonlinearities and multiplicative noise in contrast discrimination. Vision Research, 46, 4279–4293] questions the existence of intrinsic singularities in two-alternative force-choice (2AFC) Signal Detection Theory (SDT) models, suggesting that the singularities found in Katkov et al. [Katkov, M., Tsodyks, M., & Sagi, D. (2006a). Singularities in...

We present a new control design method which guarantees any prespecified componentwise ultimate bound on the state of multiple-input systems with matched perturbations. The method is based on eigenstructure assignment by state feedback and utilises a componentwise bound computation procedure recently proposed by the authors. This procedure exploits both the system and perturbation structures by...

The multiplicative complexity c^(f) of a Boolean function f is the minimum number of AND gates in a circuit representing f which employs only AND, XOR and NOT gates. A constructive upper bound, c^(f) = 2 n 2 +1 ? n=2 ? 2, for any Boolean function f on n variables (n even) is given. A counting argument gives a lower bound of c^(f) = 2 n 2 ? O(n). Thus we have shown a separation, by an exponentia...

The state feedback H1 control problem for standard discrete-time singularly perturbed systems with polytopic uncertainties is considered. Two methods for designing H1 controllers are given in terms of solutions to a set of linear matrix inequalities, where one of them is with the consideration of improving the upper bound of singular perturbation parameter e. Moreover, a method of evaluating th...

The null space method is a standard method for solving the linear least squares problem subject to equality constraints (the LSE problem). We show that three variants of the method, including one used in LAPACK that is based on the generalized QR factorization, are numerically stable. We derive two perturbation bounds for the LSE problem: one of standard form that is not attainable, and a bound...

This paper addresses the H1 control problem via slow state variables feedback for discretetime fuzzy singularly perturbed systems. At first, a method of evaluating the upper bound of singular perturbation parameter with meeting a prescribed H1 performance bound requirement is given. Subsequently, two methods for designing H1 controllers via slow state variables feedback are presented in terms o...