Interval solution of nonlinear equations using linear programming
From MaRDI portal
A computational test for nonexistence of solutions to a system of nonlinear equations in a given region X is proposed. The method consists in reformulating the problem as a linear programming problem, whose feasible region contains the solutions of the original problem in X, and using the first phase of the simplex method. The method proposed is suitable for systems involving many linear terms and a relatively small number of nonlinear terms (situation often appearing in practice).
Recommendations
Cites work
- A Comparison of the Existence Theorems of Kantorovich and Moore
- A globally convergent interval method for computing and bounding real roots
- A Modification of Krawczyk’s Algorithm
- A new class of interval methods with higher order of convergence
- A Note on the Moore Test for Nonlinear Systems
- A Quadratically Convergent Krawczyk-Like Algorithm
- A Successive Interval Test for Nonlinear Systems
- A Test for Existence of Solutions to Nonlinear Systems
- Accelerating Krawczyk-like interval algorithms for the solution of nonlinear systems of equations by using second derivatives
- Am improved form of the Krawczyk-Moore algorithm
- An efficient algorithm for finding all solutions of piecewise-linear resistive circuits
- Bounding solutions of systems of equations using interval analysis
- Decompostition of arithmetic expressions to improve the behavior of interval iteration for nonlinear systems
- Finding all solutions of piecewise-linear resistive circuits using linear programming
- Finding all solutions of piecewise-linear resistive circuits using simple sign tests
- scientific article; zbMATH DE number 3649911 (Why is no real title available?)
- scientific article; zbMATH DE number 3880009 (Why is no real title available?)
- scientific article; zbMATH DE number 4139201 (Why is no real title available?)
- scientific article; zbMATH DE number 3559405 (Why is no real title available?)
- scientific article; zbMATH DE number 869736 (Why is no real title available?)
- scientific article; zbMATH DE number 236854 (Why is no real title available?)
- Interval iteration for zeros of systems of equations
- Interval Methods for Systems of Equations
- Interval solution of nonlinear equations using linear programming
- Krawczyk-Like Algorithms for the Solution of Systems of Nonlinear Equations
- Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken
- Polyhedral elements: a new algorithm for capturing all the equilibrium points of piecewise-linear circuits
- Preconditioners for the Interval Gauss–Seidel Method
- Safe Starting Regions for Iterative Methods
- Simple algorithms for tracing solution curves
- Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations
- Some Computable Existence, Uniqueness, and Convergence Tests for Nonlinear Systems
- Some tests of generalized bisection
Cited in
(22)- Interval solution of nonlinear equations using linear programming
- Finding all solutions of nonlinear equations using linear combinations of functions
- Interval mathematics, algebraic equations and optimization
- A heuristic method for certifying isolated zeros of polynomial systems
- A new exclusion test.
- Finding all solutions of nonlinear equations using the dual simplex method
- An efficient algorithm for finding all solutions of nonlinear equations using parallelogram LP test
- Finding all solutions of a class of nonlinear equations using an improved LP test
- Finding all solution sets of piecewise-linear interval equations using an integer programming solver
- Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\)
- Solving kinematics problems by efficient interval partitioning
- An efficient algorithm for finding all solutions of separable systems of nonlinear equations
- Efficient interval partitioning-local search collaboration for constraint satisfaction
- Nonlinear optimization exclusion tests for finding all solutions of nonlinear equations
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
- Finding all solutions of separable systems of piecewise-linear equations using integer programming
- scientific article; zbMATH DE number 2068450 (Why is no real title available?)
- Quasiconvex relaxations based on interval arithmetic
- LP narrowing: A new strategy for finding all solutions of nonlinear equations
- Application of the Krawczyk-Moore-Jones algorithm to electric circuit analysis and its further development
- Existence test for solution of nonlinear systems applying affine arithmetic
- On locating all roots of systems of nonlinear equations inside bounded domain using global optimization methods
This page was built for publication: Interval solution of nonlinear equations using linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1387251)
