Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with na.numerical-analysis
Search options not deleted
user 129192
Numerical algorithms for problems in analysis and algebra, scientific computation
1
vote
1
answer
85
views
The distance between a collection of points and a sequence of sets
Fix $m \geq 2$, and consider a sequence of sets
$$
J_m^{(n)} = \left\{ \frac{2}{mn}+\frac{i-1}{n}\right\}_{i=1}^n.
$$
For any collection of $m-1$ points $x_1,...,x_{m-1} \in (0, 1)\cap \mathbb{Q}$, de …
- 1,087
1
vote
3
answers
748
views
Determining polynomial approximations of piecewise constant functions
Let $t_1 < t_2 < \cdots <t_m$ be real, and $X = \cup_{i=1}^{m-1} (t_i, t_{i+1})$ be a union of real open intervals. Let $f:X \rightarrow \{-1, 1\}$ be any piecewise constant function of form
$$
f(x) …
- 1,087