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
1 answer
143 views

Differential form of the multidimensional "orthogonal dilation" operator

For a one-dimensional $f(x)$, the dilation operator $f(ax)$ can be expressed as $\exp(g(D))f(x)$, where $g$ is a closed-form function. This is easily checked by e.g. formal Taylor series expansion. ...
Kanghun Kim's user avatar
0 votes
1 answer
115 views

Approximation for an expectation expression

Let $\mathbf{x} \in \mathbb{C}^M$ is an unknown distributed random vector (certainly not gaussian), and matrix $\mathbf{A}\in \mathbb{C}^{M \times M}$ which is fix (known). Also, assume we know the ...
A. R.'s user avatar
  • 25
0 votes
1 answer
101 views

Maximum number of vectors with bounds on inner products (follow up question)

This is a follow-up question from my previous question. Suppose there are (2n+1) vectors $\{m_1,m_2,...,m_n\}$, $\{p_1,p_2,...,p_n\}$ and $p^*$ in $R^{k+1}$. $m_i$ are weakly positive vectors. $p_i$ ...
TanG's user avatar
  • 23
0 votes
1 answer
142 views

Vandermonde matrix with polynomials

Let us consider the simple Vandermonde matrix $V_n$ with $V_{ij} = \omega^{(i - 1)(j - 1)}$ where $\omega = e^{2i\pi/n}$. Its well known that for a column vector $A$, $VA$ is equivalent to evaluating ...
Aditya Jain's user avatar
0 votes
1 answer
75 views

The spectrum of the product $JA$ where $J=I_n\oplus (-I_n)$

Let $A$ be a real symmetric matrix in $M_{2n}(\mathbb{R})$with $A^2=I_{2n}$. Suppose that the Schur decomposition of $A$ is given by $A=\Lambda^t D \Lambda$. Let us consider the following matrix. $$...
ABB's user avatar
  • 4,058
0 votes
1 answer
147 views

Is there a redundant constraint in linear programming? [closed]

