Questions about the properties of vector spaces and linear transformations, including linear systems in general.

learn more… | top users | synonyms

3
votes
1answer
703 views

Ratio sum comparison on operators

It is known by the Lidskii inequality, that $\sum_{i=1}^n \left|s_i(S)-s_i(T)\right|\le\sum_{i=1}^n s_i(S+T)$, where $s_i(S)$ is the $i$-th singular value of $S$. How would one prove that ...
0
votes
0answers
8 views

Questions about some special tensor transformation

Suppose tensor $U_{i\alpha\beta}$ with dimension $M*N*N$ satisfy following condition: $$U_{i\beta\alpha}=W^1_{\alpha\alpha'}W^2_{\beta\beta'}U_{i\alpha'\beta'}$$ where $W^1$ and $W^2$ are $N*N$ ...
2
votes
1answer
68 views

Linearly constrained eigenvalue problem

Suppose I'd like to: \begin{align} \mathop{\text{min}}_\mathbf{x} && \mathbf{x}^T\mathbf{A}\mathbf{x} \\ \text{subject to:} && \mathbf{x}^T \mathbf{M} \mathbf{x} = 1\\ && ...
0
votes
0answers
104 views

Composition of multilinear forms agreeing on a subset of points

Let $n$ be a perfect square. Consider multiaffine polynomials $p(x_1,x_2,\dots,x_n),q(x_1,x_2,\dots,x_n),r(x_1,x_2,\dots,x_n),$$\{s_j(x_1,x_2,\dots,x_n)\}_{j=1}^{n}$$\in\mathbb R[x_1,x_2,\dots,x_n]$. ...
2
votes
1answer
92 views

Which nonnegative matrices have exact nonnegative matrix factors of smaller dimensionality?

The nonnegative matrix $V = \left( \begin{array}{cc} 1 & 1 \\ 1 & 1 \end{array} \right)$ has nonnegative matrix factors $W = \left( \begin{array}{c} 1 \\ 1 \end{array} \right)$ and $H = ...
1
vote
1answer
134 views

Is the notation ${}^t g$ for the transpose of a linear transformation intended to be suggestive?

The notation ${}^t g$ for the transpose of a linear transformation is, in my view, quite unusual: otherwise (at least in many areas of math), one almost never sees subscripts or superscripts appearing ...
1
vote
0answers
40 views

Is there an efficient way to compute the “complete subset regression”?

Background: Let $X \in \mathbb{R}^{N\times K}$ and $y \in \mathbb{R}^{N\times 1}$ be data for a regression problem. The aim is to find $\beta \in \mathbb{R}^{K\times 1}$ such that $X\beta \approx y$ ...
8
votes
2answers
750 views

Spheres over rational numbers and other fields

Let K be an ordered field. Define the n-sphere: $$S^n(K) := \{ (x_1,x_2,\dots,x_n+1) \in K^{n+1} \mid \sum_{i=1}^{n+1} x_i^2 = 1 \}$$ A set of vectors $v_1, v_2, \dots, v_r \in S^n(K)$ is ...
32
votes
19answers
6k views

Wonderful applications of the Vandermonde determinant

This semester I am assisting my mentor teaching a first-year undergraduate course on linear algebra in Peking University, China. And now we have come to the famous Vandermonde determinant, which has ...
9
votes
2answers
794 views

How to transform matrix to this form by unitary transformation?

Without loss of gernerality, we can only consider $n$-dimensional diagonal matrix $M$ whose elements are all nonnegative, i.e. $$M=\operatorname{diag}(m_1,m_2,\cdots,m_n)\ (m_i \geq 0).$$ Then is ...
4
votes
1answer
85 views

Writing a complex orthogonal matrix as a conjugation by real orthogonal matrices

Let $Q\in O(n,\mathbb C)$ be a complex orthogonal matrix. I would like to know if $Q$ can always be written as $Q = T^{-1}ST$, where $T\in O(n,\mathbb R)\subset O(n,\mathbb C)$ and $S$ belongs to some ...
1
vote
0answers
12 views

