A Fast And Accurate Frequent Directions Algorithm For Low Rank Approximation Via Block Krylov Iteration

It is known that frequent directions (FD) is a popular deterministic matrix sketching method for low rank approximation. However, FD and its randomized variants usually meet high computational cost or computational instability in dealing with large-scale
  • IEEE MemberUS $11.00
  • Society MemberUS $0.00
  • IEEE Student MemberUS $11.00
  • Non-IEEE MemberUS $15.00
Purchase

Videos in this product