Search

Your search keyword '"PAN, VICTOR Y."' showing total 449 results

Search Constraints

Start Over You searched for: Author "PAN, VICTOR Y." Remove constraint Author: "PAN, VICTOR Y."
449 results on '"PAN, VICTOR Y."'

Search Results

1. Fast Approximation of Polynomial Zeros and Matrix Eigenvalues

Catalog

Books, media, physical & digital resources

3. Accelerated Subdivision for Clustering Roots of Polynomials given by Evaluation Oracles

4. New Progress in Classic Area: Polynomial Root-squaring and Root-finding

6. Root Radii and Subdivision for Polynomial Root-Finding

7. Root-Squaring for Root-Finding

9. New practical advances in polynomial root clustering

10. CUR Low Rank Approximation at Deterministic Sublinear Cost

11. Polynomial root clustering and explicit deflation

12. CUR Low Rank Approximation of a Matrix at Sublinear Cost

13. Iterative Refinement and Oversampling for Low Rank Approximation

14. More on low rank approximation of a matrix

15. Low Rank Approximation at Sublinear Cost

16. Superfast Approximate Linear Least Squares Solution of a Highly Overdetermined Linear System of Equations

17. QRP Variation of Cross--Approximation Iterations for Low Rank Approximation

19. Implementation of a Near-Optimal Complex Root Clustering Algorithm

20. Polynomial Root-Finding and Algebraic Eigenvalue Problem

21. Fast Feasible and Unfeasible Matrix Multiplication

23. Superfast CUR Matrix Algorithms, Their Pre-Processing and Extensions

24. Simple and Nearly Optimal Polynomial Root-finding by Means of Root Radii Approximation

25. Superfast Low-Rank Approximation and Least Squares Regression

26. New Results on CGR/CUR Approximation of a Matrix

27. Root-finding with Implicit Deflation

28. Enhancing the Power of Cardinal's Algorithm

29. Low-rank Approximation of a Matrix: Novel Insights, New Progress, and Extensions

30. Fast Approximate Computations with Cauchy Matrices and Polynomials

31. How Bad Are Vandermonde Matrices?

33. Faster Numerical Univariate Polynomial Root-Finding by Means of Subdivision Iterations

34. Acceleration of Subdivision Root-Finding for Sparse Polynomials

35. Sublinear Cost Low Rank Approximation via Subspace Sampling

36. New Practical Advances in Polynomial Root Clustering

37. CUR LRA at Sublinear Cost Based on Volume Maximization

38. Polynomial Root Isolation by Means of Root Radii Approximation

39. Accelerated Approximation of the Complex Roots and Factors of a Univariate Polynomial

40. Real Polynomial Root-finding by Means of Matrix and Polynomial Iterations

41. New Studies of Randomized Augmentation and Additive Preprocessing

42. Matrix Multiplication, Trilinear Decompositions, APA Algorithms, and Summation

43. Better Late Than Never: Filling a Void in the History of Fast Matrix Multiplication and Tensor Decompositions

44. Random Multipliers Numerically Stabilize Gaussian and Block Gaussian Elimination: Proofs and an Extension to Low-rank Approximation

45. Novel Approach to Real Polynomial Root-finding and Matrix Eigen-solving

46. Accelerated Approximation of the Complex Roots of a Univariate Polynomial (Extended Abstract)

47. Nearly Optimal Computations with Structured Matrices

48. Old and New Nearly Optimal Polynomial Root-Finders

49. Root-Finding with Implicit Deflation

50. Supporting GENP with Random Multipliers