All Questions
6,178 questions
0
votes
1
answer
269
views
Is there relationship between $f\left({\sum_i(\mathbf{v}_i^\top\mathbf{x})^2\lambda_i},\sum_j{(\mathbf{u}_j^\top\mathbf{x})^2\theta_j}\right)$ and $\sum_i\sum_j{(\mathbf{v}_i^\top\mathbf{u}_j)^2f(\lambda_i,\theta_j)}$ if $f$ is jointly convex?
Hello, everyone!
As we know that by Jensen's inequality, for jointly convex function $f$ and $\sum_ix_i^2=1$, we have
$$f(\sum_i{x_i^2\lambda_i},\sum_i{x_i^2\theta_i)}\leq\sum_i{x_i^2f(\lambda_i,\...
- 607
2
votes
1
answer
137
views
Design constraint systems over the reals
This question is inspired by the discussion at this problem.
Suppose I have a design consisting of a finite point set $U$ of size $|U|=m_{\emptyset}$ and a family of $n$ subsets (sometimes called ...
CommunityBot
- 1
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
3
votes
0
answers
617
views
normal form of antisymmetric matrices under pseudo-orthogonal transformations
It is well-known that any real anti-symmetric $n \times n$ matrix $A$ can be transformed via
$A \to O A O^T$ into block-diagonal form consisting of $2 \times 2$ antisymmetric matrices,
where $O \in SO(...
10
votes
2
answers
3k
views
How do you tell if a system of linear inequalities has a solution?
A naive solution would be to optimize a dummy variable via linear programming and see if a result is returned. I imagine there must be a more direct way.
- 2,239
4
votes
2
answers
1k
views
signs of eigenvalues of quadratic form
Let $A=(a_{ij})_{i,j=1}^n$ be a symmetric real matrix, $M_k:=det(a_{ij})_{1\leq i,j\leq k}$ be its minors and $M_k\ne 0$ for all $k$. Then signs of eigenvalues of $A$ are equal (up to some permutation)...
- 34.7k
8
votes
2
answers
2k
views
Hermitian matrices with prescribed number of positive and negative eigenvalues
Let $H$ be a linear subspace of the space of Hermitian $n\times n$ matrices. Is there a good characterization of those $H$ such that every $A\in H$ has at least $k$ positive and $k$ negative ...
- 6,962
1
vote
3
answers
585
views
Checking for invertibility of large matrices in MAGMA
If you have a number of large matrices, and you wish to determine whether each matrix has determinant zero or not, what is the most efficient way to do this in MAGMA
(it appears that calculating the ...
- 295
5
votes
1
answer
1k
views
Is Diagonalization worth to be taught? [closed]
When students come to the College (first two years of the University system in most of the developped countries) to train in mathematics, they get a linear algebra / matrix analysis course. After a ...
- 12.6k
7
votes
3
answers
780
views
the largest eigenvalue of the matrix A with A_{ij}=(i \times j) mod p for p is a prime.
For a prime p, consider the $(p-1) \times (p-1)$ matrix A with entry to be $A_{ij}=(i \times j) mod$ $p$. every row (column) is permutation of 1 to p-1, such a permutation is useful in one version of ...
- 156k
8
votes
0
answers
738
views
Bounding sum of first singular values squared for Kronecker sum of traceless matrices
Let $A$ and $B$ be $4\times4$ traceless matrices with Hilbert-Schmidt norms summing up to $1/4$, i.e.
$$\text{Tr}\left[ A\right]=\text{Tr}\left[ B\right] = 0,\qquad\text{Tr}\left[ A^\dagger A + B^\...
- 1,612
2
votes
1
answer
232
views
An innocent looking subgroup of $U(n)$
Consider the Lie subalgebra of $\mathfrak{u}(n)$ given by $L = \{A \in \mathfrak{u}(n): \sum_{j=1}^n A_{ij} = 0 \text{ for all } i \in [n]\}$. What is its dimension? What does the corresponding Lie ...
- 27.9k
4
votes
8
answers
3k
views
Theory of cones
Hi all,
Can anyone point me to some references to the theory of finitely-generated cones in euclidean space? I'd like to know in particular if there is a notion of basis/dimension/linear dependence ...
- 9,720
1
vote
0
answers
285
views
Given a jointly convex function $f$, what is the bound of $f\left(\sum_ip_i^2x_i,\sum_jq_j^2y_j\right)$if $\mathbf{p},\mathbf{q}$ are constrained in a manifold?
Suppose there is a jointly convex function $f:\mathbb{R}\times\mathbb{R}\rightarrow\mathbb{R}$, $\mathbf{x},\mathbf{y}\in\mathbb{R}^m$ and $\mathbf{p}=[p_1\;\ldots\;p_m]^\top,\mathbf{q}=[q_1\;\ldots\;...
- 607
1
vote
2
answers
734
views
Singular matrices with integer entries
I am motivated by the following paper by Greg Martin and Erick B. Wong:
http://www.math.ubc.ca/~gerg/papers/downloads/AAIMHNIE.pdf
Here the authors prove that assuming that the entries of an $n \...
- 3,201
2
votes
1
answer
162
views
'Compute' Integral equivalence of matrices
Hi.
For a matrix $D \in \mathbb{Z}^{n \times n}$ and a symmetric, positive definite integral even matrix $S \in \mathbb{Z}^{n \times n}$ put $S[D] := D^TSD$ where the $\cdot^T$ means 'transposed'. ...
- 3,201
4
votes
1
answer
682
views
Canonical rational form for $SL(n)$
The canonical rational form helps us to parametrize the conjugacy classes in $GL(n)$ over any commutative field.
How can we parametriize the conjugacy classes in $SL_n(k)$, where $k$ is an ...
- 11.2k
6
votes
3
answers
482
views
Linear subspaces in cones over orthogonal groups
Consider the orthogonal group $G=O(n)$ as a subset of the vector space of $n\times n$ real matrices. Let $C=C(G)$ denote the Euclidean cone over $G$, i.e., the space of matrices of the form $tA, A\in ...
CommunityBot
- 1
0
votes
2
answers
148
views
Bounding 2nd Eigenvalue of a Pseudo-Rotation-ish matrix
Let $p,q$ be arbitrary primes.
Let $N = p * q$.
Let $I$ be the $N * N$ identity matrix.
Let $R$ be the $N * N$ matrix defined as follows:
$R[x_0 * p + y_0, x_1 * p + y_1]=1$ if and only if $x_0+1 ...
- 52.3k
5
votes
1
answer
4k
views
Determinant of a sum of two matrices (one dominating the other)
Let $A$ and $B$ be two $n \times n$ real matrices such that:
$\forall i, j: a_{ij} \geq 0, b_{ij} \geq 0$
let $a_\max$ be the largest entry of $A$ and $b_\min$ be the smallest nonzero entry of $B$; ...
3
votes
0
answers
220
views
Could SVD be used to optimize the partial inner-products?
Suppose a set $N$ of $n$ distinct points in $m-$dimensional space is given in $X\in\mathbb{R}^{n\times m}$. Also, suppose a subset $L\subset N$, $|L|=l<m<n$, with
$m-$dimensional coordinates in ...
- 131
1
vote
0
answers
215
views
Characterizing symplectic matrices relative to a partial Iwasawa decomposition
Fixing notation: for matrices $A,X$ we let $A[X]$ denote ${}^tXAX$.
Let $P_n$ denote the collection of real $n\times n$ positive definite symmetric matrices.
For $Y\in P_n$ we have the usual ...
- 2,274
1
vote
2
answers
198
views
Finding a vector in the subspace
Given a $d$ dimensional vector $\bar{x} = [x_0,...,x_d]^t$,
how do I minimize $||\bar{x}-\bar{y}||_p$ such that $A\bar{y}=0$, for $p= 0$
i.e.,Minimize $L_0$ norm.
I also have the constraints that $...
- 31
11
votes
1
answer
838
views
Are these abelian groups free?
Suppose we have a countable, torsion-free abelian group $A$ with the property that for each element $a\neq 0$ the set $D_a=\{x\in A|\exists n\in \mathbb{Z}:nx=a\}$ is finite.
Is $A$ already a free ...
- 11.1k
3
votes
0
answers
1k
views
How many iterations are required for the Lanczos algorithm to converge?
I am trying to find the n smallest eigenvalues and eigenvectors of a NxN SPD matrix using Lanczos method. What is the number of iterations usually required? I mean, does it scale as $O(N)$ or $O(\sqrt{...
- 31
2
votes
1
answer
446
views
Example for pairwise triangularizable but not all three.
I am not able give an example for the following problem on simultaneous triangularization. So, I thought I will post it here.
Give an example of three linear transformations $A,B$ and $C,$ such ...
- 6,919
2
votes
1
answer
196
views
Relations between a set of inner products of vectors
Suppose we have n normalized vectors on an arbitrarily large Hilbert space $|A_1\rangle,\dots,|A_n\rangle$, $\langle A_i|A_i\rangle=1$ for every i. And there're $\frac{n(n-1)}{2}$ inner products $\...
- 96.4k
7
votes
0
answers
512
views
maximal subgroups of $GL_2(Z/p^kZ)$
Hello,
is there any classification of proper maximal subroups of $GL_2(\mathbb{Z}/p^k\mathbb{Z})$ for $k>1$ (analogous to the one which exist for $GL_2(\mathbb{Z}/p\mathbb{Z})$)?
Could you give ...
3
votes
2
answers
4k
views
Checking consistency of a system of linear equations and inequalities
I have a lot of systems of equations and inequalities of the following form:
$$ a_{1,1}x+a_{1,2}y+a_{1,3}z+a_{1,4}w = 2 $$
$$ \ldots $$
$$ 0 < x < 2 $$
$$ 0 < y < 2 $$
$$ 0 < z < 2 ...
- 14k
25
votes
8
answers
15k
views
Linear Algebra Problems?
Is there any good reference for difficult problems in linear algebra? Because I keep running into easily stated linear algebra problems that I feel I should be able to solve, but don't see any obvious ...
- 20.2k
2
votes
1
answer
586
views
quadratic form factorization
For a homogeneous polynomial with real coefficients:$f(x,y,z)=ax^2+by^2+cz^2+dxy+exz+fyz$, suppose we know $f$ factors into products of linear forms$f=(p_1x+p_2y+p_3z)(q_1x+q_2y+q_3z)$, are there ...
- 95
6
votes
1
answer
643
views
q-analog of the matrix exponential
I am a fan of the Matrix exponential $\exp(X)$, defined for any complex matrix $X$ by
\begin{equation*}
\exp(X) := \sum_{k \ge 0} \frac{X^k}{k!}.
\end{equation*}
I have a fleeting acquaintance with ...
- 8,524
2
votes
2
answers
337
views
How do you tell if the span of a set of vectors enters the most positive sector of a graph?
I have $k$ linearly independent vectors in $\mathbb{R}^n$. I want to know if the span of these vectors (i.e. the set of points in $\mathbb{R}^n$ that can be described by linear combinations of these ...
- 54.2k
4
votes
1
answer
386
views
Given $\mathbf{x}_i^\top A\mathbf{x}_i$ for a SPD matrix $A$ and orthonormal bases $\mathbf{x}_i$, what is the bound of its eigenvalues?
Assume that $A_{d\times d}$ is a symmetric positive semi-definite matrix, and $\{\mathbf{x}_1,\ldots,\mathbf{x}_d\}$ composes a group of orthogonal bases of $\mathbb{R}^d$ where $\mathbf{x}_i\bot\...
- 607
6
votes
1
answer
737
views
Rank of the absolute-value matrix $|M|$ vs. rank of $M$
Let $M$ be a real matrix of rank $r$ (and let us set $M=UV^T$, with $U,V^T\in\mathbb{R}^{n\times r}$, to fix the notation).
Let $|M|$ be the matrix obtained by taking the absolute value of each entry ...
CommunityBot
- 1
2
votes
2
answers
390
views
Ax=0, estimate min(Hamming(x)) ? Equivalently: Bipartite graph. How to find (estimate) minimal number of vertices1 which are connected with EVEN number of vertices2 ? Equivalently: estimate minimal weight of error correcting code ?
Consider system of linear equations Ax=0 over $F_2$ (field with two elements {0,1}).
Where number of variables is bigger than equations - so we have many solutions $x$.
Question How to estimate ...
- 198
6
votes
1
answer
180
views
Orbits of exterior products
In linear algebra one learns a lot of normal forms (Which I want to think of as a classification of the orbits of a group action on some set). For example if $V$ is a $k$-vectorspace $GL(V)$ acts on $...
- 16.9k
1
vote
0
answers
165
views
Affine space partition of a general set
Olof Heden, in his work "A survey of the different types of vector space
partitions", discusses various results regarding the following qustion - given a vector space $V$ over a finite field, how can ...
- 119
1
vote
1
answer
2k
views
Recovering a Matrix After Multiplication By Its Transpose [closed]
Given an arbitrary symmetric N-by-N matrix A, how can its original values be calculated from $P$?
$$ P = A'A$$
Both $A$ and $P$ have \( \frac{N^2-N}{2}+N \) degrees of freedom.
Edit: added the ...
- 52.3k
3
votes
1
answer
2k
views
Singular values of differences of square matrices
Suppose $A, B \in \mathbb{R}^{n \times n}$. Let $\sigma_1(A),\ldots,\sigma_n(A)$ be the singular values of $A$, and let $\sigma_1(B),\ldots,\sigma_n(B)$ be the singular values of $B$. If I know these ...
- 28.6k
9
votes
1
answer
1k
views
0 eigenvalue for a symmetric tridiagonal matrix
Let $T\in \mathbb{R}^{n\times n}$ be a symmetric tridiagonal matrix having the off--diagonal entries equal to -1. The diagonal entries are all positive, $a_i>0$, $i=\overline{1,n}$, and there ...
- 28.6k
4
votes
1
answer
314
views
Spectral Properties of $A(I-A)^{-1}$
I am working with a class of matrices $A$ which are non-negative-definite, not symmetric, and have maximum eigenvalue less than 1. I am interested in the spectral properties of the matrix $H = A(I - ...
- 20.2k
12
votes
2
answers
2k
views
Non-degenerate multilinear forms
Is there a standard notion of non-degeneracy for multilinear forms?
My motivation is simple curiosity, by the way!
- 5,898
8
votes
2
answers
583
views
Efficiently computing a few localized eigenvectors
Let $H = \triangle + V(x) : \mathbb{R}^2 \rightarrow \mathbb{R}^2$. I am interested in domain decomposition for an eigenproblem involving $H$.
The lowest 1000 eigenfunctions of $H$, $ \psi_i $, can ...
CommunityBot
- 1
3
votes
1
answer
1k
views
What is the minimum of the Frobenius norm in the intersection of positive semidefinite cones?
For scalar variables $x$, we have a simple solution for the following problem.
\begin{eqnarray}
\min_x&&\alpha(x-a)^2+\beta(x-b)^2 \\\
\mathrm{s.t. }&&x\leq a\\\
&&...
- 28.6k
1
vote
1
answer
794
views
Tensor Products, Sub-Algebras, Sub-Modules, and Inclusions
Let $A$ be a not neccessarily commutative algebra, and let $B \subset A$ be a subalgebra of $A$. Moreover, let $M$ be an $A$-bimodule, and let $N \subset M$ be a $B$-sub-bimodule. The tensor product $...
- 389
-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
2
votes
2
answers
820
views
Computing the multiplicity of an eigenvalue of a 0-1 symmetric matrix...
When we want to compute the multiplicity of an eigenvalue of a 0-1 symmetric matrix (viewed as the adjacency matrix of an undirected regular graph), we commonly resort to the know lemma of Feit and ...
2
votes
1
answer
313
views
Derivation of Iteration Rules
Suppose we are given a matrix $V$ and our goal is to find non-negative matrices $W$ and $H$ such that $V \approx WH$. So we want to minimize $K(V || WH)$ (Kullback-Leibler Divergence) where $$K(V||WH) ...
CommunityBot
- 1
6
votes
4
answers
1k
views
Polar decomposition for quaternionic matrices?
A non-zero complex number can be uniquely written in polar form as $re^{i\theta}$. There is an analogous result for complex matrices: any invertible complex matrix can be uniquely written as $UP$, ...
- 1,749