Timeline for Elaborating Mercer's theorem (RKHS) on Cameron-Martin space $k(x,y)=\min(x,y)$
Current License: CC BY-SA 3.0
14 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Apr 13, 2017 at 12:19 | history | edited | CommunityBot |
replaced http://math.stackexchange.com/ with https://math.stackexchange.com/
|
|
Jan 9, 2013 at 11:29 | history | edited | Ohad Asor | CC BY-SA 3.0 |
deleted 139 characters in body; deleted 252 characters in body
|
Jan 9, 2013 at 11:23 | history | edited | Ohad Asor | CC BY-SA 3.0 |
added 51 characters in body
|
Jan 9, 2013 at 10:40 | history | edited | Ohad Asor | CC BY-SA 3.0 |
added 254 characters in body; added 88 characters in body
|
Jan 9, 2013 at 10:27 | vote | accept | Ohad Asor | ||
S Jan 9, 2013 at 10:27 | vote | accept | Ohad Asor | ||
Jan 9, 2013 at 10:27 | |||||
Jan 9, 2013 at 10:22 | vote | accept | Ohad Asor | ||
S Jan 9, 2013 at 10:27 | |||||
Jan 9, 2013 at 10:14 | answer | added | Dirk | timeline score: 5 | |
Jan 9, 2013 at 1:02 | answer | added | Branimir Ćaćić | timeline score: 7 | |
Jan 8, 2013 at 22:26 | comment | added | Dirk | Seems like I did not look careful enough on my mesh plot... Sorry. | |
Jan 8, 2013 at 22:01 | comment | added | Ohad Asor | here's my code: ## #include <iostream> #include <cmath> using namespace std; long double phi(double x, double n) { return sin(nx)/n; } int main(int, char*) { long double sum = 0, x=8,y=1; for (long double n = 1;n< 100000;n++) { sum += phi(x,n)*phi(y,n); if (((int)n)%1000) cout<<n<<' '<<sum<<endl; } return 0; } ## | |
Jan 8, 2013 at 21:50 | comment | added | Ohad Asor | wow that's amazing. you actually got $ \min(x,y)=\sum_{n=1}^\infty n^{-2}\sin nx\sin ny$? | |
Jan 8, 2013 at 21:42 | comment | added | Dirk | Seems to be a bug in your numerics... Calculations look fine and my plots also... | |
Jan 8, 2013 at 21:04 | history | asked | Ohad Asor | CC BY-SA 3.0 |