Skip to main content

Questions tagged [linear-algebra]

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

Filter by
Sorted by
Tagged with
0 votes
0 answers
273 views

Finding the eigenvectors of a submatrix

Let $A=(a_{kl})$ be a matrix in $M_n(\mathbb{R})$ when $n$ is even. Let $B=(b_{kl})$ be the symmetric $2n$ by $2n$ matrix whose entries are given by, $b_{k,l}=a_{kl}$ if $1\leq k,l\leq n$. $b_{n+k,l}=...
ABB's user avatar
  • 4,058
0 votes
1 answer
70 views

Tensor nuclear norm for a binary 3rd-order tensor

I am interested in the low-rank approximation of a binary(01) third-order tensor. Does anyone know how to define its tensor nuclear norm based on whatever tensor decomposition methods? Could anyone ...
Yang Ming's user avatar
0 votes
1 answer
80 views

Can this function be simplified to use only quadratic, linear terms of M with given conditions?

Given the function $$ E(M) = \sum_{i=1}^N \sum_{a=1}^K \left( M_{ia} \cdot \left\lVert\sum_{i=1}^N M_{ia}\cdot x_i\right\rVert_2^2 \right) $$ $x$ is a given constant matrix, $x_i$ is a the $n_\text{th}...
LancelotAchilleus's user avatar
0 votes
1 answer
104 views

Do subgradient inequalities hold for matrix convex functions?

Suppose $f$ is a matrix convex function over symmetric, positive semidefinite matrices with spectra in some interval $I$ [1]. That is, for $A,B\succeq 0$ with spectra in $I$, and any $\theta\in[0,1]$, ...
VF1's user avatar
  • 253
0 votes
0 answers
149 views

Diagonalizing a specific case of symmetric block matrix

Let's consider the following block matrix $$ M = \begin{pmatrix}D&A^T\\A&-D\end{pmatrix},$$ where $A$ and $D$ are $n \times n$ matrices. The diagonal matrix $D$ is defined by $D_{kk} = k \...
Marin's user avatar
  • 1
0 votes
0 answers
232 views

How to analyse the range of eigenvalues of a symmetric and indefinite matrix?

Let $G$ be a symmetric and indefinite matrix defined as follows $$ G := S - \begin{pmatrix} I_n & I_n \\ I_n & I_n \end{pmatrix},$$ where $S$ is a symmetric positive definite matrix of size $...
Nxy's user avatar
  • 1
0 votes
1 answer
74 views

$\det(HH’) = 0$ for nonnegative $H$

$H$ is an $n\times m$ matrix with non-negative coefficients and $n < m$. $H'$ is the transpose of $H$. Are the following statements true? If $\det(HH’) > 0$, the rows of $H$ define the edges of ...
dhakim's user avatar
  • 13
0 votes
0 answers
78 views

Topology of independence set of a vector space

This seems like something that would have a well-known treatment somewhere, but I'm not sure where to look. If we have a vector space $V$ (or maybe even a module), we can consider an abstract ...
xir's user avatar
  • 2,044
0 votes
0 answers
104 views

Necessary and sufficient conditions for $\mbox{trace}(A^{-1/2}e^{-tB} (AB+BA) e^{-tB}A^{-1/2}) \ge 0$ for all $t$

Let $A$ and $B$ be positive-definite matrices of the same size. For any $t \ge 0$, define $$ u(t) := \mbox{trace}(A^{-1/2}e^{-tB} (AB+BA) e^{-tB}A^{-1/2}). $$ Question. What are necessary and ...
dohmatob's user avatar
  • 6,853
0 votes
0 answers
174 views

Lipschitz map on positive definite cone of $n$-by-$n$ matrices

A function matrix $f : X \to \mathbb R$ is a convex Lipschitz continuous matrix function with Lipschitz constant $\mathrm L$ with respect to a fixed given norm $\|\cdot\|$, i.e., $|f(A)-f(B)| \leq \...
Reza's user avatar
  • 91
0 votes
0 answers
168 views

Multiplying by Loewner-ordered matrices

Suppose $A$ and $B$ are symmetric positive (semi-)definite, and $A<B$ in Loewner order, meaning $B-A$ is positive (semi-)definite. Is it true that, for a symmetric positive-definite $C$, we have $...
Athere's user avatar
  • 93
0 votes
0 answers
108 views

Solving a nonlinear equation maybe with Lambert W function

