New answers tagged complexity
16
votes
Accepted
Why is it that SVD routines on nearly square matrices run significantly faster than if the matrix was highly non square?
You are asking for a full (dense) SVD, which also needs to generate the unitary components of $U$ and $V$ which correspond with the null space of your input.
for the $1000 \times 800$ case, your input ...
Top 50 recent answers are included
Related Tags
complexity × 107algorithms × 30
linear-algebra × 15
optimization × 11
linear-solver × 9
performance × 8
numerics × 7
sparse-matrix × 7
convex-optimization × 7
matrix × 6
computational-geometry × 5
matlab × 4
eigenvalues × 4
floating-point × 4
ode × 3
computational-physics × 3
parallel-computing × 3
combinatorics × 3
heuristics × 3
pde × 2
finite-difference × 2
python × 2
reference-request × 2
eigensystem × 2
linear-programming × 2