From wikipedia: But... Why do we need the $x\ge 0$ part? We can instead do $-x\le 0$, and thus saving a line in the definition (which is not a big deal but nevertheless nice). (In order to do that, ...
Bipolo's user avatar
  • 3
0 votes
1 answer
257 views

Calculation of solid angle for rectangle in 6DOF [closed]

I am an undergrad trying to understand and use solid angle calculations: I have a point source in R3 space (x_source, y_source, z_source) and a rectangle with given center (x_center, y_center, ...
Vojtooo's user avatar
0 votes
1 answer
80 views

Probability of accurate sparse recovery

Suppose $\mathbf{A}_{k\times n}$ ($k<n$) is a matrix whose entries are generated i.i.d. from Gaussian distribution and $\mathbf{s}_{n\times 1}$ is a sparse vector with $m$ sparsity (i.e., $\|\...
Math_Y's user avatar
  • 287
0 votes
1 answer
67 views

Analytic formula for minimizer of $f(x) := \sqrt{(x-a)^\top S(x-a)}+ r \|x\|_2$

Let $S$ be a positive-definite $n \times n$ matrix and define $\|z\|_S := \sqrt{x^\top S x}$ for any $x \in \mathbb R^n$. Let $a$ be a fixed vector in $\mathbb R^n$ and $r \ge 0$, and consider the ...
dohmatob's user avatar
  • 6,853
0 votes
1 answer
269 views

Product of subspace and its inverse

$\DeclareMathOperator\GF{GF}$Let $R=\GF(q)$ be a finite field with $q=p^r$ elements, where $p$ is a prime number, $S=\GF(q^n)$ be an extension of $R$, where $n\in \mathbb{N}$, $n\geq 2$ and let $K=\GF(...
Mikhail Goltvanitsa's user avatar
0 votes
1 answer
116 views

Enumerating (i.e. generating one by one) matrices of given rank over a finite field

Let be given positive integers $m,n,r$, with $r \leq \min(m, n)$, and a finite field of $q$ elements $\mathbb{F}_q$. I'm looking for an efficient algorithm to enumerate (i.e., generate one by one) all ...
Kleo's user avatar
  • 43
0 votes
1 answer
123 views

Explicit expression of Padé–Hermite approximant of type I

It is well known that the Padé approximants $(P,Q)$ of an analytic function in the neighborhood of $0$ can be expressed as a quotient of Hankel determinants built on the coefficients of the function $...
joaopa's user avatar
  • 3,998
0 votes
1 answer
125 views

Special type of normal form of matrix in principal ideal domain

$\DeclareMathOperator\GL{GL}\DeclareMathOperator\PSL{PSL}$I want to ask the following, Given $X \in n \times n$ matrix that all the elements are integers and $X=X^{T}$ is symmetric. Can one always ...
en kuo's user avatar
  • 145
0 votes
1 answer
116 views

Order 2 matrices with entries in the polynomial ring over a field are diagonalisable

This is a variant on the question posed here, in which the OP asks for a characterisation of the diagonalisable involutions in $\operatorname{GL}_n(A)$, where $A$ is a $k$-algebra for some field $k$ ...
Martin Skilleter's user avatar
0 votes
1 answer
176 views

Maximum vertex amount of low-dimensional simplex projection

Consider an arbitrary simplex $\mathcal{S} \subseteq \mathbb{R}^n$ ($\mathcal{S}$ is a polytope in $\mathbb{R}^n$ with $n+1$ vertices and non-empty interior). Let ${\bf P} \in \mathbb{R}^{m \times n}, ...
Daniel Turizo's user avatar
0 votes
1 answer
138 views

Does there exist a function $f(X)$ with the following gradient $\mathrm{Tr}[(I-X)^{-1}]\cdot g(X)$?

Let $f: \mathbb{R}^{n\times n} \to \mathbb{R}$ be a function that receives a square matrix and spits out a scalar. Does there exist a function $f$ such that the gradient $\nabla_Xf(X) = \mathrm{Tr}[(...
Bee's user avatar
  • 59
0 votes
1 answer
245 views

Decomposing a standard deviation [closed]

I am trying to "decompose" a standard deviation of an economy-wide variable into sectoral components. I have data for the year 2010 on the dispersion (standard deviation) of total economy ...
user319004's user avatar
0 votes
1 answer
162 views

How many matrices with given minors?

Let us consider a matrix $A \in M_{2 \times n}(\mathbb C)$ such that $rank A=2$. Let us denote by $$ a_1,\ldots,a_d \in \mathbb C, $$ where $d:=\binom{n}{2}$, the value of the $2 \times 2$ minors of $...
Bobech's user avatar
  • 381
0 votes
1 answer
140 views

Linear independence of complex polynomials and a "sum of squares" conjecture

This will take me some time to explain. Let $n \geq 2$ be a fixed integer. Let $p_i(z)$, for $i = 1,\ldots,n$ be $n$ nonzero complex polynomials of degree at most $n-1$. I am interested in ...
Malkoun's user avatar
  • 5,215
0 votes
1 answer
120 views

Complexity of solving linear equations plus disequality constraints $a \ne b$

Let $K$ be ring and $S$ linear homogeneous system with $n$ variables $x_i$ over $K$. Add to $K$ linear disequalities of the form $x_k \ne x_l$ and let the final system be $S'$. If $K=\mathbb{F}_2$, $...
joro's user avatar
  • 25.4k
0 votes
1 answer
230 views

Solution of complex linear system

In Brubeck, Nakatsukasa, and Trefethen - Vandermonde with Arnoldi (example 3) they solve the following linear system: $$\operatorname{Re}\left(\begin{array}{ccc}1 & \cdots & z_{1}^{n} \\ 1 &...
Gaussian's user avatar
0 votes
1 answer
126 views

An otherwise linear matrix equation with the presence of a signum function : reference request

Consider the equation $$\pmb{c}+\text{sign}(G\pmb{c}) = L$$ $\pmb{c}$ is a $n\times1$ matrix. $G$ is a $n\times n$ matrix which is also positive definite. matrices $G$ and $c$ are real. $L$ is a $n\...
Rajesh D's user avatar
  • 698
0 votes
2 answers
263 views

Convergence of the eigenvector matrix for an analytic perturbation of a singular matrix

Let $A$ be an $n\times n$ matrix of all ones. Consider the analytic perturbation of $A$ as $$\tilde{A} = A + \epsilon H_1 + \epsilon^2 H_2 + \epsilon^3 H_3 + ... $$ All matrices are symmetric. Assume $...
Rajesh D's user avatar
  • 698
0 votes
1 answer
34 views

Entries of matrix iterates

We consider a matrix $$A:=\begin{pmatrix} 0 & b & 0 &f \\a & 0 & e & 0 \\ 0 & d & 0 & h \\ c& 0 & g & 0 \end{pmatrix}.$$ This matrix has the interesting ...
Pritam Bemis's user avatar
0 votes
1 answer
425 views

Are anti-linear maps/semi-linear, such as conjugations, linear in other almost complex structures?

I have asked this on mse, but I did not get any responses even after a bounty. I started studying the book of Daniel Huybrechts, Complex Geometry An Introduction. I tried studying backwards as much ...
BCLC's user avatar
  • 247
0 votes
1 answer
119 views

Matrix iteration for non-negative matrices. Does it converge to some eigenvector?

Let $A$ be a non-negative (entrywise) matrix such that $A(1,1)>0$. Set $u=(1,0,0,...,0)^T$. Is it always true that there exists a non-negative eigenvector $v$ of $A$ such that $\lim_{n\rightarrow\...
A. Batsis's user avatar
0 votes
1 answer
73 views

Proving equality of a vector multiplication example [closed]

I noticed that for any vectors $\mathbf{a},\mathbf{b},\mathbf{c}$ where $\mathbf{a},\mathbf{b}\in \mathbb{R}^{m\times 1}$ and $\mathbf{c}\in \mathbb{R}^{n\times 1}$, there exists the equality that $$\...
Guoyang Qin's user avatar
0 votes
1 answer
181 views

expectation of a quadratic function of a matrix variate normal distribution

I want to compute the following expectation term: $E[{\bf{XA}}{{\bf{X}}^T}]$ where ${\bf X} \in R^{M \times M}$ and its elements are normal random variables such that $vec\left( {\bf{X}} \right)\...
user51780's user avatar
  • 275
0 votes
1 answer
205 views

Trace of a finite hypercubic tensor

Is the trace of a finite hypercubic tensor defined? Clearly, for the bidimensional case $n \times n$ the trace is defined as the sum of the elements on the main diagonal: $$\operatorname {tr} (\...
Luca Cappelletti's user avatar
0 votes
1 answer
226 views

Condition of tri-diagonal matrix A such that UAU^t=A for all orthogonal matrix U [closed]

$A,U \in \mathbb{R}^{n\times n}$ $\exists A \in \text{{tri-diagonal}} \quad s.t \quad UAU^{t}=A \quad \forall U \in \text{{orthogonal}}$ I know it holds when A is a diagonal matrix, but have no ...
rae hyun kim's user avatar
0 votes
1 answer
228 views

Upper and lower bounds for a matrix norm with fixed diagonal

given a vertical vector $x=(x_1,x_2,...x_n)$ of size n and $B$ is a symmetric positive definite matrix ($n \times n$) of choice. All the diagonal elements of B are fixed to one, while extra diagonale ...
SC_thesard's user avatar
0 votes
1 answer
127 views

Existence of rank-1 weight matrix in some type of deep neural network

Problem This is the first time I have posted a question on this site and it may not be suitable for this venue, which is primarily used for research questions in maths. If someone finds it unsuitable,...
Mr.Robot's user avatar
  • 103
0 votes
1 answer
43 views

For an one-order Linear Recurrence of a vector sequence, does the corresponding item follow a Linear Recurrence? [closed]

Consider an one-order Linear Recurrence of a vector sequence, such as $${\bf x}_{n+1}={\bf A}{\bf x}_n$$ where ${\bf x}_n \in \mathbb{R}^m (\forall n)$, and ${\bf A} \in \mathbb{R}^{m\times m}$ and ${\...
zbh2047's user avatar
  • 601
0 votes
1 answer
135 views

Solving Problem: LMIs and block matrices

I have been reading through this paper (https://ieeexplore.ieee.org/document/7995739) where I am stuck with this particular LMI. If you are familiar with control theory, the author is trying to find ...
Zero's user avatar
  • 103
0 votes
1 answer
809 views

Conjecture that relates matrix systems with some specific functions as solution sets

what is written below is a conjecture that I posed , and I ask for a proof or a disproof of it .I have checked the conjecture from $n$=$1$ up to $n$=$10$ using Matlab, and all results were in ...
Ahmad Jamil Ahmad Masad's user avatar
0 votes
1 answer
288 views

How eigenvalue perturbation affects back to the original matrix?

Both "eigenvalue perturbation" and "matrix perturbation" seems to study this scenario that given a matrix $A$, if we add something to it like $\tilde{A} = A+E$, how will the eigenvalues of $\tilde{A}$ ...
Haohan Wang's user avatar
0 votes
1 answer
114 views

Name of a matrix with one column and row removed [closed]

I am looking for the exact name of a matrix where the i-th column and rows have been removed. I cannot remember how it is called in linear algebra, does anyone got an idea? Thanks!
BayesianMonk's user avatar
0 votes
1 answer
302 views

root of identity matrix and lexicographic order

I asked a question here order of a permutation and lexicographic order but it seems*** that a very powerful and rich generalization can be made! Let $A$ be a finite ring together with an arbitrary ...
jcdornano's user avatar
  • 469
0 votes
1 answer
213 views

How to decompose a matrix into its orthogonal and diagonal parts (assuming it has that form)? [closed]

Assume that $A = U * S$ for $U$ orthogonal and $S$ diagonal, ordered and positive. If I only know $A$, is it possible to obtain $U$ and $S$? My first guess would be taking the singular value ...
HesterJ's user avatar
  • 123
0 votes
1 answer
3k views

Cholesky decomposition – non-positive definite matrix

In order to pass the Cholesky decomposition, I understand the matrix must be positive definite. However, I also see that there are issues sometimes when the eigenvalues become very small but negative ...
C. Kwong's user avatar
0 votes
1 answer
138 views

On sum of matrices

Suppose we have a matrix $M\in\Bbb Q^{n\times n}$ with no $0$ elements and we write as sum of two matrices $M_1$ and $M_2$ on following constraint. $M_{1,ij}=M_{ij}$ and $M_{2,ij}=0$ or $M_{1,ij}=0$ ...
Turbo's user avatar
  • 13.9k
0 votes
1 answer
443 views

Relation between degree of root of determinant polynomial and rank of the matrix

Let $A=[a_{ij}]$ be an $n \times n$ matrix with $a_{ij}=f_{ij}(x_1,...,x_m)$ where $f_{ij}(x_1,...,x_m)$ is a polynomial in $m$ variables over a finite field $\mathbb{F}_q$. Let $rank(A)=n$. Now ...
Balaji sb's user avatar
  • 187
0 votes
1 answer
155 views

Are the inverses of a set of quadratic polynomials linearly independent?

Is a collection of reciprocals of monic reducible quadratic polynomials, that is functions of the form $$ \{ \left( (x-a_i)(x-b_i) \right)^{-1} \}_{i=1}^{k}, $$ linearly independent over a finite ...
user119164's user avatar
0 votes
1 answer
134 views

Modification of a known optimization problem

In my research of linear algebra and optimization, I wish to modify the following well-known problem: $ \min \lVert x-Ax \rVert$ subject to $ rank(A)\leq k $ where $ x $ is a given column vector ...
groupoid's user avatar
  • 620
0 votes
1 answer
111 views

A conjugation matrix $X\in \mathbb{C}^{ n\times p}$ where $p< n$

Given a Hermitian positive definite matrix $A\in \mathbb{C}^{n \times n}$ and a Hermitian matrix $B\in\mathbb{C}^{ p\times p},$ find the matrix $X$ so that $X^HAX=B$ holds where $X^H$ denotes ...
Saheb's user avatar
  • 21
0 votes
1 answer
150 views

General results regarding linear separability?

I'm reading up on the theory behind support vector machines and would like a good reference with some general results about linear separability. Specifically, questions like below: Given two ...
Fred Byrd's user avatar
  • 101
0 votes
1 answer
75 views

Equivalent linear inequalities system - Coefficients bound?

Just having some difficulties with this system of inequalities... We know E is a system of m linear inequalities of the form: a1,1x1+ ··· +a1,nxn ≤ b1 ... am,1x1+ ··· +am,nxn ≤ bm And E' an ...
John Willson's user avatar
0 votes
1 answer
110 views

Number theory for operator bound

Let $\gamma_i$ be such that for even $i$ $\gamma_i=1$ and for odd $i$ $\gamma_i$ shall have absolute value $1$ and the product of all of the odd ones is also on the complex unit circle but not 1 or -1....
Zinkin's user avatar
  • 501
0 votes
1 answer
327 views

Rotation matrix between two column spaces

I would like to find a rotation matrix between two flats $F_1,F_2$ that are defined by the column spaces of the matrices $M_1,M_2 \in \mathbb{R}^{n \times k}$ ($k<n$) respectively. If it was to ...
nzer0's user avatar
  • 3
0 votes
1 answer
28 views

Finding a point at which only certain linear functionals are integral

Let $C$ be a full-dimensional rational polyhedral cone in $\Bbb R^d$ with facets $G_1,\ldots,G_n$ . For each $i$, let $h_i$ be an integer-valued linear functional on $\Bbb R^d$ whose kernel is the ...
Avi Steiner's user avatar
  • 3,079

1
106 107
108
109 110
118