Results 41 to 50 of about 86 (84)

Preconditioned optimization algorithms solving the problem of the non unitary joint block diagonalization: application to blind separation of convolutive mixtures

, 2017
International audienceThis article addresses the problem of the Non Unitary Joint Block Diagonalization (NU − JBD) of a given set of complex matrices for the blind separation of convolutive mixtures of sources.
Thirion-Moreau, Nadège, Cherrak, Omar, Ghennioui, Hicham, Abarkan, El Houssein   +3 more
core   +1 more source

Geršhgorin-type theorems for Z1-eigenvalues of tensors with applications

Demonstratio Mathematica
In this article, we present several Geršhgorin-type theorems for Z1{Z}_{1}-eigenvalues of tensors, which improve the results provided by Wang et al. (Some upper bounds on Zt{Z}_{t}-eigenvalues of tensors, Appl. Math. Comput.
Shen Xiaowei, Hao Qian, He Jun, Wang Guangbin   +3 more
doaj   +1 more source

Linear preservers of Tensor product of Unitary Orbits

, 2020
It is shown that the linear group of automorphism of Hermitian matrices which preserves the tensor product of unitary orbits is generated by natural automorphisms: change of an orthonormal basis in each tensor factor, partial transpose in each tensor ...
Chi-Kwong Li, Raphael Loewy, Abraham Berman, Yiu-Tung Poon, Moshe Goldberg, Nung-Sing Sze   +5 more
core  

Characteristic numbers and chromatic polynomial of a tensor

Forum of Mathematics, Sigma
We introduce the characteristic numbers and the chromatic polynomial of a linear subspace of matrices, or equivalently of a tensor. Our approach generalizes and unifies the chromatic polynomial of a graph and of a matroid, characteristic numbers of ...
Austin Conner, Mateusz Michalek
doaj   +1 more source

Absolute And Relative Perturbation Bounds For Invariant Subspaces Of Matrices

, 1998
. Absolute and relative perturbation bounds are derived for angles between invariant subspaces of complex square matrices, in the two-norm and in the Frobenius norm.
Ilse C. F. Ipsen
core  

Tensor Decompositions and Applications

, 2009
. This survey provides an overview of higher-order tensor decompositions, their applications, and available software. A tensor is a multidimensional or N-way array.
Tamara G. Kolda, Brett W. Bader
core  

A generalization of the Graham-Pollak tree theorem to even-order Steiner distance

Special Matrices
Graham and Pollak showed in 1971 that the determinant of a tree’s distance matrix depends only on its number of vertices, and, in particular, it is always nonzero.
Cooper Joshua, Tauscheck Gabrielle
doaj   +1 more source

Parsimony and the rank of a flattening matrix. [PDF]

J Math Biol, 2023
Snyman J, Fox C, Bryant D.
europepmc   +1 more source

Low-rank tensor methods for Markov chains with applications to tumor progression models. [PDF]

J Math Biol, 2022
Georg P, Grasedyck L, Klever M, Schill R, Spang R, Wettig T.   +5 more
europepmc   +1 more source

Universality of High-Strength Tensors. [PDF]

Vietnam J Math, 2022
Bik A, Danelon A, Draisma J, Eggermont RH.   +3 more
europepmc   +1 more source