AMS eBook CollectionsOne of the world's most respected mathematical collections, available in digital format for your library or institution
Randomization, Relaxation, and Complexity in Polynomial Equation Solving
About this Title
Leonid Gurvits, Los Alamos National Laboratory, Los Alamos, NM, Philippe Pébay, Sandia National Laboratories, Livermore, CA, J. Maurice Rojas, Texas A&M University, College Station, TX and David Thompson, Sandia National Laboratories, Livermore, CA, Editors
Publication: Contemporary Mathematics
Publication Year:
2011; Volume 556
ISBNs: 978-0-8218-5228-6 (print); 978-0-8218-8235-1 (online)
DOI: https://doi.org/10.1090/conm/556
ReadershipTable of Contents
Download chapters as PDF
Front/Back Matter
Articles
- Martin Avendaño and Ashraf Ibrahim – Multivariate ultrametric root counting
- Daniel J. Bates, Jonathan D. Hauenstein and Andrew J. Sommese – A parallel endgame
- Carlos Beltrán and Luis Miguel Pardo – Efficient polynomial system solving by numerical methods
- Bruno Grenet, Erich L. Kaltofen, Pascal Koiran and Natacha Portier – Symmetric determinantal representation of formulas and weakly skew circuits
- Tsung-Lin Lee and Tien-Yien Li – Mixed volume computation in solving polynomial systems
- Anton Leykin – A search for an optimal start system for numerical homotopy continuation
- Mounir Nisse – Complex tropical localization, and coamoebas of complex algebraic hypersurfaces
- Osbert Bastani, Christopher J. Hillar, Dimitar Popov and J. Maurice Rojas – Randomization, sums of squares, near-circuits, and faster real root counting
- Korben Rusek, Jeanette Shakalli and Frank Sottile – Dense fewnomials
- Zhonggang Zeng – The numerical greatest common divisor of univariate polynomials