Rank: 505 based on 241 downloads (last 30 days) and 2 files submitted
photo

Nickolas Cheilakos

E-mail
Company/University
UOA
Lat/Long
38.002197, 23.794107

Personal Profile:

Professional Interests:
Approximations and Interpolation, Linear Algebra , Graphics

 

Watch this Author's files

 

Files Posted by Nickolas View all
  • 1 - 2 of
  • 2
Updated   File Tags Downloads
(last 30 days) 		Comments Rating
20 Dec 2006 Gauss elimination with complete pivoting This function calculate Gauss elimination with complete pivoting Author: Nickolas Cheilakos complete elimination, gaussian, gauss, linear algebra, elimination 147 8
  • 3.55556
3.6 | 10 ratings
20 Dec 2006 Kruskal Algorithm Kruskal's algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connect Author: Nickolas Cheilakos graphics, i want to signal a ms..., kruskal, specialized plot, algorithm, plotting 94 8
  • 3.16667
3.2 | 6 ratings
Comments and Ratings on Nickolas' Files View all
  • 1 - 5 of
  • 22
Updated File Comment by Comments Rating
23 Dec 2008 Kruskal Algorithm Kruskal's algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connect Author: Nickolas Cheilakos merabti, Billal

the code of 'connected' function is not correct. if you want to use this code you have to correct it (it is simple to do). but i think that the code is verry simple to understand and to use.
an other think, we can use the matlab function max(PV,3)' in the place of "fysalida.m"
thanks
15 Oct 2008 Kruskal Algorithm Kruskal's algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connect Author: Nickolas Cheilakos mohammed reda, kheroua

a kadri mourad...es-tu celui que je connais le prof. de geologie a l'ecole des mines de paris...si oui j'aimerais renrer en contact...!
15 Oct 2008 Kruskal Algorithm Kruskal's algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connect Author: Nickolas Cheilakos mohalled reda, kheroua

je voudrais savoir
21 Jun 2008 Gauss elimination with complete pivoting This function calculate Gauss elimination with complete pivoting Author: Nickolas Cheilakos s, sid

Somethings wrong in the calculation of Q. We do not get L*U==P*A*Q;
Consider the matrix below with 1 on the diagonal, -1 in the lower triangle and 1 on the last column. The code below plots the error between L*U and P*A*Q and it is definitely not zero.

N=10;
A=ones(N,N);
A=A-2*tril(A,-1)-triu(A,1);
A(:,N)=1;

[L,U,P,Q]=gecp(A);
mesh(abs(L*U-P*A*Q));

If its just a convention mistake then this is a good code.
31 May 2008 Kruskal Algorithm Kruskal's algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connect Author: Nickolas Cheilakos Wei, Lai

 I think the code is not correct. If we get w=[0 1 0 0;1 0 1 0;0 1 0 0;0 1 0 0], the connected will also be 1.
Top Tags Applied by Nickolas
  • 1 - 5 of
  • 12
algorithm, complete elimination, elimination, gauss, gaussian
Files Tagged by Nickolas View all
  • 1 - 2 of
  • 2
Updated   File Tags Downloads
(last 30 days) 		Comments Rating
20 Dec 2006 Gauss elimination with complete pivoting This function calculate Gauss elimination with complete pivoting Author: Nickolas Cheilakos complete elimination, gaussian, gauss, linear algebra, elimination 147 8
  • 3.55556
3.6 | 10 ratings
20 Dec 2006 Kruskal Algorithm Kruskal's algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connect Author: Nickolas Cheilakos graphics, i want to signal a ms..., kruskal, specialized plot, algorithm, plotting 94 8
  • 3.16667
3.2 | 6 ratings
 

MATLAB Central Terms of Use

NOTICE: Any content you submit to MATLAB Central, including personal information, is not subject to the protections which may be afforded information collected under other sections of The MathWorks, Inc. Web site. You are entirely responsible for all content that you upload, post, e-mail, transmit or otherwise make available via MATLAB Central. The MathWorks does not control the content posted by visitors to MATLAB Central and, does not guarantee the accuracy, integrity, or quality of such content. Under no circumstances will The MathWorks be liable in any way for any content not authored by The MathWorks, or any loss or damage of any kind incurred as a result of the use of any content posted, e-mailed, transmitted or otherwise made available via MATLAB Central. Read the complete Terms prior to use.

Contact us at files@mathworks.com