meta user
network profile
| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 1 year, 3 months |
| seen | 51 mins ago | |
| stats | profile views | 191 |
|
9h |
revised |
Plot 3D set (or a domain of three-variable function) added 501 characters in body |
|
9h |
answered | Plot 3D set (or a domain of three-variable function) |
|
1d |
comment |
Interpolation and points of non-differentiability Just do dg[x_] = D[g[x], x] and then dg[5] automatically becomes indeterminate... |
|
1d |
comment |
Optimizing functions taking matrix arguments This isn't a matrix-valued function. It's a function whose arguments are matrices, but the value the function returns is a scalar $p$-value. |
|
Apr 30 |
awarded | Good Answer |
|
Apr 23 |
awarded | Nice Question |
|
Apr 15 |
awarded | Good Answer |
|
Apr 3 |
comment |
Plotting data points: Optimizing size and visuals @whuber, kale: I think this solution can suffer from undersampling. For example, if the data has a narrow spike, Plot's adaptive sampling may miss it entirely. |
|
Apr 3 |
revised |
Plotting data points: Optimizing size and visuals added 436 characters in body |
|
Apr 3 |
comment |
Plotting data points: Optimizing size and visuals Well, the horizontal scale is so much larger than the vertical scale in this case that geometric distances are effectively the same as vertical differences here! But you make a great point. One only needs to modify the dist function to return the vertical difference, and then it does the job. |
|
Apr 3 |
answered | Plotting data points: Optimizing size and visuals |
|
Apr 3 |
comment |
Plotting data points: Optimizing size and visuals A standard approach for simplifying a polygonal curve while losing as little detail as possible is called the Douglas-Peucker algorithm. This demonstration by Mark McClure contains a Mathematica implementation. |
|
Mar 3 |
awarded | Custodian |
|
Mar 3 |
revised |
Differentiating space curves added 43 characters in body |
|
Mar 3 |
reviewed | Approve suggested edit on Differentiating space curves |
|
Mar 3 |
comment |
Differentiating space curves Probably I should also replace every Function[s, ...] with Function[s, Evaluate[...]] for performance as VF1 suggested. Or would that have any side effects? |
|
Mar 3 |
accepted | Differentiating space curves |
|
Mar 3 |
answered | Differentiating space curves |
|
Mar 3 |
comment |
Differentiating space curves This computes $\gamma''(s)/\lVert\gamma''(s)\rVert$, which is not the same as the normal. One can see this, for example, on the parabola $(s,s^2,0)$. |
|
Mar 3 |
comment |
Differentiating space curves A closer analogue would be multiplyBy2[r]'[s], but that strangely yields a matrix, which is still not what I expected. I guess I see the problem, though I'm still in the dark about why it happens. Should I just avoid using primes on higher-order functions? |
