Randomization, Relaxation, and Complexity in Polynomial Equation Solving.

Randomization, Relaxation, and Complexity in Polynomial Equation Solving.

Saved in:
Bibliographic Details
Online Access: Full text (MCPHS users only)
Main Author: Gurvits, Leonid
Other Authors: Pébay, Philippe, Rojas, J. Maurice
Format: Electronic eBook
Language:English
Published: Providence : American Mathematical Society, 2011
Series:Contemporary Mathematics.
Subjects:
Number theory > Congresses.
Algorithms > Congresses.
Geometry, Algebraic > Congresses.
Local Note:ProQuest Ebook Central
Table of Contents:
  • Contents
  • Preface
  • Multivariate Ultrametric Root Counting
  • A Parallel Endgame
  • Efficient Polynomial System Solving by Numerical Methods
  • Symmetric Determinantal Representation of Formulas and Weakly Skew Circuits
  • Mixed Volume Computation in Solving Polynomial Systems
  • A Search for an Optimal Start System for Numerical Homotopy Continuation
  • Complex Tropical Localization, and Coamoebas of Complex Algebraic Hypersurfaces
  • 1. Introduction
  • 2. Preliminaries
  • 3. Complex tropical hypersurfaces with a simplex Newton polytope
  • 4. Tropical mirror hypersurfaces5. Coamoebas of complex tropical hypersurfaces
  • 6. Coamoebas of complex algebraic hypersurfaces
  • 7. Examples of complex algebraic plane curves coamoebas
  • References
  • Randomization, Sums of Squares, Near-Circuits, and Faster Real Root Counting
  • Dense Fewnomials
  • The Numerical Greatest Common Divisor of Univariate Polynomials

Similar Items