The calculation of the degree of an approximate greatest common divisor of two polynomials

Fundamentals of Matrix Computations.

G. W. S., David S. Watkins · Mathematics of Computation · 1992 · 864 citations

Natural Sciences, Computer Science, Systems Analysis +13

On the numerical condition of polynomials in Bernstein form

Rida T. Farouki, V. T. Rajan · Computer Aided Geometric Design · 1987 · 318 citations

Natural Sciences, Computer Science, Mathematics +6

The singular value decomposition for polynomial systems

Robert M. Corless, Patrizia Gianni, Barry Trager et al. · 1995 · 205 citations

Computing, Computer Science, Mathematics +14

Statistical analysis of effective singular values in matrix rank determination

K. Yao · IEEE Transactions on Acoustics Speech and Signal Processing · 1988 · 201 citations

Computing, Data Science, Econometrics +16

Computing multiple roots of inexact polynomials

Zhonggang Zeng · Mathematics of Computation · 2004 · 118 citations · Full text

Computing, Computer Science, Algorithms +16