A Rigorous Generic Branch and Bound Solver for Nonlinear Problems Andrew P. Smith C´esar A. Mu˜noz and Anthony J. Narkawicz Mantas Markevicius National Institute of Aerospace NASA Langley Research Center

First Page		Document Content
Date: 2015-08-18 13:33:42 Mathematics Equations Polynomials Numerical analysis Algebra Operations research Global optimization System of polynomial equations Mathematical optimization Linear programming Constraint satisfaction Interval arithmetic		A Rigorous Generic Branch and Bound Solver for Nonlinear Problems Andrew P. Smith C´esar A. Mu˜noz and Anthony J. Narkawicz Mantas Markevicius National Institute of Aerospace NASA Langley Research Center Add to Reading List Source URL: shemesh.larc.nasa.gov Download Document from Source Website File Size: 323,13 KB Share Document on Facebook

	MATHEMATICS OF COMPUTATION Volume 00, Number 0, Pages 000–000 SXXBETTER POLYNOMIALS FOR GNFS SHI BAI, CYRIL BOUVIER, ALEXANDER KRUPPA, AND PAUL ZIMMERMANN DocID: 1xVRE - View Document
	An Introduction to the Dynamics of Real and Complex Quadratic Polynomials. May 30, 2011 Abstract DocID: 1xVv1 - View Document
	On Computing the Resultant of Generic Bivariate Polynomials Gilles Villard Univ Lyon, CNRS, ENS de Lyon, Inria, Université Claude Bernard Lyon 1, LIP UMR 5668, FLyon, France ABSTRACT An algorithm is presented for DocID: 1xVkU - View Document
	LibPoly: A Library for Reasoning about Polynomials∗ Dejan Jovanovi´c and Bruno Dutertre SRI International Abstract LibPoly is a C library for computing with polynomials. It provides data structures to represent multiv DocID: 1xUTX - View Document