نتایج جستجو برای: kronecker product

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

Journal: :Journal of Econometrics 2023

We propose a test for covariance matrix to have Kronecker Product Structure (KPS). KPS implies reduced rank restriction on certain transformation of the and new procedure is an adaptation Kleibergen Paap (2006) test. To derive limiting distribution Wald type statistic proves challenging partly because singularity estimator that appears in weighting matrix. show has ? 2 null with degrees freedom...

Journal: :Linear Algebra and its Applications 2012

Journal: :Linear Algebra and its Applications 1998

2014
Mathilde G. E. Verdam Frans J. Oort

HIGHLIGHTS Application of Kronecker product to construct parsimonious structural equation models for multivariate longitudinal data.A method for the investigation of measurement bias with Kronecker product restricted models.Application of these methods to health-related quality of life data from bone metastasis patients, collected at 13 consecutive measurement occasions.The use of curves to fac...

Journal: :Chaos 2015
Manuela A D Aguiar Ana Paula S Dias

There are several ways for constructing (bigger) networks from smaller networks. We consider here the cartesian and the Kronecker (tensor) product networks. Our main aim is to determine a relation between the lattices of synchrony subspaces for a product network and the component networks of the product. In this sense, we show how to obtain the lattice of regular synchrony subspaces for a produ...

Journal: :Australasian J. Combinatorics 1993
Jennifer Seberry Xian-Mo Zhang

Strong Kronecker multiplication of two matrices is useful for constructing new orthogonal matrices from those known. These results are particularly important as they allow small matrices to be combined to form larger matrices, but of smaller order than the straight-forward Kronecker product would permit.

Journal: :Discussiones Mathematicae Graph Theory 1997

2002
Amy Langville

LANGVILLE, AMY N. Preconditioning for Stochastic Automata Networks. (Under the direction of William J. Stewart.) Many very large Markov chains can be modeled efficiently as Stochastic Automata Networks (SANs). A SAN is composed of individual automata that, for the most part, act independently, requiring only infrequent interaction. SANs represent the generator matrix Q of the underlying Markov ...

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

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