[PDF] Top 20 abs_vol18_pp30-57. 35KB Jun 04 2011 12:05:47 AM

... Weighted graph, Generalized Bethe tree, Laplacian matrix, Adjacency matrix, Spectral radius, Algebraic connectivity.. Accepted for publication December 30, 2008.[r] ... Lihat dokumen lengkap

... Then the numerical range ofT is a closed disk about the origin, and its numerical radius is determined in terms of the reciprocal of the minimum positive root of a hypergeometric functi[r] ... Lihat dokumen lengkap

... †Institute of Mathematics, Department of Geometry and Topology, University of Santiago de Compostela, Spain [email protected].. Partially supported by FEDER and Research Project MTM2[r] ... Lihat dokumen lengkap

... ELA THE SYMMETRIC MINIMAL RANK SOLUTION OF THE MATRIX EQUATION AX=B AND THE OPTIMAL APPROXIMATION∗ QING-FENG XIAO†, XI-YAN HU†, AND LEI ZHANG† Abstract.. By applying the matrix rank [r] ... Lihat dokumen lengkap

... ‡Department of Mathematics, Shahid Bahonar University of Kerman, Kerman, Iran, and Center of Excellence in Linear Algebra and Optimization of Shahid Bahonar University of Kerman, Iran s[r] ... Lihat dokumen lengkap

... †Institute of Computer Science, Czech Academy of Sciences, Prague, and School of Business Ad-ministration, Anglo-American University, Prague, Czech Republic [email protected].. Electronic[r] ... Lihat dokumen lengkap

... †Department of Mathematics and Statistics, University of Victoria, Victoria, British Columbia, Canada V8W 3R4 [email protected], [email protected].. ‡Department of Computer Science, Unive[r] ... Lihat dokumen lengkap

... ELA THE STRUCTURE OF LINEAR PRESERVERS OF LEFT MATRIX MAJORIZATION ONRP ∗ FATEMEH KHALOOEI† AND ABBAS SALEMI† Abstract.. For vectors X, Y ∈Rn,Y is said to be left matrix majorized by[r] ... Lihat dokumen lengkap

... As is well known, the Schur complements of strictly or irreducibly diagonally dom-inant matrices are H−matrices; however, the same is not true of generally diagonally dominant matrices..[r] ... Lihat dokumen lengkap

... Leydold, Largest eigenvalues of degree sequences], which led to an incorrect proof of the main result of [B.L.. This paper presents a correct proof of the main result in [B.L.[r] ... Lihat dokumen lengkap

... Jordan form, Weyr characteristic, eigenvalues AMS subject classifications.15A21, 15A18 ∗Received by the editors May 5, 2009.. 281 Electronic Journal of Linear Algebra ISSN 1081-3810 [r] ... Lihat dokumen lengkap

... Also, it is proved that the bipartite graph or, equivalently, the zero pattern of a free matrix uniquely determines that of its Moore-Penrose inverse, and this mapping is described expli[r] ... Lihat dokumen lengkap

... e reduced-rank estimators, f unbiasedness of estimators, g uniqueness of estimators, h equalities of estimators, i additive and block decomposability of estimators, j unrelatedness of e[r] ... Lihat dokumen lengkap

... The Krein space numerical range of a complex matrix Aof sizenis the collection of complex numbers of the form ξξ∗∗J AξJ ξ , withξ∈C nandξ∗J ξ= 0.. In this note, a class of tridiagonal[r] ... Lihat dokumen lengkap

... Then we show that there exists a subspace Σ of PGVkV for which the following holds: 1 the projective dimension of Σ is equal to 2m k −2· mk −1; 2 a k−1-dimensional subspaceαof PGV bel[r] ... Lihat dokumen lengkap

... Toward these matrices one usually introduces the first row and column as initial conditions for a recurrence relation used for constructing the other entries.. Both this relation and the[r] ... Lihat dokumen lengkap

... Spectrally and inertially arbitrary sign patterns were introduced in [6]. Classes of inertially arbitrary sign patterns were derived by Gao and Shao [7] as well as Miao and Li [13]. In [1], Britz et. al. characterized ... Lihat dokumen lengkap

... Being the inverse of a unit diagonal upper triangular strictly totally positive matrix, the matrixB has the formB =D∗RDˆ ∗ where ˆRis a unit diagonal upper triangular strictly totally po[r] ... Lihat dokumen lengkap

... LetAbe doubly diagonally dominant with max j∈S2∪S3 Rj−tB |bj−t,j−t| Ri0A≤ |ai0i0| for somei0, andB be strictly diagonally dominant, A= As Bru, Pedroche and Szyld studied the resu[r] ... Lihat dokumen lengkap

... In 1996 Nylen gave a method for computation of minimum rank for a tree, sub- sequently improved by Johnson and Leal-Duarte [11], Johnson and Saiago [14], and others. Convenient algorithms for computation of the minimum ... Lihat dokumen lengkap