Results 11 to 20 of about 1,769,588 (220)

Accurate computation of all eigenvalues of a totally nonnegative matrix by the Cauchon algorithm

open access: yesThe Electronic Journal of Linear Algebra
Totally nonnegative matrices are considered, i.e., matrices having all their minors nonnegative. Any $n\times n$ nonsingular totally nonnegative matrix can be represented as the product of $2n-1$ entry-wise nonnegative bidiagonal matrices. The $n^2$ nontrivial entries of this factorization parameterize the set of the nonsingular totally nonnegative ...
Fatima Rasheed   +2 more
openaire   +2 more sources

On the effect of the perturbation of a nonnegative matrix on its Perron eigenvector [PDF]

open access: yes, 1982
Elsner L, Johnson CR, Neumann MM. On the effect of the perturbation of a nonnegative matrix on its Perron eigenvector. Czechoslovak Mathematical Journal.
Elsner, Ludwig F.   +5 more
core   +1 more source

On Perron complements of totally nonnegative matrices [PDF]

open access: yes, 2001
An n×n matrix is called totally nonnegative if every minor of A is nonnegative. The problem of interest is to describe the Perron complement of a principal submatrix of an irreducible totally nonnegative matrix.
Fallat, Shaun M.   +3 more
core   +1 more source

Totally nonnegative (0,1)-matrices [PDF]

open access: yes, 2010
We investigate (0,1)-matrices which are totally nonnegative and therefore which have all of their eigenvalues equal to nonnegative real numbers. Such matrices are characterized by four forbidden submatrices (of orders 2 and 3).
Brualdi, Richard A., Kirkland, Steve
core   +2 more sources

Directional clustering through matrix factorization [PDF]

open access: yes, 2016
This paper deals with a clustering problem where feature vectors are clustered depending on the angle between feature vectors, that is, feature vectors are grouped together if they point roughly in the same direction.
Blumensath, Thomas
core   +1 more source

The Hadamard core of the totally nonnegative matrices [PDF]

open access: yes, 2001
An m-by-n matrix A is called totally nonnegative if every minor of A is nonnegative. The Hadamard product of two matrices is simply their entry-wise product.
Fallat, Shaun M.   +5 more
core   +3 more sources

Minimal positive realizations of transfer functions with nonnegative multiple poles [PDF]

open access: yes, 2005
This note concerns a particular case of the minimality problem in positive system theory. A standard result in linear system theory states that any nth-order rational transfer function of a discrete time-invariant linear single-input-single-output (SISO)
Matolcsi, Máté, Nagy, B.
core   +1 more source

A fast algorithm for matrix balancing [PDF]

open access: yes, 2013
As long as a square nonnegative matrix A contains sufficient nonzero elements, then the matrix can be balanced, that is we can find a diagonal scaling of A that is doubly stochastic. A number of algorithms have been proposed to achieve the balancing, the
Knight, Philip, Ruiz, Daniel
core   +2 more sources

Deep‐Learning‐Driven High‐Fidelity In Vivo Hyperspectral Fluorescence Imaging Under Extreme Photon‐Limited Conditions

open access: yesAdvanced Science, EarlyView.
Highly overlapping fluorescent signals become distinguishable in photon‐limited living organisms via advanced imaging with intelligent reconstruction. The resulting in vivo hyperspectral imaging capability reveals nanoplastic uptake and circulation in live zebrafish, providing a new approach for studying complex biological and environmental processes ...
Renjian Li   +11 more
wiley   +1 more source

Irreducible totally nonnegative matrices with a prescribed Jordan structure [PDF]

open access: yes, 2021
[EN] Let A be an irreducible totally nonnegative matrix with rank r and principal rank p, that is, all minors of A are nonnegative, r is the size of the largest invertible square submatrix of A and p is the size of its largest invertible principal ...
Cantó Colomina, Rafael   +2 more
core   +1 more source

Home - About - Disclaimer - Privacy