Luca Fenzi

Last seen: 8 maanden ago | Active since 2015

Followers: 0 Following: 0

Message

https://lucafe.github.io

Statistics

All

RANK
400
of 159.989

CONTRIBUTIONS
3 Problems
417 Solutions

SCORE
4.165

NUMBER OF BADGES
12

View badges

Feeds

Answered
computational complexity of eig and pinv
The computational cost of eig should be O(N^3) with N dimension of the matrix

meer dan 8 jaar ago | 0

Answered
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...

meer dan 8 jaar ago | 0

Answered
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...

meer dan 8 jaar ago | 0

Answered
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 ...

meer dan 8 jaar ago | 0

| accepted

Answered
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...

meer dan 9 jaar ago | 0

Question

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)...

meer dan 9 jaar ago | 2 answers | 0

2

answers