3 papers
cs.SC2023
Fast Approximation of Polynomial Zeros and Matrix Eigenvalues
Victor Y. Pan, Soo Go, Qi Luan +1
We approximate the d complex zeros of a univariate polynomial p(x) of a degree d or those zeros that lie in a fixed region of interest on the complex plane such as a disc or a squa…
math.NA2019
CUR Low Rank Approximation at Deterministic Sublinear Cost
Qi Luan, Victor Y. Pan, John Svadlenka
A matrix algorithm runs at {\em sublinear cost} if it uses much fewer memory cells and arithmetic operations than the input matrix has entries. Such algorithms are indispensable fo…
math.NA2019
Counting Roots of a Polynomial in a Convex Compact Region by Means of Winding Number Calculation via Sampling
Vitaly Zaderman, Liang Zhao
In this paper we propose a novel efficient algorithm for calculating winding numbers, aiming at counting the number of roots of a given polynomial in a convex region on the complex…