Univariate polynomials: nearly optimal algorithms for factorization and rootfinding
暂无分享,去创建一个
[1] Victor Y. Pan,et al. Approximating Complex Polynomial Zeros: Modified Weyl's Quadtree Construction and Improved Newton's Iteration , 2000, J. Complex..
[2] V. Pan. Structured Matrices and Polynomials , 2001 .
[3] V. Pan. Optimal and nearly optimal algorithms for approximating polynomial zeros , 1996 .
[4] B. Donald,et al. Symbolic and Numerical Computation for Artificial Intelligence , 1997 .
[5] V. Pan. Sequential and parallel complexity of approximate evaluation of polynomial zeros , 1987 .
[6] V. Pan,et al. Polynomial and matrix computations (vol. 1): fundamental algorithms , 1994 .
[7] Arnold Schönhage,et al. Quasi-GCD computations , 1985, J. Complex..
[8] W. Gragg,et al. The Padé Table and Its Relation to Certain Algorithms of Numerical Analysis , 1972 .
[9] Victor Y. Pan,et al. Asymptotic acceleration of solving multivariate polynomial systems of equations , 1998, STOC '98.
[10] Victor Y. Pan,et al. Optimal (up to polylog factors) sequential and parallel algorithms for approximating complex polynomial zeros , 1995, STOC '95.
[11] I. Emiris,et al. Certified approximate univariate GCDs , 1997 .
[12] V. Pan. Structured Matrices and Polynomials: Unified Superfast Algorithms , 2001 .
[13] J. McNamee. A bibliography on roots of polynomials , 1993 .
[14] J. N. Lyness,et al. A Numerical Method for Locating the Zeros of an Analytic Function , 1967 .
[15] C. Andrew Neff,et al. Specified precision polynomial root isolation is in NC , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[16] Peter Kirrinnis. Fast computation of numerical partial fraction decompositions and contour integrals of rational functions , 1992, ISSAC '92.
[17] V. Pan. On Approximating Complex Polynomial Zeros: Modified Quadtree (Weyl's) Construction and Improved Newton's Iteration , 1996 .
[18] Arnold Schönhage,et al. The fundamental theorem of algebra in terms of computational complexity - preliminary report , 1982 .
[19] G. Pólya,et al. Aufgaben und Lehrsätze aus der Analysis , 1926, Mathematical Gazette.
[20] C. Andrew Neff,et al. Specified precision polynomial root isolation is in NC , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[21] V. Pan,et al. Polynomial and Matrix Computations , 1994, Progress in Theoretical Computer Science.
[22] Victor Y. Pan,et al. Multivariate Polynomials, Duality, and Structured Matrices , 2000, J. Complex..
[23] Peter Kirrinnis,et al. Partial Fraction Decomposition in (z) and Simultaneous Newton Iteration for Factorization in C[z] , 1998, J. Complex..
[24] John H. Reif,et al. An Efficient Algorithm for the Complex Roots Problem , 1996, J. Complex..
[25] C. Andrew Neff,et al. Roots of a polynomial and its derivatives , 1994, SODA '94.
[26] S. Smale. On the efficiency of algorithms of analysis , 1985 .
[27] James R. Bunch,et al. Stability of Methods for Solving Toeplitz Systems of Equations , 1985 .
[28] Victor Y. Pan,et al. The complexity of the matrix eigenproblem , 1999, STOC '99.
[29] Victor Y. Pan,et al. Approximate polynomial Gcds, Padé approximation, polynomial zeros and bipartite graphs , 1998, SODA '98.
[30] André Galligo,et al. Numerical Univariate Polynomial GCD , 1996 .
[31] Victor Y. Pan,et al. Solving a Polynomial Equation: Some History and Recent Progress , 1997, SIAM Rev..
[32] J. McNamee. A supplementary bibliography On roots of polynomials , 1997 .
[33] Arnold Schönhage,et al. Asymptotically Fast Algorithms for the Numerical Multiplication and Division of Polynomials with Complex Coeficients , 1982, EUROCAM.
[34] Helly. Aufgaben und Lehrsätze aus der Analysis , 1928 .
[35] Lenore Blum,et al. Complexity and Real Computation , 1997, Springer New York.
[36] Victor Y. Pan,et al. Computation of Approximate Polynomial GCDs and an Extension , 2001, Inf. Comput..
[37] James Renegar,et al. On the worst-case arithmetic complexity of approximating zeros of polynomials , 1987, J. Complex..
[38] Victor Y. Pan,et al. Deterministic improvement of complex polynomial factorization based on the properties of the associated resultant , 1995 .
[39] Y. N. Lakshman,et al. Elimination methods: an introduction , 1992 .
[40] A. A. Grau. The Simultaneous Newton Improvement of a Complete Set of Approximate Factors of a Polynomial , 1971 .
[41] S. Lang. Complex Analysis , 1977 .
[42] David Y. Y. Yun,et al. Fast Solution of Toeplitz Systems of Equations and Computation of Padé Approximants , 1980, J. Algorithms.
[43] M. Mignotte. An inequality about factors of polynomials , 1974 .
[44] S. Smale. The fundamental theorem of algebra and complexity theory , 1981 .