Cited in
(26)- Efficiently Computing Many Roots of a Function
- Generalizations of the Intermediate Value Theorem for Approximating Fixed Points and Zeros of Continuous Functions
- Artificial nonmonotonic neural networks
- RFSFNS: A portable package for the numerical determination of the number and the calculation of roots of Bessel functions
- Novel orbit based symmetric cryptosystems
- Algorithm 666: Chabis: a mathematical software package for locating and evaluating roots of systems of nonlinear equations
- On the complexity of isolating real roots and computing with certainty the topological degree
- Locating, characterizing and computing the stationary points of a function
- Intermediate value theorem for simplices for simplicial approximation of fixed points and zeros
- Locating and computing in parallel all the simple roots of special functions using PVM
- Locating three-dimensional roots by a bisection method
- On the zeros of \(J_n(z)\pm iJ_{n+1}(z)\) and \([J_{n+1}(z)]^2- J_n(z) J_{n+2}(z)\)
- Survey on generalizations of the intermediate value theorem and applications
- From linear to nonlinear iterative methods
- An efficient method for locating and computing periodic orbits of nonlinear mappings
- RFSFNS
- ZEBEC
- COULFG
- ELF
- GNOME
- scientific article; zbMATH DE number 1086545 (Why is no real title available?)
- MANBIS
- Improved Newton's method without direct function evaluations
- Algorithm 987: MANBIS -- a C++ mathematical software package for locating and computing efficiently many roots of a function: theoretical issues
- A dimension-reducing method for unconstrained optimization
- On perturbation of roots of homogeneous algebraic systems
This page was built for software: CHABIS
