User Portlet
Featured Contributor
Discussions |
---|
*MODERATOR NOTE: This is the notebook used in the livestream "The state of Optimization" on Wednesday, May 17 -- a part of Wolfram R&D livestream series announced and scheduled here: https://wolfr.am/RDlive. Subscribe to [**@WolframRD**]... |
Hi Craig. I am glad you liked the presentation. Yes - we will be posting the notebook shortly. |
One way to solve this would be to explicitly use finite element method. However, you may need to play around with the the boundary conditions for `\[Beta][t]`. The code below should give a starting point: l = 1; P = 380.57402011815145`;... |
We are aware of the RBF-FD method and this topic has been internally discussed by the numerics group. The initial tests have been promising. However, as of now there is nothing built-in within NDSolve for using RBF-FD. |
The method I am using here is called Successive Over Relaxation (SOR). There are plenty of references that you can find on the web on this. My implementation is a very simple version. There are much more sophisticated methods in SOR that could be... |
Phi, What are the definitions of Uff and coordreticolo? |
If you are using V8, then you would have to change the syntax a little bit as follows: [mcode]R = 1 + 10^-15; eqns = (2 (1 - (r/R)^2)) D[rho[r, z],z] == (r D[rho[r, z], r, r] + D[rho[r, z], r])/r; bcs = {rho[R, z] == 0, Derivative[1, 0][rho][10^-19,... |
How aboutIn[2]:= list /. List[List[x__]] -> List[x] Out[2]= {{1, 2}, {{3, 4}, {5, 6}, {7, 8}, {9, 10}}, {11, 12}} |
Is this what you are looking for? [mcode]In[526]:= gg = Graph[{1, 2, 3, 4, 5, 6}, {UndirectedEdge[1, 2], UndirectedEdge[2, 3], UndirectedEdge[3, 4], UndirectedEdge[4, 5], UndirectedEdge[5, 6], UndirectedEdge[6, 1]}, {VertexStyle -> {2... |
You can have Nearest give you the index of the data that matches the test. [mcode]In[59]:= dat = Table[{RandomInteger[100], RandomInteger[1, 15]}, {10}]; In[64]:= test = RandomInteger[1, 15] In[69]:= nf = Nearest[dat[[All, 2]] -> Automatic] ; ... |