نتایج جستجو برای: g row substochastic matrix

تعداد نتایج: 802495  

Journal: :Int. Arab J. Inf. Technol. 2011
Rukhsana Shahnaz Anila Usman

The present paper discusses the implementations of sparse matrix-vector products, which are crucial for high performance solutions of large-scale linear equations, on a PC-Cluster. Three storage formats for sparse matrices compressed row storage, block compressed row storage and sparse block compressed row storage are evaluated. Although using BCRS format reduces the execution time but the impr...

Journal: :CoRR 2017
Tao Hong Xiao Li Zhihui Zhu Qiuwei Li

We consider designing a sparse sensing matrix which contains few non-zero entries per row for compressive sensing (CS) systems. By unifying the previous approaches for optimizing sensing matrices based on minimizing the mutual coherence, we propose a general framework for designing a sparse sensing matrix that minimizes the mutual coherence of the equivalent dictionary and is robust to sparse r...

2000
A Zanna H Z Munthe-Kaas

In this paper we describe the use of the theory of generalized polar decompositions (Munthe-Kaas, Quispel & Zanna 2000b) to approximate a matrix exponential. The algorithms presented in this paper have the property that, if Z 2 g, a Lie algebra of matrices, then the approximation for exp(Z) resides in G, the matrix Lie group of g. This property is very relevant when solving Lie-group ODEs and i...

Journal: :Journal of Mathematical Analysis and Applications 2016

Journal: :CoRR 2013
Rahul R. Upadhyay

In this paper a novel approach for matrix manipulation and indexing is proposed .Here the elements in a row of matrix are designated by numeric value called ‘permutation index’ followed by the elements of the row being randomised. This is done for all the rows of the matrix and in the end the set of permutation indices are put in the parent matrix and random locations depending on a pre decided...

2003
Taher H. Haveliwala Sepandar D. Kamvar

We determine analytically the modulus of the second eigenvalue for the web hyperlink matrix used by Google for computing PageRank. Specifically, we prove the following statement: “For any matrix , where is an row-stochastic matrix, is a nonnegative rank-one row-stochastic matrix, and ! " , the second eigenvalue of has modulus # $&%'#( ) . Furthermore, if has at least two irreducible closed subs...

Journal: :Discrete Mathematics 1990
Dino J. Lorenzini

Lorenzini, D.J., A finite group attached to the laplacian of a graph, Discrete Mathematics 91 (1991) 277-282. Let F = diag(cp,, . , r~_, , 0), 91, 1 t . 1 q, ~, , denote the Smith normal form of the laplacian matrix associated to a connected graph G on n vertices. Let h denote the cardinal of the set {i 1 rp, > 1). We show that h is bounded by the number of independent cycles of G and we study ...

1999
Cheng-Shang Chang Wen-Jyh Chen Hsiang-Yi Huang

Based on a decomposition result by Birkhoff and von Neumann for a doubly substochastic matrix, in this paper we propose a scheduling algorithm that is capable of providing service guarantees for input-buffered crossbar switches. Our service guarantees are uniformly good for all non-uniform traffic, and thus imply 100% throughput. The off-line computational complexity to identify the scheduling ...

Journal: :J. Multivariate Analysis 2016
Peter D. Hoff

Many inference techniques for multivariate data analysis assume that the rows of the data matrix are realizations of independent and identically distributed random vectors. Such an assumption will be met, for example, if the rows of the data matrix are multivariate measurements on a set of independently sampled units. In the absence of an independent random sample, a relevant question is whethe...

Journal: :J. Comb. Theory, Ser. A 1983
W. H. Mills David P. Robbins Howard Rumsey

An alternating sign matrix is a square matrix such that (i) all entries are 1,-1, or 0, (ii) every row and column has sum 1, and (iii) in every row and column the nonzero entries alternate in sign. Striking numerical evidence of a connection between these matrices and the descending plane partitions introduced by Andrews (Invent. Math. 53 (1979), 193-225) have been discovered, but attempts to p...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید