14 citations · 89 across the 38 of their papers we have counts for
6 papers · 1 filter
Fast Matrix Multiplication and Symbolic Computation
Jean-Guillaume Dumas, Victor Pan
The complexity of matrix multiplication (hereafter MM) has been intensively studied since 1969, when Strassen surprisingly decreased the exponent 3 in the cubic cost of the straigh…
Superfast Low-Rank Approximation and Least Squares Regression
Victor Y. Pan, Qi Luan, John Svadlenka +1
Low Rank Approximation is among most fundamental subjects of numerical linear algebra having important applications to various areas of modern computing and %they range from machin…
Fast Derandomized Low-rank Approximation and Extensions
Victor Pan, John Svadlenka, Liang Zhao
Low-rank approximation of a matrix by means of structured random sampling has been consistently efficient in its extensive empirical studies around the globe, but adequate formal s…
New Results on CGR/CUR Approximation of a Matrix
Victor Y. Pan
CUR and low-rank approximations are among most fundamental subjects of numerical linear algebra, with a wide range of applications to a variety of highly important areas of modern…
Root-finding with Implicit Deflation
Remi Imbach, Victor Y. Pan, Chee Yap +2
Functional iterations such as Newton's are a popular tool for polynomial root-finding. We consider realistic situation where some (e.g., better-conditioned) roots have already been…
Enhancing the Power of Cardinal's Algorithm
Victor Y. Pan
Cardinal's factorization algorithm of 1996 splits a univariate polynomial into two factors with root sets separated by the imaginary axis, which is an important goal itself and a b…