How to restructure adjacency matrix $A$ from shortest distance matrix $B$ in Network topology inference

An undirected graph with $n$ nodes could be referred to as an adjacency matrix $A$. $A=[a_{ij}]_{n×n}$ with $a_{ij}=a_{ji}=1$ standing for there being an edge between node $i$ and node $j$, and no ...
16
votes
4answers
703 views

Computing the Zariski closure of a subgroup of SL(n,Z)

Suppose $\Gamma$ is a finitely generated subgroup of $SL(n,\mathbb{Z})$, given as a list of generators. We would like to (somewhat efficiently) try to compute the Zariski closure of $\Gamma$, which is ...
1
vote
1answer
47 views

Heuristic for choosing n-vectors from n-sets

my given problem is: choose n-vectors from n-sets (one vector from each set) so that the biggest element in the sum of the chosen vectors is minimal. Unfortunately the problem is NP-hard. So I'm ...
4
votes
1answer
208 views

Generalized Cauchy-Binet sum over a fixed subset of indices

I originally posted this on math.stackexchange, but it quickly got buried. I removed it not too long after, thinking of rewriting it for MO, but I didn’t have a chance to post it until now. Apologies ...
1
vote
1answer
170 views

Solving a matrix equation $X=c \cdot AXA' +I$ with a diagonal corrections

I am now struggling to solve the matrix $X \in R^{n \times n}$ in the following equation: $X=c \cdot AXA' - diag(c \cdot AXA')+ I$, where (1) $A \in R^{n \times n}$ is a given matrix whose element ...
-5
votes
0answers
29 views

Point of Discontinuity [closed]

Please help on this solution... This is one of the hardest exam I'd encounter in math. 1.) f(x)2 = 2x/x+9 2.) f(x)2 = x, if x>0 -x, if x<0 3.)f(x)2 = 2x3 - 2
-1
votes
1answer
141 views

spectrum of a special class of tridiagonal matrices

Consider a real and symmetric tridiagonal matrix with zero diagonals and where subdiagonals and superdiagonals are equal to 1 except the (1,2)-th component being equal to $a$, i.e., ...
-3
votes
0answers
78 views

The rank and eigenvalues of the operator $T(M) = AM - MA$ on the space of matrices [closed]

This problem is from Artin Algebra Second edition, 5.2.3. Let $A$ be a $n\times n$ complex matrix. (a) Consider the linear operator $T$ defined on the space $\mathbb{C}^{n\times n}$ of all complex ...
0
votes
1answer
113 views

Bounded domain matrix factorization

Assume we're trying to find $A\in [-1,1]^{n\times d}, B\in [-1,1]^{m\times d}$, from an observed matrix $C\in [-d,d]^{n\times m}$, where $C=AB^T$. The goal is to return $\widehat A, \widehat B$ such ...
0
votes
0answers
50 views

Relation between eigendecomposition of matrix sum and sum of squared matrices [closed]

I would like to ask if there is (generally) a relation between the eigenvalues and eigenvectors of a matrix sum $\sum_i A_i$ and a sum of the squared matrices $\sum_i A_i A_i$ ? If this thread ...
4
votes
1answer
122 views

standard practice for large dense truncated svd computations?

What are the standard methods of computing the rank-k truncated SVD of large dense matrices? My literature search yields results only for large sparse matrices. I assume for k small that you use a ...
3
votes
0answers
760 views

Eigenvalue Problems with Linear Constraints

The motivation for this problem comes from trying to develop a simple way to decompose domains into non-overlapping subdomains to solve for the eigenvalues of some differential operator. The idea is ...
6
votes
2answers
221 views

Approximating the action of the U(N) exponential map

Let's say that I have a curve in $\mathbb{C}^N$ given by the action of the unitary group: $$x(t) = e^{Ht}x_0,~ H \in \mathfrak{u}(N),~ ||x_0||=1$$ Here, $H$ is an NxN skew-Hermitian matrix (for very ...
1
vote
1answer
50 views

