742 reputation
118
bio website
location
age
visits member for 1 year, 3 months
seen Apr 18 at 0:06

Kids in rectangles irritating sick urchins rattling foxes, directory.kirisurf.org lol


Mar
17
asked Calculating the DFT of a sequence following a mathematical expression
Feb
19
awarded  Popular Question
Feb
12
accepted Greedy algorithm to make change “getting stuck”
Feb
12
asked Greedy algorithm to make change “getting stuck”
Feb
8
comment Seemingly nonsensical differential equation approximation
@DanielFischer Sorry, I really don't know how to realize it. Can you give a slightly more elaborate hint as an answer?
Feb
8
comment True, false and meaningless statements in math.
The language seems to be Georgian. Nkoreli is typing Georgian in the Latin alphabet.
Feb
8
comment Seemingly nonsensical differential equation approximation
Okay. I don't get why you can use an approximate substitution though. The question doesn't say that $(y_n - y_n-1)$ is computed with the naive Euler method.
Feb
8
comment Seemingly nonsensical differential equation approximation
Sorry, do not get. What is the 3 there doing?
Feb
8
asked Seemingly nonsensical differential equation approximation
Jan
23
accepted Stable algorithms from a backwards recurrence?
Jan
23
comment Stable algorithms from a backwards recurrence?
Thanks! That really helped.
Jan
23
comment Stable algorithms from a backwards recurrence?
Umm, we know already what $I_0$ is. We want a formula for $I_n$. I know, for large $n$, $I_0$ is easily calculated, but we are given $I_0$ and asked to find a stable algo for $I_n$. With the recurrence I derived this would involve subtracting something very close to $I_0$ from $I_0$, a classic invite for massive instability.
Jan
23
comment Stable algorithms from a backwards recurrence?
I seem to get $I_0=f(1)-\frac{1}{\alpha}f(2)+\frac{1}{\alpha ^2}f(3)...\frac{1}{\alpha ^ n}I_n$. Is this remotely correct? How on earth is this of any use, especially since I don't know if $n$ is even or odd? This also doesn't look very stable, with the alternating up and down of small quantities...
Jan
22
comment Stable algorithms from a backwards recurrence?
$I_n$ is supposed to be $\int_0^1 \frac{x^n}{x+\alpha}dx$ if it helps. $I_0$ is defined to be $\log \frac{1+\alpha}{\alpha}$
Jan
22
asked Stable algorithms from a backwards recurrence?
Dec
29
awarded  Yearling
Dec
17
comment Monty hall problem extended.
@Jaydles I don't know, people's intuitions are different. Two years ago, I saw that exact explanation, with a million doors rather than 100 (making it even more "obvious"). I still thought switching made no difference.
Nov
20
accepted Proving that $2^n$ is greater than a binomial expression
Nov
20
asked Proving that $2^n$ is greater than a binomial expression
Nov
16
accepted No idea how to prove this property about symmetric matrices