Results 21 to 30 of about 28,541,050 (306)
matrix-toolbox/CHM_CATALOG: v2.2.0
Sinkhorn matrices, symmetric and Hermitian ...
matrix-toolbox
core +1 more source
Good hidden P-matrix sandwiches
A real square matrix is called a \(P\)-matrix if all its principal minors are positive. The problem of recognizing when a matrix is a \(P\)-matrix is known to be co-NP-complete [see \textit{G. E. Coxson}, Math. Program. 64, 173--178 (1994; Zbl 0822.90132)] and so is expected to be hard.
Morris, Walter D., Namiki, Makoto
openaire +2 more sources
P-Matrix Reasoning and Information Intelligent Mining
Abstract P-sets (P stand for Packet) and P-matrix are novel and effective mathematical tools for studying dynamic information systems. In this paper, the concept of P-information mining is given by using the dynamic characteristics of P-sets and P-matrix structure.
Xiuquan Zhang, Lin Shen
openaire +1 more source
Minimizing the condition number of a positive definite matrix by completion [PDF]
Elsner L, He C, Mehrmann V. Minimizing the condition number of a positive definite matrix by completion. Numerische Mathematik. 1994;69(1):17-23.We consider the problem of minimizing the spectral condition number of a positive definite matrix by ...
Mehrmann, Volker +2 more
core +1 more source
Matrix-vector representation of a directed graph.
The matrix M and the vector v correspond to the edge set and the vertex set of the graph, respectively. An iteration of graph processing is represented as a matrix-vector multiplication with generalized operations.
Chiwan Park (8356896) +2 more
core +1 more source
matrix-toolbox/CHM_scripts: Sinkhorn Algorithm
Several CHM matrices (M-scripts) obtained by the Sinkhorn Algorithm are ...
matrix-toolbox
core +1 more source
Spectra of matrices with P-matrix powers
Let A be an \(n\times n\) matrix with all powers having all principal minors positive. It is not known if these conditions force the eigenvalues of A to be all positive. The authors prove that conclusion for \(n\leq 4\), and show in general that the eigenvalues of A with the same absolute value form the vertices of a regular polygon of odd order, with ...
Hershkowitz, Daniel, Johnson, Charles R.
openaire +2 more sources
On some properties of P-matrix sets
AbstractA nonempty set %plane1D;49E; in ℝn×n is said to have the row-P-property if every row representative of %plane1D;49E; is a P-matrix. We show that this property is equivalent to saying that for every nonzero x in ℝn there is an index i with x1(Mx)1 > 0 for all M∈%plane1D;49E;.
Song, Yoon +2 more
openaire +1 more source
P-matrix completions under weak symmetry assumptions
An \(n\times n\) matrix is called a \(\Pi\)-matrix if it is one of (weakly) sign-symmetric, positive, nonnegative \(P\)-matrix, (weakly) sign-symmetric, positive, nonnegative \(P_{0,1}\)-matrix, or Fischer, or Koteljanskii matrix. The paper deals with the \(\Pi\)-matrix completion problems, that is, when a partial \(\Pi\)-matrix has a \(\Pi\)-matrix ...
Fallat, Shaun M. +3 more
openaire +1 more source
$L^p$ Matrix Coefficients for Nilpotent Lie Groups
Suppose that \(G\) is a connected nilpotent Lie group. For any irreducible unitary representation \(\pi\) of \(G\), denote by \(N_\pi\) its kernel. The main theorem of the paper under review is that there exists \(p\) in \([2,\infty)\), depending only on \(G\), such that the matrix coefficients \(g\mapsto\langle\pi(g)\xi,\eta\rangle\) lie in \(L^p(G/N_\
Corwin, Lawrence, Moore, Calvin C.
openaire +3 more sources

