An improved method for global solution of nonlinear systems
Let the function \(\psi: D\subset\mathbb{R}^n\to \mathbb{R}^n\) be continuous and let \(X_0\subset D\) be an \(n\)-dimensional interval vector. Some method for determining all zeros of \(\psi\) which lie in \(X_0\) was presented by the author earlier [ibid. 4, No. 2, 125-146 (1998)]. This method was based on the insertion of \(m\) slack variables so that the system \(\psi(x)= 0\) was transformed to a semiseparable system \(f(y)= 0\) of dimension \(m+n\), which could be solved by an appropriate iterative method. The present paper extends these results, i.e., it is shown that the system \(f(y)= 0\) can be reduced to a system of dimension \(n\) again and that elements of the so-called constraint propagation approach can be applied to improve the computational performance.
- A new method for global solution of systems of nonlinear equations
- Global methods for solving systems of nonlinear algebraic equations
- A globalization procedure for solving nonlinear systems of equations
- An improved interval linearization for solving nonlinear problems
- Verified Solutions of Systems of Nonlinear Polynomial Equations
- Continuous Variable Neighborhood Search (C-VNS) for Solving Systems of Nonlinear Equations
- Solving interval constraints by linearization in computer-aided design
This page was built for publication: An improved method for global solution of nonlinear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1809077)
