A combined method for enclosing all solutions of nonlinear systems of polynomial equations (Q1899456): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3345690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3208084 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3789075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994492 / 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: Q4277813 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A globally convergent interval method for computing and bounding real roots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4865664 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3948528 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval Methods for Systems of Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3857636 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5789039 / rank
 
Normal rank

Latest revision as of 17:37, 23 May 2024

scientific article
Language Label Description Also known as
English
A combined method for enclosing all solutions of nonlinear systems of polynomial equations
scientific article

    Statements

    A combined method for enclosing all solutions of nonlinear systems of polynomial equations (English)
    0 references
    0 references
    0 references
    0 references
    1995
    0 references
    An interval version of Buchberger's algorithm for solving systems of polynomial equations over \(\mathbb{R}\) is described. Some modifications were, however, incorporated in order to avoid a superfluous blowing up of interval coefficients.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    interval arithmetic
    0 references
    Buchberger's algorithm
    0 references
    systems of polynomial equations
    0 references
    0 references