The approximation-theory tag has no usage guidance.

**2**

votes

**1**answer

824 views

### Padé approximation - usability in iterative algorithms

Firstly, I have to say that I don't understand Padé approximation well.
But I discovered that, it is more precise than Taylor series.
I have to create approximation for these functions: Log(x) and ...

**2**

votes

**2**answers

982 views

### Interpolation Splines of Bounded Curvature

Given $n$ points $p_i=(x_i,y_i)$ on the [Euclidean] plane, and a positive real number $\rho$. Can we have a polynomial spline (e.g natural cubic spline) passing through all these points, such that: ...

**3**

votes

**1**answer

482 views

### Approximating an integral representation of the Number Partition Problem

One can write out an integral whose solution gives the number of solutions to the NP-Complete Number Partition Problem and I'm wondering if anyone has an suggestions or ideas on who to solve or ...

**0**

votes

**1**answer

489 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 ...

**1**

vote

**4**answers

2k views

### A differentiable approximation to the minimum function

Suppose we have a function $f : \Re^N \rightarrow \Re$ which, given a vector, returns the value of its smallest element. How can I approximate $f$ with a differentiable function(s)?

**4**

votes

**2**answers

282 views

### Can SO_n(R) be approximated arbitrarily well using a discrete subgroup?

Let $G := SO_n(R)$ be equipped with the Euclidean metric on vectors of length $n^2$. Is it true that for any $\epsilon >0$, there is a finite subgroup of $G$ which intersects every metric ball of ...

**7**

votes

**4**answers

5k views

### Approximation with continuous functions

Is it true that for every function $\mathbb{R} \to \mathbb{R}$ there exists a sequence of continuous functions $f_n(x): \mathbb{R} \to \mathbb{R}$ such that for any $x \in \mathbb{R}$ $f_n(x)$ ...

**4**

votes

**3**answers

544 views

### Does NP = “epsilon-P” (PTAS / BPP)?

Some NP-complete optimization problems, like the knapsack problem, have a solution reachable in polynomial time that is guaranteed to be within arbitrary ε of the optimum answer. (aka PTAS - ...

**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 ...

**5**

votes

**4**answers

2k views

### Approximation by exponential polynomials

Let $u(t) = \Sigma_{k=1}^n c_k e^{\lambda_k t} (c_k \in \mathbb C, \lambda_k \in \mathbb C) $ be an exponential polynomial of $\underline{order}$ $n$.
Define $E_n$ to be the collection of all ...

**2**

votes

**1**answer

923 views

### Probability of system failure in a distributed network

I am trying to build a mathematical model of the availability of a file in a distributed file-system. The system works like this: a node $x$ stores a file $f$ (encoed using erasure codes) at $rb$ ...

**12**

votes

**5**answers

927 views

### Does this sequence span $L^2$?

Consider the following sequence of functions in $L^2[0,\infty)$:
$$f_n(x)=e^{-x/n}x^n,\;\;n\geq 1$$
Does this sequence span $L^2[0,\infty)$ (that is, is the set of finite linear combinations
of these ...

**1**

vote

**1**answer

768 views

### Fast gradient approximations

I am trying to use the one-sided Simultaneous Perturbation (SP) method to get a gradient approximation for multi-variable function.
The equations are very simple: ...

**1**

vote

**1**answer

376 views

### References regarding unisolvent sets

Let $X = {x_1, ..., x_N}$ be a finite subset of $R^n$ and let $p$ and $q$ be any polynomials of degree $k$ or less. X is called $\underline{P_k-unisolvent}$ if $p(x_j) = q(x_j)$ ($j = 1, ..., N$) ...

**8**

votes

**2**answers

3k views

### approximate a probability distribution by moment matching

Suppose we want to approximate a real-valued random variable $X$ by a discrete random variable $Z$ with finitely many atoms. Suppose all moments of $X$ is finite. We want to match the moments of $X$ ...

**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 ...

**2**

votes

**2**answers

973 views

### Approximation of a Normal Distribution function

I am reviewing and documenting a software application (part of a supply chain system) which implements an approximation of a Normal Distribution function; the original documentation mentions the ...

**14**

votes

**4**answers

680 views

### Finite interpolation by a nondecreasing polynomial

Let $x_1 < x_2 < \ldots < x_n$ and $y_1 < y_2 < \ldots < y_n$ be two sequences
of $n$ real numbers. It is well known that there are polynomials that "interpolate"
in that ...

**6**

votes

**0**answers

456 views

### convergence rate in Wiener's approximation theorem

Wiener has the following fantastic results about approximations using translation families:
Given a function $h: \mathbb{R} \to \mathbb{R}$, the set $\{\sum a_i h(\cdot - x_i): a_i, x_i \in ...

**6**

votes

**1**answer

302 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$) ...

**3**

votes

**2**answers

1k views

### Variant of Fermat's last theorem

By Fermat's last theorem, the equation $u^3+v^3=w^3$ has no solutions
in positive integers $u,v,w$. Now consider the following variant : call $\rho(x)$
the distance between $x$ and the nearest ...

**16**

votes

**6**answers

5k views

### Solving NP problems in (usually) Polynomial time?

Just because a problem is NP-complete doesn't mean it can't be usually solved quickly.
The best example of this is probably the traveling salesman problem, for which extraordinarily large instances ...

**4**

votes

**1**answer

499 views

### Interpolation by a function whose second derivative is bounded

I don't know if this is an easy question for specialists in the field. Consider
the following interpolation problem : let $\varepsilon >0$, $X$ be a finite
set of real numbers and $g$ be a ...

**8**

votes

**3**answers

652 views

### Approximating with translated Gaussians and low-frequency trig functions

Defining the translated Gaussians by $f_t(x)=\exp(-(x-t)^2)$ for $t,x\in\Bbb{R}$, we showed that the linear span of $\{f_t \mid 0 \le t < \epsilon\}$ is dense in $L^2(\Bbb{R})$, for any ...