Skip to main content

All Questions

Filter by
Sorted by
Tagged with
5 votes
1 answer
252 views

Smooth, non-analytic functions of non-normal matrices

My apologies if this isn't a well-enough-posed question, I think I'm partly unsure of what exact question to even ask. There are many different ways in which we can take a function of a matrix. We ...
Yonah Borns-Weil's user avatar
2 votes
1 answer
133 views

Control on dimension of image

Let $f:E\rightarrow F$ be a map between Banach spaces E and F; E finite dimensional (>0) and F infinite dimensional. Let $F$ be equipped with its weak topology and suppose that $f$ is strong-weak ...
ABIM's user avatar
  • 5,405
5 votes
2 answers
242 views

Can we stay invertible while approximating linear maps in Sobolev spaces?

Let $\Omega \subseteq \mathbb{R}^n$ be an open bounded domain with a smooth boundary. Fix $1<p<n$. Let $A \in W^{1,p}(\Omega;\text{End}(\mathbb{R}^n)) \cap C(\Omega;\text{End}(\mathbb{R}^n))$ ...
Asaf Shachar's user avatar
  • 6,741
1 vote
1 answer
169 views

On optimizing a function whose projection and projected vector go through a linear transformation

Assume the two sets of vectors $\{\mathbf{a}_1,\ldots,\mathbf{a}_N\}$ and $\{\mathbf{b}_1,\ldots,\mathbf{b}_N\}$ of equal length. My goal is to find the optimum matrix $\mathbf{C}$ to the following ...
mermeladeK's user avatar
-1 votes
2 answers
605 views

Approximating a subspace by sampling a base without replacement

Let $X$ be a $p \times n$ matrix, with $p > n$. Now, suppose I sample $m < n$ columns from $X$ at random, without replacement. I would like to characterize the distance between the subspace ...
gappy3000's user avatar
  • 461
9 votes
2 answers
1k views

polynomials with minimal $L_\infty$ norm on multiple disjoint intervals

It is well-known that Chebyshev polynomials are the polynomials of minimal $L_\infty$ norm on [-1,1] with leading coefficient 1. But what if you want the minimal $L_\infty$ polynomial on two disjoint ...
Paul's user avatar
  • 223
2 votes
0 answers
104 views

Noisy bases for linear functions

For any $x \in \mathbb{R}^n$, the following statement is trivially true: There exists a set $I \subset \mathbb{R}^n$ with $|I| \leq n$ such that for any $x' \in \mathbb{R}^n$, if $x \cdot y = x' \...
Aaron's user avatar
  • 794
0 votes
1 answer
638 views

Rational solutions of homogeneous equations

Can every solution of a homogeneous linear system be approximated by a solution in rational numbers? In mathematical terms: Let $$Ax=0$$ be a homogeneous linear system in $n$ determinates for an $m\...
ThiKu's user avatar
  • 10.5k
6 votes
2 answers
2k views

Efficient approximation of a matrix and its inverse

Assume that $ A $ is a real $ n\times n $ matrix whose rows constitute an orthonormal basis of $ \mathbb R^n $. Informal statement of question: Assume we want to approximate $ A $ by a rational ...
Iddo Tzameret's user avatar
3 votes
1 answer
1k views

Matrix approximation

Let A be an $m\times n$ matrix and $k$ be an integer. Assume that $A$ is non-negative. We want to find a scalar $\epsilon$ and an $n\times n$ matrix $B$ such that $A\leq A(\epsilon I + B)$ (where $\...
Danu's user avatar
  • 145
6 votes
1 answer
347 views

Sparse approximate representation of a collection of vectors

Suppose I have a collection of $n$ vectors $C \subset \mathbb{F}_2^n$. They are of course spanned by the canonical set of $n$ basis vectors. What I would like to find is a much smaller (~ $\log n$) ...
Donald's user avatar
  • 583
9 votes
6 answers
8k views

How to approximate a solution to a matrix equation? [closed]

Suppose a matrix equation $Ax = b$ has no solution ($b$ is not in the column space of $A$) How can I find a vector $x^\prime$ so that $Ax^\prime$ is the closest possible vector to $b$?
Eric Wilson's user avatar