Luca Fenzi
Followers: 0 Following: 0
統計
All
Feeds
回答済み
computational complexity of eig and pinv
The computational cost of eig should be O(N^3) with N dimension of the matrix
computational complexity of eig and pinv
The computational cost of eig should be O(N^3) with N dimension of the matrix
9年弱 前 | 0
回答済み
Can someone help me with my code? Topic: integration
Dear LeneB, You should truncate the sum (S(j) = S(j-1) + 1/2V(j-1)+1/2V(j) for j>=1) up to N: in this way knowing V(j) for al...
Can someone help me with my code? Topic: integration
Dear LeneB, You should truncate the sum (S(j) = S(j-1) + 1/2V(j-1)+1/2V(j) for j>=1) up to N: in this way knowing V(j) for al...
約9年 前 | 0
回答済み
How can I plot a sphere in 3D?
This code works fine: % PARAMETERS Of the model I=1 x=1 y=1 k=1; j=1; %% Grid puntos=200; puntos_1=400; teta=lins...
How can I plot a sphere in 3D?
This code works fine: % PARAMETERS Of the model I=1 x=1 y=1 k=1; j=1; %% Grid puntos=200; puntos_1=400; teta=lins...
約9年 前 | 0
回答済み
Numerical solution of non-linear model
I think that equation can be recast as: h'(t)=(F/dA) - (B*sqrt(h(t)))/dA, d,B,A,F constants Instead of using Euler method I ...
Numerical solution of non-linear model
I think that equation can be recast as: h'(t)=(F/dA) - (B*sqrt(h(t)))/dA, d,B,A,F constants Instead of using Euler method I ...
約9年 前 | 0
| 採用済み
回答済み
D for loops concatenated
Thank you very much for your answer I adjust it in the following way P=5; D =3; dim = nchoosek(P-1+D,D); indexe...
D for loops concatenated
Thank you very much for your answer I adjust it in the following way P=5; D =3; dim = nchoosek(P-1+D,D); indexe...
約10年 前 | 0
質問
D for loops concatenated
I would like to generalize the following codes for dimension D=2: D=2; dim=factorial(P-1+D)/(factorial(P-1)*factorial(D)...
約10年 前 | 2 件の回答 | 0
