[PDF] Top 20 vol18_pp176-191. 219KB Jun 04 2011 12:06:02 AM
Has 10000 "vol18_pp176-191. 219KB Jun 04 2011 12:06:02 AM" found on our website. Below are the top 20 most common "vol18_pp176-191. 219KB Jun 04 2011 12:06:02 AM".
vol18_pp176-191. 219KB Jun 04 2011 12:06:02 AM
... If we can find a signing for D that makes the sign of every cycle +, then the digraph D hasQ-completion, and since by Corollary 2.5 we can make the problem easier by removing arcs fromD [r] ... Lihat dokumen lengkap
16
vol18_pp117-125. 106KB Jun 04 2011 12:06:02 AM
... Research on representations of the group inverse of block matrices is an important effort in generalized inverse theory of matrices;see [14] and [13]. Indeed, generalized inverses are useful tools in areas such as ... Lihat dokumen lengkap
9
vol18_pp246-252. 107KB Jun 04 2011 12:06:02 AM
... Linear complementarity problem, Moore-Penrose inverse, Verified solution, Abso-lute value equation.. AMS subject classifications.90C33.[r] ... Lihat dokumen lengkap
7
vol18_pp233-245. 150KB Jun 04 2011 12:06:02 AM
... Observe that if we apply a similar labeling to T as in the previous section and consider the bidirected tree T with the underlying tree structure T, and use the weights ui = x ∀i, vi = y[r] ... Lihat dokumen lengkap
13
vol18_pp222-232. 135KB Jun 04 2011 12:06:02 AM
... 2.5 Referring to the already mentioned fact that any transformation of the formA −→ SAS∗ with some invertible bounded linear or conjugate-linear operatorS onH pre-serves Lebesgue deco[r] ... Lihat dokumen lengkap
11
vol18_pp211-221. 118KB Jun 04 2011 12:06:02 AM
... In either event, the smallest eigenvalue ofAis real, has algebraic multiplicity one and its typical eigenvector is totally nonzero with sign pattern corresponding to that of a column of [r] ... Lihat dokumen lengkap
11
vol18_pp192-201. 146KB Jun 04 2011 12:06:02 AM
... Ifvis connected to exactly one of its neighbors by a single edge, then M+G =M+H, where H is the graph obtained from G−v by connecting r1 and r2 by two edges in parallel.. LetHi fori= 1[r] ... Lihat dokumen lengkap
10
vol18_pp162-175. 161KB Jun 04 2011 12:06:02 AM
... know whether these statements are equivalent to “A is an IAP” when A is a full sign pattern.Except possibly for the statement “A is an rIAP implies that A is a SAP”, the converse of each implication in the diagram above ... Lihat dokumen lengkap
14
vol18_pp126-145. 202KB Jun 04 2011 12:06:02 AM
... Minimum rank, Maximum nullity, symmetric minimum rank, Asymmetric mini-mum rank, Path cover number, Zero forcing set, Zero forcing number, Edit distance, Triangle num-ber, Minimum degree[r] ... Lihat dokumen lengkap
20
vol18_pp202-210. 149KB Jun 04 2011 12:06:02 AM
... 1. Introduction. The eigenvalues of the combinatorial Laplacian have been intensively investigated during the last decades. Recently there is an increasing in- terest in the discrete p-Laplacian, a natural generalization ... Lihat dokumen lengkap
9
vol18_pp108-116. 140KB Jun 04 2011 12:06:02 AM
... Motivated by this situation, in this paper we consider the generalized eigenvalue problem both for rectangular and for square constant coefficient matrices associated with autonomous sin[r] ... Lihat dokumen lengkap
9
vol18_pp13-20. 118KB Jun 04 2011 12:06:02 AM
... Then |||Aα1Bβ1Aα2· · ·Bβn−1Aαn||| ≤ |||AB|||s is true for all pairs of positive-definite matrices A and B of the same shape if and only if the inequalities in the left-hand column of T[r] ... Lihat dokumen lengkap
8
vol18_364-370. 115KB Jun 04 2011 12:06:02 AM
... So to prove the theorem it suffices to show that each non-scalar invertible matrix A∈MnD, is joined to a non-zero, non-invertible matrix in ΓCMnD.. By Theorem 1.2, we may assume that A i[r] ... Lihat dokumen lengkap
7
vol17_pp88-101. 159KB Jun 04 2011 12:06:02 AM
... edge, the reflexive re-nonnegative definite solution to (1.1)and the re-nonnegative definite solution to (1.2)have not been investigated yet so far. Motivated by the work mentioned above and keeping the interests and ... Lihat dokumen lengkap
14
vol18_pp146_161. 167KB Jun 04 2011 12:06:02 AM
... In the study of the combinatorially symmetric TN completion problem [JKL], it is shown that for every partial TN matrix with specified entries corresponding to a monotonically labeled bl[r] ... Lihat dokumen lengkap
16
vol18_pp01-12. 186KB Jun 04 2011 12:06:02 AM
... The reachability index for positive 1-D systems has been studied in [5], [9], [14], [15] and [26] among others, and it is always bounded by n (see [12] and [13]). However, despite the numerous research efforts, an ... Lihat dokumen lengkap
12
vol18_pp21-29. 131KB Jun 04 2011 12:06:02 AM
... In [9,10] solvability conditions for symmetric and positive definite solutions and general solutions of Equation 1.2 were obtained through the use of the generalized singular value decom[r] ... Lihat dokumen lengkap
9
vol8_pp26-46. 219KB Jun 04 2011 12:06:16 AM
... The main result here, Theorem 2.3, characterizes the minimizers of the distance between a given positive semidefinite matrix and the unitary group, for strictly increasing Schur convex un[r] ... Lihat dokumen lengkap
21
getdoc10cd. 254KB Jun 04 2011 12:04:06 AM
... gradient. It is represented as a sum of Wiener chaos of order at most two. Widely known Wiener functionals of second order are the square of the L 2 -norm on an interval of the Wiener process, L´evy’s stochastic area, ... Lihat dokumen lengkap
30
getdoc107b. 296KB Jun 04 2011 12:04:06 AM
... |∇ f | 2 dµ, (8) with for example φ(x) = xF (x). In general, Inequalities (7) and (8) have different features. Note that (7) is an equality for constant f if F(1) = 0. We shall say that the inequality is tight in this ... Lihat dokumen lengkap
26
Related subjects