Can you please help me solve the following nonlinear equation? \begin{equation} \boldsymbol{z} \odot\left(\boldsymbol{\Gamma}^{\top} \boldsymbol{y}\right)=(\beta)^{\frac{1}{m-1}}\left(\frac{m-1}{...
Iman Nodozi's user avatar
0 votes
0 answers
144 views

Given a binary parity check matrix, find a parity check matrix for the same code such that no row has weight greater than $k$

A parity check matrix for a binary linear code is a matrix $H$ (with linearly independent rows) such that the (right) kernel of $H$ is the codespace. Clearly we can replace any row $r_i$ by $r_i + \...
itsabijection's user avatar
0 votes
0 answers
156 views

Optimal solution of complex optimization problem

Let $Q(x)=a(x)e^{jb(x)}$ be a complex function of $x$. We want to approximate this function with $R(x)=\alpha e^{jx\beta}$ such that \begin{align} \text{arg}\min_{\alpha,\beta} \int_{-\frac{A}{2}}^{\...
Math_Y's user avatar
  • 287
0 votes
0 answers
114 views

Degeneracies in linear combination of tensor product of Pauli matrices

Let $P_i \in \{I,X,Y,Z\}^{\otimes n} $, that is $P_i = \bigotimes_{i =1 }^n \sigma_i$ with $\sigma_i \in \{I,X,Y,Z\}$, where $$ I = \begin{pmatrix} 1 & 0 \\ 0 & 1 \end{pmatrix} \hspace{1cm} X =...
KAJ226's user avatar
  • 131
0 votes
0 answers
37 views

Linear system with +-1 coefficients and three variables for each equation

I have a linear system $LS$, where each equation contains three variables and the coefficient of each variable is $\pm 1$. For example, I have $x_{a}-x_{b}+x_{c}=p$ ($p$ is the known term). Suppose ...
Mario Giambarioli's user avatar
0 votes
0 answers
99 views

Invertible matrices with bounded nonnegative coefficients

I am teaching a class in linear algebra and I asked myself the following question: what is the chance to get an invertible matrix if I write a random one? My impulsive answer is "very likely"...
Andrea Marino's user avatar
0 votes
0 answers
92 views

Positive definite matrix and Hörmander theory

Let $\varphi \in C_{0}^{\infty}, \varphi\neq 0$. We'll consider the inner product in $L^{2}.$ Let $\alpha,\beta$ multi-index, $m\in \mathbb{N}$ such that $|\alpha|,|\beta|\leq m$ and set $$ \varphi_{\...
Lucas De Souza's user avatar
0 votes
0 answers
56 views

Determining the total number of nonzero expansion terms in a (0,1)-matrix

Let $A=(a_{ij})_{n\times n}$ be a $(0,1)$-matrix such that it contains equal number of $1$s in each row and column. Is there any general method to count the total number of the nonzero terms $\prod_{i=...
Easy's user avatar
  • 133
0 votes
0 answers
151 views

CRT for linear forms

Suppose $A,B,C,A',B',C'$ are random distinct primes in $[T,2T]$ and $u,v$ are integers in $[T,2T]$. Suppose we know: $$Au+Bv\equiv r\bmod C$$ $$A'u+B'v\equiv r'\bmod C'$$ can we identify $u,v$ in ...
Turbo's user avatar
  • 13.9k
0 votes
0 answers
180 views

Adding the AWGN to the data makes its covariance matrix always positive definite?

I'm working on a numerical method that estimates direction-of-arrivals in antenna arrays. I realized that every time I add the AWGN (Additive white Gaussian noise) to a data (which is a matrix), its (...
Tiago Troccoli's user avatar
0 votes
0 answers
92 views

Classification of elements $GL(d, \mathbb{R})$

Any $SL(2, \mathbb{R})$ is either elliptic or hyperbolic, or parabolic up to conjugacy; see here. Do we have the same classification for $GL(d, \mathbb{R})$? If so, could you please introduce some ...
Adam's user avatar
  • 1,043
0 votes
0 answers
57 views

Determinant of barycenter of a hyperbolic-matrix

Let $A \in \operatorname{GL}(d, \mathbb{R})$ be a hyperbolic matrix. I want to show that $$\det((1-\alpha)A+\alpha\operatorname{Id})\geq 1,$$ where $0<\alpha<1$. Attempt: In $\operatorname{SL}(2,...
Adam's user avatar
  • 1,043
0 votes
0 answers
67 views

Integration of matrix form of Vasicek variance (Python/Matlab)

$X_t$ is a vector and follows the following Vasicek process. $$ dX_t=(mu-K\cdot X_t)dt+Sigma_x\cdot dZ_t \\ $$ What is the variance of $X_t$? In scalar form the answer is $\frac{Sigma_x^2}{2\cdot K}\...
JH Y's user avatar
  • 1
0 votes
1 answer
397 views

What is the best way to choose initial basis when applying simplex method to an equality form of LP?

Currently I'm trying to write a practically fast LP solver for a sparse instance, which is by simplex method with LU decomposition and eta-matrix update. In the development I realized that I'm not ...
sansaqua's user avatar
0 votes
0 answers
133 views

A question from Richard Hamilton's paper "A matrix Harnack estimate for the heat equation"

Richard Hamilton "A matrix Harnack estimate for the heat equation. Communications in Analysis and Geometry. 1(1993), 113-126." On page 125, at the end of the proof of Theorem 4.3, I abstract ...
Geom Zari's user avatar
0 votes
0 answers
105 views

Unitarily equivalent matrices that are also unitarily equivalent on orthogonal subspaces

Consider two positive semidefinite matrices $A$ and $B$ on $\mathbb C^d$. Let $\{P_i\}_{i=1}^m$ be a complete family of $m$ orthogonal projectors on $\mathbb C^d$ (i.e., $P_i^*=P_i, P_iP_j=\delta_{ij}...
Henrik's user avatar
  • 31
0 votes
0 answers
124 views

The best unitary matrices that approximate a matrix product

Let $\mathbf{A}$ be an arbitrary $N\times N$ complex matrix. Moreover, $\mathcal{U}_1$ and $\mathcal{U}_2$ are distinct subsets of all unitary matrices. Suppose the matrices $\mathbf{U}_1$ and $\...
Math_Y's user avatar
  • 287
0 votes
0 answers
46 views

What kind of bounds for $\mathrm{Re}(\lambda(A))$ when $\lambda_{\mathrm{max}}(A + A^t) < 0$?

What can be said about the real parts of eigenvalues of $A \in \mathbb R^{n\times n}$ when $\lambda_{\max}(A + A^t) < 0$? I think the real parts of eigenvalues of $A$ will be negative, but I can't ...
seg nana's user avatar
0 votes
0 answers
80 views

Multivariate vandermonde matrix [duplicate]

I am dealing with a generalized vandermonde matrix, and i wandered if there were simple results availiable on it's invertibility. Fix a dimension $d$, and let $\mathbf x_1,...\mathbf x_n$ be points in ...
lrnv's user avatar
  • 686
0 votes
0 answers
112 views

How to prove or disprove $ |r'(a)| \leq c_1 \sup_{x \in [a-1/2,a+1/2]} |r(x)|$?

Let $ A = \begin{bmatrix} a & 1 \\ 0 & a \end{bmatrix}$ be a Jordan matrix with $ -1 < a < 1 $. Let $r(z) = \frac{p(z)}{q(z)}$ be an irreducible rational function, where $p(...
xiuhua's user avatar
  • 101
0 votes
0 answers
248 views

Is there a relationship between infinity norm (or any other norms) of a vector and the trace of its covariance matrix?

I wish to know if there is a known relationship between the infinity norm (or any other norms) of a vector and the trace of its covariance matrix? I have found a paper that used the following ...
Spring Breeze's user avatar
0 votes
0 answers
112 views

Existence of a subspace of having no isotropic 2-plane

Let $V$ be a vector space of dimension $n$ over the field $\mathbb {Q} $. A subspace $W$ is isotropic for a skew-bilinear form $\alpha$ on $V$ if $\alpha(x,y) = 0$ for all $x,y \in W$. More ...
Sky's user avatar
  • 923
0 votes
0 answers
198 views

eigenvalues of the product of a unitary with a diagonal

In $M_n(\mathbb{C})$, suppose $U$ and $D$ are a unitary and an invertible diagonal matrix with eigenvalues $\{e^{i\theta_1},\cdots,e^{i\theta_n}\}$ and $\{e^{i\eta_1},\cdots,e^{i\eta_n}\}$ ...
ABB's user avatar
  • 4,058
0 votes
0 answers
253 views

Determinant of chain complexes

Let $\mathcal{C}$ be the category of bounded cochain complexes of $R$-modules for a commutative ring $R$. I am trying to prove the following formula involving determinant $\text{Det}(F)$ of a map of ...
user avatar
0 votes
0 answers
44 views

Polynomial representation with shared root

Let $R$ be a polynomial quotient ring of the form $F_3[x_1,x_2,...,x_n]/\langle \{x_i^3-x_i\}_{1\le i\le n} \rangle$ and $\{f_i\}_{1\le i \le m}$ be elements of $R$, where $m > n$. We know that the ...
Changmin Lee's user avatar
0 votes
0 answers
150 views

Sequence in matrices converging to Identity

Let $M_{k}(\mathbb{C})$ be the set of $k \times k$ complex matrices. I am trying to find a sequence of polynomials $P_{n}: M_{k}(\mathbb{C}) \to M_{k}(\mathbb{C})$ (or continuous functions $f_{n}$) ...
user938363's user avatar
0 votes
0 answers
96 views

Books on limiting properties of matrices with growing size

This question has been posted on Math-Se previously. I am studying asymptotic properties of the Projection Matrix $$ H_n=X'(X'X)^{-1}X $$ By the Gerschgorin disc theorem, the bounds on the ...
chuck's user avatar
  • 101
0 votes
0 answers
41 views

Combining coefficients in a sum of inequalities

In an induction proof of a lemma I would like to prove the following statement. Let $U$ be a non-empty finite set and let $X_{i,j}$ for all $i\not=j \in U$ be real numbers. Assume for each $j\in U$ we ...
user379923's user avatar
0 votes
0 answers
257 views

What's the definition of Euclidean density?

In page 19 of the article "Equivariant cohomology with generalized coefficients" the authors say: Let $V $ be an n-dimensional real vector space, let $v'$ be a non-zero element in $ \wedge^...
Mira's user avatar
  • 139
0 votes
0 answers
54 views

Rank decomposition of matrices over $\mathbb F_2$

Given an integer matrix $M\in\mathbb Z^{n\times n}$ of real rank $k$ what is the minimum and maximum number of rank $1$ matrices $B_1$ to $B_t$ we require so that $M\equiv\sum_{i=1}^tB_i\bmod 2$? If $...
Turbo's user avatar
  • 13.9k
0 votes
0 answers
135 views

Is there an efficient algorithm to project a vector onto the eigenbasis of a symmetric matrix?

Let $H$ be a symmetric matrix over $\mathbb R^n$. Given some vector $u$, I would like to express $u$ in the eigenbasis for $H$. Can this be done efficiently, perhaps using some kind of iterative ...
Jack M's user avatar
  • 623
0 votes
0 answers
105 views

Any open subgroup of $GL_n(K)$ contains $U_n(K)$

My setting is the $p$-adic field. $K$ (finite extension of $\Bbb Q_p$.) Proposition 2.1.18 seems to claim that Any open subgroup of $GL_n(K)$. contains $U_n(K)$ the unipotent upper triangular ...
Bryan Shih's user avatar
0 votes
1 answer
357 views

Continuity of point evaluation on space of Hölder functions with $L^p$ norm

Let $L>0$ and $\Omega \subset \mathbb{R}^n$ a bounded Lipschitz domain. Define $$ B_{\frac12,L}:=\{f \in L^2((0,1) \times \Omega) : \|f(t,\cdot)-f(s,\cdot)\|_{L^2(\Omega)} \leq L|t-s|^{\frac12},~ \...
Marko Rajkovic's user avatar
0 votes
0 answers
104 views

Efficient Algorithm to Find Subset of Vectors Over $\mathbb{F}_q$ Living in Low Dimensional Subspace

Let $q$ be a fixed prime, $P, Q$ be polynomials with $\mathrm{deg}(Q) < \mathrm{deg}(P)$ and $h = O(\log n)$. Let $S$ be a subset of $\mathbb{F}_q^n$ of size $P(n)$ such that there exists a subset ...
cha21's user avatar
  • 328
0 votes
0 answers
183 views

Eigenbases without the Axiom of Choice

I understand that in ZF set theory without the Axiom of Choice (AC), it is consistent to have models in which there exist vector spaces over some (unspecified) field $k$ without a basis. So in ...
THC's user avatar
  • 4,547
0 votes
0 answers
137 views

Any technique for linearization, or linear approximation?

Consider the following Matrix constraint: $$ \begin{bmatrix} -U+\psi\Sigma_b^{-1} & V \\ V^T & -V^TU^{-1}V+\tau_2 -\psi \end{bmatrix} \leq 0 $$ where $\Sigma_b$ is a known positive definite ...
Navid Hashemi's user avatar
0 votes
0 answers
227 views

Decomposition of symmetric block matrix

I came across this question and got really interested about it. There, the OP asks whether is possible to decompose a $2n \times 2n$ block matrix: $$ \begin{pmatrix} X & I \\ I & Y \end{...
InMathweTrust's user avatar
0 votes
1 answer
266 views

Using QR or SVD to sum up finite number of matrices

Problem I was wondering if there are any theoretical results that tackle the following problem: Construct the following matrices $\mathbf{\mathcal{S}_{1}},\mathbf{\mathcal{S}_{2}},\ldots,\mathbf{\...
Mykael Yuday's user avatar
0 votes
0 answers
46 views

Lipschitz solutions to linear complementarity problems (LCP)

Let $M\in\mathbb{R}^{n\times n}$. For $q\in\mathbb{R}^n$, define the set: $$S_M(q)=\{y\in\mathbb{R}^n|y\ge 0,q+My\ge 0, y^\top (q+My)=0\}.$$ This is the set of solutions to the LCP $(q,M)$. We say $...
cfp's user avatar
  • 183

1
110 111
112
113 114
118