Author of the publication

Sublinear Cost Low Rank Approximation via Subspace Sampling.

, , , and . MACIS, volume 11989 of Lecture Notes in Computer Science, page 89-104. Springer, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Real and complex polynomial root-finding with eigen-solving and preprocessing., and . ISSAC, page 219-226. ACM, (2010)Acceleration of Euclidean algorithm and extensions., and . ISSAC, page 207-213. ACM, (2002)Parallel Polynomial Computations by Recursive Processes., and . ISSAC, page 294. ACM, (1990)Accelerated approximation of the complex roots of a univariate polynomial., and . SNC, page 132-134. ACM, (2014)The Complexity of the Matrix Eigenproblem., and . STOC, page 507-516. ACM, (1999)Computational Complexity of Computing Polynomials over the Fields of Real and Complex Numbers. STOC, page 162-172. ACM, (1978)CUR LRA at Sublinear Cost Based on Volume Maximization., and . MACIS, volume 11989 of Lecture Notes in Computer Science, page 105-121. Springer, (2019)Sublinear Cost Low Rank Approximation via Subspace Sampling., , , and . MACIS, volume 11989 of Lecture Notes in Computer Science, page 89-104. Springer, (2019)New Practical Advances in Polynomial Root Clustering., and . MACIS, volume 11989 of Lecture Notes in Computer Science, page 122-137. Springer, (2019)How Bad Are Vandermonde Matrices?. SIAM J. Matrix Anal. Appl., 37 (2): 676-694 (2016)