1 option
Randomization, relaxation, and complexity in polynomial equation solving : Banff International Research Station workshop on randomization, relaxation, and complexity, February 28--March 5, 2010, Banff, Ontario, Canada / Leonid Gurvits ... [and others], editors.
Math/Physics/Astronomy Library QA241 .R27 2011
Available
- Format:
- Book
- Series:
- Contemporary mathematics (American Mathematical Society) ; v. 556.
- Contemporary mathematics ; 556
- Language:
- English
- Subjects (All):
- Number theory--Congresses.
- Number theory.
- Algorithms--Congresses.
- Algorithms.
- Geometry, Algebraic--Congresses.
- Geometry, Algebraic.
- Genre:
- Conference papers and proceedings.
- Physical Description:
- viii, 217 pages : illustrations ; 26 cm.
- Place of Publication:
- Providence, R.I. : American Mathematical Society, 2011.
- Summary:
- The 10 papers in this collection explore the setting of systems of polynomial equations, primarily from the point of view of numerical computation and algebraic geometry. Among the topics are multivariate ultrametric root counting, efficient polynomial system solving by numerical methods, a search for an optimal start system for numerical homotopy continuation, dense fewnomials, and the numerical greatest common divisor of univariate polynomials. There is no index. Annotation ©2011 Book News, Inc., Portland, OR (booknews.com)
- Notes:
- Includes bibliographical references.
- ISBN:
- 9780821852286
- 0821852280
- OCLC:
- 745765984
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.