A combined method for enclosing all solutions of nonlinear systems of polynomial equations
From MaRDI portal
Publication:1899456
DOI10.1007/BF02390521zbMath0833.65046MaRDI QIDQ1899456
Publication date: 1995
Published in: Reliable Computing (Search for Journal in Brave)
65H10: Numerical computation of solutions to systems of equations
65G30: Interval and finite arithmetic
26C10: Real polynomials: location of zeros
Related Items
Outer interval solution of the eigenvalue problem under general form parametric dependencies, Blending implicit interval curves and surfaces, Lower bound functions for polynomials
Cites Work
- Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
- Computation complexity of the range of a polynomial in several variables
- Interval Methods for Systems of Equations
- A globally convergent interval method for computing and bounding real roots
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item