Statistics
RANK
83,467
of 300,553
REPUTATION
0
CONTRIBUTIONS
1 Question
1 Answer
ANSWER ACCEPTANCE
100.0%
VOTES RECEIVED
0
RANK
of 21,024
REPUTATION
N/A
AVERAGE RATING
0.00
CONTRIBUTIONS
0 Files
DOWNLOADS
0
ALL TIME DOWNLOADS
0
RANK
of 169,635
CONTRIBUTIONS
0 Problems
0 Solutions
SCORE
0
NUMBER OF BADGES
0
CONTRIBUTIONS
0 Posts
CONTRIBUTIONS
0 Public Channels
AVERAGE RATING
CONTRIBUTIONS
0 Highlights
AVERAGE NO. OF LIKES
Feeds
Question
Why these two similar operations (a sparse matrix w/o transpose times a vector) take different time to finish?
n = 1e5; a = sprand(n,n,5/n); v = rand(n,1); tic; for i = 1:1e3, b = a*v; end; toc tic; for i = 1:1e3, c = a'*v; end; toc I...
3 years ago | 2 answers | 0
2
answersAnswered
deleting row and column from very large Sparse matrix efficiently
This is an easy way to deal with boundary conditions in stiffness matrices, have you tried permutation? Suppose your original m...
deleting row and column from very large Sparse matrix efficiently
This is an easy way to deal with boundary conditions in stiffness matrices, have you tried permutation? Suppose your original m...
5 years ago | 0
