What is an elegant way to pick the array that has the minimum sum from an array of arrays? I know Min[Total[#] & /@ list] gives the minimum of the sums, but how do I pick the corresponding array?
I was just called into a meeting with four people. One person asked another if they could explain something. Then they asked if they could explain it again to them via email. Then they said that concludes the meeting.
@Guesswhoitis. It feels that way sometimes. I've been here almost a year. Out of a team of 5, 2 have left, and 3 levels of managers above me have left. There is so much organizational inefficiency that my day to day hasn't changed at all during that. I'm not complaining though because that gives me a lot of free time.
I'm trying to solve a 1D time-dependent Schrodinger equation:
$$
i\frac{\partial \psi(x,t)}{\partial t}=\left[-\frac{1}{2} \frac{\partial^2}{\partial x^2}+V(x)+F(t)*x\right]\psi(x,t)
$$
where $V(x)$ is a periodic Dirac delta potential (or the Dirac comb):
$$
V(x)=\sum_{k=-\infty}^\infty\delta(...
What is the difference between Mathematica and Mathematics websites ?
I'm trying to solve a 1D time-dependent Schrodinger equation:
$$
i\frac{\partial \psi(x,t)}{\partial t}=\left[-\frac{1}{2} \frac{\partial^2}{\partial x^2}+V(x)+F(t)*x\right]\psi(x,t)
$$
where $V(x)$ is a periodic Dirac delta potential (or the Dirac comb):
$$
V(x)=\sum_{k=-\infty}^\infty\delta(...