Looking for algorithms based on sorting [closed]

i am looking for algorithms which use sorting in low-dimensional space like $R$ and how they are generalized for higher-dimensional spaces like $R^2$ where there is no sorting possible. (i.e. numbers ...
2
votes
2answers
126 views

Matrix, singular values, Moore-Penrose-pseudoinverse

If A is any real mxn-matrix consider the block matrix $\begin{pmatrix} E&A^T \\ A&0\end{pmatrix}$. This matrix seems to have close connections with pseudo inverse, svd etc. which are probably ...
3
votes
2answers
79 views

eigenvalue estimate of the adjacency matrix

The adjacency matrix of a nonempty (undirected) graph has a strictly positive largest eigenvalue $\lambda_\max$. A very easy upper estimate for it can be obtained directly by Gershgorin's theorem: $$ ...
0
votes
2answers
96 views

Can any antilinear involution be trivialized by a change of basis?

Consider an antilinear involution, that is an antilinear map on a complex vector space, whose matrix $M$ obeys $MM^*=1$ where the star denotes complex conjugation. Can we find a change of basis whose ...
0
votes
1answer
250 views

Is there a Gröbner basis analogue that exists for vector spaces?

Suppose I have a coordinate system $t_1,\ldots t_N$ with a lexicographical ordering. Let LT denote choosing the lowest term of a polynomial with respect to this ordering. e.g. LT$(t_1 + t_2)=t_2$. ...
8
votes
1answer
428 views

Reference request: Book of Linear algebra from categorical point of view

Is there any book of Linear algebra in the modern language of Category theory? I refer to the (systematic, formalist) study of the category whose objects are vector spaces and whose morphisms are ...
27
votes
2answers
1k views

The probability for a symmetric matrix to be positive definite

Let me give a reasonable model for the question in the title. In ${\rm Sym}_n({\mathbb R})$, the positive definite matrices form a convex cone $S_n^+$. The probability I have in mind is the ratio ...
1
vote
0answers
109 views

Bounds on the effect of a matrix product on the Frobenius norm

I was wondering if there was a way to put upper and lower bounds on the Frobenius norm of a matrix product in relation to the Frobenios norm of one of the individual matrices, i.e, ...
-1
votes
3answers
8k views

The Convergence of Jacobi and Gauss-Seidel Iteration [closed]

Hi All! I was supposed to find a solution of Ax=b using Jacobi and Gauss-Seidel method. The A is 100x100 symetric, positive-definite matrix and b is a vector filled with 1's. I am iterating(k = ...
3
votes
2answers
134 views

Linearly independent family of sequences of rationals with a cardinal equal to the continuum

I'm coming back to this question. Is it possible to have "an explicit" linearly independent family of sequences of rationals with a cardinal equal to the continuum? PS: sorry for the duplicate on the ...
5
votes
3answers
195 views

Why is the spectrum of this matrix product invariant with respect to order of the multiplicants?

I've been chewing on the following problem for some time and I just don't have any more ideas how to tackle it. I have matrices $A_1,...,A_k \in \mathbb R^{n\times n}$ and I'm observing that the ...
0
votes
0answers
55 views

The space of sequences of rationals and its dimension [duplicate]

In the following page, I give an example of a vector space not isomorphic to its double dual. I use the space $E$ of sequences of reals. Its dimension (over the field of the reals) is the one of the ...
0
votes
0answers
15 views

Significance of Eigenvectors of a Covariance matrix [migrated]

In PCA and in many other problems of machine learning we use Eigenvectors of covariance matrix of the data. How do we visualize Eigenvectors of Covariance matrix? The Principal Eigenvector ...
9
votes
1answer
321 views

Trouble with Jordan form of the truncated Carleman-matrix for $\sin(x)$ as size $n$ goes to infinity

I'm currently trying to get familiar with the Jordan normal form for matrices; and after some example I ask for the possible Jordan-form for the Carleman matrix for the function $f(x) = \sin(x)$ when ...
2
votes
0answers
33 views

Random matrices whose limit gives exact Wigner surmise

Let $M$ come from an ensemble of $N\times N$ matrices. The Wigner surmise is density function $p^W_0(s)=\frac{\pi}{2}se^{-\pi s^2/4}$. From a random matrix point of view, we can write ...
0
votes
1answer
405 views

eigen-decomposition solution? is it unique?

Assume an N*N covariance matrix (Q) which is a positive definite matrix. The decoder X is assumed to be N*s, where s<=N. X is calculated to be s eigenvectors corresponding to s minimum eigenvalues. ...
16
votes
5answers
756 views

Smallest non-zero eigenvalue of a (0,1) matrix

What's the smallest absolute value possible of a non-zero eigenvalue of an $n$ by $n$ square matrix whose entries are either $0$ or $1$ (all operations are over $\mathbb{R}$)? I would be interested ...
1
vote
0answers
71 views

MInors related problem [closed]

A matrix $A$ has $m$ rows and $n$ colums, such that $m \leq n$. We know that each row of $A$ has the norm $1$ (the norm of an element $x=(x_1,x_2,...,x_n) \in \mathbb{R}^n$ is ...
0
votes
1answer
133 views

Collecting terms of a linear expression with nested sums and combinatorics in coefficients

I need to collect the $\Pr(\cdot)$ terms of the following expression: $\sum_{m=3}^{n}\frac{g_{m}\left( \cdot \right) }{\left( \sqrt{\theta \left( 1-\theta \right) }\right) ^{m}}\left[ ...
11
votes
1answer
172 views

Hlawka inequality for determinants of positive definite matrices

It is mentioned here that if $A, B, C\in M_{n}(\mathbb C)$ are positive semidefinite, then $$\det (A+B+C)+\det C\ge \det (A+C)+\det (B+C)$$ (quoted from this article) and the special case ($C=\bf 0$) ...
5
votes
3answers
146 views

Norm of triangular truncation operator on rank deficient matrices

Let $T_{n\times n}$ be a triangular truncation matrix, i.e. $$T_{i,j}=\begin{cases}1 & i\ge j\\ 0 & i<j \end{cases}$$ It is known that for arbitrary $A_{n\times n}$ $$\|T\circ ...
1
vote
1answer
218 views

Under what conditions there is a one-to-one mapping between a product of matrices and the sequence of matrices leading to the product?

I have a set of matrices $A_1,\ldots,A_n$. Let $\mathcal{A} = \{A_i\}$. What are some simple conditions under which for any sequence of indices between $1$ and $n$, $a_1,\ldots,a_m$, the product ...
0
votes
1answer
201 views

Find the following transformation $G$

I asked this question 6 days ago on math.stackexchange.com (http://math.stackexchange.com/questions/656585/find-the-following-transformation-g). I didn't get any answers yet, so I'm posting here. I'm ...
2
votes
0answers
152 views

Eigenvalues of this matrix

I have a linear map that is defined by $$T:\text{lin}(1,...,x^m) \rightarrow \text{lin}(1,...,x^m) \text{ with}$$ $$x^k \mapsto 2w(k-m)x^{k+1}+(k^2-k-w^2)x^k-2kwx^{k-1}+(k-k^2)x^{k-2}$$ Let me give a ...
7
votes
1answer
111 views

Compute only selected components of an eigenvector

I am wondering whether it is possible to compute portions of the eigenvectors of a given (possibly very big) matrix. More formally, consider the eigenvalue problem $\mathbf{Ax} = \lambda \mathbf{x}$, ...
4
votes
1answer
166 views

$n$ columns of a specific “infinite” Vandermonde matrix always linearly independent? [closed]

Consider the "infinite" Vandermonde matrix $$ V (x_1, x_2, \ldots , x_n) = \begin{pmatrix} 1 & x_1 & x_1^2 & \cdots & x_1^{n-1} & x_1^n & x_1^{n+1} & \cdots \\ ...