The following pages link to CHABIS (Q12889):
Displayed 20 items.
- On the complexity of isolating real roots and computing with certainty the topological degree (Q700184) (← links)
- Novel orbit based symmetric cryptosystems (Q984155) (← links)
- Improved Newton's method without direct function evaluations (Q1012522) (← links)
- Locating three-dimensional roots by a bisection method (Q1184614) (← links)
- RFSFNS: A portable package for the numerical determination of the number and the calculation of roots of Bessel functions (Q1269369) (← links)
- From linear to nonlinear iterative methods (Q1873166) (← links)
- An efficient method for locating and computing periodic orbits of nonlinear mappings (Q1893753) (← links)
- Locating, characterizing and computing the stationary points of a function (Q1916996) (← links)
- A dimension-reducing method for unconstrained optimization (Q1919374) (← links)
- Intermediate value theorem for simplices for simplicial approximation of fixed points and zeros (Q1985674) (← links)
- Survey on generalizations of the intermediate value theorem and applications (Q2109973) (← links)
- Algorithm 666: Chabis: a mathematical software package for locating and evaluating roots of systems of nonlinear equations (Q3493195) (← links)
- (Q4362785) (← links)
- Algorithm 987 (Q4611304) (← links)
- Generalizations of the Intermediate Value Theorem for Approximating Fixed Points and Zeros of Continuous Functions (Q5122292) (← links)
- On perturbation of roots of homogeneous algebraic systems (Q5470058) (← links)
- Efficiently Computing Many Roots of a Function (Q5693188) (← links)
- 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)\) (Q5946101) (← links)
- Locating and computing in parallel all the simple roots of special functions using PVM (Q5946625) (← links)
- Artificial nonmonotonic neural networks (Q5958708) (← links)