Let A = (an;k)n;k1 and B = (bn;k)n;k1 be two non-negative ma-trices. Denote by Lv;p;q;B(A), the supremum of those L, satisfying the followinginequality:k Ax kv;B(q) L k x kv;B(p);where x 0 and x 2 lp(v;B) and also v = (vn)1n=1 is an increasing, non-negativesequence of real numbers. In this paper, we obtain a Hardy-type formula forLv;p;q;B(H), where H is the Hausdor matrix and 0 < q p 1. Also...

it is proved that by using bounds of eigenvalues of an interval matrix, someconditions for checking positive deniteness and stability of interval matricescan be presented. these conditions have been proved previously with variousmethods and now we provide some new proofs for them with a unity method.furthermore we introduce a new necessary and sucient condition for checkingstability of interv...

Randomized Kaczmarz, Motzkin Method and Sampling Kaczmarz (SKM) algorithms are commonly used iterative techniques for solving a system of linear inequalities (i.e., \(Ax \le b\)). As systems equations represent modeling paradigm many optimization problems, these randomized gaining popularity among researchers in different domains. In this work, we propose Generalized (GSKM) method that unifies ...

this paper analyzes a linear system of equations when the righthandside is a fuzzy vector and the coefficient matrix is a crisp m-matrix. thefuzzy linear system (fls) is converted to the equivalent crisp system withcoefficient matrix of dimension 2n × 2n. however, solving this crisp system isdifficult for large n because of dimensionality problems . it is shown that thisdifficulty may be avoide...

begin{abstract} the relations between the spectrum of the matrix $q+r$ and the spectra of the matrices $(gamma + delta)q+(alpha + beta)r-qr-rq$, $qr-rq$, $alpha beta r-qrq$, $alpha rqr-(qr)^{2}$, and $beta r-qr$ have been given on condition that the matrix $q+r$ is diagonalizable, where $q$, $r$ are ${alpha, beta}$-quadratic matrix and ${gamma, delta}$-quadratic matrix, respectively, of order $...

in this paper, we derive the necessary and sufficient conditions for the quaternion matrix equation xa=b to have the least-square bisymmetric solution and give the expression of such solution when the solvability conditions are met. futhermore, we consider the maximal and minimal inertias of the least-square bisymmetric solution to this equation. as applications, we derive sufficient and necess...

results migration of cells started on the fifth day. as a result of this migration, most cells were located on the surface of the scaffold and formed epiderm-like structure and some penetrated into the scaffold. by day 25, cells which had penetrated into the scaffold had various destinies such as becoming elongated spindle-shaped cells and creating blood vessel-like structures. conclusions adm ...

In this paper we study several classes of stochastic optimization algorithms enriched with heavy ball momentum. Among the methods studied are: stochastic gradient descent, stochastic Newton, stochastic proximal point and stochastic dual subspace ascent. This is the first time momentum variants of several of these methods are studied. We choose to perform our analysis in a setting in which all o...

A device has two arms with unknown deterministic payoffs, and the aim is to asymptotically identify the best one without spending too much time on the other. The Narendra algorithm offers a stochastic procedure to this end. We show under weak ergodic assumptions on these deterministic payoffs that the procedure eventually chooses the best arm (i.e. with greatest Cesaro limit) with probability o...