Results 21 to 30 of about 302,520 (264)
On a Low-Rank Matrix Single-Index Model
In this paper, we conduct a theoretical examination of a low-rank matrix single-index model. This model has recently been introduced in the field of biostatistics, but its theoretical properties for jointly estimating the link function and the ...
The Tien Mai
doaj +1 more source
Analysis of the properties of matrix rank and the relationship between matrix rank and matrix operations [PDF]
Abstract This paper discusses the invariance of the rank of a matrix, the conditions and applications of matrix inequalities, the relationship between matrix rank and matrix operations, the relationship with matrix reversibility, the linear correlation with vector groups and the zero relationship of eigenvalue algebra multiples and ...
openaire +1 more source
On the similarity of matrices $AB$ and $BA$ over a field
Let $A$ and $B$ be $n$-by-$n$ matrices over a field. The study of the relationship between the products of matrices $AB$ and $BA$ has a long history. It is well-known that $AB$ and $BA$ have equal characteristic polynomials (and, therefore, eigenvalues ...
V.M. Prokip
doaj +1 more source
On Rank Selection in Non-Negative Matrix Factorization Using Concordance
The choice of the factorization rank of a matrix is critical, e.g., in dimensionality reduction, filtering, clustering, deconvolution, etc., because selecting a rank that is too high amounts to adjusting the noise, while selecting a rank that is too low ...
Paul Fogel +3 more
doaj +1 more source
Low-Rank Matrix Completion: A Contemporary Survey
As a paradigm to recover unknown entries of a matrix from partial observations, low-rank matrix completion (LRMC) has generated a great deal of interest.
Luong Trung Nguyen +2 more
doaj +1 more source
Local low-rank approach to nonlinear matrix completion
This paper deals with a problem of matrix completion in which each column vector of the matrix belongs to a low-dimensional differentiable manifold (LDDM), with the target matrix being high or full rank.
Ryohei Sasaki +3 more
doaj +1 more source
Parsimony and the rank of a flattening matrix
AbstractThe standard models of sequence evolution on a tree determine probabilities for every character or site pattern. A flattening is an arrangement of these probabilities into a matrix, with rows corresponding to all possible site patterns for one setAof taxa and columns corresponding to all site patterns for another setBof taxa.
Jandre Snyman, Colin Fox, David Bryant
openaire +4 more sources
On the rank of the distance matrix of graphs
17 pages, 2 ...
Ezequiel Dratman +3 more
openaire +4 more sources
s-Goodness for Low-Rank Matrix Recovery
Low-rank matrix recovery (LMR) is a rank minimization problem subject to linear equality constraints, and it arises in many fields such as signal and image processing, statistics, computer vision, and system identification and control.
Lingchen Kong +2 more
doaj +1 more source
On the matrix of rank one over a UFD [PDF]
In this paper we characterize all matrices of rank one over a unique factorization domain (UFD). Also we find the Rmodule generated by the rows and the R-module generated by the columns of a matrix of rank one and assert some properties of them.
Somayeh Hadjirezaei, Somayeh Karimzadeh
doaj +1 more source

