An efficient algorithm for finding all solutions of nonlinear equations using parallelogram LP test
From MaRDI portal
Publication:2196050
DOI10.1016/j.cam.2020.113080zbMath1452.65095OpenAlexW3037690365MaRDI QIDQ2196050
Publication date: 28 August 2020
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2020.113080
Numerical mathematical programming methods (65K05) Numerical computation of solutions to systems of equations (65H10) General methods in interval analysis (65G40)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding all solutions of separable systems of piecewise-linear equations using integer programming
- LP narrowing: A new strategy for finding all solutions of nonlinear equations
- Derived eigenvalues of symmetric matrices, with applications to distance geometry
- Interval solution of nonlinear equations using linear programming
- A new method for global solution of systems of nonlinear equations
- Finding all solutions of nonlinear equations using linear combinations of functions
- Finding all solutions of systems of nonlinear equations using the dual simplex method
- Bounding perturbations in zeros of nonlinear systems
- A new exclusion test.
- Finding all solutions of nonlinear equations using the dual simplex method
- Applications of interval computations. Proceedings of an international workshop, El Paso, TX, USA, February 23-25, 1995
- Finding all solution sets of piecewise-linear interval equations using an integer programming solver
- An efficient algorithm for finding all solutions of separable systems of nonlinear equations
- Nonlinear optimization exclusion tests for finding all solutions of nonlinear equations
- Verification methods: Rigorous results using floating-point arithmetic
- Introduction to Interval Analysis
- Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations
- Efficient and Safe Global Constraints for Handling Numerical Constraint Systems
- Quasiconvex relaxations based on interval arithmetic
- On bounding solutions of underdetermined systems
- Verified error bounds for multiple roots of systems of nonlinear equations
This page was built for publication: An efficient algorithm for finding all solutions of nonlinear equations using parallelogram LP test