Statistica
9 Domande
                        0 Risposte
RANK
70.216
                          
                          
of 300.381
                        
REPUTAZIONE
0
                           
                        
CONTRIBUTI
                          9 Domande
                          0 Risposte
ACCETTAZIONE DELLE RISPOSTE 
                            55.56%
                        
VOTI RICEVUTI
0
RANK
of 168.477
CONTRIBUTI
                            0 Problemi
                            0 Soluzioni
PUNTEGGIO
0
NUMERO DI BADGE
0
CONTRIBUTI
0 Post
CONTRIBUTI
0 Pubblico Canali
VALUTAZIONE MEDIA
CONTRIBUTI
0 Punti principali
NUMERO MEDIO DI LIKE
Feeds
Domanda
Sparse matrix multiplication complexity and CPU time
I am multiplying two sparse matrices $A$ and $A^T$ such that I have $A^T*A$. From what I know the complexity of this operation d...
circa 5 anni fa | 1 risposta | 0
1
rispostaDomanda
Given a vector, I would like to sample without replacement elements from it repeatedly.
Given a (m x 1) vector v , I would like to ,randomly without replacement, sample s elements from it. I know I can use randsample...
circa 5 anni fa | 2 risposte | 0
2
risposteDomanda
Given that A is a sparse matrix, norm(A(i,:)) takes a very long time. Why and can one do better ?
I am computing norm(A(i,:)) within a loop, where A is a sparse matrix. This seems to be a bottleneck, is there anyway to perfor...
circa 5 anni fa | 3 risposte | 0
3
risposteDomanda
C = union( A,B ) is too slow. Is there any faster way given that A and B are ordered.
I have two sorted arrays A and B. I want to find the elements that are both in A and B. I am using union function, yet this seem...
circa 5 anni fa | 4 risposte | 0
4
risposteDomanda
Preallocating a sparse matrix, then entering values column by column takes too much time. Is there a more efficient way ?
At the beginning of the loop, I preallocate the sparse matrix (Q) with a number of non zero values that I do not exceed within t...
oltre 5 anni fa | 1 risposta | 0
1
rispostaDomanda
Which is more efficient when applied to a sparse matrix, find or logical indexing ?
Given a sparse matrix, I would like to get its non-zero entries. I would like to know if using find function is an efficient way...
oltre 5 anni fa | 1 risposta | 0
1
rispostaDomanda
MEX/Lapack/Blas problem
I don't have technical background, I am just trying to configure a solver called Blendenpik (https://uk.mathworks.com/matlabcent...
oltre 5 anni fa | 0 risposte | 0
0
risposteDomanda
What is the convergence criteria used in MATLAB lsqr function ?
I am using LSQR to solve Ax = b, where A is not consistent. I know that lsqr will give me the minimum residual solution. I am wo...
oltre 5 anni fa | 0 risposte | 0
0
risposteDomanda
Does MATLAB qr function employ the SuiteSparseQR (multifrontal multithreaded sparse QR factorization) in SuiteSparse ?
I am using the function [Q,R,P] = qr(A,0) to have a rank-revealing qr factorization of sparse matrix A. I am wondering if MATLAB...
oltre 5 anni fa | 0 risposte | 0

                
              
