Finding zeros by multilevel subdivision techniques
From MaRDI portal
Recommendations
- AN ALGORITHM FOR FINDING ALL ZEROS OF VECTOR FUNCTIONS
- Locating all the zeros of an analytic function in one complex variable
- An algorithm for finding all solutions of a nonlinear system
- Locating and Computing Arbitrarily Distributed Zeros
- A globally convergent method for finding zeros of smooth functions
Cited in
(14)- Always convergent methods for nonlinear equations of several variables
- Covering Pareto sets by multilevel subdivision techniques
- A globally convergent method for finding zeros of smooth functions
- Finding zeros of nonlinear functions using the hybrid parallel cell mapping method
- Global optimization using a dynamical systems approach
- A subspace expanding technique for global zero finding of multi-degree-of-freedom nonlinear systems
- A Set-Oriented Numerical Approach for Dynamical Systems with Parameter Uncertainty
- A multiscale N-section method for resolving fluid-dynamic clusters of zeros and extrema
- Approximation of box dimension of attractors using the subdivision algorithm
- Locating and Computing Arbitrarily Distributed Zeros
- The method of determining all real nonmultiple roots of systems of nonlinear equations
- A multi-objective approach to the design of low thrust space trajectories using optimal control
- Complexity of a root clustering algorithm for holomorphic functions
- A method to find all the roots of the system of nonlinear algebraic equations based on the Krawczyk operator
This page was built for publication: Finding zeros by multilevel subdivision techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4548052)