Rank: 1519 based on 47 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
23 Dec 2011 Gauss elimination with complete pivoting This function calculate Gauss elimination with complete pivoting Author: Nickolas Cheilakos gauss, gaussian, linear algebra, elimination, complete elimination 22 11
  • 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 algorithm, kruskal, i want to signal a ms..., graphics, specialized, minimum spanning tree 25 10
  • 3.625
3.6 | 8 ratings
Comments and Ratings on Nickolas' Files View all
  • 1 - 5 of
  • 29
Updated File Comment by Comments Rating
09 Oct 2012 Kruskal Algorithm Kruskal's algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connect Author: Nickolas Cheilakos Anand

12 Jul 2012 Gauss elimination with complete pivoting This function calculate Gauss elimination with complete pivoting Author: Nickolas Cheilakos Tursa, James

You need to take the syntax text from the above description and put it in the comment section of your code. You also need to add an H1 line at the top. The way it is now, the user has to manually edit your source code to get this information since it does not appear when you type "help gecp", so it is not user friendly.
14 May 2012 Kruskal Algorithm Kruskal's algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connect Author: Nickolas Cheilakos Le Roux, Peet

Can someone please tell me what is wrong with the coding of the connected function? I recoded this function and still don’t understand what could be wrong. I understand the code so if someone can maybe just give me a hint please.
01 May 2012 Kruskal Algorithm Kruskal's algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connect Author: Nickolas Cheilakos Mohamed Reda

22 Apr 2012 Gauss elimination with complete pivoting This function calculate Gauss elimination with complete pivoting Author: Nickolas Cheilakos lopez, carlos

My two cents regarding applications for this submissions. What happends when you run out of memory with A\b? In some cases you can accept a painfully slow implementation which fits into available memory. And Gaussian Elimination can do the job.
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
23 Dec 2011 Gauss elimination with complete pivoting This function calculate Gauss elimination with complete pivoting Author: Nickolas Cheilakos gauss, gaussian, linear algebra, elimination, complete elimination 22 11
  • 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 algorithm, kruskal, i want to signal a ms..., graphics, specialized, minimum spanning tree 25 10
  • 3.625
3.6 | 8 ratings

Contact us