By Pan V.
Read or Download Univariate polynomials: nearly optimal numerical factorization and roots PDF
Similar computational mathematicsematics books
Emergent computation: Emphasizing bioinformatics
Emergent Computation emphasizes the interrelationship of the several sessions of languages studied in mathematical linguistics (regular, context-free, context-sensitive, and sort zero) with points to the biochemistry of DNA, RNA, and proteins. furthermore, facets of sequential machines reminiscent of parity checking and semi-groups are prolonged to the learn of the Biochemistry of DNA, RNA, and proteins.
Reviews in Computational Chemistry Volume 2
This moment quantity of the sequence 'Reviews in Computational Chemistry' explores new purposes, new methodologies, and new views. the themes lined comprise conformational research, protein folding, strength box parameterizations, hydrogen bonding, cost distributions, electrostatic potentials, digital spectroscopy, molecular estate correlations, and the computational chemistry literature.
Introduction to applied numerical analysis
This ebook by means of a widespread mathematician is suitable for a single-semester direction in utilized numerical research for desktop technology majors and different upper-level undergraduate and graduate scholars. even though it doesn't conceal genuine programming, it makes a speciality of the utilized themes so much pertinent to technological know-how and engineering execs.
Additional info for Univariate polynomials: nearly optimal numerical factorization and roots
Sample text
In Proceedings of 27th Annual ACM Symposium on Theory of Computing, pp. 488–496. New York, ACM Press. , Pan, V. Y. (2000). Multivariate polynomials, duality and structured matrices. J. Complexity, 16, 110–180. Neff, C. A. (1994). Specified precision polynomial root isolation is NC. J. Comput. Syst. , 48, 429– 463. Neff, C. , Reif, J. H. (1994). An O(nl+ ) algorithm for the complex root problem. In Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, pp. 540–547. Los Alamitos, CA, IEEE Computer Society Press.
Exploiting matrix structure and eigendecomposition for polynomial rootfinding, preprint. Pan, V. , Chen, Z. Q. (1999). The complexity of the matrix eigenproblem. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pp. 507–516. New York, ACM Press. Pan, V. , Wang, X. (2002). Improved computations with structured matrices, preprint. , Szeg¨ o, G. (1925). Aufgaben und Lehrs¨ atze aus der Analysis. Berlin, Springer. Renegar, J. (1987). On the worst-case arithmetic complexity of approximating zeros of polynomials.
Univariate polynomials: nearly optimal algorithms for factorization and rootfinding. In Proceedings of the International Symposium on Symbolic and Algorithmic Computation, pp. 253– 267. New York, ACM Press. Pan, V. Y. (2001c). Computation of approximate polynomial GCD’s and an extension. Inf. , 167, 71–85. Pan, V. Y. (2002). Exploiting matrix structure and eigendecomposition for polynomial rootfinding, preprint. Pan, V. , Chen, Z. Q. (1999). The complexity of the matrix eigenproblem. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pp.