Reputation
Next tag badge:
111/100 score
19/20 answers
Badges
37 100
Newest
 Nice Answer
Impact
~317k people reached

12h
comment How to express $f(x,y) = u(x,y) + i\, v(x,y)$ as $f(z)$
There is also the issue of posting actual code for actual examples..
14h
comment How to express $f(x,y) = u(x,y) + i\, v(x,y)$ as $f(z)$
And if CR does hold, it could be as simple as setting x->z and y->0.
14h
comment How to express $f(x,y) = u(x,y) + i\, v(x,y)$ as $f(z)$
If CR does not hold then it cannot be done (you will require z* as well as z in the function, where I use asterisk for conjugate variable).
1d
comment Solving a system of nonlinear equtions
I'm seeing three equations, I think. Hard to be sure, absent actual code.
Jun
25
comment How to solve for the intersection points of two ellipses?
Your code cannot figure out what is real due to phantom imaginary parts arising in numerical approximations involving arctans and the like.
Jun
25
answered Symbolic cut-off of high-order terms
Jun
24
comment Challenging matrix sorting request?
Making B identical to A by the moves you describe is the same as making B-A equal to 0. For each negative therein, move as much of the nearest positive as needed to make it zero. If that positive is too small to make it zero, move it all and proceed to next nearest positive, etc.
Jun
24
comment Challenging matrix sorting request?
Subtract matrix A from matrix B. Use greedy approach to move each positive to closest negative to zero them both. Obviously this will require a bit of coding.
Jun
24
comment Manually specifying distance metric to Nearest slows down calculation
@RunnyKine I don't think that would be possible with the current implementation.
Jun
22
comment Slow-down encountered for RandomChoice in large lists
You are recreating a sublist at every iteration and that means it will be, at best, O(n^2) complexity. Most likely better would be to pick two random integers between 1 and t and use them as indices.
Jun
20
comment Unexpected inefficiency when calculating matrix product by Dot
Might be more efficient to use MatrixExp instead of doing the explicit diagonalizations and time steps.
Jun
18
comment Why do Mathematica list indices start at 1?
This is way way into the region of the opinion-based. (I realize some people put serious time into it anyway.)
Jun
18
comment Solve an eigensystem faster and eliminate Root[…] from the solution
I have to wonder what sort of result you are expecting.
Jun
18
comment Should I Remove the initial symbols of Module?
@Leonid Shifrin Yes, good point. I thought there was some extra issue involved but did not recall what it was.
Jun
17
comment Should I Remove the initial symbols of Module?
It's only an issue when the local smbols get used in a way that leaks frfom Module (not your situation) or when DownValues are placed on them.
Jun
17
comment How to convert a system of parametric equations?
The result, in terms of Root objects, is comprised of algebraic roots. That's by definition of what an algebraic root is. They are not in terms of explicit radicals but that's a different matter.
Jun
15
comment why is NSolve giving {y,x} in place of {x,y}?
Look more closely...
Jun
11
comment Designing a loop that fetches 5 random vectors each with 5 components from a set of 10 until Linear dependence is found
Not easily in general, but for this case not so hard. You could take the set of all Binomial[10,5] subsets and suffle them e.g. with RandomChoice. Then just iterate over the result until you find one you like.
Jun
11
comment Lexicographic ordering of lists-of-lists?
The reason to sort on length first is that it is often a quick discriminator, hence Ordering is less likely to be slow e.g. from deep recursion in a depth first search.
Jun
10
comment Plot a picture of roots of polynomial equations under the 'Log| |" map
Please actually look carefully at Manipulate documentation. As it stands now this is near to where the question could get closed.