Community Profile

photo

Anwaya rath


Last seen: 3 years ago |  Active since 2017

Statistics

All
  • Personal Best Downloads Level 2
  • First Submission

View badges

Content Feed

View by

Submitted


Fast Version of the Ablowitz Ladik Technique
This code compares with the standard version of the Ablowitz Ladik

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

6 years ago | 0 answers | 0

0

answers

Question


How to multiply n matrices
stepsize = 0.01; time(1) = -10; signalLength = 2000; time(2) = 10; N = signalLength+1; x = time(1):ste...

6 years ago | 0 answers | 0

0

answers

Question


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

6 years ago | 2 answers | 0

2

answers

Submitted


Bellman Ford Algorithm
The above code is used to find the minimum distance between 2 nodes.

6 years ago | 5 downloads |

Submitted


Code for Djikstra's Algorithm
This code successfully finds out the shortest path between source node and destination node.

6 years ago | 2 downloads |