Statistics
RANK
143,689
of 300,871
REPUTATION
0
CONTRIBUTIONS
3 Questions
0 Answers
ANSWER ACCEPTANCE
0.0%
VOTES RECEIVED
0
RANK
8,045 of 21,100
REPUTATION
112
AVERAGE RATING
3.00
CONTRIBUTIONS
3 Files
DOWNLOADS
3
ALL TIME DOWNLOADS
1077
RANK
of 171,460
CONTRIBUTIONS
0 Problems
0 Solutions
SCORE
0
NUMBER OF BADGES
0
CONTRIBUTIONS
0 Posts
CONTRIBUTIONS
0 Public Channels
AVERAGE RATING
CONTRIBUTIONS
0 Discussions
AVERAGE NO. OF LIKES
Feeds
Submitted
Fast Version of the Ablowitz Ladik Technique
This code compares with the standard version of the Ablowitz Ladik
8 years ago | 1 download |
Question
In my code for multiplying 400 matrices 1000 times, I find that the normal matrix multiplication method (brutal force method) is being computed in a much faster way than the divide and conquer algorithm. Can anyone please suggest me what the prob is?
In my code for multiplying 400 matrices 1000 times, I find that the normal matrix multiplication method (brutal force method) is...
8 years ago | 0 answers | 0
0
answersQuestion
How to multiply n matrices
stepsize = 0.01; time(1) = -10; signalLength = 2000; time(2) = 10; N = signalLength+1; x = time(1):ste...
8 years ago | 0 answers | 0
0
answersQuestion
How can you change the color and size of the elements in the matrix as shown below?
label = {' A',' B',' C',' D',' E',' F',' G',' H',' L',' M'}; I have to change the font color of the letters to red and increas...
8 years ago | 2 answers | 0
2
answersSubmitted
Bellman Ford Algorithm
The above code is used to find the minimum distance between 2 nodes.
8 years ago | 1 download |
Submitted
Code for Djikstra's Algorithm
This code successfully finds out the shortest path between source node and destination node.
8 years ago | 1 download |
