Results 221 to 230 of about 5,810,036 (263)

Nearest Kronecker Product Decomposition Based Normalized Least Mean Square Algorithm

IEEE International Conference on Acoustics, Speech, and Signal Processing, 2020
Recently, nearest Kronecker product (NKP) decomposition based Wiener filter and Recursive Least Squares (RLS) have been proposed and was found to be a good candidate for system identification and echo cancellation and was shown to offer better tracking ...
Sankha Subhra Bhattacharjee, Nithin V. George   +1 more
semanticscholar   +1 more source

Lax Representation and Kronecker Product

Physica Scripta, 2003
Summary: Assume that a system of ordinary differential equations can be written in the Lax representation. We show that the Kronecker product can be used to construct new Lax representations. The time-evolution is also given.
Steeb, W.-H., Hardy, Y., Stoop, R.
openaire   +1 more source

Shifted Kronecker Product Systems

SIAM Journal on Matrix Analysis and Applications, 2007
A fast method for solving a linear system of the form $(A^{(p)} \otimes \cdots \otimes A^{(1)} - \lambda I) x = b$ is given where each $A^{(i)}$ is an $n_i$-by-$n_i$ matrix. The first step is to convert the problem to triangular form $(T^{(p)} \otimes \cdots \otimes T^{(1)} - \lambda I) y = c$ by computing the (complex) Schur decompositions of the $A^{(
Carla D. Moravitz Martin, Charles F. Van Loan   +1 more
openaire   +1 more source

Linear System Identification Based on a Kronecker Product Decomposition

IEEE/ACM Transactions on Audio Speech and Language Processing, 2018
Linear system identification is a key problem in many important applications, among which echo cancelation is a very challenging one. Due to the long length impulse responses (i.e., echo paths) to be identified, there is always room (and needs) to ...
C. Paleologu, J. Benesty, S. Ciochină
semanticscholar   +1 more source

Kronecker Products on Preconditioning

2013
Numerical techniques for linear systems arising from discretization of partial differential equations are nowadays essential for understanding the physical world. Among these techniques, iterative methods and the accompanying preconditioning techniques have become increasingly popular due to their great potential on large scale computation.
openaire   +2 more sources

Image encryption based on Kronecker product over finite fields and DNA operation

, 2020
This paper reports an image encryption algorithm based on a matrix of Kronecker products and a deoxyribonucleic acid (DNA) operation over finite fields. First, a plaintext image is mapped from pixel gray-levels to the finite field.
Xishun Zhu, Hai Liu, Yaru Liang, Jianhua Wu   +3 more
semanticscholar   +1 more source

Kronecker product graph matching

Pattern Recognition, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Barend J. van Wyk, Michaël A. van Wyk
openaire   +1 more source

Networks, communities and kronecker products

Proceedings of the 1st ACM international workshop on Complex networks meet information & knowledge management, 2009
Emergence of the web and online computing applications gave rise to rich large scale social activity data. One of the principal challenges then is to build models and understanding of the structure of such large social and information networks. Here I present our work on clustering and community structure in large networks, where clusters are thought ...
openaire   +1 more source

Kronecker’s Products and Kronecker’s Sums of Operators

2016
This chapter is a survey of recent results of the author on operators on tensor products of Hilbert and Euclidean spaces. We derive norm estimates for the resolvents of Kronecker’s products of operators, Kronecker’s sums of operators, and operator pencils on tensor products of Hilbert spaces.
openaire   +1 more source

The Procrustes Problem for Orthogonal Kronecker Products

SIAM Journal on Scientific Computing, 2003
Summary: The Procrustes problem for orthogonal Kronecker products is considered. Given matrices \(A\in \mathbb{R}^{n^2\times k^2}\), \(T\in \mathbb{R}^{n^2\times n^2},\) \(n\geq k\), we minimize the Frobenius norm \(\| T(Q\otimes Q)-A\| \) for all orthogonal Stiefel matrices \(Q\in \mathbb{R}^{n\times k}\), \(Q^TQ=I_{k}\).
Adam W. Bojanczyk, Adam Lutoborski
openaire   +2 more sources