Results 231 to 240 of about 5,810,036 (263)
Some of the next articles are maybe not open access.

On the Design of Flexible Kronecker Product Beamformers with Linear Microphone Arrays

IEEE International Conference on Acoustics, Speech, and Signal Processing, 2019
This paper proposes a method for the design of flexible Kronecker product beamformers based on the decomposition of the steering vector of a physical array as a Kronecker product of steering vectors of two smaller virtual arrays. With this decomposition,
Wenxing Yang   +4 more
semanticscholar   +1 more source

Sparse recovery and Kronecker products

2010 44th Annual Conference on Information Sciences and Systems (CISS), 2010
In this note will consider sufficient conditions for sparse recovery such as Spark, coherence, restricted isometry property (RIP) and null space property (NSP). Then we will discuss the solution of underdetermined linear equations when the matrix is the Kronecker product of matrices. Specially we will explain how NSP behave in the case where the matrix
openaire   +1 more source

Multi-scale kronecker-product relation networks for few-shot learning

Multimedia tools and applications, 2022
Mounir Abdelaziz, Zuping Zhang
semanticscholar   +1 more source

Matrix Calculus, Kronecker Product and Tensor Product

, 2019
Matrix calculus, Kronecker product, and tensor product: , Matrix calculus, Kronecker product, and tensor product: , کتابخانه‌های دانشگاه ...
Y. Hardy, W. Steeb
semanticscholar   +1 more source

A Recursive Least-squares Algorithm Based on the Nearest Kronecker Product Decomposition

IEEE International Conference on Acoustics, Speech, and Signal Processing, 2019
The recursive least-squares (RLS) adaptive filter is an appealing choice in system identification problems, mainly due to its fast convergence rate. However, this algorithm is computationally very complex, which may make it useless for the identification
Camelia Elisei-Iliescu   +3 more
semanticscholar   +1 more source

Kronecker products and shuffle algebra

IEEE Transactions on Computers, 1981
Summary: The paper relates three classical concepts, viz. mixed radix number system, Kronecker product of matrices, and perfect shuffle. It presents an algebra which describes the hardware organization of the computation of a product \(M \underline{\underline{\upsilon}}\), where \(M\) is a matrix in Kronecker product form and \(\underline{\underline ...
openaire   +2 more sources

Fast Transformation and Kronecker Products

1984
While on the subject of fast computational algorithms based on the Chinese Remainder Theorem and primitive roots (discussed in the preceding chapter), we will now take time out for a glance at another basic principle of fast computation: decomposition into direct or Kronecker products.
openaire   +1 more source

Equivalence of a matrix product to the Kronecker product.

2000
The authors give an interesting proof of the permutation equivalence of the Tracy-Singh product for partitioned matrices[\textit{D. S. Tracy} and \textit{R. P. Singh}, Stat. Neerl. 26, 143--157 (1972; Zbl 0267.15009); \textit{S. Liu}, Linear Algebra Appl. 289, No. 1-3, 267--277 (1999; Zbl 0937.15015)] to the Kronecker product.
Wei, Yimin, Zhang, Fuzhen
openaire   +1 more source

Kronecker product

2012
The Kronecker product is a classical and an extremely convenient tool in multivariate analysis. We briefly define this product, and describe some of its main algebraic properties. We also briefly review the role of Kronecker products in the traditional assumption of separability of covariance functions in spatiotemporal models.
openaire   +1 more source

Kronecker Product

2021
J. Vasundhara Devi   +2 more
openaire   +1 more source

Home - About - Disclaimer - Privacy