All Questions
6,026 questions
0
votes
0
answers
117
views
"Almost orthogonalizing" matrices using a signature matrix
Suppose $A$ and $B$ are two real symmetric $n \times n$ matrices (If simpler, consider $A$ and $B$ to be 0/1 matrices, say, adjacency matrices of d-regular graphs).
Then $||AB||_{op} \leq ||A||_{op}||...
- 949
0
votes
0
answers
704
views
expected matrix inverse of circulant plus diagonal matrix with chi-square variables
Let $R$ be a semi-definite $N\times N$ circulant Toeplitz matrix and let $N\to \infty$.
Let $D$ be an $N\times N$ diagonal matrix where the elements on the main diagonal are independent chi-square ...
- 96
0
votes
0
answers
115
views
a very elementary question on the conjugated matrices
Let $A$ and $B$ two matrices in $GL_{n}(K[[\pi]])$, regular semisimple on $GL_{n}(K((\pi)))$, with $K$ an algebraically closed field of characteristic zero .
We suppose that they have the same ...
- 3,472
0
votes
0
answers
266
views
Finding the effective maximum number of subspaces in a finite dimensional vector space
Hi mathoverflow community, may be some one may give me a hint on the following problem before I spend much time on brute force search.
For $q$ a prime number and $n=6$, let $\mathbb {F}_{q}^{n}$ be ...
0
votes
0
answers
262
views
Lattice basis reductions and finding minimal values
While reading several articles about lattice basis reduction I am left with a few questions.
For one, I came across this piece of text
Let $\alpha$ and $\beta \in \mathbb{R}$. Also let $X>0$ and $...
- 1
0
votes
1
answer
311
views
Subspace generated by positive vectors
Hi everyone, first of all i must admit i'm very familiar with quadratic forms and positive subspaces, so i'm sorry if my question is too trivial. So, here's my problem:
Let $L$ be a real vector space ...
0
votes
1
answer
775
views
Positive subspaces of quadratic forms
here's my question:
Let $V$ be a k-dimensional vector space over $\mathbb{R}$ and $q$ a quadratic form on $V$ of signature $(m,n)$ , $m+n=k$.
We have $W\subset V$ a positive (with respect to the ...
0
votes
0
answers
957
views
Diagonal of the inverse of a 6x6 symmetric partitioned matrix
Let
$$M = \begin{bmatrix}
A & B \\
B & C
\end{bmatrix}$$
in which $A$, $B$ and $C$ are $3 \times 3$ matrices being also symmetric. In fact, they are quite similar, just differing on a single ...
- 1
0
votes
0
answers
52
views
Dense Matrix Estimation
I have a matrix $X \in \mathbb{R}^{m\times n}$ and I want to estimate it with a dense matrix $Y^{m\times n}$ such that $Y$ is still close to $X$ in some distance measure. Is this doable in a ...
- 137
0
votes
0
answers
146
views
Global solution for spectral clustering
I used spectral clustering for directed graphs suggested by Dengyong Zhou paper to partition the graph.I selected the eigen vectors corresponding to k largest eigen values and then I use kmeans or FCM ...
- 13
0
votes
1
answer
312
views
Deriving the fundamental equation (with regards to computer vision)
I'm having a hard time understanding how a few equations are being derived. So the fundamental equation is an equation that relates corresponding points in stereo images. Anyway, that's the basic ...
0
votes
0
answers
270
views
Solution Existence of a System of Complex Quadratic Equations
Consider $ {x_k}_{k = 1}^K \in \mathbb{C}^{N \times 1}$ a set of $K$ complex vector variables of length $N$. I am interested in finding the existence of a solution of the following
quadratic set of ...
- 342
0
votes
0
answers
257
views
What is the integer form of a projector into the intersection of the ranges of two integer projection matrices?
Consider two square integer matrices $X$ and $Y$ of the same dimension with the following properties:
$X^2=rX$, and $Y^2=sY$ for integers $r$ and $s$. The $\gcd$ of the entries of $X$ is 1 and the $\...
0
votes
0
answers
155
views
Convexity of a Certain Set of Covariance Matrices
Hello,
My question is about a certain set of matrices being convex or not. I'll start with some preliminaries in order to define myself properly. Let $X_1,U,X_2$ be three zero-mean Gaussian random ...
- 155
0
votes
0
answers
151
views
Ratio of Eigen values and Mutual Independence
Given a matrix $X$. Calculating the Eigen values of $XX^T$ and using the ratio of maximum and minimum eigen values normally gives the condition number of the matrix.
If $X$ contains $M$ observations ...
- 1
0
votes
1
answer
590
views
Strictly diagonally dominant hermitian matrices eigenvalues sign
Let $A\in \mathcal{M}_{n\times n}(\mathbb{C})$ be a strictly diagonally dominant hermitian matrix.
My main goal is to tell how many positive eingenvalues $A$ has in terms of its leading diagonal ...
- 3
0
votes
0
answers
166
views
Do the Eigenvectors find by use PCA on a set of data point, a good replacement for Random Projection when I later on use L1Magic to reconstruct the sparse vector?
Concretely if I use the first k eigenvectors find by PCA with a point set A,to project another sparse vector b to k dimension subspace, then use L1-magic to recover b. Will this be better than a ...
- 87
0
votes
0
answers
237
views
Geometric Mean of Positive Matrices
Hello all,
My question regards the geometric mean (GM) of two positive matrices. The definition of the GM for two positive matrices $(A,B)$ is given by:
$M_0(A,B)=A^{\frac{1}{2}}(A^{-\frac{1}{2}}BA^{-...
- 155
0
votes
0
answers
224
views
When does a real-valued function of a matrix depend only on eigenvalues?
Let $\mathcal{N}$ be the space of all $n \times n$ matrices that are similar to some nonnegative matrix with zero diagonal and let $f: \mathcal{N} \to \mathbb{R}$ be a continuously differentiable ...
- 1,068
0
votes
0
answers
244
views
Checking whether this would be bounded
It may be better to post this question here. Assume that $M$ is an $m$ by $m$ ($m$ is an even number) symmetric
positive-semi-definite matrix with exactly $m/2$ positive eigenvalues
and every entry of ...
- 1
0
votes
1
answer
2k
views
Finding linearly independent columns of a large sparse rectangular matrix
I have a problem that necessitates solving a large non-negative least-squares
problem. My matrix A is large, sparse, highly rectangular (num rows >> num cols)
and nearly binary. However, A is not ...
- 103
0
votes
0
answers
324
views
Changing basis on an extension of a free Z-module.
Consider a finite-rank free $Z$-module $Y$. Let $c: Y \times Y \rightarrow Z$ be a $Z$-bilinear form. Assume that $c(y_1, y_2) + c(y_2, y_1)$ is even, for all $y_1, y_2 \in $. Then $c$ "incarnates"...
- 13.3k
0
votes
0
answers
154
views
linsolve derivative
Consider a vector $\mathbf{g} \in \mathbb{R}^{m}$ and a matrix $\mathbf{A} \equiv \mathbf{A(g)} \in \mathcal{M}_{p\times q} \[\mathbb{R}\]$, a function of $\mathbf{g}$.
Furthermore, let $\mathbf{S} \...
0
votes
0
answers
204
views
Matrix Mutiplication through Matrix Logarithms and Exponentials
Let $A,B$ be full rank $n \times n$ matrices. If $AB = BA$, then $\exp(\log(A)+\log(B))=AB$.
Supposing $A = USL$ and $B = VSL$ where $U,V,S,L$ are integer valued matrices, $det(L)=1$ and $U = LVL^{-1}...
- 13.9k
0
votes
0
answers
161
views
vector equation
Suppose you have an equation of the form $Hx=Ky$, where $x,y$ are vectors of length $n,m$ respectively ($m>n$) and $H,K$ are matrices of orders $n \times n,n \times m$ respectively. Is there some ...
- 6,962
0
votes
0
answers
138
views
Approximation of large dimensional vectors by vectors of smaller dimension
sIs there any (efficient) algorithm for the following problem:
Let $n = 128$ and $m = 64$ (in the end only $n > m$ matters) and $p_1, \ldots, p_t \in \{ -1,1 \} ^{128}$ be given ($t << 2^{...
- 397
0
votes
0
answers
276
views
Another matrix diagonalization problem
Given the matrices $X$ and $Y$ in $[0,1]^{n\times m}$, for $n > m > 3$, so that $X1_m=1_m$ and $Y1_m=1_m$, where $1_m$ denotes a $m$-length column vector of ones, find a matrix $Q$ in $R^{m\...
- 51
0
votes
0
answers
395
views
The ratio of two strictly increasing functions
Given:
\begin{equation}
f_1(a)=\sum_{i=1}^{k^*-1} \left(\begin{array}{c}
K \\\
i \\
\end{array} \right) \left(-1-\frac{1}{ar}\right)^i
\end{equation}
\begin{equation}
f_2(a)=\sum_{i=1}^{k^*-1} ...
0
votes
0
answers
109
views
Expansion (asymptotic) of scalar function of a square matrix , in terms of determinant of argument?
The title says it all. I have a scalar function (really, a determinant) of a square matrix argument. Can I find an (asymptotic) expansion of the function, in a series in the determinant of the ...
- 2,600
0
votes
0
answers
2k
views
In a network with N nodes, what is the general formula for computing the propagation of a set of numbers?
I am creating a circular neural network with N nodes. Each node is connected via a send pathway to every other node, and the connection between two nodes has a weight. Any number sent over the ...
- 1
0
votes
1
answer
655
views
Fuzzy vector similarity
Hi all,
I have two multi-dimensional vectors representing documents $\vec{a}$ and $\vec{b}$.
Considering cases where there is no overlap between $a$ and $b$ ($a \cap b = \emptyset $), traditional ...
- 103
0
votes
1
answer
130
views
Maximal length vector under constraints
Consider a criculant symmetric $M$ an $n \times n$ matrix with $0$ and $1$ entries and $r$ entries of $1$ in each row with the diagonal values taken as $1$. I am looking for a $0-1$ vector $v$ with ...
- 800
0
votes
0
answers
429
views
[]-infinity algebra and Projective representation
This is a very vague question.
We know that some algebra structures can be viewed as modules of some fantastic stuff, call T. Such examples include: Abelian groups are $\mathbb{Z}$-modules, chain ...
- 1,271
0
votes
0
answers
157
views
Matrices satisfying certain pair-wise constraints
Consider given pairs of variables: $a_{ir1},a_{ir2}\in \mathbb{R}^{m \times m}$ and $a_{jr1},a_{jr2}\in \mathbb{R}^{m \times m}$, where $r \in \{1,2,\cdots,t\}$, consider the constraints:
$\sum_{r=1}^...
- 13.9k
0
votes
0
answers
172
views
Generating Set for $O(V)$ over $\mathbb Z_2$
I am reading a claim that $O(V)$ — the orthogonal group associated with a finite-dimensional vector space $V$ over $\mathbb Z_2$ and a quadratic form $q$, i.e. the group of linear ...
- 105
0
votes
1
answer
503
views
When are operators extended by linearity bounded?
Greetings.
Suppose that $H$ is a separable infinite-dimensional Hilbert space and that $M$ is an infinite
dimensional closed subspace of $H$. Suppose that {$v_{n}: n\ge 1$} is an infinite linearly ...
- 129
0
votes
0
answers
1k
views
Determinant of special generalized Vandermonde matrix
Good evening!
I have a generalized Vandermonde matrix of special form:
$\left( \begin{array}{ccccc} a_{0,0} & a_{0,1} \cdot x_0 & a_{0,2} \cdot x_0^2 & \ldots & a_{0,m-1} \cdot x_0^{m-...
spk
0
votes
0
answers
608
views
Orthogonal Projections in Lie Theory
I have been studying a finite element method where rigid & elastic spatial motions are separated using an orthogonal projection (actually two: one for translations/stretches, the other for ...
- 157
0
votes
1
answer
153
views
Difference of two optimization problem's optimal value
Let we have two following optimization problems:
\begin{align}
\text{(P1)}\quad \alpha_1 = \max_{x_1,\ldots,x_M} &\quad \sum_{m=1}^{M}\log(1+f_m(x_1,\ldots,x_M))\\
\textrm{s.t.} &\quad \...
- 287
0
votes
1
answer
199
views
Intersection between a line and an n-dimensional parallelotope
Suppose that I have a line in an $n$-dimensional space described by
$$ X=A+Bk, \quad \quad X,A,B \in \mathbb{R}^n, k \in \mathbb{R} $$
here $A$ is known and I want to find all the possible vectors $B$ ...
- 1
0
votes
1
answer
268
views
Nonnegative Matrix
Let $A=E+\sqrt{-1}B$, where $E=diag\{0,1,\cdots,1\}$, $B$ is a real symmetric matrix. Let $A^*$ denote the adjoint matrix of $A$, i.e. $AA^*=\det A\cdot I$. I hope the real part of adjoint matrix ${\...
- 303
0
votes
1
answer
180
views
(probably simple) optimization question
Suppose you have a concave function defined over a non-polyhedral convex cone and you are interested in the infimum. What would be standard approaches to tackle the question? (The cone is actually PSD ...
- 6,962
0
votes
2
answers
2k
views
How to accelerate/avoid multiplication for large matrices in Matlab? [closed]
The setting is here.
X: 6000x8000 non-sparse matrix
B: 8000x1 sparse vector with only tens of non-zeros
d: positive number
M: is sparsified X'X, i.e. thresholding the elements smaller than d ...
- 21
0
votes
2
answers
371
views
Quantum observables
Let H be a Hilbert space and A, B two non-commuting bounded linear operators. Let Com(A,B) be the set of bounded linear operators C which commute both with A and B.
Question 1 : What is known about ...
-1
votes
1
answer
681
views
Is there such a thing [closed]
For any $U_{i}\in\mathcal{U}\left(4\right)$, $1\le i\le5$, are there
$W\in\mathcal{U}\left(4\right)$ and nontrivial $\left(x_{1},x_{2}\right)\in\mathbb{R}^{2}$, such that $\mbox{tr}\left(U_{i}\mbox{...
- 53
-1
votes
1
answer
305
views
A simple matrix multiplication query [closed]
The entries of $\begin{bmatrix}a&b\\c&d\end{bmatrix}\begin{bmatrix}a'&b'\\c'&d'\end{bmatrix}=\begin{bmatrix}aa'+bc'&ab'+bd'\\ca'+dc'&cb'+dd'\end{bmatrix}$ are curiously given ...
- 13.9k
-1
votes
2
answers
335
views
How to generate constant row and column sum matrices?
How can we randomly generate matrix $A \in \mathbb{R}^{n \times m}_{\geq 0}$ that satisfies
$A 1_n = m1$ and $A^T 1_m = n1$.
- 1
-1
votes
1
answer
809
views
On an eigenvalue inequality [closed]
Let $\lambda_1 (\cdot)$ be the larger absolute value
eigenvalue of a $2\times2$ matrix and $\lambda_2 (\cdot)$
the smaller absolute value eigenvalue of a $2\times2$ matrix, i.e.
$|\lambda_1 (\cdot)| \...
- 29
-1
votes
2
answers
806
views
The lie algebra of the orthogonal group of an arbitrary space time metric
Let X ad Y be two vectors in R4, and define the inner product of X and Y as:
(X*Y) = gikXiYk (summation convention for repeated indicies)
Then we consider the 4x4 matrix g whose components are gik. ...
- 251
-1
votes
1
answer
152
views
Topological characterization of invertible real matrices [closed]
Let $n\geq 2$ be an integer. Consider the topological space $M_n$ of $n$-by-$n$ matrices with real entries.
Can you give a short non-constructive proof of the existence of a continuous function $M_n\...
- 23