meta user
network profile
| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 1 year |
| seen | 20 hours ago | |
| stats | profile views | 74 |
|
May 13 |
comment |
Expressions like <<1>> That probably you should read manual page for Skeleton function :) |
|
May 8 |
awarded | Yearling |
|
Apr 29 |
suggested | suggested edit on Mathematica giving infinity as a random number! |
|
Apr 29 |
comment |
Map several functions in one routine There is some mismatch with braces in your code. Why points1[[i]] = points1[[i]]? Maybe you should write a higher order procedure with a function as an argument. |
|
Apr 27 |
comment |
Select performance (+1) For the Pick |
|
Apr 27 |
comment |
Select performance Append is the killer and the For loop construct. |
|
Apr 26 |
comment |
Error trying to open a notebook in Wolfram Workbench Isn't it connected with 64 bit and java? (I know similar issue from Linux system) |
|
Apr 26 |
answered | A basic problem with Solve |
|
Apr 26 |
comment |
A basic problem with Solve I'm guessing that it has to be solved for any t, so the (proper) approach is to write SolveAlways[
4 b*Cos[2 t] - 4 a*Sin[2 t] == 4 Cos[2 t] + 8 Sin[2 t], t] or rather SolveAlways[4 b*Cos[2 t] - 4 a*Sin[2 t] == 4 Cos[2 t] + 8 Sin[2 t], {Sin[2 t], Cos[2 t]}] |
|
Apr 26 |
comment |
A basic problem with Solve You can try to use SolveAlways function. |
|
Nov 26 |
comment |
Parallel linear algebra with arbitrary precision So the question is what is nontrivial in doing this? |
|
Nov 23 |
awarded | Commentator |
|
Nov 23 |
comment |
Parallel linear algebra with arbitrary precision I don't get it. Isn't it obvious to use parallelization in coputation intensive algoriths? |
|
Nov 21 |
revised |
Parallel linear algebra with arbitrary precision added 59 characters in body |
|
Nov 20 |
asked | Parallel linear algebra with arbitrary precision |
|
Oct 28 |
answered | Problem with NDsolve for a system of equations |
|
Oct 28 |
comment |
Using ReplaceAll on SparseArray If You are working with own "i" why don't You write own conjugate[] function? You can pack there sparse array conversion and use Your transformation rule. |
|
Oct 28 |
revised |
local variable naming & symbolic argument added 373 characters in body |
|
Oct 28 |
awarded | Teacher |
|
Oct 28 |
comment |
local variable naming & symbolic argument +1 for You of course! |
