All Questions
4 questions
5
votes
0
answers
202
views
Difficulty of solving $Ax=b$ in terms of limiting spectral density of $A$?
Suppose $A$ is a random real-valued $n\times n$ matrix and we want to know the difficulty of solving $Ax=b$ when entries of $b$ are sampled IID from Normal$(0,1)$.
Can we say anything about the ...
1
vote
0
answers
188
views
Maximum singular value of sum of an Hermitian and an anti-Hermitian matrix
Let $H$ be an $n\times n$ Hermitian matrix and $A$ an $n\times n$ anti-Hermitian matrix, i.e. $H^\dagger = H$, $A^\dagger = -A$. Consider their sum $S= H+A$. Let $\{\sigma_i(S)\}_{i=1,\dots,r}$ denote ...
3
votes
1
answer
552
views
Is this result on an unconstrained inverse quadratic programming problem new or known already?
Is this problem and solution actually new, or has someone done this earlier?
The details can be found in the preprint: arxiv:1701.01477.
Let us consider a direct quadratic programming problem:
$$
\...
5
votes
3
answers
1k
views
Constant rank theorem for Banach spaces
Is there a similar statement to the constant rank theorem for finite dimensional real smooth manifolds which holds for a smooth map $F:B \rightarrow M$ where $B$ is an infinite (countable) dimensional ...