Polytope-based computation of polynomial ranges (Q426184): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: IbexOpt / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cagd.2011.09.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2002910417 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4518988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subdivision algorithms converge quadratically / rank
 
Normal rank
Property / cites work
 
Property / cites work: How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the stability of transformations between power and Bernstein polynomial forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the numerical condition of polynomials in Bernstein form / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation complexity of the range of a polynomial in several variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bound functions for polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Investigation of a subdivision based algorithm for solving systems of polynomial equations. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of interval methods for plotting algebraic curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Interval Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of the solutions of nonlinear polynomial systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast construction of constant bound functions for sparse polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding all solutions of nonlinear equations using the dual simplex method / rank
 
Normal rank

Latest revision as of 08:33, 5 July 2024

scientific article
Language Label Description Also known as
English
Polytope-based computation of polynomial ranges
scientific article

    Statements

    Polytope-based computation of polynomial ranges (English)
    0 references
    0 references
    0 references
    0 references
    11 June 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    polynomial ranges
    0 references
    Bernstein polynomials
    0 references
    multivariate polynomials
    0 references
    polytopes
    0 references
    numerical examples
    0 references
    polynomial systems
    0 references
    interval Newton solvers
    0 references
    linear programming
    0 references
    0 references