Reputation
Top tag
Next privilege 250 Rep.
View close votes
Badges
4
Newest
 Editor
Impact
~363 people reached

  • 0 posts edited
  • 0 helpful flags
  • 12 votes cast
Mar
10
accepted Efficient low rank matrix-vector multiplication
Mar
10
comment Efficient low rank matrix-vector multiplication
I see, thank you for clarification.
Mar
9
comment Efficient low rank matrix-vector multiplication
Or has any other structure with O(N) non-zero elements.
Mar
9
comment Efficient low rank matrix-vector multiplication
How can I compute product in linear time using SVD? I can multiply NxN matrix by Nx1 vector in O(N) only if it is diagonal/band matrix.
Mar
9
comment Efficient low rank matrix-vector multiplication
@NickAlger just theoretically, isn't there an automatic/systematic way to find rank-2 expansion. Maybe looking at this expansion will help to find efficient way of multiplication.
Mar
9
awarded  Editor
Mar
9
revised Efficient low rank matrix-vector multiplication
matrix is not orthogonal
Mar
9
comment Efficient low rank matrix-vector multiplication
@augurar you right, I've mixed different questions.
Mar
8
asked Efficient low rank matrix-vector multiplication
Nov
14
asked abstract optimization problem
Feb
27
comment Find the point in a sub-space defined by linear constraints closer to an external point
Just using linearly constrained quadratic programming to find $P_0$ isn't an option?
Feb
27
awarded  Scholar
Feb
27
comment Probability that a random n-digit sequence has specific m-digit subsequence
Thank you! I still can't figure it out, but I've written small program to compare results and it seems to be correct :)
Feb
27
accepted Probability that a random n-digit sequence has specific m-digit subsequence
Feb
27
awarded  Supporter
Feb
26
awarded  Student
Feb
26
asked Probability that a random n-digit sequence has specific m-digit subsequence