Results 251 to 260 of about 2,984,671 (302)

Efficient hybrid algorithm for nonnegative matrix factorization based on modified nonmonotone linear search. [PDF]

PLoS One
Wu J, Li W, Su L, Wang H, Li Y.
europepmc   +1 more source

Reservoir computing-based cryptanalysis of structured phase-masked chaos encryption. [PDF]

Sci Rep
Tosyali E, Oniz Y.
europepmc   +1 more source

Inertias of Block Band Matrix Completions

SIAM Journal on Matrix Analysis and Applications, 1998
Summary: This paper classifies the ranks and inertias of Hermitian completion for the partially specified \(3 \times 3\) block band Hermitian matrix (also known as a ``bordered matrix'') \[ P=\begin{pmatrix} A&B&?\\ B^*&C&D\\ ?&D^*&E \end{pmatrix}.
Nir Cohen, Jerome Dancis
openaire   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

Matrix Measures and Random Walks with a Block Tridiagonal Transition Matrix

SIAM Journal on Matrix Analysis and Applications, 2007
Summary: We study the connection between matrix measures and random walks with a block tridiagonal transition matrix. We derive sufficient conditions such that the blocks of the \(n\)-step block tridiagonal transition matrix of the Markov chain can be represented as integrals with respect to a matrix valued spectral measure.
Holger Dette
exaly   +4 more sources

A Matrix Polynomial Spectral Approach for General Joint Block Diagonalization

SIAM Journal on Matrix Analysis and Applications, 2015
Joint block diagonalization (JBD) of a given Hermitian matrix set {A(i)}(i=0)(p) is to find a nonsingular matrix W such that W-H A(i)W for i = 0, 1, ... , p are all block diagonal matrices with the same prescribed block diagonal structure.
Yunfeng Cai, Shufang Xu
exaly   +2 more sources

The inverse of a block-circulant matrix

IEEE Transactions on Antennas and Propagation, 1983
The inverse A^{-1} of a block-circulant matrix (BCM) A is given in a closed form, by using the fact that a BCM is a combination of permutation matrices, whose eigenvalues and eigenvectors are found with the help of the complex roots of unity. Special results are also given when A is block symmetric or symmetric.
De Mazancourt, T., Gerlic, D.
openaire   +2 more sources

The exponential distance matrix of block graphs

Applied Mathematics and Computation, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rundan Xing, Zhibin Du
openaire   +2 more sources

Building-block Identification by Simultaneity Matrix

Soft Computing, 2003
This paper presents a study of building blocks (BBs) in the context of genetic algorithms (GAs). In GAs literature, the BBs are common structures of high-quality solutions. The aim is to identify and maintain the BBs while performing solution recombination. To identify the BBs, we construct an $$\ell \times \ell$$ simultaneity matrix according to a set
Chatchawit Aporntewan, Prabhas Chongstitvatana   +1 more
openaire   +3 more sources